Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar

The limitations in complexities and extensibilities of current scheduling policies based on combined input and cross-point queuing switch (CICQ) are first analyzed. To overcome the deficiencies in supporting fair and QOS scheduling, we propose a fair and simple high-performance multicast scheduling...

Full description

Saved in:
Bibliographic Details
Published in:Key engineering materials 2011-01, Vol.474-476 (SUPPL.3), p.1819-1824
Main Authors: Hu, Hong Chao, Chen, Shu Qiao, Wang, Peng
Format: Article
Language:English
Subjects:
Algorithms
Complexity
Delay
Design of experiments
Multicast
Queues
Scheduling
Switches
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The limitations in complexities and extensibilities of current scheduling policies based on combined input and cross-point queuing switch (CICQ) are first analyzed. To overcome the deficiencies in supporting fair and QOS scheduling, we propose a fair and simple high-performance multicast scheduling algorithm for Combined Input Crosspoint Queued Switches, which is called multicast Fair Service and Group Smoothed Round Robin (mFGSR). The complexity of the algorithm is only O(1). mFGSR groups and schedules flows according to the weight of flows, thus it has good fairness and can adapt to the need of real-time performance. Theorotical analysis and simulation results show that mFGSR exhibits good delay, throughput and anti-burst performance.
ISSN:1013-9826
1662-9795
1662-9795
DOI:10.4028/www.scientific.net/KEM.474-476.1819