Optimal Distributed Multicast Routing using Network Coding

13 years 10 months ago

Download vanets.vuse.vanderbilt.edu

—Multicast is an important communication paradigm, also a problem well known for its difﬁculty (NP-completeness) to achieve certain optimization goals, such as minimum network delay. Recent advances in network coding has shed a new light onto this problem. In network coding, forwarding nodes can perform arbitrary operations on data received, other than forwarding or replicating, to enhance throughput of a multicast session. In this paper, we show that with the aid of network coding, the once intractable optimal multicast routing problem becomes tractable. In this problem, given a set of multicast sessions and their trafﬁc demands, one tries to route the multicast trafﬁc regarding various objectives, such as to minimize overall delay, or to maximize the battery life of each node. We further show that his problem can be solved in a distributed fashion: each node akes its own routing decisions based on periodic updating information from neighboring nodes. We prove that starting fr...

Yi Cui, Yuan Xue, Klara Nahrstedt

Real-time Traffic