Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar

Abstract:

Article Preview

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.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

1819-1824

DOI:

10.4028/www.scientific.net/KEM.474-476.1819

Citation:

P. Wang et al., "Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar", Key Engineering Materials, Vols. 474-476, pp. 1819-1824, 2011

Online since:

April 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.