Distributed, self-stabilizing placement of replicated resources in emerging networks

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 6-15

  Ko, Bong Jun ^a   Rubenstein, D ^a  

^a Department of Electrical Engineering Columbia University ^*  (United States)

Author keywords

Computer networks; Distributed computing; Grid computing; Intelligent networks; Large scale systems; Peer to peer computing; Protocols; Sensor systems; Synchronization; Wireless sensor networks

Indexed keywords

COMPUTER NETWORKS; DISTRIBUTED PARAMETER NETWORKS; GRID COMPUTING; INTELLIGENT NETWORKS; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; PEER TO PEER NETWORKS; SENSOR NODES; SYNCHRONIZATION; WIRELESS AD HOC NETWORKS; WIRELESS SENSOR NETWORKS;

AD HOC WIRELESS NETWORKS; DISTRIBUTED NETWORKING SYSTEMS; IMPACT PERFORMANCE; MESSAGE TRANSMISSIONS; NETWORKING SYSTEMS; P2P FILE SHARING SYSTEMS; PEER-TO-PEER COMPUTING; SENSOR SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 23344443939     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249752     Document Type: Conference Paper

References (13)

1. M. Adler. personal communication.
2. I. D. Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, January 2001.
3. 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), pages 1-10, Atlanta, GA, May 1999.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
5. I. Foster and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999.
6. Gnutella. http://www.gnutella.co.uk/.
7. A. Goel, P. Indyk, and K. R. Varadarajan. Reductions among high dimensional proximity problems. In Symposium on Discrete Algorithms (SODA), pages 769-778, Washington DC, 2001.
8. Guha and Khuller. Greedy strikes back: Improved facility location algorithms. In Symposium on Discrete Algorithms (SODA), San Francisco, CA, January 1998.
9. J. Kangasharju, K. W. Ross, and D. A. Turner. Optimal Content Replication in P2P Communities. in submission, 2002.
10. B.-J. Ko and D. Rubenstein. A greedy approach to replicated content placement using graph coloring. In SPIE IT-Com Conference on Scalability and Traffic Control in IP Networks II, July 2002.
11. B.-J. Ko and D. Rubenstein. Replica placement for emerging networks via an asynchronous, decentralized, graphcoloring algorithm. Technical report, Columbia University, May 2003.
12. L. Qiu, V. Padmanabham, and G. Voelker. Replication Strategies in Unstructured Peer-to-Peer Networks. In Proceedings of the ACM SIGCOMM '01, August 2002.
13. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In ACM Symposium on Theory of Computing (STOC), pages 265-274, El Paso, TX, May 1997.