
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
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. 145158, 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 = {10459219}, year = {2008}, pages = {145158}, 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  10459219 SP145 EP158 EPD  145158 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   
[1] K. Aberer, P. CudreMauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt, “PGrid: A SelfOrganizing Structured P2P System,” Proc. 22nd ACM Sigmod/ACM Symp. Principles of Database Systems (PODS '03), pp. 2933, June 2003.
[2] A. Andrzejak and Z. Xu, “Scalable, Efficient Range Queries for Grid Information Services,” Proc. Second IEEE Int'l Conf. PeertoPeer Computing (P2P '02), pp. 3340, Sept. 2002.
[3] F. Araujo and L. Rodrigues, “Geopeer: A LocationAware PeertoPeer System,” Technical Report DI/FCUL TR 0331, Dept. of Informatics, Univ. of Lisbon, http://www.di.fc.ul.pt/techreports0331.pdf , Dec. 2003.
[4] F. Araujo and L. Rodrigues, “Long Range Contacts in Overlay Networks with Unbalanced Node Distribution,” Technical Report DI/FCUL TR 048, Dept. of Informatics, Univ. of Lisbon, July 2004.
[5] L. Arge, D. Eppstein, and M.T. Goodrich, “SkipWebs: Efficient Distributed Data Structures for MultiDimensional Data Sets,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing (PODC '05), pp. 6976, July 2005.
[6] J. Aspnes, J. Kirsch, and A. Krishnamurthy, “Load Balancing and Locality in RangeQueriable Data Structures,” Proc. 23rd Ann. ACM SIGACTSIGOPS Symp. Principles of Distributed Computing (PODC '04), pp. 115124, July 2004.
[7] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '03), pp. 384393, 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. 270284, Oct. 2001.
[9] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable MultiAttribute Range Queries,” ACM SIGCOMM Computer Comm. Rev., vol. 34, no. 4, pp. 353366, 2004.
[10] M. Cai, M. Frank, J. Chen, and P. Szekely, “Maan: A MultiAttribute Addressable Network for Grid Information Services,” Proc. Fourth Int'l Workshop Grid Computing (GRID '03), pp. 184191, Nov. 2003.
[11] A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, and J. Shanmugasundaram, “Querying PeertoPeer Networks Using PTrees,” Proc. Seventh Int'l Workshop the Web and Databases (WebDB '04), pp. 2530, 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. 169178, July 2004.
[13] P. Ganesan, M. Bawa, and H. GarciaMolina, “Online Balancing of RangePartitioned Data with Applications to PeertoPeer Systems,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 444455, Sept. 2004.
[14] P. Ganesan, B. Yang, and H. GarciaMolina, “One Torus to Rule Them All: MultiDimensional Queries in P2P Systems,” Proc. Seventh Int'l Workshop the Web and Databases (WebDB '04), pp. 1924, July 2004.
[15] B. Gedik and L. Liu, “PeerCQ: A Decentralized and SelfConfiguring PeertoPeer Information Monitoring System,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 490499, 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. 113126, 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. 152153, 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 PeertoPeer Networks,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 661672, Sept. 2005.
[20] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for PeertoPeer Systems,” Proc. 16th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA '04), pp. 3643, June 2004.
[21] J. Kleinberg, “The SmallWorld Phenomenon: An Algorithmic Perspective,” Proc. 32nd ACM Symp. Theory of Computing (STOC '00), pp. 163170, 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. PeertoPeer Computing (P2P '03), pp. 1422, Sept. 2003.
[24] M.L. Lee, M. Kitsuregawa, B.C. Ooi, K.L. Tan, and A. Mondal, “Towards SelfTuning Data Placement in Parallel Database Systems,” Proc. ACM Sigmod '00, pp. 225236, 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. 127140, 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. 5463, June 2004.
[27] C. Martel and V. Nguyen, “Analyzing Kleinberg's (and Other) SmallWorld Models,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 179188, 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 ContentAddressable Network,” ACM SIGCOMM Computer Comm. Rev., vol. 31, no. 4, pp. 161172, 2001.
[30] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for LargeScale PeertoPeer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329350, Nov. 2001.
[31] Y.F. Shu, B.C. Ooi, K.L. Tan, and A.Y. Zhou, “Supporting MultiDimensional Range Queries in P2P Systems,” Proc. Fifth IEEE Int'l Conf. PeertoPeer Computing (P2P '05), pp. 173180, Aug. 2005.
[32] I. Stoica, R. Morris, D.L. Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: Scalable PeertoPeer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149160, Aug. 2001.
[33] X. Wang, Y. Zhang, X. Li, and D. Loguinov, “On ZoneBalancing of PeertoPeer 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 ACMSIAM Symp. Discrete Algorithms (SODA '04), pp. 308317, Jan. 2004.
[35] B.Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for FaultTolerant WideArea Location and Routing,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 4153, Jan. 2004.
[36] Y. Zhu, H. Wang, and Y. Hu, “Integrating SemanticsBased Access Mechanisms with P2P File Systems,” Proc. Third IEEE Int'l Conf. P2P Computing (P2P '03), pp. 118125, 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. 17211736, Dec. 2005.