Ashwin R. Bharambe
Abstract
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game's messaging overheard significantly compared to a naïve approach.
- Byers, J., Considine, J., and Mitzenmacher, M. Simple load balancing for distributed hash tables. Second International Workshop on Peer-to-Peer Systems (2003).Google Scholar
Cross Ref
- Cabrera, L. F., Jones, M. B., and Theimer, M. Herald: Achieving a Global Event Notification Service. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (Elmau, Germany, May 2001). Google ScholarDigital Library
- Carzaniga, A., Rosenblum, D. S., and Wolf, A. L. Design and Evaluation of a Wide-Area Event Notification Service. ACM Transactions on Computer Systems 19, 3 (Aug. 2001), 332--383. Google ScholarDigital Library
- Castro, M., Druschel, P., Hu, Y. C., and Rowstron, A. Exploiting network proximity in distributed hash tables. In International Workshop on Future Directions in Distributed Computing (FuDiCo) (June 2002), O. Babaoglu, K. Birman, and K. Marzullo, Eds., pp. 52--55.Google Scholar
- Castro, M., Druschel, P., Kermarrec, A. M., Nandi, A., Rowstron, A., and A., S. Splitstream: High-bandwidth multicast in a cooperative environment. In Proceedings of the 19th Symposium on Operating System Principles (Oct. 2003). Google ScholarDigital Library
- Castro M., et. al. SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications (JSAC) 20, 8 (Oct. 2002). Google ScholarDigital Library
- Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. Wide-area cooperative storage with CFS. In Proceedings of the 18th Symposium on Operating System Principles (Chateau Lake Louise, Banff, Canada, Oct. 2001). Google ScholarDigital Library
- Ganeshan, P., Bawa, M., and Garcia-Molina, H. Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. In Conference on Very Large Databases (VLDB) (2004). To appear. Google ScholarDigital Library
- Ghosh, B., Leighton, F. T., Maggs, B. M., Muthukrishnan, S., Plaxton, C. G., Rajaraman, R., Richa, A. W., Tarjan, R. E., and Zuckerman, D. Tight analyses of two local load balancing algorithms. In Proceedings of the 27th ACM STOC (1995), pp. 548--558. Google ScholarDigital Library
- Gummadi, K., Gummadi, R., Ratnasamy, S., Gribble, S., Shenker, S., and Stoica, I. The Impact of DHT Routing Geometry on Resilience and Proximity. In Proceedings of the ACM SIGCOMM '03 (Aug. 2003). Google ScholarDigital Library
- Harvey, N. J. A., Jones, M. B., Saroiu, S., Theimer, M., and Wolman, A. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (Seattle, WA, Mar. 2003). Google ScholarDigital Library
- Heubsch, R., Hellerstein, J., Lanhan, N., Loo, B. T., Shenker, S., and Stoica, I. Querying the Internet with PIER. In Proceedings of the 29th International Conference on Very Large DataBases (Sept. 2003). Google ScholarDigital Library
- Karger, D., and Ruhl, M. Simple efficient load-balancing algorithms for peer-to-peer systems. Third International Workshop on Peer-to-Peer Systems (2004).Google ScholarDigital Library
- Kleinberg, J. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32th ACM STOC (2000). Google ScholarDigital Library
- Kostic, D., Rodriguez, A., Albrecht, J., Bhirud, A., and Vahdat, A. Using random subsets to build scalable network services. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (Seattle, WA, Mar. 2003). Google ScholarDigital Library
- Li, X., Kim, Y.-J., Govindan, R., and Hong, W. Multi-dimensional range queries in sensor networks. In Proceedings of the ACM Sensys 2003 (Nov. 2003). Google ScholarDigital Library
- Macedonia, M. R., Zyda, M. J., Pratt, D. R., Brutzman, D. P., and Braham, P. T. Exploiting reality with multicast groups: A network architecture for large-scale virtual environments. In Proc. of the 1995 IEEE Virtual Reality Symposium (VRAIS95) (Mar. 1995). Google ScholarDigital Library
- Manku, G., Bawa, M., and Raghavan, P. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (Seattle, WA, Mar. 2003). Google ScholarDigital Library
- Motwani, R., and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- Randall, D. Math 8213A - Rapidly Mixing Markov Chains. http://www.math.gatech.edu/~randall/Course/lewis1.ps, 2003.Google Scholar
- Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., and Stoica, I. Load Balancing in Structured P2P Systems. Second International Workshop on Peer-to-Peer Systems (2003).Google ScholarCross Ref
- Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A Scalable Content-Addressable Network . In Proceedings of the SIGCOMM '01 Symposium on Communications Architectures and Protocols (San Diego, California, Aug. 2001). Google ScholarDigital Library
- Rowstron, A., and Druschel, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) (Nov. 2001), pp. 329--350. Google ScholarDigital Library
- Singhal, S., and Cheriton, D. Using projection aggregations to support scalability in distributed simulation. In Proceedings of the 16th International Conference on Distributed Computing Systems (1996). Google ScholarDigital Library
- Stoica, I., Morris, R., Karger, D., Kaashoek, F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the SIGCOMM '01 Symposium on Communications Architectures and Protocols (2001). Google ScholarDigital Library
Index Terms
- Mercury: supporting scalable multi-attribute range queries
Recommendations
Mercury: supporting scalable multi-attribute range queries
SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communicationsThis paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load ...
Efficient range queries in spatial databases over Peer-to-Peer Networks
Peer-to-Peer (P2P) network, e.g., Chord, is designed mainly for one-dimensional data retrieval and point queries. Multimedia and spatial applications require efficient execution of range queries. This paper proposes an efficient scheme to support range ...
A Diffusive Load Balancing Scheme for Clustered Peer-to-Peer Systems
ICPADS '09: Proceedings of the 2009 15th International Conference on Parallel and Distributed SystemsNode clustering is an effective solution for achieving good performance and high reliability for peer-to-peer (P2P) systems. To improve the performance of a clustered P2P system, it is important to balance the service load among the clusters in the ...
Comments