DocumentCode :
569045
Title :
Fair Scheduling on Parallel Bonded Channels with Intersecting Bonding Groups
Author :
Hong, Gongbing ; Martin, James ; Moser, Scott ; Westall, James
Author_Institution :
Sch. of Comput., Clemson Univ., Clemson, SC, USA
fYear :
2012
fDate :
7-9 Aug. 2012
Firstpage :
89
Lastpage :
98
Abstract :
We describe an efficient scheduling technique for providing weighted sharing of aggregate capacity in networks having parallel bonded channels in which a single channel may simultaneously be a member of multiple bonding groups. Our work is motivated by the introduction of this capability into version 3 of the Data Over Cable Service Interface Specification (DOCSIS). Our technique extends Golestani´s self-clocked fair queuing algorithm (SCFQ). We illustrate its weighted fair-sharing properties via simulation and provide some analytic results that establish fairness under certain conditions. We also demonstrate that round robin based techniques such as weighted deficit round robin do not extend equally easily and effectively to this environment.
Keywords :
cable television; data communication; group theory; queueing theory; scheduling; DOCSIS; SCFQ; data over cable service interface specification; intersecting bonding group; parallel bonded channel; round robin based technique; self-clocked fair queuing algorithm; weighted fair scheduling; weighted fair sharing property; Aggregates; Bonding; Channel capacity; Global Positioning System; Resource management; Scheduling; Scheduling algorithms; DOCSIS; channel bonding; weighted fair scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS), 2012 IEEE 20th International Symposium on
Conference_Location :
Washington, DC
ISSN :
1526-7539
Print_ISBN :
978-1-4673-2453-3
Type :
conf
DOI :
10.1109/MASCOTS.2012.20
Filename :
6298168
Link To Document :
بازگشت