Logarithmic delay for N × N packet switches under the crossbar constraint

IEEE/ACM Transactions on Networking

Volumn 15, Issue 3, 2007, Pages 657-668

  Neely, Michael J ^a   Modiano, Eytan ^b   Cheng, Yuan Sheng ^a  

^a University of Southern California   (United States)

^b Massachusetts Institute of Technology   (United States)

Author keywords

Optimal control; Scheduling; Stochastic queueing analysis

Indexed keywords

ALGORITHMS; OPTIMAL CONTROL SYSTEMS; PACKET SWITCHING; QUEUEING NETWORKS; RANDOM PROCESSES; SCHEDULING;

CROSSBAR CONTRAINT; STOCHASTIC QUEUIENG ANALYSIS;

PACKET NETWORKS;

EID: 34250837450     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.893876     Document Type: Article

References (30)

1. M. J. Neely and E. Modiano, "Logarithmic delay for n × n packet switches," in Proc. IEEE Workshop High Performance Switching Routing 2004, pp. 3-9.
2. C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "Birkhoff-Von Neumann input buffered crossbar switches," in Proc. IEEE INFOCOM, 2000, pp. 1614-1623.
3. C.-S. Chang, D.-S. Lee, and C.-Y. Yue, "Providing guaranteed rate services in the load balanced Birkhoff-Von Neumann switchies," in Proc. IEEE INFOCOM, 2003, pp. 1622-1632.
4. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "On the stability of input-queued switches with speedup," IEEE/ACM Trans. Netw., vol. 9, no. 1, pp. 104-118, Feb. 2001.
5. C. E. Koksal, "Providing quality of service over electronic and optical switches," Ph.D. dissertation, Lab. Inf. Decision Syst. (LIDS), Massachusetts Inst. Technol., Cambridge, 2002.
6. M. Andrews and M. Vojnovic', "Scheduling reserved traffic in inputqueued switches: New delay bounds via probabilistic techniques," in Proc. IEEE INFOCOM, 2003, pp. 764-774.
7. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM, 1996, pp. 296-302.
8. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
9. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan, "Bounds on average delays and queue size averages and variances in input-queued cell-based switches," in Proc. IEEE INFOCOM, 2001, pp. 1095-1103.
10. M. A. Marsan, A. Bianco, P. Giaccone, E. Leonardi, and F. Neri, "Multicast traffic in input-queued switches: Optimal scheduling and maximum throughput," IEEE/ACM Trans. Netw., vol. 11, no. 3, pp. 465-477, Jun. 2003.
11. M. Gamvrili and D. N. Serpanos, "Multicast schedulers for ATM switches with multiple input queues," in Proc. ISSPIT, 2004, pp. 377-380.
12. S.-T. Chuang, A. Goel, N. McKeown, and B. Prabhakar, "Matching output queueing with a combined input output queued switch," in Proc. IEEE INFOCOM, 1998, pp. 1169-1178.
13. S. Sarkar, "Optimum scheduling and memory management in input queued switches with finite buffer space," in Proc. IEEE INFOCOM, 2003, pp. 1373-1383.
14. T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packet switching system with small propagation delay," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 813-823, Dec. 1997.
15. M. Andrews and L. Zhang, "Achieving stability in networks of input queued switches," in Proc. IEEE INFOCOM, 2001, pp. 1673-1679.
16. M. J. Neely, J. Sun, and E. Modiano, "Delay and complexity tradeoffs for routing and power allocation in a wireless network," presented at the Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2002.
17. S. Iyer and N. McKeown, "Maximum size matchings and input queued switches," presented at the 40th Annu. Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2002.
18. I. Gopal, D. Coppersmith, and C. K. Wong, "Minimizing packet waiting time in a multibeam satellite system," IEEE Trans. Commun., vol. COM-30, pp. 305-316, Feb. 1982.
19. M. A. Bonuccelli, I. Gopal, and C. K.Wong, "Incremental time-slot assignment in SS/TDMA satellite systems," IEEE Trans. Commun., vol. 39, no. 7, pp. 1147-1156, Jul. 1991.
20. M. J. Neely, E. Modiano, and C. E. Rohrs, "Tradeoffs in delay guarantees and computation complexity for n × n packet switches," presented at the Conference on Information Sciences and Systems, Princeton, NJ, 2002.
21. D. Shah and M. Kopikare, "Delay bounds for approximate maximum weight matching algorithms for input queued switches," in Proc. IEEE INFOCOM, 2002, pp. 1024-1031.
22. G. Birkhoff, "Tres observaciones sobre el algebra lineal," Univ. Nac. Tucumán Rev. Ser. A, vol. 5, pp. 147-151, 1946.
23. J. von Neumann, "A certain zero-sum two-person game equivalent to the optimal assignment problem," Contributions Theory Games, vol. 2, pp. 5-12, 1953.
24. D. P. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
25. P. Humblet, "Determinism minimizes waiting time," MIT LIDS, Cambridge, Tech. Rep. P-1207, 1982.
26. D. Gamarnik, "Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks," in Proc. 31st ACM Symp. Theory Comput., 1999, pp. 206-214.
27. M. Hall Jr., Combinatorial Theory. Waltham, MA: Blaisedell, 1969.
28. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithm and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
29. 5/2 algorithm for maximum matchings in bipartite graphs," SIAM J. Comput., pp. 225-231, Dec. 1973.
30. M. J. Neely and E. Modiano, "Logarithmic delay for n × n packet switches," USC CSI, Los Angeles, Tech. Rep. CSI-04-01, 2004.