Abstract
Seeking to understand the potential of network coding in future internet endeavors, we consider the vital role of network topology with respect to the potential benefits of Random Linear Network Coding (RLNC). First, we propose a set of metrics that capture the essential trade-offs between throughput, confidentiality and decoding delay. Using large network simulation, we are able to evaluate the behavior of RLNC for various topological classes based on random graphs. Our results show significant differences between local dissemination of information (typical of wireless networks) and long range connectivity (typical of peer-to-peer environments). We believe that our results can help pave the way for the creation of better overlay topologies for RLNC protocols in future internet applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ho, T., Médard, M., Koetter, R., Karger, D., Effros, M., Shi, J., & Leong, B. (2006). A random linear network coding approach to multicast. IEEE Transactions on Information Theory, 52(10), 4413–4430.
Koetter, R., & Médard, M. (2003). An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5), 782–795.
Lun, D., Médard, M., Koetter, R., & Effros, M. (2005). Further results on coding for reliable communication over packet networks. In Proc. of the IEEE ISIT 2005, Adelaide, Australia, September 2005 (pp. 1848–1852).
Yunnan, P. C., Chou, P. A., Wu, Y., & Jain, K. (2003). Practical network coding. In Proc. of the 41st annual Allerton conference on communication, control, and computing, Monticello, IL, USA, October 2003.
Gkantsidis, C., & Rodriguez, P. (2005). Network coding for large scale content distribution. In Proc. of IEEE infocom’05, Miami, USA, March 2005.
Dimakis, A. G., Godfrey, P. B., Wainwright, M. J., & Ramchandran, K. (2007). Network coding for distributed storage systems. In Proceedings of the IEEE INFOCOM, Anchorage, Alaska, USA, May 2007.
Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., & Crowcroft, J. (2006). XORs in the air: practical wireless network coding. In SIGCOMM 2006: proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications, Pisa, Italy, September 2006 (pp. 243–254).
Widmer, J., & Le Boudec, J.-Y. (2005). Network coding for efficient communication in extreme networks, August 2005 (pp. 284–291).
Doval, D., O’Mahony, D., Coll, T., & Dublin, I. (2003). Overlay networks: a scalable alternative for P2P. IEEE Internet Computing, 7(4), 79–82.
Andersen, D. G., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001). Resilient overlay networks. In 18th ACM SOSP, Banff, Canada, October 2001.
Jannotti, J., Gifford, D., Johnson, K., Kaashoek, M., & O’Toole, J. Jr. (2000). Overcast: reliable multicasting with an overlay network. In Proc. of the 4th conference on symposium on operating system design & implementation, USENIX association, Berkeley, CA, USA (Vol. 4, pp. 14–14).
Lima, L., Médard, M., & ao Barros, J. (2007). Random linear network coding: a free cypher. In Proc. of the IEEE international symposium on information theory, Nice, France, June 2007.
Katti, S., Cohen, J., & Katabi, D. (2007). Information slicing: anonymity using unreliable overlays. In Proc. of the 4th USENIX symposium on network systems design and implementation (NSDI), Cambridge, MA, USA, April 2007.
Crisostomo, S., Barros, J., & Bettstetter, C. (2008). Flooding the network: multipoint relays versus network coding. In 4th IEEE international conference on circuits and systems for communications (ICCSC 2008), Shanghai, China, May 2008 (pp. 119–124)
Costa, R., Munaretto, D., Widmer, J., & Barros, J. (2008). Informed network coding for minimum decoding delay. In Proc. IEEE international conf. on mobile ad-hoc and sensor systems—MASS, Atlanta, United States, September 2008 (Vol. 1, pp. 1–12).
Eugster, P., Guerraoui, R., Kermarrec, A., & Massoulie, L. (2004). Epidemic information dissemination in distributed systems. IEEE Computer, 37(5), 60–67.
Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45, 167.
Jacquet, P., Laouiti, A., Minet, P., & Viennot, L. (2001). Performance analysis of OLSR multipoint relay flooding in two ad hoc wireless network models. Rapport de recherche—Institut National de Recherche en Informatique et en Automatique.
Gupta, P., & Kumar, P. (2000). The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2), 388–404.
Costa, R. A., & Barros, J. (2007). Dual radio networks: capacity and connectivity. In Workshop on spatial stochastic models in wireless networks, Limassol, Cyprus, April 2007.
Costa, R. A. (2007). Capacity bounds for small-world and dual radio networks. Master’s thesis, Faculdade de Ciências da Universidade do Porto, Portugal, October 2007.
Newman, M. (2002). Random graphs as models of networks, Arxiv preprint cond-mat/0202208.
Jovanović, M., Annexstein, F., & Berman, K. (2001). Modeling peer-to-peer network topologies through small-world models and power laws. In Proc. of the IX telecommunications forum, TELFOR.
Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393(6684), 440–442.
Ferreira, D., Lima, L., & Barros, J. (2009). NECO: NEtwork COding simulator. In Proc. of the SIMUTOOLS’09, Rome, Italy, March 2009.
Goldsman, D., & Tokol, G. (2000). Output analysis: output analysis procedures for computer simulations. In Proc. of the 32nd conference on Winter simulation (WSC’00) (pp. 39–45).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lima, L., Ferreira, D. & Barros, J. Topology matters in network coding. Telecommun Syst 51, 247–257 (2012). https://doi.org/10.1007/s11235-011-9433-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-011-9433-4