This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
HRing: A Structured P2P Overlay Based on Harmonic Series
February 2008 (vol. 19 no. 2)
pp. 145-158
ASCII Text
x 
 
Hai Zhuge, Xue Chen, Xiaoping Sun, Erlin Yao, "HRing: A Structured P2P Overlay Based on Harmonic Series," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 2, pp. 145-158, February, 2008.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2007.70725,
author = {Hai Zhuge and Xue Chen and Xiaoping Sun and Erlin Yao},
title = {HRing: A Structured P2P Overlay Based on Harmonic Series},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {19},
number = {2},
issn = {1045-9219},
year = {2008},
pages = {145-158},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70725},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - HRing: A Structured P2P Overlay Based on Harmonic Series
IS - 2
SN - 1045-9219
SP145
EP158
EPD - 145-158
A1 - Hai Zhuge,
A1 - Xue Chen,
A1 - Xiaoping Sun,
A1 - Erlin Yao,
PY - 2008
KW - Overlay Network
KW - structured P2P
KW - range query
KW - routing
VL - 19
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
This paper presents HRing (Harmonic Ring), a structured P2P overlay where long links are builtalong the ring with decreasing probabilities coinciding with the Harmonic Series. HRing constructs routingtables based on the distance between node positions instead of node IDs in order to eliminate the effect of node IDdistribution on the long link distribution and load balance. It supports leave-and-rejoin load balance withoutincurring uneven long link distribution. And node IDs can be any form like number, string, address and datewithout the prerequisite of uniform distribution, so they can preserve the semantics and range locality of dataobjects. HRing supports multi-dimensional range queries. Each node is expected to have O(ln(n)) long links. Theconstruction of O(ln(n)) long links for a node costs O(ln(n)) messages. Routing queries achieve O(ln(n)) hops.Analysis and simulations demonstrate the efficiency of query routing and the effectiveness of the long linkconstruction method.

[1] K. Aberer, P. Cudre-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt, “P-Grid: A Self-Organizing Structured P2P System,” Proc. 22nd ACM Sigmod/ACM Symp. Principles of Database Systems (PODS '03), pp. 29-33, June 2003.
[2] A. Andrzejak and Z. Xu, “Scalable, Efficient Range Queries for Grid Information Services,” Proc. Second IEEE Int'l Conf. Peer-to-Peer Computing (P2P '02), pp. 33-40, Sept. 2002.
[3] F. Araujo and L. Rodrigues, “Geopeer: A Location-Aware Peer-to-Peer System,” Technical Report DI/FCUL TR 03-31, Dept. of Informatics, Univ. of Lisbon, http://www.di.fc.ul.pt/tech-reports03-31.pdf , Dec. 2003.
[4] F. Araujo and L. Rodrigues, “Long Range Contacts in Overlay Networks with Unbalanced Node Distribution,” Technical Report DI/FCUL TR 04-8, Dept. of Informatics, Univ. of Lisbon, July 2004.
[5] L. Arge, D. Eppstein, and M.T. Goodrich, “Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 69-76, July 2005.
[6] J. Aspnes, J. Kirsch, and A. Krishnamurthy, “Load Balancing and Locality in Range-Queriable Data Structures,” Proc. 23rd Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '04), pp. 115-124, July 2004.
[7] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), pp. 384-393, Jan. 2003.
[8] L. Barriere, P. Fraigniaud, E. Kranakis, and D. Krizanc, “Efficient Routing in Networks with Long Range Contacts,” Proc. 15th Conf. Distributed Computing (DISC '01), pp. 270-284, Oct. 2001.
[9] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable Multi-Attribute Range Queries,” ACM SIGCOMM Computer Comm. Rev., vol. 34, no. 4, pp. 353-366, 2004.
[10] M. Cai, M. Frank, J. Chen, and P. Szekely, “Maan: A Multi-Attribute Addressable Network for Grid Information Services,” Proc. Fourth Int'l Workshop Grid Computing (GRID '03), pp. 184-191, Nov. 2003.
[11] A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, and J. Shanmugasundaram, “Querying Peer-to-Peer Networks Using P-Trees,” Proc. Seventh Int'l Workshop the Web and Databases (WebDB '04), pp. 25-30, July 2004.
[12] P. Fraigniaud, C. Gavoille, and C. Paul, “Eclecticism Shrinks Even Small Worlds,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 169-178, July 2004.
[13] P. Ganesan, M. Bawa, and H. Garcia-Molina, “Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 444-455, Sept. 2004.
[14] P. Ganesan, B. Yang, and H. Garcia-Molina, “One Torus to Rule Them All: Multi-Dimensional Queries in P2P Systems,” Proc. Seventh Int'l Workshop the Web and Databases (WebDB '04), pp. 19-24, July 2004.
[15] B. Gedik and L. Liu, “PeerCQ: A Decentralized and Self-Configuring Peer-to-Peer Information Monitoring System,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 490-499, May 2003.
[16] N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS '03), pp. 113-126, Mar. 2003.
[17] N.J.A. Harvey and J.I. Munro, “Deterministic SkipNet,” Proc. 22nd Ann. ACM Symp. Principles of Distributed Computing (PODC '03), pp. 152-153, July 2003.
[18] J. Havil and F. Dyson, “The Harmonic Series,” Gamma: Exploring Euler's Constant, 2003.
[19] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “BATON: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 661-672, Sept. 2005.
[20] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,” Proc. 16th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA '04), pp. 36-43, June 2004.
[21] J. Kleinberg, “The Small-World Phenomenon: An Algorithmic Perspective,” Proc. 32nd ACM Symp. Theory of Computing (STOC '00), pp. 163-170, May 2000.
[22] J. Kleinberg, “Navigation in a Small World,” Nature, vol. 406, p. 845, 2000.
[23] A. Kothari, D. Agrawal, A. Gupta, and S. Suri, “Range Addressable Network: A P2P Cache Architecture for Data Ranges,” Proc. Third IEEE Int'l Conf. Peer-to-Peer Computing (P2P '03), pp. 14-22, Sept. 2003.
[24] M.L. Lee, M. Kitsuregawa, B.C. Ooi, K.L. Tan, and A. Mondal, “Towards Self-Tuning Data Placement in Parallel Database Systems,” Proc. ACM Sigmod '00, pp. 225-236, May 2000.
[25] G.S. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed Hashing in a Small World,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS '03), pp. 127-140, Mar. 2003.
[26] G.S. Manku, M. Naor, and U. Wieder, “Know thy Neighbor's Neighbor: The Power of Look Ahead in Randomized P2P Networks,” Proc. 36th ACM Symp. Theory of Computing (STOC '04), pp. 54-63, June 2004.
[27] C. Martel and V. Nguyen, “Analyzing Kleinberg's (and Other) Small-World Models,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 179-188, July 2004.
[28] S. Ramabhadran, S. Ratnasamy, J. Hellerstein, and S. Shenker, “Brief Announcement: Prefix Hash Tree,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), p. 368, July 2004.
[29] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, “A Scalable Content-Addressable Network,” ACM SIGCOMM Computer Comm. Rev., vol. 31, no. 4, pp. 161-172, 2001.
[30] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, Nov. 2001.
[31] Y.F. Shu, B.C. Ooi, K.L. Tan, and A.Y. Zhou, “Supporting Multi-Dimensional Range Queries in P2P Systems,” Proc. Fifth IEEE Int'l Conf. Peer-to-Peer Computing (P2P '05), pp. 173-180, Aug. 2005.
[32] I. Stoica, R. Morris, D.L. Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149-160, Aug. 2001.
[33] X. Wang, Y. Zhang, X. Li, and D. Loguinov, “On Zone-Balancing of Peer-to-Peer Networks: Analysis of Random Node Join (Extended Version),” technical report, Texas A&M, June 2004.
[34] K.C. Zatloukal and N.J.A. Harvey, “Family Trees: An Ordered Dictionary with Optimal Congestion, Locality, Degree, and Search Time,” Proc. 15th ACM-SIAM Symp. Discrete Algorithms (SODA '04), pp. 308-317, Jan. 2004.
[35] B.Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[36] Y. Zhu, H. Wang, and Y. Hu, “Integrating Semantics-Based Access Mechanisms with P2P File Systems,” Proc. Third IEEE Int'l Conf. P2P Computing (P2P '03), pp. 118-125, Sept. 2003.
[37] H. Zhuge, X.P. Sun, J. Liu, E.L. Yao, and X. Chen, “A Scalable P2P Platform for the Knowledge Grid,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 12, pp. 1721-1736, Dec. 2005.

Index Terms:
Overlay Network, structured P2P, range query, routing
Citation:
Hai Zhuge, Xue Chen, Xiaoping Sun, Erlin Yao, "HRing: A Structured P2P Overlay Based on Harmonic Series," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 2, pp. 145-158, Feb. 2008, doi:10.1109/TPDS.2007.70725
Usage of this product signifies your acceptance of the Terms of Use.