Node weighted scheduling

SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems

Volumn 37, Issue 1, 2009, Pages 97-107

  Gupta, Gagan R ^a   Sanghavi, Sujay ^a   Shroff, Ness B ^b  

^a PURDUE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Bipartite matching; Fluid limits; Scheduling; Switch

Indexed keywords

ARRIVAL PROCESS; BIPARTITE MATCHINGS; BUFFERED CROSSBAR SWITCH; COMPLEXITY ALGORITHMS; DELAY PERFORMANCE; EDGE-BASED APPROACH; FLUID LIMITS; INITIAL CONFIGURATION; INPUT BUFFERS; LARGE CLASS; LAW OF LARGE NUMBERS; OPTIMALITY; SIZE MATCHING; SWITCH SCHEDULING; TIME SLOTS; WEIGHTED MATCHING; WORST-CASE COMPLEXITY;

CROSSBAR EQUIPMENT; SWITCHES;

SCHEDULING ALGORITHMS;

EID: 70449645012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555349.1555361     Document Type: Conference Paper

References (31)

1. ALTMAN, E., LIU, Z., AND RIGHTER, R. Scheduling of an input-queued switch to achieve maximal throughput. Probability in the Engineering and Informational Sciences 14 (2000), 327-334.
2. BRZEZINSKI, A., ZUSSMAN, G., AND MODIANO, E. Enabling distributed throughput maximization in wireless mesh networks: A partitioning approach. In ACM Mobicom (New York, NY, USA, 2006), ACM Press, pp. 26-37.
3. CHANG, C.-S., CHEN, W.-J., AND HUANG, H.-Y. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and Von Neumann. In IEEE Infocom (2000).
4. DAI, J., AND PRABHAKAR, B. The throughput of data switches with and without speedup. In IEEE Infocom (March 2000).
5. DAI, J. G. On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 5 (1995), 49-77.
6. DIMAKIS, A., AND WALRAND, J. Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits. Advances in Applied Probability 38, 2 (2006), 505âǍŞ- 521.
7. FELDMANN, A., KAMMENHUBER, N., MAENNEL, O., MAGGS, B., PRISCO, R. D., AND SUNDARAM, R. A methodology for estimating interdomain web traffic demand. In IMC (2004).
8. GEORGIADIS, L., NEELY, M. J., AND TASSIULAS, L. Resource Allocation and Cross-Layer Control in Wireless Networks, Foundations and Trends in Networking, vol. 1. Now Publishers, 2006.
9. HOFFMAN, A., AND KUHN, H. Systems of distinct representatives and linear programming. The American Mathematical Monthly 63 (1956).
10. IYER, S., AND MCKEOWN, N. Maximum size matching and input queued switches. In Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing (2002).
11. JOO, C., LIN, X., AND SHROFF, N. B. Performance limits of greedy maximal matching in multi-hop wireless networks. In IEEE CDC (2007).
12. JOO, C., LIN, X., AND SHROFF, N. B. Understanding the capacity region of greedy maximal scheduling algorithm in multi-hop wireless networks. In IEEE INFOCOM (2008).
13. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2 (1973).
14. KESLASSY, I., AND MCKEOWN, N. Analysis of scheduling algorithms that provide 100% throughput in input-queued switches. In Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing (October 2001).
15. KESLASSY, I., ZHANG-SHEN, R., AND MCKEOWN, N. Maximum size matching is unstable for any packet switch. IEEE Communications Letters 7 (October 2003).
16. LEONARDI, E., MELLIA, M., NERI, F., AND AJMONE MARSAN, M. On the stability of input-queued switches with speed-up. IEEE/ACM Transactions on Networking 9, 1 (Feburary 2001).
17. M. HALL, J. Distinct representatives of subsets. Bulletin of the American Mathematical Society 54 (1948).
18. MCKEOWN, N., ANANTHARAM, V., AND WALRAND, J. Achieving 100% throughput in an input-queued switch. In IEEE Infocom (March 1996).
19. MEKKITTIKUL, A., AND MCKEOWN, N. Practical scheduling algorithm to achieve 100% throughput in input-queued switches. In IEEE Infocom (April 1998).
20. NEELY, M. J., MODIANO, E., AND CHENG, Y.-S. Logarithmic delay for n x n packet switches under the crossbar constraint. IEEE Transactions on Networking 15 (2007).
21. NEELY, M. J., MODIANO, E., AND ROHRS, C. E. Tradeoffs in delay guarantees and computation complexity for nxn packet switches. In Proc. of Conf. on Information Sciences and Systems (CISS) (2002).
22. GAMARNIK D. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In Proc. of 31st ACM Symposium on the Theory of Computing (1999).
23. NEELY, M. J., SUN, J., AND MODIANO, E. Delay and complexity tradeoffs for routing and power allocation in a wireless network. In Proc. of Allerton Conf. on Communication, Control, and Computing (2002).
24. PERFECT, H., AND PYM, J. An extension of Banach's mapping theorem, with applications to problems concerning common representatives. Proceedings of the Cambridge Philosophical Society (Mathematical and Physical Sciences) 62 (1966).
25. SHAH, D. Maximal matching scheduling is good enough. In IEEE Globecom (2003).
26. SHAH, D., GIACCONE, P., AND PRABHAKAR, B. An efficient randomized algorithm for input-queued switch scheduling. IEEE Micro 22 (January-February 2002).
27. SHAH, D., AND WISCHIK, D. Optimal scheduling algorithms for input-queued switches. In INFOCOM (2006).
28. STOLYAR, A. L. Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals of Applied Probability Vol.14, No.1 (2004), pp.1-53.
29. TASSIULAS, L. Scheduling and performance limits of networks with constantly changing topology. IEEE Trans. Inform. Theory 43 (1997), 1067-1073.
30. TASSIULAS, L., AND EPHREMIDES, A. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Aut. Contr.37 37, 12 (1992), 1936-1948.
31. WELLER, T., AND HAJEK, B. Scheduling nonuniform traffic in a packet-switching system with small propagation delay. IEEE/ACM Trans. Netw. 5, 6 (1997), 813-823.