Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JSAC
2006

favoriteEmaildiscussreport

108views more JSAC 2006»

Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach

13 years 4 months ago

Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach

Download www.princeton.edu

One central issue in practically deploying network coding is the adaptive and economic allocation of network resource. We cast this as an optimization, where the net-utility

Yunnan Wu, Sun-Yuan Kung

Real-time Traffic

Attainable Multicast Throughput | JSAC 2006 | Lagrangian Relaxation Method | Proximal Method |

claim paper

Related Content

» The New Shortest Best Path Tree SBPT Algorithm for Dynamic Multicast Trees

» PeertoPeer utility maximization

» CRMA A Cyclebreaking Multicast Routing Algorithm for Supporting QoS over the Internet

» CongestionAware Multicast Routing for Supporting QoS over the Internet

» Optimized Multipath Network Coding in Lossy Wireless Networks

» A Bidding Algorithm for Optimized UtilityBased Resource Allocation in Ad Hoc Networks

» Multicastbased inference of networkinternal delay distributions

» Multirate peertopeer video conferencing A distributed approach using scalable coding

» Efficient MCS selection for MBSFN transmissions over LTE networks

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JSAC
Authors	Yunnan Wu, Sun-Yuan Kung

Comments (0)