Query-load balancing in structured overlays

Proceedings - Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2007

Volumn , Issue , 2007, Pages 453-460

  Datta, Anwitaman ^a   Schmidt, Roman ^b   Aberer, Karl ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b EPFL   (Switzerland)

Author keywords

Query load balancing; Structured overlays

Indexed keywords

BUFFER STORAGE; HEURISTIC METHODS; NETWORK ROUTING; RESOURCE ALLOCATION;

CACHING HEURISTICS; LOAD-AWARE VARIANTS; QUERY-LOAD BALANCING; STRUCTURED OVERLAYS;

QUERY PROCESSING;

EID: 34548359156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2007.90     Document Type: Conference Paper

References (13)

1. K. Aberer, A. Datta, M. Hauswirth, and R. Schmidt. Indexing data-oriented overlay networks. VLDB, 2005.
2. J. Byers, J. Considine, and M. Mitzenmacher. Simple load balancing for distributed hash tables. In IPTPS, 2003.
3. A. Datta, W. Nejdi, and K. Aberer. Optimal caching for first-order query load-balancing in decentralized index structures. In The 4th International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), 2006.
4. P. Ganesan, M. Bawa, and H. Garcia-Molina. Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. In VLDB, 2004.
5. M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst., 12(10): 1094-1104, 2001.
6. L. Peterson, T. Anderson, D. Culler, and T. Roscoe. A blueprint for introducing disruptive technology into the internet. In SIGCOMM Comput. Commun. Rev., 2003.
7. M. Raab and A. Steger. Balls into Bins - A Simple and Tight Analysis. In RANDOM '98: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, pages 159-170, London, UK, 1998. Springer-Verlag.
8. V. Ramasubramanian and E. Sirer. Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays. In NSDI, 2004.
9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM, 2001.
10. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
11. S. Serbu, S. Bianchi, P. Kropf, and P. Felber. Dynamic load sharing in peer-to-peer systems: When some peers are more equal than others. In Montreal Conference on eTechnologies (MCETECH'06), 2006.
12. 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 the ACM SIGCOMM, 2001.
13. Z. Xu and L. Bhuyan. Effective load balancing in p2p systems. CCGrid, 2006.