Minimum cost mirror sites using network coding: Replication versus coding at the source nodes

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1080-1091

  Huang, Shurui ^a   Ramamoorthy, Aditya ^a   Médard, Muriel ^b  

^a Iowa State University of Science and Technology   (United States)

^b USA   (United States)

Author keywords

Content distribution; information measures; minimum cost; network coding

Indexed keywords

CONTENT DISTRIBUTION; DISTRIBUTED STORAGE; INFORMATION MEASURES; MINIMUM COST; MULTIPLE SOURCE; NETWORK CODING; SINGLE LOCATION; SOURCE NODES;

INFORMATION THEORY; MIRRORS;

COSTS;

EID: 79251491334     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2094890     Document Type: Article

References (33)

1. P. Rodriguez, A. Kirpal, and E. W. Biersack, "Parallel-access for mirror sites in the Internet," in Proc. INFOCOM 19th Ann. Joint Conf. IEEE Comput. Commun. Soc., 2000, vol. 2, pp. 864-873.
2. D. Qiu and R. Srikant, "Modeling and performance analysis of Bit-Torrent-like peer-to-peer networks," in SIGCOMM'04, Proc. Conf. Appl., Technol., Architect. Protocols for Comput. Commun., 2004, pp. 367-378.
3. A. Jiang and J. Bruck, "Network file storage with graceful performance degradation," ACM Trans. Storage, vol. 1, no. 2, pp. 171-189, May 2005.
4. K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," in Proc. INFOCOM 22rd Ann. Joint Conf. IEEE Comput. Commun. Soc., 2003, vol. 3, pp. 2166-2176.
5. Y. Chen, L. Qiu, W. Chen, L. Nguyen, and R. H. Katz, "Efficient and adaptive web replication using content clustering," IEEE J. Sel. Areas Commun., vol. 21, pp. 979-994, Aug. 2003.
6. K. Hosanagar, R. Krishnan, M. Smith, and J. Chuang, "Optimal pricing of content delivery network services," in Proc. 37th Ann. Hawaii Int. Conf. Syst. Sci., Jan. 2004, pp. 10-10.
7. K. L. Johnson, J. F. Carr, M. S. Day, and M. F. Kaashoek, "The measured performance of content distribution networks," Comput. Commun., vol. 24, no. 2, pp. 202-206, Feb. 2000.
8. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web," in Proc. ACM STOC, 1997, pp. 654-663.
9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, 2001, pp. 161-172.
10. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in INFOCOM 24th Ann. Joint Conf. IEEE Comput. Commun. Soc., 2005, vol. 4, pp. 2235-2245.
11. D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE Trans. Inf. Theory, vol. 52, pp. 2608-2623, Jun. 2006.
12. K. Jain, L. Lovász, and P. A. Chou, "Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding," Distrib. Comput., vol. 19, no. 4, pp. 301-311, 2007.
13. J. Zhao, F. Yang, Q. Zhang, Z. Zhang, and F. Zhang, "LION: Layered overlay multicast with network coding," IEEE Trans. Multimedia, vol. 8, pp. 1021-1032, Oct. 2006.
14. Y. Wu, Y. C. Hu, J. Li, and P. A. Chou, "The delay region for P2P file transfer," in Proc. IEEE Intl. Symp. Inf. Theory, 2009, pp. 834-838.
15. T. K. Dikaliotis, A. G. Dimakis, T. Ho, and M. Effros, "On the delay of network coding over line networks," in Proc. IEEE Int. Symp. Inf. Theory, 2009, pp. 1408-1412.
16. G. M. Ezovski, A. Tang, and L. L. H. Andrew, "Minimizing average finish time in P2P networks," in Proc. INFOCOM, 2009, pp. 594-602.
17. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, "Separating distributed source coding from network coding," IEEE Trans. Inf. Theory, vol. 52, pp. 2785-2795, Jun. 2006.
18. S. Li and A. Ramamoorthy, "Network distributed source coding," in Theoretical Aspects of Distributed Computing in Sensor Networks, S. Nikoletseas and J.D.P. Rolim, Eds. Berlin, Germany: Springer Verlag, 2010.
19. A. Lee, M. Médard, K. Z. Haigh, S. Gowan, and P. Rubel, "Minimumcost subgraphs for joint distributed source and network coding," in Proc. 3rd Workshop on Netw. Coding, Theory, Appl., Jan. 2007.
20. A. Ramamoorthy, "Minimum cost distributed source coding over a network," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/ abs/0704.2808, accepted for publication
21. R. Yeung, Information Theory and Network Coding. New York: Springer, 2008.
22. C. Feng and B. Li, "On large-scale peer-to-peer streaming systems with network coding," in Proc. ACMInt. Conf. Multimedia, Vancouver, British Columbia, Canada, 2008, pp. 269-278.
23. S. Acedański, S. Deb, M. Médard, and R. Koetter, "How good is random linear coding based distributed networked storage," in NetCod, Apr. 2005.
24. A. Ramamoorthy, V. P. Roychowdhury, and S. K. Singh, "Selfish distributed compression over networks," in Proc. 28th IEEE Int. Conf. Comput. Commun. (INFOCOM) Mini-Conf., 2009, pp. 3011-3015.
25. A. Jiang, "Network coding for joint storage and transmission with minimum cost," in Proc. IEEE Int. Symp. Inf. Theory, 2006, pp. 1359-1363.
26. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, to be published.
27. K. Bhattad, N. Ratnakar, R. Koetter, and K. Narayanan, "Minimal network coding for multicast," in Proc. IEEE Int. Symp. Inf. Theory, 2005, pp. 1730-1734.
28. B. Hassibi and S. Shadbakht, "Normalized entropy vectors, network information theory and convex optimization," in Proc. IEEE Inf. Theory Workshop for Inf. Theory for Wireless Netw., Solstrand, Norway, Jul. 2007, pp. 1-5.
29. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, 2006. (Pubitemid 46445282)
30. J. Kleinberg and T. Éva, Algorithm Design. Reading, MA: Pearson/ Addison-Wesley, 2006.
31. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, 2005.
32. F. Matúš, "Infinitely many information inequalities," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 41-44.
33. H. L. Bodlaender, "A partial k-arboretum of graphs with bounded treewidth," Theoret. Comput. Sci., vol. 209.1-2, pp. 1-45, Dec. 1998.