LION: Layered Overlay Multicast With Network Coding

Recent advances in information theory show that the throughput of a multicast session can be improved using network coding. In overlay networks, the available bandwidth between sender and different receivers are different. In this paper, we propose a solution to improve the throughput of an overlay multicast session with heterogeneous receivers by organizing the receivers into layered data distribution meshes and sending substreams to each mesh using layered coding. Our solutions utilize alternative paths and network coding in each mesh. We first formulate the problem into a mathematical programming, whose optimal solution requires global information. We therefore present a distributed heuristic algorithm. The heuristic progressively organizes the receivers into layered meshes. Each receiver can subscribe to a proper number of meshes to maximize its throughput by fully utilizing its available bandwidth. The benefits of organizing the topology into layered mesh and using network coding are demonstrated through extensive simulations. Numerical results indicate that the average throughput of a multicast session is significantly improved (up to 50% to 60%) with only slightly higher delay and network resource consumption

[1]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Helen J. Wang,et al.  Distributing streaming media content using cooperative networking , 2002, NOSSDAV '02.

[3]  Ying Zhu,et al.  oEvolve: toward evolutionary overlay topologies for high-bandwidth data dissemination , 2004, IEEE Journal on Selected Areas in Communications.

[4]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[5]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[7]  Steven McCanne,et al.  Low-Complexity Video Coding for Receiver-Driven Layered Multicast , 1997, IEEE J. Sel. Areas Commun..

[8]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  P. Chou,et al.  Low complexity algebraic multicast network codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[10]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[12]  Zongpeng Li,et al.  A High-Throughput Overlay Multicast Infrastructure with Network Coding , 2005, IWQoS.

[13]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[14]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[15]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[16]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[17]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[19]  Klara Nahrstedt,et al.  Layered peer-to-peer streaming , 2003, NOSSDAV '03.

[20]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[21]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[22]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[23]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[24]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[25]  K. Jain,et al.  Practical Network Coding , 2003 .

[26]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[27]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[28]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[29]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[30]  Steven McCanne,et al.  Receiver-driven layered multicast , 2001 .

[31]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[32]  Sidharth Jaggi,et al.  Low Complexity Algebraic , 2003 .

[33]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

[34]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.