Mercury
Open Access
- 30 August 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 34 (4) , 353-366
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.Keywords
This publication has 14 references indexed in Scilit:
- Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems2005
- SplitStream2003
- The impact of DHT routing geometry on resilience and proximity2003
- Simple Load Balancing for Distributed Hash Tables2003
- Load Balancing in Structured P2P Systems2003
- Scribe: a large-scale and decentralized application-level multicast infrastructureIEEE Journal on Selected Areas in Communications, 2002
- A scalable content-addressable network2001
- Chord2001
- Design and evaluation of a wide-area event notification serviceACM Transactions on Computer Systems, 2001
- Tight analyses of two local load balancing algorithms1995