Network coding in bi-directed and peer-to-peer networks

Zongpeng Li, Hong Xu, Baochun LiCambridge 2012 · DOI · OpenAlex

Abstract

Network coding has been shown to help achieve optimal throughput in directed networks with known link capacities. However, as real-world networks in the Internet are bi-directed in nature, it is important to investigate theoretical and practical advantages of network coding in more realistic bi-directed and peer-to-peer (P2P) network settings. In this chapter, we begin with a discussion of the fundamental limitations of network coding in improving routing throughput and cost in the classic undirected network model. A finite bound of 2 is proved for a single communication session. We then extend the discussions to bi-directed Internet-like networks and to the case of multiple communication sessions. Finally, we investigate advantages of network coding in a practical peer-to-peer network setting, and present both theoretical and experimental results on the use of network coding in P2P content distribution and media streaming.
BibTeX
@inproceedings{li2012network,
  author = {Zongpeng Li and Hong Xu and Baochun Li},
  title = {{Network coding in bi-directed and peer-to-peer networks}},
  booktitle = {Cambridge},
  year = {2012},
  doi = {10.1017/cbo9780511920950.018},
}

Loading related content...

Figure