Abstract
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, constraints on bandwidth, and locality of decisions. We analyze the system theoretically and prove near optimal bounds on the parameters defining robustness and scalability. As a result we show that the effects of failures are contained locally, allowing the network to grow exponentially with server load. We also argue that adversarial failures are no more harmful than random failures.
Similar content being viewed by others
References
Ahlswede R., Cai N., Li S.-Y.R. Yeung R.W. (2000): Network information flow. IEEE Trans. Inf. Theory IT-46, 1204–1216
Albanese A., Blömer J., Edmonds J., Luby M., Sudan M. (1996): Priority encoding transmission. IEEE Trans. Inf. Theory 42, 1737–1744
Byers, J.W., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. In: Proc. SIGCOMM, Pittsburg. ACM, (2002)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: Splitstream: high-bandwidth content distribution in a cooperative environment. In: Proceedings of the International Workshop on Peer-to-Peer Systems (2003)
Charles D., Jain K., Lauter K. (2006): Signature for network coding. Princeton University, Princeton
Chou, P., Wu, Y., Jain, K.: Practical network coding. In: Proceedings of Allerton Conf. Communications, Control, and Computing, Monticello (2003)
Chu, Y., Rao, S.G., Zhang, H.: A case for end system multicast. In: Joint Int’l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS) (2000)
Cohen, B.: Incentives build robustness in BitTorrent. http://bitconjurer.org/BitTorrent/bittorrentecon.pdf (2003)
Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (eds.) Combinatorial Algorithms. New York Academic, pp. 91–96 (1973)
Ho, T., Koetter, R., Médard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proceedings of the Int’l Symp. Information Theory, Yokohama, IEEE, (2003)
Koetter R., Médard M. (2003): An algebraic approach to network coding. IEEE ACM Trans Netw 11, 782–795
Li S.-Y.R., Yeung R.W., Cai N. (2003): Linear network coding. IEEE Trans. Inf. Theory IT-49, 371–381
Padmanabhan, V.N., Wang, H.J., Chou, P.A.: Resilient peer-to-peer streaming. In Proceedings of the Int’l Conf. Network Protocols, Atlanta (2003)
Padmanabhan, V.N., Wang, H.J., Chou, P.A.: Supporting heterogeneity and congestion control in peer-to-peer multicast streaming. In: Proceedings of the Int’l Workshop on Peer-to-Peer Systems, San Diego (2004)
Rejaie, R., Stafford, S.: A framework for architecting peer-to-peer receiver-driven overlays. In Proceedings of the Int’l Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), Kinsale (2004)
Rodriguez, P., Gkantsidis, C.: Revolutionising content distribution. In: Proceedings of the Conf. Computer Communications (INFOCOM), Miami. IEEE, (2005) (Submitted)
Sander, P., Egner, S., Tolhuizen, L.: Polynomial time algorithms for network information flow. In: Symposium on Parallel Algorithms and Architectures (SPAA), pp. 286–294. San Diego ACM (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proc. ACM Symp. Principles of Distributed Computation (PODC), Las Vegas, July 2005.
Rights and permissions
About this article
Cite this article
Jain, K., Lovász, L. & Chou, P.A. Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. Distrib. Comput. 19, 301–311 (2007). https://doi.org/10.1007/s00446-006-0014-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-006-0014-9