Weighted fairness in buffered crossbar scheduling

IEEE International Conference on High Performance Switching and Routing, HPSR

Volumn , Issue , 2003, Pages 17-22

  Chrysos, N ^a,b   Katevenis, M ^a,b  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

^b UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CROSSBAR EQUIPMENT; SCHEDULING; TELECOMMUNICATION NETWORKS;

BUFFERED CROSSBARS; CROSSBAR SCHEDULING; CROSSPOINT BUFFER; FAIRNESS PROPERTIES; HIGH THROUGHPUT; SWITCH ARCHITECTURES; WEIGHTED FAIR SCHEDULERS; WEIGHTED FAIRNESS;

BUFFER CIRCUITS;

EID: 25844468715     PISSN: 23255595     EISSN: 23255609     Source Type: Conference Proceeding    
DOI: 10.1109/HPSR.2003.1226674     Document Type: Conference Paper

References (17)

1. T. Anderson, S. Owicki, J. Saxe, C. Thacker: "High-Speed Switch Scheduling for Local-Area Networks ", ACM Trans, on Computer Sys tems, vol. 11, no. 4, Nov. 1993, pp. 319-352.
2. R. LaMaire, D. Serpanos: "Two-Dimensional Round-Robin Schedulers for Packet Switches with Multiple Input Queues ", IEEE/ACM Trans, on Networking, vol. 2, no. 5, Oct. 1994, pp. 471-482.
3. N. McKeown: "The iSLIP Scheduling Algorithm for Input-Queued Switches ", IEEE/ACM Trans, on Networking, vol. 7, no. 2, April 1999, pp. 188-201.
4. A. Demers, S. Keshav, S. Shenker: "Design and Analysis of a Fair Queueing Algorithm", Proc. of ACM SIGCOMM Conf.,Texas USA, Sep. 1989, pp. 1-12.
5. N. Ni, L. N. Bhuyan: "Fair scheduling for Input Buffered Switches", citeseer.nj.nec.com/482342.html.
6. D. Stephens, H. Zhang: "Implementing Distributed Packet Fair Queueing in a scalable switch architecture", Proc. INFOCOM'98 Conf., San Francisco, CA, March 1998, pp. 282-290
7. T. Javidi, R. Magill, and T. Hrabik: "A High-Throughput Scheduling Algorithm for a Buffered Crossbar Switch Fabric" Proc. IEEE Int. Conf. on Communications (ICC2001), Helsinki, Finland, June 2001, vol. 5, pp. 1586-1591.
8. R. Rojas-Cessa, E. Oki, and H. Jonathan Chao: "CIXOB-k: Combined Input-Crosspoint-Output Buffered Switch", Proc. GLOBECOM '01, vol. 4, pp. 2654-2660
9. www.tsmc.com/
10. P. Goyal, H. M. Vin and H. Cheng: "Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks ", Proc. of ACM-SIGCOM 96, pages 157-168, Palo Alto, CA, August 1996.
11. K. G.I. Harteros: "Fast Parallel Comparison Circuits for Schedul ing", Master of Science Thesis, University of Crete, Greece; Technical Report FORTH-ICS/TR-304, Institute of Computer Sci ence, FORTH, Heraklio, Crete, Greece, 78 pages, March 2002; http://archvlsi.ics.forth.gr/muqpro/cmpTree.html
12. A. K. Parekh and R. G. Gallager: "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The single Node Case", IEEE/ACM Transactions on Networking, vol. 1, no. 3, June 19.
13. N. Chrysos and M. Katevenis: "Weighted Fairness in Buffered Crossbar Scheduling-Extended Version", http://archvlsi.ics.forth.gr/bufxbar/wf- bufxbar.extended.ps
14. Z. Cao, E. W. Zegura: "Utility Max-Min: An application-Oriented Bandwidth Allocation Scheme", Proceedings of IEEE INFOCOM 99, New York, NY, March, 1999.
15. J. C. R. Bennett, H. Zhang: "Hierarchical Packet Fair Queueing Algorithms", IEEE/ACM Transactions on networking, Vol. 5., No. 5, October 1997
16. E. Hahne: "Round-Robin Scheduling for Max-Min Fairness in Data Networks", IEEE Journal on Selected Areas in Communications, vol. 9, no. 7, September 1991.
17. N. Chrysos and M. Katevenis: "Transient Phenomena of a Buffered Crossbar Converging to Weighted Max Min Fairness", http://archvlsi.ics. forth.gr/bufxbar/bufxbar-chrys-02-08.ps