By Topic

Efficient distributed admission control for 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 ; Inst. of Commun. Eng., Tampere Univ. of Technol., Finland

Providing service guarantees requires strict admission control to ensure that the resources are not over-allocated. On another hand, limiting the core nodes' role has been recognized as a key aspect in providing scalable quality of service (QoS) solutions. This paper presents a scalable multiple-token mechanism that ensures a distributed and coordinated resource allocation along the logical ring of the ingress/edge nodes. The proposed mechanism alleviates the scalability problem by keeping all the admission control operations in the ingress/edge nodes while preserving guaranteed service semantics. By distributing the available bandwidth of the links over multiple tokens, increased robustness and low latency under light load conditions are achieved, while the zero-false positives property is maintained. The erroneous connection denials, which could be due to the distribution of available bandwidth information, are avoided by an accumulation procedure that concentrates the available bandwidth information whenever necessary.

Published in:

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.  (Volume:4 )

Date of Conference:

13-17 March 2005