Network coding in a multicast switch

IEEE Transactions on Information Theory

Volumn 57, Issue 1, 2011, Pages 436-460

  Kim, Minji ^a   Sundararajan, Jay Kumar ^b   Médard, Muriel ^a   Eryilmaz, Atilla ^c   Kötter, Ralf ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b QUALCOMM INC   (United States)

^c The Ohio State University   (United States)

^d TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Imperfection ratio; multicast switch; network coding; rate region; scheduling; speedup

Indexed keywords

IMPERFECTION RATIO; MULTICAST SWITCHES; NETWORK CODING; RATE REGION; SPEEDUP;

GRAPH THEORY; INFORMATION THEORY; MULTICASTING; PACKET SWITCHING; RADIO INTERFERENCE; SCHEDULING ALGORITHMS;

SWITCHING CIRCUITS;

EID: 78650924665     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2090213     Document Type: Article

References (35)

1. Vinci-Computing Volumes of Convex Polytopes [Online]. Available: http://www.lix.polytechnique.fr/Labo/Andreas.Enge/Vinci.html
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, 2000.
3. M. Andrews, S. Khanna, and K. Kumaran, "Integrated scheduling of unicast and multicast traffic in an input-queued switch," in Proc. IEEE INFOCOM, Mar. 1999, pp. 1144-1151.
4. G. Birkhoff, "Tres observaciones sobre el algebra lineal," Univ. Nac. Tucumàn Revista A, vol. 5, pp. 147-147.
5. C. Caramanis, M. Rosenblum, M. X. Goemans, and V. Tarokh, "Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in banyan networks," in Proc. Conf. Inf. Sci. Syst., 2004, pp. 160-166.
6. C.-S. Chang, D.-S. Lee, and Y.-S. Jou, "Load balanced Birkhoff-Von Neumann switches," in Proc. IEEEWorkshop on High Perform. Switch. Routing, 2001, pp. 276-280.
7. V. Chvátal, "On certain polytopes associated with graphs," J. Combinator. Theory, vol. 18, pp. 138-154, 1975.
8. A. Eryilmaz and D. Lun, "Control for inter-session network coding," Proc. NetCod, Jan. 2007.
9. L. Georgiadis, M. J. Neely, and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Found. and Trends in Netw., vol. 1, no. 1, pp. 1-144, 2006. (Pubitemid 44147280)
10. S. Gerke, "Weighted colouring and channel assignment," Ph.D., Univ. Oxford, Oxford, U.K., 2000.
11. S. Gerke and C. McDiarmid, "Graph imperfection I," J. Combinator. Theory, Series B, vol. 83, pp. 58-78, 2001.
12. S. Gerke and C. McDiarmid, "Graph imperfection II," J. Combinator. Theory, Series B, vol. 83, pp. 79-101, 2001.
13. J. Hayes, R. Breault, and M. Mehmet-Ali, "Performance analysis of a multicast switch," IEEE Trans. Commun. , vol. 39, no. 4, pp. 581-587, 1991.
14. T. Ho, D. R. Karger,M.Médard, and R. Kötter, "Network coding from a network flowperspective," in Proc. IEEE Int. Symp. Inf. Theory, 2003.
15. T. Ho, M. Médard, R. Kötter, M. Effros, J. Shi, and D. R. Karger, "A random linear coding approach to mutlicast," IEEE Trans. Inf. Theory, vol. 52, pp. 4413-4430, 2006.
16. T. Ho and H. Viswanathan, "Dynamic algorithms for multicast with intra-session network coding," in Proc. 43rd Allerton Ann. Conf. Commun., Contr. Comput., 2005.
17. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proc. IEEE Int. Symp. Inf. Theory, 2003.
18. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
19. M. Kim, J. K. Sundararajan, and M. Médard, "Network coding for speedup in switches," in Proc. IEEE ISIT, 2007.
20. C. E. Koksal, "On the speedup required to achieve 100% throughput for multicast over crossbar switches," in Proc. IEEE IWQoS, 2008.
21. R. Kötter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, pp. 782-795, 2003.
22. M. Kvasnica, P. Grieder, and M. Baotic, Multi-Parametric Toolbox 2004 [Online]. Available: http://control.ee.ethz.ch/mpt/
23. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, pp. 371-381, 2003.
24. S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
25. 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, pp. 465-477, Jun. 2003.
26. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE INFOCOM, 1996, pp. 296-302.
27. Y. Oie, M. Murata, K. Kubota, and H. Miyahara, "Effect of speedup in nonblocking packet switch," in Proc. IEEE Int. Conf. Commun., 1989, vol. 1, pp. 410-414.
28. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. New York: Springer-Verlag, 2003.
29. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. New York: Springer-Verlag, 2003.
30. J. K. Sundararajan, S. Deb, and M. Médard, "Extending the birkhoff-von neumann switching strategy for multicast-On the use of optical splitting in switches," IEEE J. Sel. Areas Commun.-Opt. Commun. Netw. Ser., vol. 25, no. 6, pp. 36-50, Aug. 2007.
31. J. K. Sundararajan, M. Médard, R. Kötter, and E. Erez, "A systematic approach to network coding problems using conflict graphs," in Proc. UCSD Workshop on Inf. Theory and its Appl., San Diego, CA, Feb. 2006.
32. J. K. Sundararajan, D. Shah, and M. Médard, "ARQ for network coding," in Proc. IEEE ISIT, 2008.
33. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, 1998, vol. 2, pp. 533-539.
34. 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, pp. 1936-1948, 1992.
35. J. von Neumann, "A certain zero-sum two-person game equivalent to the optimal assignment problem," Contributions to the Theory of Games, vol. 2, pp. 5-12, 1953.