Topology-based hierarchical scheduling using Deficit Round Robin: Flow protection and isolation for triple play service

This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack of malicious traffic. This is significant for IPTV services in Carrier Ethernet networks.

[1]  Jean-Michel Fourneau,et al.  Analyzing Weighted Round Robin policies with a stochastic comparison approach , 2008, Comput. Oper. Res..

[2]  Kihyun Pyun,et al.  A Hierarchical Deficit Round-Robin Scheduling Algorithm for a High Level of Fair Service , 2007, 2007 International Symposium on Information Technology Convergence (ISITC 2007).

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

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

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

[6]  M. Strzelecki,et al.  Automatic detection of pancreatic islets in magnetic resonanse rat liver images , 2008, New Trends in Audio and Video / Signal Processing Algorithms, Architectures, Arrangements, and Applications SPA 2008.

[7]  Chin-Chi Wu,et al.  Delivering relative differentiated services in future high-speed networks using hierarchical dynamic deficit round robin , 2007, Multimedia Systems.

[8]  Michael S. Berger,et al.  IPTV traffic management using topology-based hierarchical scheduling in carrier ethernet transport networks , 2009, 2009 Fourth International Conference on Communications and Networking in China.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Victor C. M. Leung,et al.  Fair and efficient frame-based scheduling algorithm for multimedia networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[11]  George Kesidis,et al.  Hierarchical shaped deficit round-robin scheduling , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[12]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[13]  Peter Willis,et al.  Carrier ethernet , 2008, IEEE Communications Magazine.

[14]  Salil S. Kanhere,et al.  Fair and Efficient Packet Scheduling Using Elastic Round Robin , 2002, IEEE Trans. Parallel Distributed Syst..

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

[16]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.