Loading [a11y]/accessibility-menu.js
A Hierarchical Deficit Round-Robin Scheduling Algorithm for a High Level of Fair Service | IEEE Conference Publication | IEEE Xplore

A Hierarchical Deficit Round-Robin Scheduling Algorithm for a High Level of Fair Service


Abstract:

For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to rea...Show More

Abstract:

For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(logN) implementation complexity where N is the number of sessions.
Date of Conference: 23-24 November 2007
Date Added to IEEE Xplore: 26 December 2007
ISBN Information:
Conference Location: Jeonju, Korea (South)

1 Introduction

For the last several decades, providing a fair service among sessions has been studied extensively [13], [14], [2], [7], [18], [12], [10], [1]. In this problem, scalable implementation and a high level of fairness are the most important issues. Here a high level of fairness means that bandwidth is distributed evenly among sessions in short time intervals.

References

References is not available for this document.