By Topic

Feedback Mechanism for MPLS Path Assignment using RSVP-TE

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
$31 $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

2 Author(s)
Gupta, A. ; Indian Institute of Technology, New Delhi,India ; Atwood, J.W.

In constraint-based routing a topology database is maintained on all participating nodes to be used in calculating a path through the network. This database contains a list of the links in the network and the set of constraints the links can meet. Since these constraints change rapidly, the topology database will not be consistent with respect to the real network. A feedback mechanism was proposed by Ashwood-Smith, et al, to help correct the errors in the database. They felt that it would be useable only when the database sees the availability of resources to be more than they really are. Gario and Atwood validated this proposal, and showed that the feedback algorithm was helpful in all cases (not only when it was optimistic). Their validation was based on the use of CR-LDP to distribute the MPLS labels. In this paper, we show the same usefulness, for all cases, when RSVP-TE is used to distribute the labels. In addition, because RSVP-TE is a soft-state protocol that requires periodic refresh of its state, the updates that result from the refresh operations provide an additional benefit.

Published in:

Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on

Date of Conference:

19-25 Feb. 2006