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

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.

[1]  Upamanyu Madhow,et al.  Fair scheduling with tunable latency: a round-robin approach , 2003, TNET.

[2]  Jeonwoo Lee,et al.  The Strategy Development of u-Health Service , 2006, 2006 Technology Management for the Global Future - PICMET 2006 Conference.

[3]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[4]  Alan P Koretsky,et al.  Highly efficient endosomal labeling of progenitor and stem cells with large magnetic particles allows magnetic resonance imaging of single cells. , 2003, Blood.

[5]  Meng Chang Chen,et al.  On maximum rate control of weighted fair scheduling for transactional systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[6]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[7]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[8]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[9]  George C. Polyzos,et al.  SCED: A Generalized Scheduling Policy for Guarantee* Quality-of-Service , 1999 .

[10]  A. Shapiro,et al.  Pancreatic islet transplantation in the treatment of diabetes mellitus. , 2001, Best practice & research. Clinical endocrinology & metabolism.

[11]  Peter Girman,et al.  MRI of transplanted pancreatic islets , 2004, Magnetic resonance in medicine.

[12]  Joseph Pasquale,et al.  A schedulability condition for deadline-ordered service disciplines , 1997, TNET.

[13]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[14]  Kyung-Whan Oh,et al.  A validity measure for fuzzy clustering and its use in selecting optimal number of clusters , 1996, Proceedings of IEEE 5th International Fuzzy Systems.

[15]  Brian Rutt,et al.  Imaging Islets Labeled With Magnetic Nanoparticles at 1.5 Tesla , 2006, Diabetes.

[16]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time and priority services , 1997, SIGCOMM '97.

[17]  Salil S. Kanhere,et al.  Fair, efficient and low-latency packet scheduling using nested deficit round robin , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[18]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[19]  Habib Zaidi,et al.  Positron-emission tomography imaging of early events after transplantation of islets of Langerhans. , 2005, Transplantation.

[20]  Theofanis Orphanoudakis,et al.  GFS: An Efficient Implementation of Fair Scheduling for Mult-Gigabit Packet Networks , 2003, ASAP.

[21]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[22]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[23]  A. Shapiro,et al.  Factors Influencing the Loss of β-Cell Mass in Islet Transplantation , 2007, Cell transplantation.

[24]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[25]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[26]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[27]  Anna Moore,et al.  In Vivo Imaging of Immune Rejection in Transplanted Pancreatic Islets , 2006, Diabetes.

[28]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[29]  Frank S Prato,et al.  Tracking transplanted cells using dual-radionuclide SPECT , 2006, Physics in medicine and biology.

[30]  James H. Anderson,et al.  Quick-release fair scheduling , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[31]  Alberto Leon-Garcia,et al.  The Single-Queue Switch: A Building Block for Switches with Programmable Scheduling , 1997, IEEE J. Sel. Areas Commun..

[32]  Yvon Savaria,et al.  A systolic architecture for fast stack sequential decoders , 1994, IEEE Trans. Commun..