Analyzing the performance of greedy maximal scheduling via local pooling and graph theory

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Birand, Berk ^a   Chudnovsky, Maria ^a   Ries, Bernard ^b   Seymour, Paul ^c   Zussman, Gil ^a   Zwols, Yori ^a  

^a Columbia University ^*  (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Graph theory; Local pooling; Scheduling; Switches; Throughput maximization; Wireless networks

Indexed keywords

BIPARTITE GRAPHS; GREEDY ALGORITHMS; IN-NETWORK; INPUT QUEUED SWITCH; INTERFERENCE CONSTRAINTS; INTERFERENCE GRAPHS; LINEAR-TIME ALGORITHMS; LOCAL POOLING; LOWER BOUNDS; NETWORK GRAPH; NETWORK TOPOLOGY; THEORETICAL TECHNIQUE; THROUGHPUT MAXIMIZATION;

ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; GRAPHIC METHODS; OPTIMIZATION; SCHEDULING ALGORITHMS; THROUGHPUT;

WIRELESS NETWORKS;

EID: 77953309946     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462046     Document Type: Conference Paper

References (31)

1. M. Ajmone Marsan, E. Leonardi, M. Mellia, and F. Neri, "On the stability of isolated and interconnected input-queueing switches under multiclass traffic," IEEE Trans. Inform. Th., vol. 51, no. 3, pp. 1167-1174, Mar. 2005.
2. B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman, and Y. Zwols, "Analyzing the performance of greedy maximal scheduling via local pooling and graph theory," Columbia University, EE, Tech. Rep. #2009-07-30, July 2009. [Online]. Available: http://www.columbia.edu/~bb2408/pdfs/AnalyzingGMS.pdf
3. H. Bodlaender, "On linear time minor tests with depth-first search," J. Algorithms, vol. 14, no. 1, pp. 1-23, 1993.
4. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks - a partitioning approach," in Proc. ACM MOBICOM'06, Sept. 2006.
5. P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, "Throughput and fairness guarantees through maximal scheduling in wireless networks," IEEE Trans. Inform. Th., vol. 54, no. 2, pp. 572-594, Feb. 2008.
6. M. Chudnovsky, B. Ries, and Y. Zwols, "Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I: Graphs with α ≤ 3 and fuzzy long circular interval graphs." 2009, in preparation.
7. -, "Claw-free graphs with strongly perfect complements. Fractional and integral version. Part II: Graphs with α ≥ 4 that are not fuzzy long circular interval graphs." 2009, in preparation.
8. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proc. IEEE INFOCOM'00, Mar. 2000.
9. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue first scheduling: second order properties using fluid limits," Adv. Appl. Probab., vol. 38, no. 2, pp. 505-521, June 2006.
10. L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks. NOW Publishers, 2006.
11. P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for high-aggregate bandwidth switches," IEEE J. Select. Areas Commun., vol. 21, no. 4, pp. 546-559, May 2003.
12. J. Gross and J. Yellen, Graph theory and its applications. CRC press, 2006.
13. J.-H. Hoepman, "Simple distributed weighted matchings," Oct. 2004, eprint cs.DC/0410047.
14. S. Hougardy, "Classes of perfect graphs," Discrete Math., vol. 306, no. 19-20, pp. 2529-2571, 2006.
15. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, "Impact of interference on multi-hop wireless network performance," ACM/Springer Wireless Networks, vol. 11, no. 4, pp. 471-487, July 2005.
16. C. Joo, X. Lin, and N. B. Shroff, "Performance limits of greedy maximal matching in multi-hop wireless networks," in Proc. IEEE CDC'07, Dec. 2007.
17. C. Joo, X. Lin, and N. Shroff, "Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks," in Proc. IEEE INFOCOM'08, April 2008.
18. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "What cannot be computed locally!" in Proc. ACM PODC'04, July 2004.
19. M. Leconte, J. Ni, and R. Srikant, "Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks," in Proc. ACM MOBIHOC'09, May 2009.
20. B. Li, C. Boyaci, and Y. Xia, "A refined performance characterization of longest-queue-first policy in wireless networks," in Proc. ACM MOBIHOC'09, May 2009.
21. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer rate control in wireless networks," IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 302-315, Apr. 2006.
22. F. Maffray, "Kernels in perfect line-graphs," J. Combin. Theory Ser. B, vol. 55, no. 1, pp. 1-8, 1992.
23. N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," IEEE Trans. Commun., vol. 47, no. 8, pp. 1260-1267, Aug. 1999.
24. T. Moscibroda and R. Wattenhofer, "The complexity of connectivity in wireless networks," in Proc. IEEE INFOCOM'06, Apr. 2006.
25. R. Preis, "Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs," in LNCS, vol. 1563, pp. 259-269, 1999.
26. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the complexity of scheduling in wireless networks," in Proc. ACM MOBICOM'06, Sept. 2006.
27. N. J. A. Sloane. (2009) The on-line encyclopedia of integer sequences. [Online]. Available: http://www.research.att.com/~njas/sequences/
28. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
29. D. West, Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ, 2001.
30. X. Wu and R. Srikant, "Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling," in Proc. IEEE INFOCOM' 06, Apr. 2006.
31. G. Zussman, A. Brzezinski, and E. Modiano, "Multihop local pooling for distributed throughput maximization in wireless networks," in Proc. IEEE INFOCOM'08, April 2008.