Competitive admission control and routing of multi-class traffic with statistical QoS guarantees

Author

Dasylva, A. ; Srikant, R.

Author_Institution

Nokia Res. Center, Burlington, MA, USA

fYear

1999

fDate

1999

Firstpage

290

Lastpage

297

Abstract

We propose competitive policies for admission control and routing in general topology networks, with bandwidth and buffer resources. The goal of these solutions is to maximize the network revenue, when the traffic demand is not known ahead of time, and over-allocation of network resources is allowed with some probability. On top of appropriate resource reservation setup protocols, these solutions provide statistical service while optimizing the profit of the network operator

Keywords

buffer storage; network topology; optimisation; probability; quality of service; statistical analysis; telecommunication congestion control; telecommunication network routing; telecommunication traffic; bandwidth resources; buffer resources; competitive admission control; competitive policies; general topology networks; multi-class traffic; network resource allocation; network revenue maximization; probability; routing; statistical QoS guarantees; statistical service; traffic demand; Admission control; Authentication; Bandwidth; Communication system traffic control; Cost function; Network topology; Probability; Protocols; Routing; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 1999. Proceedings. Eight International Conference on

Conference_Location

Boston, MA

ISSN

1095-2055

Print_ISBN

0-7803-5794-9

Type

conf

DOI

10.1109/ICCCN.1999.805533

Filename

805533