By Topic

Algorithms to implement snap-shot-based effective-bandwidth routing that best utilizes its excess bandwidth for best effort traffic

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

2 Author(s)
S. L. Spitler ; Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA ; D. C. Lee

Computationally efficient algorithms are developed to implement admission control and explicit routing of label switched paths (LSPs) for individually arriving quality of service (QoS) connection requests in a multiprotocol label switching (MPLS) network domain. A greedy admissions control policy, based on the snap-shot state of the network, is applied to arriving QoS connection requests, i.e., a connection request is admitted whenever there is an available path with sufficient residual capacities along its links to support the connection without re-routing existing LSPs. Although in our novel scenario best effort (BE) traffic flows follow their usual destination-based shortest path routes, in routing QoS connections, our algorithms give consideration to the resultant BE traffic delays. Excess effective bandwidth, the margin by which a QoS connection's effective bandwidth exceeds its average consumed bandwidth, is employed to support BE traffic.

Published in:

MILCOM 2002. Proceedings  (Volume:2 )

Date of Conference:

7-10 Oct. 2002