Xiaoping Sun
ABSTRACT
This paper presents SRing, a structured non DHT P2P overlay that efficiently supports exact and range queries on multiple attribute values. In SRing, all attribute values are interpreted as strings formed by a base alphabet and are published in the lexicographical order. Two virtual rings are built: N-ring is built in a skip-list way for range partition and queries; D-ring is built in a small-world way for the construction of N-ring. A leave-and-join based load balancing method is used to balance range overload in the network with heterogeneous nodes.
- K. Gummadi, R. Gummadiy, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity", In Proceeding of SIGCOMM 2003. pp. 381--394, 2003. Google Scholar
Digital Library
- J. Kleinberg, "The Small-World Phenomenon: An Algorithmic Perspective", in Proceeding of 32nd ACM STOC, pp. 163--170, 2000. Google ScholarDigital Library
- N. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman, "SkipNet: A Scalable Overlay Network with Practical Locality Properties", In Proceeding of USITS 2003, pp. 113--126, Mar. 2003. Google ScholarDigital Library
- H. Zhuge, X. Sun, J. Liu, E. Yao and X. Chen, "A Scalable P2P Platform for the Knowledge Grid", IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No.12, pp. 1721--1736, 2005. Google ScholarDigital Library
Index Terms
- SRing: a structured non dht p2p overlay supporting string range queries
Recommendations
On the design of semi-structured multi-star hybrid-overlays for multi-attribute range queries
GPC'10: Proceedings of the 5th international conference on Advances in Grid and Pervasive ComputingIn the past few years, resource discovery is an important mechanism in P2P applications P2P networks could be categorized into structured and unstructured In general, structured P2P networks (DHTs) provide efficient keyword search, but is difficult to ...
Load Balancing and Range Queries in P2P Systems Using P-Ring
In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems ...
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
Object caching and replication are the primary mechanisms for addressing load balancing in peer-to-peer systems. In structured P2P networks, object popularity compounds the challenge as both the request and forwarding loads increase for the nodes ...
Comments