Skip to main content

WDM Networks with Limited or no Wavelength Conversion for Worst Case Traffic

  • Chapter

Part of the book series: The International Series in Engineering and Computer Science ((SECS,volume 554))

Abstract

WDM networks are considered that have limited or no wavelength conversion, and they accommodate all traffic as long as the offered load on any link does not exceed some parameter L. Wavelength requirements W are given that are functions of L for static and dynamic traffic. It is shown that wavelength requirements can be decreased significantly by small amounts of wavelength conversion.

The work was sponsored in part by NSF grant 9612846.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Scheiber, B., and Sudan, M. (1994). Efficient routing and scheduling algorithms for optical networks. In Proc. Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412–423.

    Google Scholar 

  • Arora, S., Leighton, T., and Maggs, B. (1990). On-line algorithms for path selection in a non-blocking network. In Proc. ACM Symp. on Theory of Computering, pages 149–158.

    Google Scholar 

  • Barry, R. A. and Humblet, P. A. (1996). Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Sel. Areas Comm., 14(5):858–867.

    Google Scholar 

  • Berge, C. (1976). Graphs and Hypergraphs. North Holland.

    Google Scholar 

  • Birman, A. (1996). Computing approximate blocking probabilities for a class of all-optical networks. IEEE J. Sel. Areas Comm., 14(5):852–857.

    Article  Google Scholar 

  • Cantor, D. (1972). On non-blocking switching networks. Networks, 1:367–377.

    MathSciNet  MATH  Google Scholar 

  • Gerstel, O. and Kutten, S. (1996). Dynamic wavelength allocation in WDM ring networks. Research Report RC 20462, IBM.

    Google Scholar 

  • Gerstel, O., Sasaki, G., and Ramaswami, R. (1996). Dynamic channel assignment for WDM optical networks with little or no wavelength conversion. In 1996 Allerton Conference, pages 32–43, Monticello, IL.

    Google Scholar 

  • Kovačević, M. and Acampora, A. S. (1996). Benefits of wavelength translation in all-optical clear-channel networks. IEEE J. Sel. Areas Comm., 14(5):868–880.

    Google Scholar 

  • Lee, K. C. and Li, V. O. K. (1993a). Routing and switching in a wavelength convertible lightwave network. In Proc. INFOCOM, pages 578–585.

    Google Scholar 

  • Lee, K. C. and Li, V. O. K. (1993b). A wavelength-convertible optical network. IEEE/OSA J. Lightwave Tech., 11(5/6):962–970.

    Google Scholar 

  • Mihail, M., Kaklamanis, C., and Rao, S. (1995). Efficient access in all-optical networks. In Proc. IEEE Symp. Foundations of Com. Sci., pages 548–557.

    Google Scholar 

  • Raghavan, P. and Upfal, E. (1994). Efficient routing in all-optical networks. In Proc. ACM Symp. Theory of Computing, pages 134–143.

    Google Scholar 

  • Ramaswami, R. and Sasaki, G. H. (1998). Multiwavelength optical networks with limited wavelength conversion. IEEE/ACM Transactions on Networking, 6(6):744–754.

    Article  Google Scholar 

  • Ramaswami, R. and Sivarajan, K. N. (1995). Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Networking, 3(5):489–500.

    Article  Google Scholar 

  • Slusarek, M. (1995). Optimal online coloring of circular arc graphs. Informatique Theoretique et Applications, 29(5):423–429.

    MathSciNet  MATH  Google Scholar 

  • Subramaniam, S., Azizoglu, M., and Somani, A. K. (1996). Connectivity and sparse wavelength conversion in wavelength-routing networks. In Proc. INFOCOM’ 96, pages 148–155.

    Google Scholar 

  • Tucker, A. (1975). Coloring a family of circular arcs. SIAM J. Appl. Math., 29(3):493–502.

    Article  MathSciNet  MATH  Google Scholar 

  • Veeramachaneni, V. and Berman, P. (1997). Lower and upper bounds on the performance of first-fit in dynamic WDM optical networks. Technical Report CSE-97-017, Pennsylvania State University, University Park, PA, USA.

    Google Scholar 

  • Yates, J., Lacey, J., Everitt, D., and Summerfield, M. (1996). Limited-range wavelength translation in all-optical networks. In Proc. INFOCOM, pages 954–961.

    Google Scholar 

  • Zelinka, B. (1969). Medians and peripherians on trees. Arch. Math. (Brno), pages 87–95.

    Google Scholar 

  • Zhou, J., Park, N., Vahala, K. J., Newkirk, M. A., and Miller, B. I. (1994). Broadband wavelength conversion with amplification by four-wave mixing in semiconductor travelling-wave amplifiers. Electronics Letters, 30(11):859–860.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

Sasaki, G. (2002). WDM Networks with Limited or no Wavelength Conversion for Worst Case Traffic. In: Sivalingam, K.M., Subramaniam, S. (eds) Optical WDM Networks. The International Series in Engineering and Computer Science, vol 554. Springer, Boston, MA. https://doi.org/10.1007/0-306-47021-7_6

Download citation

  • DOI: https://doi.org/10.1007/0-306-47021-7_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7825-9

  • Online ISBN: 978-0-306-47021-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics