By Topic

New scheduling mechanisms which efficiently utilize policing for GFR service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nabeshima, M. ; NTT Network Service Syst. Lab., Tokyo, Japan ; Yamanaka, N. ; Hasegawa, H.

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

Published in:

ATM Workshop Proceedings, 1998 IEEE

Date of Conference:

26-29 May 1998