Abstract
This paper proposes new scheduling mechanisms for meeting fairness criteria which are not met by conventional scheduling mechanisms such as WRR. These proposed mechanisms utilize the arrival of untagged cells at an ATM switch not only for frame drop policy but also for deciding which VC cell is eligible to be serviced. GFR service using the proposed mechanisms can provide the users with bandwidth allocation which meets several fairness criteria.
| Original language | English |
|---|---|
| Title of host publication | IEEE ATM Workshop, Proceedings |
| Pages | 80-85 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 1998 Dec 1 |
| Externally published | Yes |
| Event | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' - Fairfax, VA, USA Duration: 1998 May 26 → 1998 May 29 |
Other
| Other | Proceedings of the 1998 IEEE ATM Workshop 'Meeting the Challenges of Deploying the Global Broadband Network Infrastucture' |
|---|---|
| City | Fairfax, VA, USA |
| Period | 98/5/26 → 98/5/29 |
ASJC Scopus subject areas
- Engineering(all)
Fingerprint Dive into the research topics of 'New scheduling mechanisms which efficiently utilize policing for GFR service'. Together they form a unique fingerprint.
Cite this
Nabeshima, M., Yamanaka, N., & Hasegawa, H. (1998). New scheduling mechanisms which efficiently utilize policing for GFR service. In IEEE ATM Workshop, Proceedings (pp. 80-85) https://doi.org/10.1109/ATM.1998.675127