Title :
Efficient distributed admission control for core-stateless networks
Author :
Dumitrescu, Avadora
Author_Institution :
Inst. of Commun. Eng., Tampere Univ. of Technol., Finland
Abstract :
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.
Keywords :
bandwidth allocation; quality of service; resource allocation; telecommunication congestion control; telecommunication network reliability; token networks; accumulation procedure; admission control; bandwidth information; coordinated resource allocation; core stateless network; distributed resource allocation; guaranteed service semantics; ingress-edge node; logical ring; multiple-token mechanism; quality of service; scalable QoS; zero-false positive property; Admission control; Aggregates; Bandwidth; Delay; Quality of service; Resource management; Robustness; Scalability; State estimation; Testing;
Conference_Titel :
INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE
Print_ISBN :
0-7803-8968-9
DOI :
10.1109/INFCOM.2005.1498577