DocumentCode :
2405381
Title :
Multi-Level Round-Robin Multicast Scheduling with Look-Ahead Mechanism
Author :
Yu, Hao ; Ruepp, Sarah ; Berger, Michael S.
Author_Institution :
Tech. Univ. of Denmark, Lyngby, Denmark
fYear :
2011
fDate :
5-9 June 2011
Firstpage :
1
Lastpage :
5
Abstract :
In this paper, we propose a multi-level round-robin multicast scheduling (MLRRMS) algorithm with look-ahead (LA) mechanism for N×N input-queued switches. Fan-out splitting is applied, where a multicast cell can be transferred to all its destinations over any number of cell times. The scheduler constructs the Traffic Matrix before each cell transmission based on the fan-out vectors of the cells in the queues. A scheduling pointer independently moves on each column of the Traffic Matrix in a round-robin fashion and returns the decision to the Decision Matrix. The sync procedure is carried out to reduce the unnecessary transmissions of a cell. The look-ahead mechanism is executed to reduce the head-of-line blocking problem resulting in increased the throughput and reduced cell delay.
Keywords :
queueing theory; scheduling; telecommunication switching; LA mechanism; MLRRMS algorithm; cell transmission; decision matrix; fan-out splitting; head-of-line blocking problem; input-queued switches; look-ahead mechanism; multicast cell; multilevel round-robin multicast scheduling; round-robin fashion; scheduling pointer; sync procedure; traffic matrix; Computer architecture; Delay; Microprocessors; Schedules; Scheduling; Scheduling algorithm; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
ISSN :
1550-3607
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
Type :
conf
DOI :
10.1109/icc.2011.5962481
Filename :
5962481
Link To Document :
بازگشت