By Topic

Dynamic widest path selection for connection admission control in core-stateless 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

1 Author(s)
A. Dumitrescu ; Tampere Univ. of Technol., Finland

A method for determining the highest available-bandwidth paths in a core-stateless network, with or without restrictions, is proposed. The method keeps track of the possible solution range as it progresses, can operate under number of hops, delay or cost constraints, and induces load balancing and high network resource utilization. The method is combined with a token-based transfer of information and semaphore mechanism to avoid over-allocation and ensure resource allocation coordination along the logical ring of the ingress nodes. The resulted connection admission control procedure alleviates the scalability problem by keeping all the admission control operations in the ingress nodes while preserving the guaranteed service semantics and providing a low-latency, quasi-parallel allocation under light load and a centralized/semaphored allocation under heavy load. The widest path search algorithm is illustrated and compared with other existing algorithms.

Published in:

Quality of Service in Heterogeneous Wired/Wireless Networks, 2004. QSHINE 2004. First International Conference on

Date of Conference:

18-20 Oct. 2004