Local resource allocation for providing end to end delay guarantees in ATM networks using PGPS scheduling

Author

Ayad, Amr S. ; Elsayed, Khaled M F ; El-Hadidi, Mahmoud T.

Author_Institution

Dept. of Electron. & Commun. Eng., Cairo Univ., Giza, Egypt

fYear

1999

fDate

1999

Firstpage

30

Lastpage

37

Abstract

The paper addresses the issue of reserving resources at ATM switches along the path of flows that require a hard (deterministic) bound on end to end delay. The switches are assumed to be using packet-by-packet generalized processor sharing (PGPS) schedulers for each outgoing link. An algorithm for call admission control of these flows is proposed. Different policies for mapping the end to end delay requirement into service rates to be assigned at each scheduler are suggested and analyzed

Keywords

asynchronous transfer mode; delays; packet switching; probability; processor scheduling; quality of service; telecommunication congestion control; telecommunication networks; ATM networks; ATM switches; PGPS scheduling; QoS; algorithm; call admission control; call blocking probability; deterministic bound; end to end delay guarantees; hard bound; local resource allocation; packet-by-packet generalized processor sharing; quality of service; resource reservation; service rates; Asynchronous transfer mode; Delay; Electronic switching systems; Global Positioning System; Intelligent networks; Processor scheduling; Quality of service; Resource management; Routing; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999. Proceedings. 7th International Symposium on

Conference_Location

College Park, MD

Print_ISBN

0-7695-0381-0

Type

conf

DOI

10.1109/MASCOT.1999.805037

Filename

805037