Skip to main content
SpringerLink
Log in

Routing in Optical and Wireless Networks

  • Chapter
Algorithms for Parallel Processing

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 105))

  • 283 Accesses

Abstract

The problem of efficiently routing information through communication networks is more important then ever. Much work has been done on routing problems in the store-and-forward and wormhole routing models, but emerging technologies are motivating new routing models to be considered. In this paper, we discuss problems of routing messages in optical networks, where signals are carried by light rather than by electrical impulses, and in wireless networks, where radio-wave interconnections are used for communication. For each model, we present background information and previous results, and also suggest several open problems whose solution would help us to better understand the capabilities and limitations of these classes of communication networks.

This research was supported by the National Science Foundation under grant number CCR-9309111.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. “Efficient Routing and Scheduling Algorithms for Optical Networks.” Proceedings of the 5th ACM-SIAM Symp. on Discrete Algorithms, pp. 412–423, 1993.

    Google Scholar 

  2. R.J. Anderson and G.L. Miller. “Optical Communication for Pointer Based Algorithms.” Technical Report CRI 88–14, Department of Computer Science, University of Southern California, 1988.

    Google Scholar 

  3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. “On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling.” Journal of the ACM, Vol. 44, No. 3, pp. 486–504, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  4. Y. Aumann and Y. Rabani. “Improved Bounds for All Optical Routing.” Proceedings of the 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 567–576, 1995.

    Google Scholar 

  5. R.A. Barry and P.A. Humblet. “An All-Optical Non-Blocking M x M Switchless Connector with \(O\left( {\sqrt {M\log M} } \right)\) Wavelengths and Without Wavelength Changers. Electronics Letters, Vol. 29, pp. 1252 - 1254, 1993.

    Article  Google Scholar 

  6. R.A. Barry and P.A. Humblet. “On the Number of Wavelengths and Switches in All-Optical Networks.” IEEE Transactions on Communications, Vol. 42, No. 2/3/4, pp. 583–591, 1994.

    Google Scholar 

  7. L.J. Cimini, G.J. Foschini, and C.-L. I. “Call blocking performance of distributed algorithms for dynamic channel allocation in microcells.” Conference Record of the International Conference on Communications (ICC), pp. 345A.4.1–345A.4.6., 1992.

    Google Scholar 

  8. L.J. Cimini, G.J. Foschini, and L.A. Shepp. “Single-Channel User-Capacity Calculations for Self-Organizing Cellular Systems.” IEEE Transactions on Communications, Vol. 42, No. 12, pp. 3137–3143, 1994.

    Article  Google Scholar 

  9. R.J. Cole, B.M. Maggs, and R.K. Sitarman. “On the benefit of supporting virtual channels in wormhole routers.” Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 131–141, 1996.

    Google Scholar 

  10. T. Erlebach and K. Jansen. “Call-Scheduling in Trees, Rings and Meshes.” Proceedings of the 30th Hawaii International Conference on System Sciences, 1997.

    Google Scholar 

  11. T. Erlebach and K. Jansen. “Scheduling of Virtual Connections in Fast Networks.” Proceedings of the 4th Parallel Systems and Algorithms Workshop ( Jülich, Germany ), 1997.

    Google Scholar 

  12. T. Erlebach and K. Jansen. Personal communication, 1996.

    Google Scholar 

  13. A. Feldmann, B. Maggs, J. Sgall, D.D. Sleator, and A. Tomkins “Competitive Analysis of Call Admission Algorithms that Allow Delay.” Technical Report CMU-CS-95–102, School of Computer Science, Carnegie Mellon University, 1995.

    Google Scholar 

  14. S. Felperin, P. Raghavan, and E. Upfal. “A Theory of Wormhole Routing in Parallel Computers.” Proceedings of the 33rd IEEE Symp, on Foundations of Comp. Sci., pp. 563–572, 1992.

    Google Scholar 

  15. M. Gereb-Graus and T. Tsantilas. “Efficient Optical Communication in Parallel Computers.” Proceedings of the 4th ACM Symp. on Parallel Algorithms and Architectures, pp. 41–48, 1992.

    Google Scholar 

  16. L. Goldberg, M. Jerrum, T. Leighton, and S. Rao. “A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.” Proceedings of the 5th ACM Symp. on Parallel Algorithms and Architectures, pp. 300–309, 1993.

    Google Scholar 

  17. L. Goldberg, M. Jerrum, and P. MacKenzie. “An S2(Vlog log n) Lower Bound for Routing in Optical Networks.” Proceedings of the 6th ACM Symp. on Parallel Algorithms and Architectures, pp. 147–156, 1994.

    Google Scholar 

  18. W.K. Hale. “Frequency assignment: theory and applications.” Proceedings of the IEEE, Vol. 68, pp. 1497–1514, 1980.

    Article  Google Scholar 

  19. K. Jansen. “Approximation Results for Wavelength Routing in Directed Trees.” Preprint, 1996.

    Google Scholar 

  20. S. Jordan and E.J. Schwabe. “Worst-Case Performance of Cellular Channel Allocation Policies.” ACM Journal on Wireless Networks, Vol. 2, No. 4, pp. 265–275, 1996.

    Article  Google Scholar 

  21. C. Kaklamanis and G. Persiano. “Efficient Wavelength Routing on Directed Fiber Trees.” J. Diaz and M. Sema, editors, Proceedings of the 4th Annual European Symp. on Algorithms, LNCS 1136, pp. 460–470, 1996.

    MathSciNet  Google Scholar 

  22. C. Kaklamanis and G. Persiano. Personal communication, 1996.

    Google Scholar 

  23. J. Kleinberg and E. Tardös. “Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.” Proceedings of the 27th ACM Symp. on Theory of Computing, pp. 26–35, 1995.

    Google Scholar 

  24. V. Kumar. “Approximating Circular Arc Colouring Using Multicommodity Flow.” Preprint, 1997.

    Google Scholar 

  25. V. Kumar and E.J. Schwabe. “Improved Access to Optical Bandwidth in Trees.” Proceedings of the 7th ACM-SIAM Symp. on Discrete Algorithms, pp. 437–444, 1997.

    Google Scholar 

  26. F.T. Leighton, B.M. Maggs, S.B. Rao, and A.G. Ranade. “Randomized routing and sorting on fixed-connection networks.” Journal of Algorithms, Vol. 17, No. 1, pp. 157–205, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  27. M. Mihail, C. Kaklamanis, and S. Rao. “Efficient Access to Optical Bandwidth.” Proceedings of the 36th IEEE Symp. on Foundations of Comp. Sci., pp. 548–557, 1995.

    Google Scholar 

  28. S. Plotkin. “Competitive Routing of Virtual Circuits in ATM Networks.” IEEE Journal on Selected Areas in Communications, Vol. 13, No. 6, pp. 1128–1136, 1995.

    Article  MathSciNet  Google Scholar 

  29. Y. Rabani. “Path Coloring on the Mesh.” Proceedings of the 37th IEEE Symp. on Foundations of Comp. Sci., pp. 400–409, 1996.

    Article  MathSciNet  Google Scholar 

  30. P. Raghavan and E. Upfal. “Efficient Routing in All-Optical Networks.” Proceedings of the 26th ACM Symp. on Theory of Computing, pp. 134–143, 1994.

    Google Scholar 

  31. R. Ramaswami and K. Sivarajan. “Routing and Wavelength Assignment in All-Optical Networks.” IEEE/ACM Transactions on Networking, Vol. 3, No. 5, pp. 489–500, 1995.

    Article  Google Scholar 

  32. H. Schulte and W. Cornell. “Multi-area mobile telephone system.” IRE Transactions on Vehicular Communications, Vol. 9, pp. 49–53, 1960.

    Article  Google Scholar 

  33. L.G. Valiant. “General Purpose Parallel Architectures.” Handbook of Theoretical Computer Science, Chapter 18, p. 967, (Elsevier) 1990.

    Google Scholar 

  34. M. Zhang and T.-S. Yum. “Comparisons of channel-assignment strategies in cellular mobile telephone systems.” IEEE Transactions on Vehicular Technology, Vol. 38, No. 4, pp. 211–215, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, 60208, USA

    Eric J. Schwabe

Authors
  1. Eric J. Schwabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana, Urbana, IL, 61801-2987, USA

    Michael T. Heath

  2. Department of Computer Science and Engineering, Indian Institute of Technology, Powai, Mumbai, 400076, India

    Abhiram Ranade

  3. Hewlett-Packard, Inc., Palo Alto, CA, 94305-1126, USA

    Robert S. Schreiber

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Schwabe, E.J. (1999). Routing in Optical and Wireless Networks. In: Heath, M.T., Ranade, A., Schreiber, R.S. (eds) Algorithms for Parallel Processing. The IMA Volumes in Mathematics and its Applications, vol 105. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1516-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1516-5_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7175-8

  • Online ISBN: 978-1-4612-1516-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation