On the behavior of input queuing switch architectures

European Transactions on Telecommunications

Volumn 10, Issue 2, 1999, Pages 111-124

  Marsan, Marco Ajmone ^b   Bianco, Andrea ^b   Giaccone, Paolo ^b   Leonardi, Emilio ^b   Neri, Fabio ^b   Filippi, Enrica ^a  

^a CSELT   (Italy)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000831092     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460100203     Document Type: Article

References (22)

1. Karol M., Hluchyj M., Morgan S., Input versus output queuing on a space division switch. IEEE Transaction on Communications, Vol. 35, No. 12, pages 1347-1356, Dec. 1987.
2. Parekh A.K., Gallager R.G., A generalized processor sharing approach to flow control in integrated services networks. IEEE/ACM Transactions on Networking, Vol. 1, No. 3, pages 344-357, June 1993.
3. Zhang H., Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, Vol. 83, No. 10, pages 1374-1399, Oct. 1995.
4. McKeown N., Mekkittikul A., A pratical scheduling algorithm to achieve 100% throughput in input-queued switches. In IEEE INFOCOM 98, 1998.
5. McKeown N., Izzard M., Mekkittikul A., Ellesick B., Horowitz M., The Tiny Tera: a packet switch core. IEEE Micro Magazine, Vol. 17, pages 27-40, Feb. 1997.
6. McKeown N., Scheduling algorithms for input-queued cell switches, Ph.D. Thesis, University of California at Berkeley, 1995.
7. McKeown N., Anderson T.E., A quantitative comparison of scheduling algorithms for input-queued switches. tiny-tera.stanford.edu/∼nickm/papers.html.
8. Mckeown N., Mekkittikul A., A starvation free algorithm for achieving 100% throughput in an input queued switch. In ICCCN 96, 1996.
9. LaMaire R.O., Serpanos D.N., Two dimensional round-robin schedulers for packet switches with multiple input queues. IEEE/ACM Transaction on Networking, Vol. 2, No. 5, pages 471-482, Oct. 1994.
10. Chen H., Lambert J., Pitsilledes A., RC-BB switch. A high performance switching network for B-ISDN. In IEEE GLOBECOM 95, 1995.
11. Duan H., Lockwood J.W., Kang S.M., Will J.D., A high performance OC12/OC48 queue design prototype for input buffered ATM switches. In IEEE INFOCOM 97, 1997.
12. Ajmone Marsan M., Bianco A., Leonardi E., RPA: a simple efficient and flexible policy for input buffered ATM switches. IEEE Communication Letters, Vol. 1, No. 3, pages 83-86, May 1997.
13. rd IEEE Symposium on Computers & Communications (IS-CC'98), 1998.
14. Giaccone P., Tecniche di accodamento e trasferimento in architetture di commutazione a larga banda, Laurea Thesis, Politecnico di Torino, May 1998, in Italian.
15. Awdeh R.Y., Mouftah H.T., Survey of ATM switch architectures. Computer Networks & ISDN Systems, Vol. 27, pages 1567-1613, May 1995.
16. D. Stiliadis, A. Varma, Providing bandwidth guarantees in an input-buffered crossbar switch. In IEEE INFOCOM 95, 1995.
17. Stephens D.C., Zhang H., Implementing distributed packet fair queueing in a scalable switch architecture. In IEEE INFOCOM 98, 1998.
18. Tarjan R.E., Data structures and network algorithms, Society for Industrial and Applied Mathematics, Pennsylvania, Nov. 1983.
19. 2.5 algorithm for maximum matching in bipartite graphs. Society for Industrial and Applied Mathematics J.Comput., Vol. 2, pages 225-231, 1973.
20. Pawlikowski K., Steady-state simulation of queueing processes: a survey of problems and solutions. ACM Computing Surveys, Vol. 22, No. 2, pages 123-163, June 1990.
21. Tassiulas L., Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In IEEE INFOCOM 98, 1998.
22. th International Workshop on Quality of Service (IWQoS 98), 1998.