A greedy approach to replicated content placement using graph coloring

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 4868, Issue , 2002, Pages 289-298

  Ko, Bong Jun ^a   Rubenstein, Dan ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR; GRAPH THEORY; SERVERS; WORLD WIDE WEB;

PEER-TO-PEER NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0036421999     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.475279     Document Type: Conference Paper

References (19)

1. K.R.A. Iamnitchi and I. Foster, "Improving data availability through dynamic model-driven replication in large peer-to-peer communities," in Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, May 2002.
2. K. Chen and K. Nahrstedt, "An integrated data lookup and replication scheme in mobile ad hoc networks," in Proc. of SPIE International Symposium on the Convergence of Information Technologies and Communications (ITCom 2001), August 2001.
3. M. Papadopouli and H. Schulzrinne, "Seven degrees of separation in mobile ad hoc networks," in Proc. of IEEE Global Telecommunications Conference 2000 (GLOBECOM '00), November 2000.
4. L. Qiu, V. Padmanabham, and G. Voelker, "On the placement of web server replicas," in Proc. 20th IEEE INFOCOM 2001, August 2001.
5. S.A. Cook, J.K. Pachl, and I.S. Pressman, "The optimal location of replicas in a network using a read-one-write-all policy," Distributed Computing 15(1) 7, April 2002.
6. J.R.J. Kangasharju and K. Ross, "Object replication strategies in content distribution networks," in Proceedings of WCW'01: Web Caching and Content Distribution Workshop, Berlin, June 2001.
7. J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, "A scalable location service for geographic ad-hoc routing," in Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (Mobicom '00), August 2000.
8. Z. Haas and B. Liang, "Ad-hoc mobility management with uniform quorum systems," IEEE/ACM Transactions on Networking 7, April 1999.
9. J. Liu, Q. Zhang, W. Zhu, J. Zhang, and B. Li, "A novel framework for qos-aware resource discovery in mobile ad hoc networks," in Proceedings of IEEE ICC'02, April 2002.
10. D.B. Shmoys, E. Tardos, and K. Aardal, "Approximation algorithms for facility location problems (extended abstract)," in ACM Symposium on Theory of Computing (STOC), pp. 265-274, (El Paso, TX), May 1997.
11. M. Charikar and S. Guha, "Improved Combinatorial Algorithms for the Facility Location and k-Median Problems," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 378-388, 1999.
12. M. Charikar, S. Guha, E. Tardos, and D.B. Shmoys, "A constant-factor approximation algorithm for the k-median problem (extended abstract)," in ACM Symposium on Theory of Computing (STOC), pp. 1-10, (Atlanta, GA), May 1999.
13. A. Goel, P. Indyk, and K.R. Varadarajan, "Reductions among high dimensional proximity problems," in Symposium on Discrete Algorithms (SODA), pp. 769-778, (Washington DC), 2001.
14. K. Jain and V.V. Vazirani, "Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems," in IEEE Symposium on Foundations of Computer Science (FOCS), pp. 2-13, 1999.
15. M.R. Korupolu, C.G. Plaxton, and R. Rajaraman, "Analysis of a local search heuristic for facility location problems," Tech. Rep. 98-30, University of Texas, Austin, 24, 1998.
16. Guha and Khuller, "Greedy strikes back: Improved facility location algorithms," in Symposium on Discrete Algorithms (SODA), (San Francisco, CA), Jan. 1998.
17. T. Cormen, C. Leiserson, and R. Rivest, introduction into Algorithms, MIT Press, Cambridge, MA, 1990.
18. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications," in Proceedings of ACM SIGCOMM'01, (San Diego, CA), August 2001.
19. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proceedings of ACM SIGCOMM'01, (San Diego, CA), August 2001.