On benefits of network coding in bidirected networks and hyper-networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 325-333

  Yin, Xunrui ^a   Wang, Xin ^a   Zhao, Jin ^a   Xue, Xiangyang ^a   Li, Zongpeng ^b  

^a FUDAN UNIVERSITY   (China)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COST ADVANTAGES; DATA NETWORK; DIRECTED NETWORK; INFORMATION FLOWS; MULTICAST APPLICATION; MULTICASTS; NETWORK MODELS; PARAMETER SETTING; PARAMETERIZED; POTENTIAL BENEFITS; REALISTIC MODELING; TRANSMISSION COSTS; UNDIRECTED NETWORK;

COST REDUCTION; DATA COMMUNICATION SYSTEMS; MULTICASTING;

NETWORK CODING;

EID: 84861650764     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195769     Document Type: Conference Paper

References (22)

1. R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
3. Z. Li, B. Li, and L. Lau, "On achieving maximum multicast throughput in undirected networks," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2467 -2485, Jun. 2006.
4. Z. Li and B. Li, "Network coding in undirected networks," in Proceedings of CISS, 2004.
5. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," in Proceedings of ITW, 2004.
6. C. Fragouli and E. Soljanin, "Network coding fundamentals," in Monograph in Series, Foundations and Trends in Networking, 2007.
7. A. M. Townsend, "Network cities and the global structure of the internet," American Behavioral Scientist, vol. 44, no. 10, pp. 1697-1716, Jun. 2001.
8. W. John and S. Tafvelin, "Differences between in- and outbound internet backbone traffic," in TERENA Networking Conference(TNC), 2007.
9. D. S. Lun, N. Ratnakar, M. M edard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE/ACM Transactions on Networking, vol. 14, pp. 2608- 2623, Jun. 2006.
10. Z. Li, B. Li, and L. C. Lau, "A constant bound on throughput improvement of multicast network coding in undirected networks," IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 1016-1026, Mar.2009.
11. Y. Wu, P. Chou, and K. Jain, "A comparison of network coding and tree packing," in Proceedings of International Symposium on Information Theory(ISIT), 2004.
12. S. Maheshwar, Z. Li, and B. Li, "Bounding the coding advantage of combination network coding in undirected networks," IEEE Transactions on Information Theory, 2012, to appear.
13. C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and S. Diot, "Packet-level traffic measurements from the sprint ip backbone," IEEE Network, vol. 17, no. 6, pp. 6-16, Nov.-Dec. 2003.
14. D. M. Chiu, R. Yeung, J. Huang, and B. Fan, "Can network coding help in p2p networks?" in Proceedings of International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks,2006.
15. Z. Shao and S. Li, "To code or not to code: Rate optimality of network coding versus routing in peer-to-peer networks," IEEE Transactions on Communications, vol. 59, no. 4, pp. 948 -954, 2011.
16. J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks," in Proceedings of INFOCOM, 2007.
17. A. Keshavarz-Haddadt and R. Riedi, "Bounds on the benefit of network coding: Throughput and energy saving in wireless networks," in Proceedings of INFOCOM, 2008.
18. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput and alphabet size in network coding." IEEE Transactions on Information Theory, vol. 52, pp. 2410-2424, Jun. 2006.
19. J. Bang-Jensen and G. Z. Gutin, Digraphs: Theory, Algorithms and Applications, 2nd ed. Springer Publishing Company, 2008.
20. J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, ed. R. Rustin. NY, USA: Academic Press, 1973, pp. 91-96.
21. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of network coding and tree-packing (routing) theorems," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2398-2409, Jun. 2006.
22. S.-Y. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.