Skip to main content

Pipelined versus non-pipelined traffic scheduling in unidirectional WDM rings

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Included in the following conference series:

Abstract

Two traffic scheduling schemes, namely, non-pipelined and pipelined scheduling, are considered for uniform traffic in unidirectional WDM rings. Their performances in terms of schedule length and through-put are compared. Optimal or near optimal schedules are obtained for a given number of wavelengths, and a given number of transceivers per node as well as their tuning time.

This research is supported in part by a grant from NSF under contract number MIP-9409864 and ANIR-9801778.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Hinrichs, C. Kosak, D. R. O’Hallaron T. M. Stricker, and R. Take, “An architecture for optimal all-to-all personalized communication,” in Proc. Sixth Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp. 310–319, 1994.

    Google Scholar 

  2. S. H. Bokhari, “Multiphase complete exchange: A theoretical analysis,” IEEE Transactions on Computers 45(2), pp. 220–229, 1996.

    Article  MATH  Google Scholar 

  3. C.-T. Ho and M. T. Raghunath, “Efficient communication primitives on hypercubes,” in Proc. Sixth Distributed Memory Concurrent Computers, pp. 390–397, 1991.

    Google Scholar 

  4. D. Scott, “Efficient all-to-all communication patterns in hypercube and mesh topologies,” in Proc. Sixth Distributed Memory Concurrent Computers, pp. 398–403, 1991.

    Google Scholar 

  5. S. Johnsson and C.-T. Ho, “Optimal broadcasting and personalized communication in hypercubes,” IEEE Transactions on Computers 38(9), pp. 1249–1268, 1989.

    Article  MathSciNet  Google Scholar 

  6. Y.-J. Suh and S. Yalamanchili, “All-to-all personalized exchange in two-dimension and 3-dimension tori,” in 10th International Parallel Processing Symposium, 1996.

    Google Scholar 

  7. L. Tassiulas and J. Joung, “Performance measures and scheduling policies in ring networks,” IEEE/ACM Transactions on Networking 3(5), pp. 576–584, 1995.

    Article  Google Scholar 

  8. E. Varvagios and D. P. Bertsekas, “Communication algorithm for isotropic tasks in hypercubes and wraparound meshes,” Parallel Computing 18, pp. 1233–1257, 1992.

    Article  MathSciNet  Google Scholar 

  9. G. R. Pieris and G. H. Sasaki, “Scheduling transmissions in WDM broadcast-and-select networks,” IEEE/ACM Transactions on Networking 2(2), pp. 105–110, 1994.

    Article  Google Scholar 

  10. H. Choi, H.-A. Choi, and M. Azizoglu, “Optimum transmission scheduling in optical broadcast networks,” in Proc. Int’l Conference on Communication, pp. 266–270, 1995.

    Google Scholar 

  11. M. S. Borella and B. Mukherjee, “Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies,” in Proceedings of IEEE Infocom, pp. 129–137, 1995.

    Google Scholar 

  12. G. N. Rouskas and V. Sivaraman, “On the design of optimal TWDM schedules for broadcast WDM networks with arbitrary transceivers tuning latencies,” in Proceedings of IEEE Infocom, pp. 1217–1224, 1996.

    Google Scholar 

  13. C. Qiao, X. Zhang, and L. Zhou, “Scheduling all-to-all connections in WDM rings,” in SPIE Proceedings, All Optical Communication Systems: Architecture, Control and Network Issues, pp. 218–229, November 1996.

    Google Scholar 

  14. X. Zhang and C. Qiao, “Pipelined transmission scheduling in all-optical TDM/WDM rings,” in IC3N’97, pp. 144–149, 1997.

    Google Scholar 

  15. X. Zhang and C. Qiao, “Scheduling in unidirectional WDM rings and its extensions,” in SPIE Proceedings, All Optical Communication Systems: Architecture, Control and Network Issues III, pp. 208–219, 1997.

    Google Scholar 

  16. A. Elrefaie, “Multiwavelength survivable ring network architectures,” in Proc. Int’l Conference on Communication, pp. 1245–1251, 1993.

    Google Scholar 

  17. J.-C. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, and U. Vaccaro, “Efficient collective communication in optical networks,” in International Colloquium on Automata, Languages, and Programming, pp. 574–585, 1996.

    Google Scholar 

  18. C. Qiao and R. G. Melhem, “Time-division optical communications in multiprocessor arrays,” IEEE Transactions on Computers 42(5), pp. 577–590, 1993.

    Article  Google Scholar 

  19. R. G. Melhem, D. Chiarulli, and S. P. Levitan, “Space multiplexing of waveguides in optically interconnected multiprocessor systems,” The Computer Journal 32(4), pp. 362–369, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Zhang, X., Qiao, C. (1999). Pipelined versus non-pipelined traffic scheduling in unidirectional WDM rings. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097979

Download citation

  • DOI: https://doi.org/10.1007/BFb0097979

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics