Scheduling for network coded multicast: A conflict graph formulation

2008 IEEE Globecom Workshops, GLOBECOM 2008

Volumn , Issue , 2008, Pages

  Traskov, Danail ^a   Heindlmaie, Michael ^a   Médard, Muriel ^b   Koetter, Ralf ^a   Lun, Desmond S ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICT GRAPHS; MEDIUM ACCESS; MULTICAST; MULTICAST TRAFFICS; OPTIMIZATION PROBLEMS; SCHEDULING TECHNIQUES; SUBGRAPH;

MULTICASTING; SCHEDULING;

WIRELESS NETWORKS;

EID: 62949220277     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOMW.2008.ECP.96     Document Type: Conference Paper

References (15)

1. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast,"IEEE Trans. On Information Theory, 52 (10). pp. 4413-4430, October 2006.
2. D.S. Lun, N. Ratnakar, M. Médard, R. Koetter, D.R. Karger, T. Ho, and E. Ahmed, "Minimum-cost multicast over coded packet networks," IEEE Trans. on Information Theory, 52(6):2608-2623, June 2006.
3. L.Bao, and J.J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," Proc. IEEE MILCOM 2000, Los Angeles, California, October 22-25, 2000.
4. L. Tassiulas and A. F. 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.
5. J. Sundararajan, M. Médard, M. Kim, A. Eryilmaz, D. Shah, R. Koetter, "Network coding in a multicast switch," in IEEE INFOCOM 2007, Anchorage, AK, May 2007.
6. J. Sundararajan, M. Médard, R. Koetter, E. Erez, "A systematic approach to network coding problems using conflict graphs," invited paper, ITA workshop, UCSD, February 2006.
7. C. Caramanis, M. Rosenblum, M.X. Goemans,V. Tarokh, "Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in Banyan networks," CISS 2004, Princeton, NJ, 2004.
8. Y. Wu, P. A. Chou, Q. Zhang, K. Jain, W. Zhu, and S.-Y. Kung, "Network planning in wireless ad hoc networks: a cross-layer approach," IEEE Journal on Selected Areas in Communications, special issue on wireless ad hoc networks, vol. 23, no. 1, pp. 136-150, Jan. 2005.
9. S. Sengupta, S. Rayanchu, S. Banerjee "An analysis of wireless network coding for unicast sessions: The case for coding-aware routing," in IEEE Infocom 2007, Anchorage, AK, April 2007.
10. M. Grötschel, L. Lovász, A. Schrijver, Geometric algorithms and combinatorial optimization, Springer, Berlin-Heidelberg, 1988.
11. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2004.
12. M. Kim, J. Sundararajan, M. Médard, "Network coding for speedup in switches," ISIT 2007, Nice, France, June 2007.
13. N. McKeown, "iSLIP: A scheduling algorithm for input-queued switches," IEEE Transactions on Networking, Vol 7, No.2, April 1999.
14. C. H. Papadimitriou, and K. Steiglitz, "Combinatorial Optimization: Algorithms and Complexity," Prentice Hall, Englewood Cliffs, NJ, 1982.
15. K. Jung, and D. Shah, "Low delay scheduling in wireless networks," IEEE International Symposium on Information Theory, June 2007, Nice, France.