By Topic

Dynamic LSP provisioning in overlay, augmented, and peer architectures for IP-MPLS over WDM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Koo ; Dept. of Electr. & Comput. Eng., George Washington Univ., DC, USA ; G. Sahin ; S. Subramaniam

We consider an IP/MPLS over WDM network, in which label switched routers (LSRs) in the IP/MPLS layer are interconnected through optical cross-connects (OXCs) in the optical core network (WDM layer) providing an end-to-end wavelength routing capability. In this paper, we study a dynamic label switched path (LSP) provisioning problem for the three different network models of the IP/MPLS over WDM network, namely, overlay, augmented, and peer models. For the overlay model, we propose an algorithm, called MLH_OVLY, in which a network finds a path with the minimum number of logical hops for an LSP request. We also propose, for the augmented model, a simple and efficient dynamic LSP provisioning algorithm, called CAPA_AUG, utilizing summarized capacity information from the WDM layer. We compare the proposed algorithms with the existing algorithms available for the overlay and peer models, and also provide an in-depth analysis of the algorithms. The algorithms are compared and evaluated using two key performance measures: LSP blocking probability and network (lightpath) utilization. Simulation results show that at low loads with a limited number of ports available in the network, CAPA_AUG achieves an order of magnitude better blocking performance and outperforms all other algorithm. Considering the small amount of information that is exchanged between the layers in the augmented model, these results suggest that the augmented model can be a practically good compromise between the overlay and peer models.

Published in:

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies  (Volume:1 )

Date of Conference:

7-11 March 2004