Distributed self-stabilizing placement of replicatedresources in emerging networks

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 476-487

  Ko, Bong Jun ^a   Rubenstein, Dan ^a  

^a Columbia University ^*  (United States)

Author keywords

Convergence; Graph coloring; Replica placement

Indexed keywords

COMPUTER SIMULATION; EVALUATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; OPTIMIZATION; PERFORMANCE;

CONVERGENCE; DISTRIBUTED NETWORKING SYSTEMS; GRAPH COLORING; REPLICA PLACEMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 23344436178     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.850196     Document Type: Article

References (15)

1. M. Adler, private communication.
2. A. A. Bertossi and M. A. Bonuccelli, "Code assignment for hidden terminal interference avoidance in multihop packet radio networks," IEEE/ACM Trans. Networking, vol. 3, no. 4, pp. 441-449, Aug. 1995.
3. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys, "A constant-factor approximation algorithm for the k-median problem," J. Comput. Syst. Sci., vol. 65, no. 1, pp. 129-149, Aug. 2002.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
5. I. Foster and C. Kesselman, Eds., The Grid: Blueprint for a New Computing Infrastructure. San Mateo, CA: Morgan Kaufmann, 1999.
6. Gnutella [Online]. Available: http://www.gnutella.co.uk/
7. A. Goel, P. Indyk, and K. R. Varadarajan, "Reductions among high dimensional proximity problems," in Proc. Symp. Discrete Algorithms (SODA), Washington, DC, 2001, pp. 769-778.
8. S. Guha and S. Khuller, "Greedy strikes back: Improved facility location algorithms," in Proc. Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan. 1998, pp. 649-657.
9. L. Hu, "Distributed code assignments for CDMA packet radio network," in IEEE/ACM Trans. Networking, vol. 1, Dec. 1993, pp. 668-677.
10. J. Kangasharju, J. Roberts, and K. W. Ross, "Object replication strategies in content distribution networks," Comput. Commun., vol. 25, no. 4, pp. 376-383, Mar. 2002.
11. J. Kangasharju, "Internet content distribution," Ph.D. dissertation, Dept. Comput. Sci., Univ. Nice, Nice, France, Apr. 2002.
12. B.-J. Ko and D. Rubenstein, "A greedy approach to replicated content placement using graph coloring," in Proc. SPIE ITCom Conf. Scalability and Traffic Control in IP Networks II, Jul. 2002, pp. 289-298.
13. B.-J. Ko and D. Rubenstein, "Distributed, self-stabilizing placement of replicated resources in emerging networks," in Proc. 11th IEEE Int. Conf. Network Protocols (ICNP 2003), Nov. 2003, pp. 6-15.
14. E. Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 177-190.
15. D. B. Shmoys, E. Tardos, and K. Aardal, "Approximation algorithms for facility location problems (extended abstract)," in ACM Symp. Theory of Computing (STOC), El Paso, TX, May 1997, pp. 265-274.