Bounds on delays and queue lengths in input-queued cell switches

Journal of the ACM

Volumn 50, Issue 4, 2003, Pages 520-550

  Leonardi, Emilio ^a   Mellia, Marco ^a   Neri, Fabio ^a   Marsan, Marco Ajmone ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Delay bounds; Input queued switches; Performance evaluation; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; LARGE SCALE SYSTEMS; LYAPUNOV METHODS; SCHEDULING;

DELAY BOUNDS; INPUT QUEUED SWITCHES; PERFORMANCE EVALUATION;

OPTICAL SWITCHES;

EID: 2942595607     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/792538.792544     Document Type: Article

References (24)

1. AJMONE MARSAN, M., BIANCO, A., FILIPPI, E., GIACCONE, P., LEONARDI, E., AND NERI, F. 1999a. On the behavior of input queuing switch architectures. Europ. Trans. Telecommun. (ETT) 10, 2 (Mar.), 111-124.
2. AJMONE MARSAN, M., BIANCO, A., LEONARD:, E., AND MILIA, L. 1999b. RPA: A flexible scheduling algorithm for input buffered switches. IEEE Trans. Commun. 47, 12 (Dec.), 1921-1933.
3. CHEN, H., LAMBERT, J., AND PITSILLEDES. A. 1995. RC-BB switch. A high performance switching network for B-ISDN. In Proceedings of IEEE Globecom (Singapore). IEEE Communication Society Press, Piscataway, NJ, pp. 275-279.
4. CHUANG, S. T., GOEL, A., MCKEOWN, N., AND PRABHAKAR, B. 1999. Matching output, queuing with combined input and output queuing. IEEE J. Select. Areas Commun. 17, 6 (Dec.), 1030-1039.
5. DAI, J. G., AND PRABHAKAR, B. 2000. The throughput of data switches with and without speedup. In Proceedings of IEEE Infocom (Tel Aviv, Israel, Mar.). IEEE Communication Society Press, Piscataway, NJ, pp. 556-564.
6. DUAN, H., LOCKWOOD, J. W., AND Mo KANG, S. 1998. Matrix Unit Cell Scheduler (MUCS) for input-buffered ATM switches. IEEE Commun. Lett. 2, 1 (Jan.), 20-23.
7. FAYOLLE, G. 1989. On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapunov functions-Part I. Queue. Syst. 5, 167-184.
8. KAROL, M., HLUCHYJ, M., AND MORGAN, S. 1987. Input versus output queuing on a space division switch. IEEE Trans. Commun. 35, 12 (Dec.), 1347-1356.
9. KLEINROCK, L. 1975. Queuing Systems-Vol. I: Theory, Wiley, New York.
10. KUSHNER, H. J. 1967. Stochastic Stability and Control, Academic Press, Orlando, FL.
11. LAMAIRE, R. O., AND SERPANOS, D. N. 1994. Two dimensional round-robin schedulers for packet switches with multiple input queues, IEEE/ACM Trans. Netw. 2, 5 (Oct.), 471-482.
12. LEONARDI, E., MELLIA, M., NEW, F., AND AJMONE MARSAN, M. 2001a. On the stability of input-queued switches with speed-up, IEEE/ACM Trans. Netw. 9, 1 (Feb.), 104-118.
13. LEONARDI, E., MELLIA, M., NERI, F., AND AJMONE MARSAN, M. 2001b. Bounds on average delays and queue size averages and variances in input queued cell-based switches. In Procedings of IEEE Infocom (Anchorage, AK., Apr.). IEEE Communication Society Press, Piscataway, NJ, pp. 1095-1103.
14. MCKEOWN, N. 1995. Scheduling algorithms for input-queued cell switches. Ph.D. Thesis. Univ. of California at Berkeley, Berkeley, Calif.
15. MCKEOWN, N. 1999. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw. 7, 2 (Apr.), 188-201.
16. MCKEOWN, N., AND MEKKTTTIKUL, A. 1998. A pratical scheduling algorithm to achieve 100% throughput in input-queued switches. In Procedings of IEEE Infocom (San Francisco, Calif., Apr.). IEEE Communication Society Press, Piscataway, NJ, pp. 792-799.
17. MCKEOWN, N., MEKKITTIKUL, A., ANANTHARAM, V., AND WALRAND, J. 1999. Achieving 100% throughput in an input-queued switch, IEEE Trans. Commun. 47, 8 (Aug.), 1260-1272.
18. SCHOENEN, R., POST, G., AND SANDER, G. 1999. Weighted arbitration algorithms with priorities for input-queued switches with 100% throughput. In Procedings of 3rd IEEE International Workshop on Broadband Switching Systems (Kingston, Ontario, Canada, Jun.). IEEE Communication Society Press, Piscataway, NJ.
19. SHAH, D., AND KOPIKARE, M. 2002. Delay bounds for approximate maximum weight matching algorithms for input queued switches. In Procedings of IEEE Infocom (New York, Jun). IEEE Communication Society Press, Piscataway, NJ, pp. 1024-1031.
20. STILIADIS, D., AND VARMA, A. 1995. Providing bandwidth guarantees in an input-buffered crossbar switch. In Procedings of IEEE Infocom. (Boston, Mass. Apr.). IEEE Communication Society Press, Piscataway. NJ, pp. 960-968.
21. TAMIR, Y., AND CHI, H-C. 1993. Symmetric crossbar arbiters for VLSI commun switches, IEEE Trans. Parall. Dist. Syst. 4, 1 (Jan.), 13-27.
22. TARJAN, R. E. 1983. Data structures and network algorithms. Society for Industrial and Applied Mathematics, Pa.
23. TASSIULAS, L., AND EPHREMIDES, A. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Cont. 37, 12 (Dec.), 1936-1948.
24. ZHANG, H. 1995. Service disciplines for guaranteed performance service in packet-switching networks. Proc. IEEE 83, 10 (Oct.), 1374-1399.