Title :
Competitive admission control and routing for multi-service general topology networks
Author :
Dasylva, A. ; Srikant, R.
Author_Institution :
Nokia Res. Center, Burlington, MA, USA
fDate :
6/21/1905 12:00:00 AM
Abstract :
We consider the problem of routing permanent virtual circuits over general-topology networks under some shortest-path rule. We derive bounds on the competitiveness ratio of any online algorithm as a function of the cost function used to describe the congestion on each network element, link or node
Keywords :
computer network management; multimedia communication; network topology; optimisation; real-time systems; telecommunication network routing; admission control; competitiveness ratio; cost function; multimedia networks; network congestion; shortest-path; telecommunication network routing; topology networks; Admission control; Bandwidth; Circuit topology; Cost function; Laboratories; Network topology; Quality management; Quality of service; Random processes; Routing;
Conference_Titel :
Decision and Control, 1999. Proceedings of the 38th IEEE Conference on
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-7803-5250-5
DOI :
10.1109/CDC.1999.827991
