Multifaceted simultaneous load balancing in DHT-based P2P systems: A new game with old balls and bins

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3460 LNCS, Issue , 2005, Pages 373-391

  Aberer, Karl ^a   Datta, Anwitaman ^a   Hauswirth, Manfred ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; ONLINE SYSTEMS; PARALLEL ALGORITHMS; SEMANTICS;

LOAD-BALANCING MECHANISMS; PEER-TO-PEER SYSTEMS; SEMANTIC INFORMATION;

RESOURCE ALLOCATION;

EID: 33748848661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11428589_24     Document Type: Conference Paper

References (26)

1. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing Nearby Copies of Replicated Objects in a Distribute d Environment. In: Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). (1997)
2. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM. (2001)
3. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM. (2001)
4. Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: Hypercup-hypercubes, ontologies, and efficient search on peer-to-peer networks. LNCS 2530 (2003)
5. Raab, M., Steger, A.: "Balls into Bins" - A Simple and Tight Analysis. In: RANDOM. (1998)
6. Karger, D.R., Ruhl, M.: New Algorithms for Load Balancing in Peer-to-Peer Systems (2003) IRIS Student Workshop (ISW).
7. Byers, J., Considine, J., Mitzenmacher, M.: Simple Load Balancing for Distributed Hash Tables. In: 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03). (2003)
8. Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems 12 (2001) 1094-1104
9. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science 2218 (2001)
10. Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: DKS(N,k,f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications. In: 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID). (2003)
11. Datta, A., Aberer, K., Nejdl, W.: Principles of Query-Adaptive Optimal Replication in DHTs. Technical Report IC/2004/110, Ecole Polytechnique Fdrale de Lausanne (EPFL) (2004)
12. Renesse, R.V., Birman, K.P., Vogels, W.: Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21 (2003) 164-206
13. Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In: Proceedings of the Sixth International Conference on Cooperative Information Systems (CoopIS). (2001)
14. Aberer, K., Hauswirth, M., Punceva, M., Schmidt, R.: Improving Data Access in P2P Systems. IEEE Internet Computing 6 (2002)
15. Aberer, K., Punceva, M.: Efficient Search in Structured Peer-to-Peer Systems: Binary v.s. k-ary Unbalanced Tree Structures. In: International Workshop On Databases, Information Systems and Peer-to-Peer Computing. Collocated with VLDB 2003. (2003)
16. Aberer, K.: Efficient Search in Unbalanced, Randomized Peer-To-Peer Search Trees. Technical Report IC/2002/79, Swiss Federal Institute of Technology, Lausanne (EPFL) (2002) http://www.p-grid.org/Papers/TR-IC-2002-79. pdf.
17. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: International Conference on Supercomputing. (2002)
18. Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02). (2002)
19. Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load Balancing in Structured P2P Systems. In: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03). LNCS, Springer (2003)
20. Manku, G.S.: Randomized ID Selection for Peer-to-Peer Networks. Technical report, Stanford University (2004) http://dbpubs.stanford.edu:8090/aux/index- en.html.
21. Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. Journal of Algorithms 22 (1997) 93-110
22. Litwin, W., Neimat, M., Schneider, D.A.: RP*: A Family of Order Preserving Scalable Distributed Data Structures. In: VLDB. (1994) 342-353
23. Litwin, W., Neimat, M., Schneider, D.A.: LH* - A Scalable, Distributed Data Structure. ACM Transactions on Database Systems 21 (1996) 480-525
24. Litwin, W., Schwarz, T.: LH*RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes. In: SIGMOD Conference. (2000) 237-248
25. Kröll, B., Widmayer, P.: Distributing a Search Tree Among a Growing Number of Processors. In: ACM SIGMOD Conference. (1994) 265-276
26. Yokota, H., Kanemasa, Y., Miyazaki, J.: Fat-Btree: An Update-Conscious Parallel Directory Structure. In: International Conference on Data Engineering. (1999) 448-457