Online Network Coding for the Dynamic Multicast Problem
Fang Zhao; Medard, M.
Information Theory, 2006 IEEE International Symposium on
Volume , Issue , 9-14 July 2006 Page(s):1753 - 1757
Digital Object Identifier   10.1109/ISIT.2006.261655
Summary:Many of the multimedia applications such as video broadcasting and teleconferencing require the network to support dynamic multicast sessions when the membership of the multicast group changes over time. In this paper, we study this problem in the context of coded networks. While trying to minimize the cost of the multicast, we also want to minimize the disturbances to existing users when the multicast graph changes. To characterize disturbances to users, we define two types of rearrangements, link rearrangements and code rearrangements. We present four algorithms to solve the non-rearrangeable and rearrangeable versions of the dynamic multicast problem. Simulation results show that the alpha-scaled algorithm we proposed can keep the cost of the multicast close to that of the optimal solution when the multicast subgraph evolves, and, at the same time, causes very few rearrangements during the process

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.