Skip to main content

Hardness on IP-subnet Aware Routing in WDM Network

  • Conference paper
Information Networking. Convergence in Broadband and Mobile Networking (ICOIN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3391))

Included in the following conference series:

  • 955 Accesses

Abstract

In this paper, we study the hardness of the IP-subnet aware routing problem in WDM network. IP-subnet aware routing attempts to reduce routing overhead by grouping a set of addresses under a single subnet. However, routing in WDM network with subnets imposes neighboring IP interfaces along the path to be on the same subnet. This subnet constraint forces the routing path to be longer unless routing permits reconfiguration of subnets. The hardness of this routing problem is first studied in [1]. We investigate further the problem of finding paths accounting for subnets and its hardness. Regardless of subnets, we argue that a shortest IP hop path can be constructed in a polynomial time. We provide efficient routing algorithms to justify our argument.

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

Access this chapter

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

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. Acharya, S., Gupta, B., Risbood, P., Srivastava, A.: IP-Subnet Aware Routing in WDM Mesh Networks. In: Proc. The IEEE Conference on Computer Communications, IEEE Infocom (2003)

    Google Scholar 

  2. Awduche, D., Berger, L., Gan, D., Li, T., Swallow, G., Srinivasan, V.: RSVP-TE: Extensions to RSVP for LSP tunnels. RFC-3209 (December 2001)

    Google Scholar 

  3. Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik (1959)

    Google Scholar 

  4. Kodialam, M., Lakshman, T.V.: Integrated Dynamic IP and Wavelength Routing in IP over Networks. In: Proc. The IEEE Conference on Computer Communications (IEEE Infocom), pp. 358–366 (2001)

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, California, USA (1979)

    Google Scholar 

  6. Guerin, R., Williams, D., Orda, A.: QoS Routing Mechanisms and OSPF Extensions. In: Proc. The IEEE Global Telecommunications Conference, IEEE Globecom (1997)

    Google Scholar 

  7. Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998)

    Google Scholar 

  8. Perlman, R.: Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, Reading (1999)

    Google Scholar 

  9. Stern, T.E., Bala, K.: Multiwavelength Optical Networks: A Layered Approach. Wesley Longman (1999)

    Google Scholar 

  10. Schwartz, M., Stern, T.E.: Routing Techniques used in Computer Communication Network. IEEE Trans. on Comm. COM-28 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, JY., Oh, E., Choi, H. (2005). Hardness on IP-subnet Aware Routing in WDM Network. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30582-8_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24467-7

  • Online ISBN: 978-3-540-30582-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics