Hierarchical scheduling for DiffServ classes

Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across the Internet. For each DiffServ compliant router, the scheduling algorithm is critical in implementing per hop behaviors (PHBs), according to which packets are forwarded. We propose a hierarchical DiffServ scheduling (HDS) algorithm to support DiffServ classes on input-queued switches. The proposed HDS algorithm features in a hierarchical scheduling scheme that consists of two levels of schedulers. One level is the central scheduler which is designed to maximize the switch throughput by computing a maximal size matching between input ports and output ports. The other level is formed by input port schedulers which provide differentiated services by serving cells belonging to different classes dynamically. Using such a hierarchical scheme, the implementation complexity and the amount of information needed to be transmitted between input ports and the central scheduler are dramatically reduced compared with existing maximal weight matching based DiffServ scheduling algorithms. The tradeoff of its slightly worse delay performance is acceptable.

[1]  Kiseon Kim,et al.  Hierarchical scheduling algorithm for QoS guarantee in MIQ switches , 2000 .

[2]  Mei Yang,et al.  Scheduling with dynamic bandwidth allocation for DiffServ classes , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[3]  Mansoor Alam,et al.  Two scheduling algorithms for input-queued switches guaranteeing voice QoS , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[5]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[6]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[7]  Andrea Francini,et al.  A distributed scheduling architecture for scalable packet switches , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Brian E. Carpenter,et al.  Differentiated services in the Internet , 2002, Proc. IEEE.

[9]  Chun-Xiang Chen,et al.  An adaptive scheduler to provide QoS guarantees in an input-buffered switch , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[10]  Shivendra S. Panwar,et al.  The dual round robin matching switch with exhaustive service , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[11]  Kai-Yeung Siu,et al.  Linear-complexity algorithms for QoS support in input-queued switches with no speedup , 1999, IEEE J. Sel. Areas Commun..

[12]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[13]  Nirwan Ansari,et al.  Provisioning QoS features for input-queued ATM switches , 1998 .

[14]  Si-Qing Zheng,et al.  A simple and fast parallel round-robin arbiter for high-speed switch control and scheduling , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

[15]  Melody Moh,et al.  PQWRR scheduling algorithm in supporting of DiffServ , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[16]  Rainer Schoenen,et al.  Prioritized arbitration for input-queued switches with 100% throughput , 1999, IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462).

[17]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.