Bandwidth scheduling for wide-area ATM networks using virtual finishing times

Author

Hung, Anthony ; Kesidis, George

Author_Institution

Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada

Volume

4

Issue

1

fYear

1996

fDate

2/1/1996 12:00:00 AM

Firstpage

49

Lastpage

54

Abstract

The paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. The authors specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. The authors revisit an approach originally proposed by Zhang (1991) and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed

Keywords

B-ISDN; asynchronous transfer mode; buffer storage; packet switching; queueing theory; scheduling; wide area networks; asynchronous transfer mode; bandwidth scheduling; design; minimum bandwidth; packetized generalized processor sharing; scheduling policies; self-clocked fair queueing; virtual finishing times; wide-area ATM networks; Asynchronous transfer mode; B-ISDN; Bandwidth; Bit rate; Clocks; Finishing; High-speed networks; ISDN; Processor scheduling; Switches;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.503761

Filename

503761