New scheduling mechanisms which efficiently utilize policing for GFR service

Author

Nabeshima, Masayoshi ; Yamanaka, Naoaki ; Hasegawa, Haruhsa

Author_Institution

NTT Network Service Syst. Lab., Tokyo, Japan

fYear

1998

fDate

26-29 May 1998

Firstpage

80

Lastpage

85

Abstract

This paper proposes new scheduling mechanisms for meeting fairness criteria which are not met by conventional scheduling mechanisms such as weighted round robin (WRR). These proposed mechanisms utilize the arrival of untagged cells at an ATM switch not only for a frame drop policy but also for deciding which VC cell is eligible to be serviced. The guaranteed frame rate (GFR) service using the proposed mechanisms can provide the users with bandwidth allocation which meets several fairness criteria

Keywords

asynchronous transfer mode; buffer storage; queueing theory; scheduling; storage management; ATM switch; FIFO queue; GFR service; VC cell; bandwidth allocation; buffer management; fairness criteria; frame drop policy; guaranteed frame rate; policing; scheduling mechanisms; untagged cells arrival; Asynchronous transfer mode; Bandwidth; Bit rate; Channel allocation; Electronic mail; Laboratories; Round robin; Switches; Telecommunication traffic; Virtual colonoscopy;

fLanguage

English

Publisher

ieee

Conference_Titel

ATM Workshop Proceedings, 1998 IEEE

Conference_Location

Fairfax, VA

ISSN

1098-7789

Print_ISBN

0-7803-4874-5

Type

conf

DOI

10.1109/ATM.1998.675127

Filename

675127