This paper develops an algorithm for integrated dynamic routing of bandwidth guaranteed paths in IP over WDM networks. By integrated routing, we mean routing taking into account the combined topology and resource usage information at the IP and optical layers. Typically, routing in IP over WDM networks has been separated into routing at the IP layer taking only IP layer information into account, and wavelength routing at the optical layer taking only optical network information into account. The motivation for integrated routing is the potential for better network usage, and this is a topic which has not been been studied extensively. We develop an integrated routing algorithm that determines (1) whether to route an arriving request over the existing topology or whether it is better to open new wavelength paths. Sometimes it is better to open new wavelength paths even if it feasible to route the current demand over the existing IP topology due to previously set-up wavelength paths. 2) For routing over the existing IP-level topology, compute "good" routes. (3) If new wavelength paths are to be set-up, determine the routers amongst which new wavelength paths are to be set-up and compute "good" routes for these new wavelength paths. The performance objective is the accomodation of as many requests as possible without requiring any a priori knowledge regarding future arrivals. The route computations account for the presence or absence of wavelength conversion capabilities at optical crossconnects. We show that the developed scheme performs very well in terms of performance metrics such as the number of rejected demands.
[1]
Andrew V. Goldberg,et al.
Solving minimum-cost flow problems by successive approximation
,
1987,
STOC.
[2]
Kumar N. Sivarajan,et al.
Optical Networks: A Practical Perspective
,
1998
.
[3]
David K. Smith.
Network Flows: Theory, Algorithms, and Applications
,
1994
.
[4]
Daniel O. Awduche,et al.
Applicability Statement for Extensions to RSVP for LSP-Tunnels
,
2001,
RFC.
[5]
D. Awduche,et al.
Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects
,
2001,
IEEE Commun. Mag..
[6]
Daniel O. Awduche,et al.
Requirements for Traffic Engineering Over MPLS
,
1999,
RFC.
[7]
Ariel Orda,et al.
QoS Routing Mechanisms and OSPF Extensions
,
1999,
RFC.
[8]
George Swallow,et al.
A framework for multiprotocol label switching
,
1999
.
[9]
Murali S. Kodialam,et al.
Minimum interference routing with applications to MPLS traffic engineering
,
2000,
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[10]
Eric C. Rosen,et al.
Multiprotocol Label Switching Architecture
,
2001,
RFC.
[11]
Serge A. Plotkin.
Competitive Routing of Virtual Circuits in ATM Networks
,
1995,
IEEE J. Sel. Areas Commun..