QoS-aware object replication in overlay networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2006, Pages

  Jeon, Won J ^a   Gupta, Indrail ^b   Nahrstedt, Klara ^b  

^a MOTOROLA INC   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED GAMING; OBJECT REPLICATION; OVERLAY NETWORKS;

GAME THEORY; HEURISTIC ALGORITHMS; PROBLEM SOLVING; QUALITY OF SERVICE; REAL TIME SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 50949088372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.202     Document Type: Conference Paper

References (21)

1. J. Kangasharju, K. W. Ross, and D. A. Turner, "Optimal content replication in p2p communities," Manuscript, 2002.
2. E. Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," in ACM SIGCOMM '02, Pittsburgh, Pennsylvania, August 2002.
3. L. Qiu, V. N. Padmanabhan, and G. M. Voelker, "On the placement of web server replicas," in Proceedings of IEEE INFOCOM 2001, 2001.
4. B. K. et al., "Peer-to-peer support for massively multiplayer games," in IEEE INFOCOM, 2004.
5. M. Aron, "Differentiated and predictable quality of service in web server systems," 2000, mohit Aron. Differentiated and Predictable Quality of Service in Web Server Systems. PhD thesis, Department of Computer Science, Rice University, October 2000.
6. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Analysis of a local search heuristic for facility location problems," in The Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, 1998, pp. 1-10.
7. B. Awerbuch, Y. Bartal, and A. Fiat, "Distributed paging for general networks," in The Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia, 1996, pp. 574-583.
8. _, "Competitive distributed file allocation," in The Twenty-fifth Annual ACM Symposium on Theory of Computing (STOC '93), San Diego, California, 1993, pp. 164-173.
9. J. Xu, B. Li, and D. L. Lee, "Placement problems for transparent data replication proxy services," IEEE Journal of Selected Areas in Communications, vol. 20, no. 7, September 2002.
10. E. Cronin, S. Jamin, C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, "Constrained mirror placement on the internet," IEEE Journal of Selected Areas in Communications, vol. 20, no. 7, September 2002.
11. B. J. Ko and D. Rubenstein, "Distributed server replication in large scale networks," in Network and Operating System Support for Digital Audio and Video, Ireland, June 2004.
12. A. Jiang and J. Bruck, "Optimal content placement for en-route web caching," in Second IEEE International Symposium on Network Computing and Applications, April 2003.
13. M. Karlson and C. Karamanolis, "Bounds on the replication cost for qos," HP Technical Report HPL-2003-156, July 2003.
14. X. Tang and S. T. Chanson, "Coordinated en-route web caching," IEEE Transactions on Computers, vol. 51, no. 6, June 2002.
15. S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, "Construction of an efficient overlay multicast infrastructure for real-time applications," in IEEE INFOCOM 2003, 2003.
16. X. Tang and J. Xu, "On replica placement for qos-aware content distribution," in IEEE INFOCOM 2004, 2004.
17. A. Tannenbaum, Distributed Operating Systems. Prentice Hall, 1995.
18. R. M. Karp, Reducibility Among Combinatorial Problems. Plenum Press, NY, 1972.
19. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
20. D. S. Johnson, "Approximation algorithms for combinatorial problems," in The fifth Annual ACM Symposium on Theory of Computing (STOC 73), 1973, pp. 38-49.
21. "Brite: Boston university representative internet topology generator," http://www.cs.bu.edu/brite/.