Network delay analysis of a class of fair queueing algorithms

Author

Golestani, S. Jamaloddin

Author_Institution

Bellcore, Morristown, NJ, USA

Volume

13

Issue

6

fYear

1995

fDate

8/1/1995 12:00:00 AM

Firstpage

1057

Lastpage

1070

Abstract

A self-clocked fair queueing (SCFQ) scheme has been proposed by Golestani (see Proc. IEEE INFOCOM, p. 636-636, 1994) as an easily implementable version of fair queueing. In this paper, the worst case network delay performance of a class of fair queueing algorithms, including the SCFQ scheme, is studied. We build upon and generalize the methodology developed by Parekh and Gallager (see ACM/IEEE Trans. Networking, vol.1, no.3, p.344-357, 1993, and vol.2, no.2, p.137-150, 1994) to study this class of algorithms based on the leaky-bucket characterization of traffic. Under modest resource allocation conditions, the end-to-end session delays and backlogs corresponding to this class of algorithms are shown to be bounded. For the SCFQ scheme, these bounds are larger, but practically as good as the corresponding bounds for the PGPS scheme. It is shown that the SCFQ scheme can provide adequate performance guarantees for the delay-sensitive traffic in ATM

Keywords

asynchronous transfer mode; delays; queueing theory; resource allocation; telecommunication networks; telecommunication traffic; ATM; backlogs; delay-sensitive traffic; end-to-end session delays; fair queueing algorithms; leaky-bucket traffic characterization; network delay analysis; resource allocation; self-clocked fair queueing; worst case network delay performance; Algorithm design and analysis; Delay; Global Positioning System; Performance analysis; Queueing analysis; Real time systems; Resource management; Telecommunication traffic; Terminology; Traffic control;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.400661

Filename

400661