Optimal content location in multicast based overlay networks with content updates

World Wide Web

Volumn 7, Issue 3, 2004, Pages 315-336

  Unger, Oren ^a   Cidon, Israel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Content distribution; Multicast; Overlay networks; Tree networks

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTER NETWORKS; COSTS; DISTRIBUTED COMPUTER SYSTEMS; INDUSTRIAL ECONOMICS; INFORMATION SERVICES; MULTICASTING; OPTIMAL SYSTEMS; REAL TIME SYSTEMS; SERVERS; TELECOMMUNICATION TRAFFIC;

CONTENT DISTRIBUTION; MULTICAST; OVERLAY NETWORKS; TREE NETWORKS;

CONTENT BASED RETRIEVAL;

EID: 3543072383     PISSN: 1386145X     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:WWWJ.0000028183.20015.be     Document Type: Article

References (18)

1. Akamai, http://www.akamai.com/
2. A. Billionnet and M.-C. Costa, " Solving the uncapacited plant location problem on trees," Discrete Applied Mathematics 49(1-3), 1994, 51-59.
3. I. Cidon, S. Kutten, and R. Sofer, " Optimal allocation of electronic content," in Proceedings of IEEE Infocorn, Anchorage, AK, April 22-26, 2001.
4. Cisco, http://www.cisco.com/
5. Digital Fountain, http://www.digitalfountain.com/
6. L. W. Dowdy and D. V. Foster, " Comparative models of the file assignment problem," ACM Computing Surveys 14(2), 1982, 287-313.
7. P. Francis, " Yoid: Extending the Internet multicast architecture," April 2000.
8. S. Jamin, C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, " Constrained mirror placement on the Internet," in Proc. of IEEE INFOCOM, 2001.
9. K. Kalpakis, K. Dasgupta, and O. Wolfson, " Optimal placement of replicas in trees with read, write, and storage costs," IEEE Transactions on Parallel and Distributed Systems 12(6), 2001, 628-637.
10. J. Kangasharju, J. Roberts, and K. Ross, " Object replication strategies in content distribution networks," in Proceedings of WCW'01: Web Caching and Content Distribution Workshop, Boston, MA, June 2001.
11. A. Kolen, " Solving covering problems and the uncapacited plant location problem on trees," European Journal of Operational Research 12, 1983, 266-278.
12. C. Krick, H. Räcke, and M. Westermann, " Approximation algorithms for data management in networks," in Proc. of the Symposium on Parallel Algorithms and Architecture, July 2001, pp. 237-246.
13. P. B. Mirchandani and R. L. Francis, Discrete Location Theory, Wiley, 1990.
14. L. Qiu, V. N. Padmanabham, and G. M. Voelker, " On the placement of web server replicas," in Proc. 20th IEEE INFOCOM, 2001.
15. Scale8, http://www.scale8.com/
16. S. Shi and J. Turner, Routing in overlay multicast networks, in Proc. of IEEE INFOCOM, June 2002.
17. WebDAV, http://www.webdav.org/
18. O. Wolfson and A. Milo, " The multicast policy and its relationship of replicated data placement," ACM Transactions on Database Systems 16(1), 1991, 181-205.