An architecture supporting quality-of-service in -Virtual-output-queued switches

IEICE Transactions on Communications

Volumn E83-B, Issue 2, 2000, Pages 171-181

  Schoenent, Rainer ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; QUEUEING NETWORKS; REAL TIME SYSTEMS; SWITCHING NETWORKS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC; VIRTUAL REALITY;

EARLIEST-DEADLINE-FIRST (EDF); QUALITY OF SERVICE (QOS); VIRTUAL OUTPUT QUEUEING (VOQ);

ASYNCHRONOUS TRANSFER MODE;

EID: 0033907328     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. A. Mekkittikul and N. McKcown, "A starvation-free algorithm for achieving 100% throughput in tin input-queued switch," Proc. IEEE International Conference on Communications Networks, 1996
2. N. McKcown, "Scheduling algorithms for input-queued cell switches," Ph.D. thesis, UC Berkeley, 1995
3. N. McKcown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Trans. Commun., 1998
4. A. Mekkittikul and N. McKcown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches," Proc. IEEE INFOCOM, 1998
5. S. Shenker, C. Partridge, and R. Guerin, "Specification of guaranteed quality of service," IETF RFC 2212, Sept. 1997
6. J. Wroclawski, 'The use of RSVP with IETF integrated services," IETF RFC 2210, Sept. 1997
7. R. Schoenen, G. Post, and G. Sander, "Weighted arbitration algorithms with priorities for input-queued switches with 100% throughput," Proc. IEEE Broadband Switching Systems, 1999
8. R. Schoenen, R. Hying, and J. Kozinc, "Distributed cell scheduling algorithms for virtual-output-queued switches," Proc. IEEE GLOBECOM, 1999
9. J.Y. Hui, Switching and Traffic Theory for Integrated Broadband Networks, Kluwer, 1990. ISBN 0-7923-9061-X.
10. T. Anderson, S. Owicki, J. Saxe, and C. Thacker, "High speed switch scheduling for local area networks," ACM Trans. Computer Systems, vol.11, Nov. 1993.
11. R. Schoenen and G. Post, "Static bandwidth allocation for input-queued switches with strict QoS bounds," Proc. IEEE Broadband Switching Systems, 1999.
12. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Prentice-Hall, Inc., 1982.
13. Y. Tamir and H.-C. Chi, ''Symmetric cross bar arbiters for VLSI communication switches," IEEE Trans. Parallel & Distributed Systems, vol.4, no.l, pp.13-27, 1993.
14. C. Lund, S. Phillips, and N. Reingold;" "Fair prioritized scheduling in an input-buffered switch," Proc. IEEE International Conference on Broadband Communications, 1996.
15. R. Schoenen, G. Post, and G. Sander, "Prioritized arbitration for input-queued switches with 100% throughput," Proc. ATM Workshop '99, 1999
16. R. Schoenen, G. Post, and A. Müller, "Analysis and dimensioning of credit-based flow control for the ABR service in ATM networks," Proc. IEEE GLOBECOM, vol.4, p.2399, 1998
17. D. Stephens and H. Zhang, "Implementing distributed packet fair queueing in a scalable switch architecture," Proc. IEEE INFOCOM, 1998
18. L. Kleinrock, Queueing Systems, Vol.II: Applications, John Wiley & Sons, New York, 197G
19. The ATM Forum, ATM user-network interface (UNI) specification version 3.1, Prentice Hall, Englewood Cliffs, N.J., 1994
20. S. Shenker and J. Wroclawski, "General characterization parameters for integrated service network elements," IETF RFC 2215, Sept. 1997
21. R. Cruz, "A calculus for network delay, Part I: Network elements in isolation," IEEE Trans. Inf. Theory, vol.37, p.114, Jan. 1991
22. H. Michiel and K. Laevens, "Teletraffic engineering in a broad-band era," Proc. IEEE, vol.85, p.2007, Dec. 1997
23. J. Roberts, U. Mocci, and J. Virtamo, eds., Broadband Network Teletraffic: Performance Evaluation and Design of Broadband Multiservice Networks; final report of action COST 242. LNCS1155, Springer, 1996
24. MIL 3, Inc., 3400 International Drive, NW Washington, DC 20008, USA, OPNET Release C.O, 1999. http://www.mil3.co
25. N. McKeown and T. Anderson, "A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches," 1997, unpublished available at http://http.cs.berkeley.edu./ %7Etca/atm.html
26. M. Marsan, Modelling with Generalized Stochastic Petri Nets, Wiley, 199G. ISBN 0-471-93059-8
27. B. Walke and W. Rosenbohm, "Waiting-time distributions for deadline-oriented serving," Performance of Computer Systems, p.214, North-Holland Publishing Company, 1979
28. L. Kleinrock, Queueing Systems, Vol.1: Theory, John Wiley & Sons, New York, 1975
29. F. Chiussi and V. Sivaraman, "Achieving high utilization in guaranteed services networks using earliest-deadline-first scheduling," Proc. International Workshop on Quality-of- ,. Service, 1998
30. S.W. Lee, D.H. Cho, and Y.K. Park "Improved dynamic weighted cell scheduling algorithm based on earliest deadline first scheme for various traffics of ATM switch," Proc. IEEE Globecom '96, pp. 1959-1963, London, 1996.