On the utility of network coding in dynamic environments
- 11 October 2006
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Many wireless applications, such as ad-hoc net- works and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient de- centralized operation of multi-source multicast networks. We show that this approach provides substantial benefits over tra- ditional routing methods in dynamically varying environments. We present a set of empirical trials measuring the perfor- mance of network coding versus an approximate online Steiner tree routing approach when connections vary dynamically. The results show that network coding achieves superior performance in a significant fraction of our randomly generated network ex- amples. Such dynamic settings represent a substantially broader class of networking problems than previously recognized for which network coding shows promise of significant practical ben- efits compared to routing.Keywords
This publication has 11 references indexed in Scilit:
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- Multicast With Network Coding in Application-Layer Overlay NetworksIEEE Journal on Selected Areas in Communications, 2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Online multicast routing with bandwidth guarantees: A new approach using multicast network flowIEEE/ACM Transactions on Networking, 2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- The benefits of coding over routing in a randomized settingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Performance evaluation of multipoint routing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994