{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:31:58Z","timestamp":1783701118626,"version":"3.55.0"},"reference-count":93,"publisher":"Emerald","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,1,8]]},"abstract":"<jats:p>Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial deals with wireless and content distribution networks, considered to be the most likely applications of network coding, and it also reviews emerging applications of network coding such as network monitoring and management. Multiple unicasts, security, networks with unreliable links, and quantum networks are also addressed. The preceding companion deals with theoretical foundations of network coding.<\/jats:p>","DOI":"10.1561\/1300000013","type":"journal-article","created":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T16:19:46Z","timestamp":1201277986000},"page":"135-269","source":"Crossref","is-referenced-by-count":123,"title":["Network Coding Applications"],"prefix":"10.1108","volume":"2","author":[{"given":"Christina","family":"Fragouli","sequence":"first","affiliation":[{"name":"\u00b4 Ecole Polytechnique F\u00b4ed\u00b4erale de Lausanne (EPFL) ,","place":["Switzerland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[{"name":"Bell Laboratories, Alcatel-Lucent ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2008,1,8]]},"reference":[{"key":"2026032901020292300_ref001","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/1109557.1109585","article-title":"On the capacity of information networks","author":"Adler","year":"2006","journal-title":"SODA"},{"issue":"4","key":"2026032901020292300_ref002","doi-asserted-by":"crossref","DOI":"10.1145\/1041680.1041681","article-title":"A survey of peer-to-peer content distribution technologies","volume":"36","author":"Androutsellis-Theotokis","year":"2004","journal-title":"ACM Computing Surveys"},{"key":"2026032901020292300_ref003","article-title":"A deterministic model for wireless relay networks and its capacity","author":"Avestimehr","year":"2007","journal-title":"Information Theory Workshop"},{"key":"2026032901020292300_ref004","article-title":"Wireless network information flow","author":"Avestimehr","year":"2007","journal-title":"Allerton"},{"key":"2026032901020292300_ref005","article-title":"A comparison of peer-to-peer architectures","author":"Backx","year":"2002","journal-title":"Eurescom Summit 2002"},{"key":"2026032901020292300_ref006","article-title":"Weakly Secure Network Coding","author":"Bhattad","year":"2005","journal-title":"Proceedings of First Workshop on Network Coding, Theory, and Applications (Net-Cod\u201905)"},{"key":"2026032901020292300_ref007","doi-asserted-by":"crossref","first-page":"1844","DOI":"10.1103\/PhysRevA.54.1844","article-title":"Quantum copying: Beyond the no-cloning theorem","volume":"54","author":"Buzek","year":"1996","journal-title":"Physics Review A"},{"key":"2026032901020292300_ref008","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4310\/CIS.2006.v6.n1.a3","article-title":"Network error correction, II: Lower bounds","volume":"6","author":"Cai","year":"2006","journal-title":"Communication and Information Systems"},{"key":"2026032901020292300_ref009","article-title":"Freenet: A distributed anonymous information storage and retrieval system","author":"Clarke","year":"2000","journal-title":"ICSI Workshop on Design Issues in Anonymity and Unobservability"},{"key":"2026032901020292300_ref010","unstructured":"B.\n              Cohen\n            \n          , \u201chttp:\/\/www.bittorrent.com,\u201d."},{"key":"2026032901020292300_ref011","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1ar","year":"1986"},{"key":"2026032901020292300_ref012","first-page":"2486","article-title":"Algebraic gossip: A network coding approach to optimal multiple rumor mongering","volume":"14","author":"Deb","year":"2006","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032901020292300_ref013","article-title":"Network coding for distributed storage systems","author":"Dimakis","year":"2007","journal-title":"Infocom"},{"key":"2026032901020292300_ref014","article-title":"Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes","author":"Dimakis","year":"2005","journal-title":"Symposium on Information Processing in Sensor Networks (IPSN \u201905)"},{"key":"2026032901020292300_ref015","doi-asserted-by":"crossref","DOI":"10.1109\/ICASSP.2006.1661484","article-title":"Distributed fountain codes for networked storage","author":"Dimakis","year":"2006","journal-title":"Acoustics, Speech and Signal Processing, ICASSP 2006"},{"key":"2026032901020292300_ref016","article-title":"Decentralized erasure codes for distributed networked storage","author":"Dimakis","year":"2006","journal-title":"IEEE\/ACM Transactions on Net-working (TON)"},{"key":"2026032901020292300_ref017","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.1109\/TIT.2006.874405","article-title":"Unachievability of network coding capacity","volume":"52","author":"Dougherty","year":"2006","journal-title":"IEEE Transactions on Information Theory and IEEE\/ACM Transactions on Networking"},{"key":"2026032901020292300_ref018","doi-asserted-by":"crossref","first-page":"5067","DOI":"10.1109\/TIT.2006.883634","article-title":"Nonreversibility and equivalent constructions of multiple-unicast networks","volume":"52","author":"Dougherty","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020292300_ref019","article-title":"On delay performance gains from network coding","author":"Erylmaz","year":"2006","journal-title":"CISS"},{"key":"2026032901020292300_ref020","article-title":"On the Capacity of Secure Network Coding","author":"Feldman","year":"2004"},{"key":"2026032901020292300_ref021","volume":"1","author":"Feller","year":"1968","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"2026032901020292300_ref022","article-title":"A network coding approach to network monitoring","author":"Fragouli","year":"2005","journal-title":"Allerton"},{"key":"2026032901020292300_ref023","article-title":"Active topology inference using network coding","author":"Fragouli","year":"2006","journal-title":"Allerton"},{"issue":"1","key":"2026032901020292300_ref024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1300000003","article-title":"Network coding fundamentals","volume":"2","author":"Fragouli","year":"2007","journal-title":"Foundation and Trends in Networking"},{"key":"2026032901020292300_ref025","article-title":"A network coding approach to energy efficient broadcasting: From theory to practice","author":"Fragouli","year":"2006","journal-title":"IEEE Infocom, Barcelona, Spain"},{"key":"2026032901020292300_ref026","article-title":"On the benefits of network coding for wireless applications","author":"Fragouli","year":"2006","journal-title":"Network Coding Workshop, Boston"},{"key":"2026032901020292300_ref027","article-title":"Network coding for large scale content distribution","author":"Gkantsidis","year":"2005","journal-title":"Proceedings of Infocom, IEEE"},{"key":"2026032901020292300_ref028","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1177080.1177104","volume-title":"IMC \u201906: Proceedings of the 6th ACM SIGCOMM on Internet Measurement","author":"Gkantsidis","year":"2006"},{"key":"2026032901020292300_ref029","unstructured":"Gnutella\n            \n          , \u201chttp:\/\/gnutella.wego.com,\u201d 2000."},{"key":"2026032901020292300_ref030","first-page":"401","article-title":"On the capacity of wireless erasure networks","author":"Gowaikar","year":"2004","journal-title":"in Proceedings of the IEEE International Symposium on Information Theory"},{"key":"2026032901020292300_ref031","volume-title":"Quantum Computing. Mcgraw Hill","author":"Gruska","year":"2000"},{"key":"2026032901020292300_ref032","unstructured":"M.\n              Hayashi\n            , K.Iwama, H.Nishimura, R.Raymond, and S.Yamashita, \u201cQuantum Network Coding,\u201d Available: http:\/\/arxiv.org\/abs\/quant-ph\/0601088 [online], 2006."},{"key":"2026032901020292300_ref033","article-title":"On constructive network coding for multiple unicasts","author":"Ho","year":"2006"},{"key":"2026032901020292300_ref034","article-title":"Network monitoring in multicast networks using network coding","author":"Ho","year":"2005","journal-title":"International Symposium on Information Theory (ISIT)"},{"key":"2026032901020292300_ref035","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2004.1365180","article-title":"Byzantine Modification Detection in Multicast Networks using Randomized Network Coding","author":"Ho","year":"2004","journal-title":"Proceedings of 2004 IEEE International Symposium on Information Theory (ISIT\u201904)"},{"key":"2026032901020292300_ref036","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1109\/TIT.2005.844062","article-title":"An information-theoretic view of network management","volume":"51","author":"Ho","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020292300_ref037","volume-title":"Content Networking: Architecture, Protocols, and Practice","author":"Hofmann","year":"2004"},{"key":"2026032901020292300_ref038","unstructured":"K.\n              Iwama\n            , H.Nishimura, R.Raymond, and S.Yamashita, \u201cQuantum network coding for general graphs,\u201d Available: http:\/\/arxiv.org\/abs\/quant-ph\/0611039 [online], 2006."},{"key":"2026032901020292300_ref039","article-title":"On subspace properties for randomized network coding","author":"Jafarisiavoshani","year":"2007","journal-title":"Information Theory Workshop (ITW)"},{"key":"2026032901020292300_ref040","article-title":"Bottleneck discovery and overlay management in network coded peer-to-peer systems","author":"Jafarisiavoshani","year":"2007","journal-title":"ACM SigComm INM\u201907"},{"key":"2026032901020292300_ref041","first-page":"616","article-title":"Resilient network coding in the presence of Byzantine adversaries","author":"Jaggi","year":"2007","journal-title":"INFOCOM"},{"key":"2026032901020292300_ref042","article-title":"Network coding for routability improvement in VLSI","author":"Jayakumar","year":"2006"},{"key":"2026032901020292300_ref043","volume-title":"Sigcomm06","author":"Kamra","year":"2006"},{"key":"2026032901020292300_ref044","doi-asserted-by":"crossref","DOI":"10.1145\/1151659.1159942","article-title":"XORs in the air: Practical wireless network coding","author":"Katti","year":"2006","journal-title":"ACM SIGCOMM"},{"key":"2026032901020292300_ref045","article-title":"Network coding for speedup in switches","author":"Kim","year":"2007","journal-title":"ISIT"},{"key":"2026032901020292300_ref046","article-title":"Coding for errors and rrasures in random network coding","author":"Koetter","year":"2007","journal-title":"ISIT"},{"key":"2026032901020292300_ref047","doi-asserted-by":"crossref","DOI":"10.1007\/s10922-005-9019-0","article-title":"Edge-cut bounds on network coding rates","volume":"14","author":"Kramer","year":"2006","journal-title":"Journal of Network and Systems Management"},{"key":"2026032901020292300_ref048","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy","author":"Krohn","year":"2004"},{"key":"2026032901020292300_ref049","first-page":"190","author":"Kubiatowicz","year":"2000"},{"key":"2026032901020292300_ref050","first-page":"499","article-title":"Network coding: Does the model need tuning?","author":"Lehman","year":"2005","journal-title":"SODA"},{"key":"2026032901020292300_ref051","unstructured":"D.\n              Leung\n            , J.Oppenheim, and A.Winter, \u201cQuantum network communication \u2014 the butterfly and beyond,\u201d Available: http:\/\/arxiv.org\/abs\/quant-ph\/0608223 [online], 2006."},{"key":"2026032901020292300_ref052","first-page":"6","article-title":"Data persistence in large-scale sensor networks with decentralized fountain codes","author":"Lin","year":"2007","journal-title":"Proceedings of the 26th IEEE INFOCOM 2007, Anchorage, Alaska"},{"key":"2026032901020292300_ref053","first-page":"271","article-title":"LT Codes","author":"Luby","year":"2002","journal-title":"IEEE Symposium on the Foundations of Computer Science (STOC)"},{"key":"2026032901020292300_ref054","first-page":"150","article-title":"Practical loss-resilient codes","author":"Luby","year":"1997","journal-title":"ACM Symposium on Theory of Computing"},{"key":"2026032901020292300_ref055","article-title":"On coding for reliable communication over packet networks","author":"Lun","year":"2004"},{"key":"2026032901020292300_ref056","article-title":"Efficient operation of coded packet networks","author":"Lun","year":"2006","journal-title":"PhD thesis, Massachusetts Institute of Technology"},{"key":"2026032901020292300_ref057","article-title":"An analysis of finite-memory random linear coding on packet streams","author":"Lun","year":"2006","journal-title":"WiOpt \u201906"},{"key":"2026032901020292300_ref058","article-title":"Achieving minimum-cost multicast: A decentralized approach based on network coding","author":"Lun","year":"2005","journal-title":"Proceedings of IEEE Infocom"},{"key":"2026032901020292300_ref059","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45748-8_5","article-title":"Kademlia: A Peer-to-Peer Information System Based on the XOR Metric","author":"Maymounkov","year":"2002","journal-title":"International Workshop on Peer-to-Peer Systems (IPTPS\u201902)"},{"key":"2026032901020292300_ref060","first-page":"1748","article-title":"Information dissemination via network coding","author":"Mosk-Aoyamam","year":"2006","journal-title":"ISIT"},{"key":"2026032901020292300_ref061","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"2026032901020292300_ref062","unstructured":"Napster\n          , \u201chttp:\/\/www.napster.com,\u201d 1999."},{"key":"2026032901020292300_ref063","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2000"},{"key":"2026032901020292300_ref064","first-page":"1853","article-title":"Coding schemes for line networks","author":"Pakzad","year":"2005","journal-title":"ISIT"},{"key":"2026032901020292300_ref065","first-page":"2649","article-title":"Overcoming untuned radios in wireless networks with network coding","volume":"14","author":"Petrovi\u0107","year":"2006","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032901020292300_ref066","doi-asserted-by":"crossref","first-page":"2878","DOI":"10.1109\/TIT.2005.851725","article-title":"On the capacity of network coding for random networks","volume":"51","author":"Ramamoorthy","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020292300_ref067","article-title":"The multicast capacity of acyclic, deterministic, relay networks with no interference","author":"Ratnakar","year":"2005","journal-title":"Network Coding Workshop"},{"key":"2026032901020292300_ref068","first-page":"1716","article-title":"On the separation of channel and network coding in Aref networks","author":"Ratnakar","year":"2005","journal-title":"ISIT"},{"key":"2026032901020292300_ref069","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM","author":"Ratnasamy","year":"2001"},{"key":"2026032901020292300_ref070","doi-asserted-by":"crossref","article-title":"Reversible and irreversible information networks","author":"Riis","DOI":"10.1109\/TIT.2007.907345"},{"key":"2026032901020292300_ref071","article-title":"Linear versus non-linear Boolean functions in network flow","author":"Riis","year":"2004","journal-title":"CISS"},{"key":"2026032901020292300_ref072","volume-title":"Proceedings of 2007 International Symposium on Information Theory, (ISIT\u201907)","author":"Rouayheb","year":"2007"},{"key":"2026032901020292300_ref073","volume-title":"Proceedings of 2006 Workshop on Information Theory and its Applications, (ITA\u201906)","author":"Rouayheb","year":"2006"},{"key":"2026032901020292300_ref074","first-page":"329","volume-title":"IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware)","author":"Rowstron","year":"2001"},{"key":"2026032901020292300_ref075","article-title":"Joint scheduling and wireless network coding","author":"Sagduyu","year":"2005","journal-title":"Network Coding Workshop"},{"key":"2026032901020292300_ref076","volume-title":"Combinatorial Optimization","author":"Schrijver","year":"2003"},{"key":"2026032901020292300_ref077","doi-asserted-by":"crossref","DOI":"10.1109\/CISS.2006.286589","article-title":"On Multicast in Quantum Networks","author":"Shi","year":"2006"},{"key":"2026032901020292300_ref078","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","article-title":"Raptor codes","volume":"52","author":"Shokrollahi","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020292300_ref079","article-title":"Using rank-metric codes for error correction in random network coding","author":"Silva","year":"2007","journal-title":"ISIT"},{"issue":"3","key":"2026032901020292300_ref080","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/1035570.1035573","article-title":"Replication for web hosting systems","volume":"36","author":"Sivasubramanian","year":"2004","journal-title":"ACM Computing Surveys"},{"key":"2026032901020292300_ref081","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1109\/TIT.2006.872983","article-title":"A separation theorem for single source network coding","volume":"52","author":"Song","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020292300_ref082","first-page":"149","author":"Stoica","year":"2001"},{"key":"2026032901020292300_ref083","doi-asserted-by":"crossref","DOI":"10.1007\/11422778_106","article-title":"Extending the Birkhoff-von Neumann switching strategy to multicast switches","author":"Sundararajan","year":"2005"},{"key":"2026032901020292300_ref084","article-title":"Network coding in a multicast switch","author":"Sundararajan","year":"2007","journal-title":"Infocom"},{"key":"2026032901020292300_ref085","first-page":"1081","article-title":"On the throughput improvement due to limited complexity processing at relay nodes","author":"Tuninetti","year":"2005","journal-title":"ISIT"},{"key":"2026032901020292300_ref086","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/TCOMM.2005.857148","article-title":"Minimum-energy multicast in mobile ad hoc networks using network coding","volume":"53","author":"Wu","year":"2005","journal-title":"IEEE Transactions on Communications"},{"key":"2026032901020292300_ref087","article-title":"Construction of linear network codes that achieve a refined Singleton bound","author":"Yang","year":"2007","journal-title":"ISIT"},{"key":"2026032901020292300_ref088","article-title":"Characterizations of network error correction\/detection and erasure correction","author":"Yang","year":"2007","journal-title":"Network Coding Workshop"},{"key":"2026032901020292300_ref089","article-title":"Secure Network Coding","author":"Yeung","year":"2004","journal-title":"Proceedings of 2002 IEEE International Symposium on Information Theory (ISIT\u201902)"},{"key":"2026032901020292300_ref090","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","article-title":"Network error correction, I: Basic concepts and upper bounds","volume":"6","author":"Yeung","year":"2006","journal-title":"Communication and Inforamtion Systems"},{"key":"2026032901020292300_ref091","first-page":"24","article-title":"Physical layer network coding","author":"Zhang","year":"2006","journal-title":"ACM Mobi-Com 2006"},{"key":"2026032901020292300_ref092","article-title":"Network error correction coding in packetized networks","author":"Zhang","year":"2006","journal-title":"ITW"},{"issue":"1","key":"2026032901020292300_ref093","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","article-title":"Tapestry: A resilient global-scale overlay for service deployment","volume":"22","author":"Zhao","year":"2004","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Foundations and Trends\u00ae in Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/2\/2\/135\/10975675\/1300000013en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/2\/2\/135\/10975675\/1300000013en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:13:44Z","timestamp":1777486424000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftnet\/article\/2\/2\/135\/1324783\/Network-Coding-Applications"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,8]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,1,8]]}},"URL":"https:\/\/doi.org\/10.1561\/1300000013","relation":{},"ISSN":["1554-057X","1554-0588"],"issn-type":[{"value":"1554-057X","type":"print"},{"value":"1554-0588","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,8]]}}}