Paper Titles

FTIR/ATR Spectroscopy Analysis of COD in Wastewater Based on Combination Optimization of SG Smoothing Modes and PLS Factor
p.1797

Modular Network in Manufacturing Industry and its Competitive Advantages
p.1802

Multi-Objective Optimization of a Piezoelectric Sandwich Ultrasonic Transducer by Using Elitist Non-Dominated Sorting Genetic Algorithm
p.1808

Maintenance-Free Technologies on Digital Methane Detection System
p.1813

Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar
p.1819

Investigating Vocational High School Students’ Cognitive Load of Infusing Nanotechnology into Electronics Subjects
p.1825

A Scalable Heuristic Based on Hypercube Graph for Automated Planner
p.1830

The Research of Scrub on the Performance of Diatomite
p.1836

Effects of Vocational School Students’ Web-Based Collaborative Learning on Diagnosis and Repair in Automobile Electrical Systems – Cases of Starting, Charging and Ignition Systems
p.1840

HomeKey Engineering MaterialsKey Engineering Materials Vols. 474-476Bandwidth Guaranteed Multicast Scheduling for...

Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Advanced Materials and Computer Science

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Pages:

1819-1824

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.474-476.1819

Citation:

Cite this paper

Online since:

April 2011

Authors:

Peng Wang, Shu Qiao Chen, Hong Chao Hu

Keywords:

CICQ, Fair Service, Multi-Cast, Smooth

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] T. Javidi, R. Magill, and T. Hrabik, A high-throughput scheduling algorithm for a buffered crossbar switch fabric, "in Proc. IEEE ICC, 01, June 2001, p.1581.

DOI: 10.1109/icc.2001.937187

[2] P. Giaccone, E. Leonardi, D. Shah. On the maximal throughput of networks with finite buffers and its application to buffered crossbars, IEEE INFOCOM 2005, Miami, 2005. 971–980.

DOI: 10.1109/infcom.2005.1498326

[3] D. Pan and Y. Yang, Localized independent packet scheduling for buffered cross-bar switches, IEEE Transactions on Computers, vol. 58, no. 2, pp.260-274, Feb. (2009).

DOI: 10.1109/tc.2008.140

[4] Paolo Giaccone and Emilio Leonardi, Asymptotic performance limits of switches with buffered crossbars supporting multicast traffic, IEEE Trans. on Information Theory, 2008, 54(2): 595-607.

DOI: 10.1109/tit.2007.913564

[5] Lotfi Mhamdi, On the integration of unicast and multicast cell scheduling in buffered crossbar switches, IEEE Trans. on Parallel and Distributed Systems, 2009, 20(6): 818-830.

DOI: 10.1109/tpds.2008.262

[6] A. Parekh, A generalized processor sharing approach to flow control in integrated services network, Ph.D. thesis, Dept. Elect. Eng and Comput. Sci. M.I.T. Feb. (1992).

[7] B. Caprita, J. Nieh, and W. C. Chan, Group Round Robin: Improving the fairness and complexity of packet scheduling, in Proc. of ACM/IEEE ANCS, (2005).

DOI: 10.1145/1095890.1095896

[8] S. Ramabhadran,J. Pasquale, Stratified round robin: a low complexity packet scheduler with bandwidth fairness and bounded delay, "ACM SIGCOMM , 03, pp.239-250, Karlsruhe, Germany, Aug. (2003).

DOI: 10.1145/863955.863983

[9] Chuanxiong Guo. SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks. IEEE/ACM trans. Networking, 12(6): 1144–1155, Dec. (2004).

DOI: 10.1109/tnet.2004.838601

[10] Chuanxiong Guo. G-3: An O(1) time complexity packet scheduler that provides bounded end-to-end delay. In Proc. infocom, (2007).

DOI: 10.1109/infcom.2007.133

[11] Deng Pan, Kia Makki, and Niki Pissinou. Fair Queueing based Packet Scheduling for Buffered Crossbar Switches. IEEE Global Communications Conference(GLOBECOM2009) Honolulu, HL, Nov. 2009.

DOI: 10.1109/glocom.2009.5425680

[12] S. He,S. Sun, H. -T. Guan,Q. Zheng,Y. Zhao and W. Gao, On guaranteed smooth switching for buffered crossbar switches, IEEE/ACM Trans. Networking, vol. 16, no. 3, p.718–731, (2008).

DOI: 10.1109/tnet.2007.900402

[13] Nan Ni and Laxmi N. Bhuyan, Fair Scheduling for Input Buffered Switches, Journal of Cluster Computing, 2003, 6(2): 105-114.

[14] Deng Pan and Yuanyuan Yang, Bandwidth Guaranteed Multicast Scheduling for Virtual Output Queued Packet Switches, Journal of Parallel and Distributed Computing, 2009, 69(12): 939-949.

DOI: 10.1016/j.jpdc.2009.08.010

[15] Chuanxiong Guo. SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks. IEEE/ACM trans. Networking, 12(6): 1144–1155, Dec. (2004).

DOI: 10.1109/tnet.2004.838601

[16] Hu Hong-chao, Yi Peng and Guo Yun-fei. Design and impementation of high performance simulation platform for switching and scheduling [J]. Journal of Software. 2008, 19(4) : 1036-1050. http: / www. jos. org. cn /1000 -9825 /19 /1036. hml.

DOI: 10.3724/sp.j.1001.2008.01036