Hardness on IP-subnet aware routing in WDM network

Authors:
Ju-Yong Lee;Eunseuk Oh;Hongsik Choi
Affiliations:
Department of Computer Science, Duksung Women's University, Seoul, Korea;Department of Computer Science, School of Engineering, Virginia Commonwealth University, Richmond, VA;Department of Computer Science, School of Engineering, Virginia Commonwealth University, Richmond, VA
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 4
Cited 0

Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols

Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

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.