
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hai Zhuge, Xiaoping Sun, "A Virtual Ring Method for Building SmallWorld Structured P2P Overlays," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 12, pp. 17121725, December, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2008.102, author = {Hai Zhuge and Xiaoping Sun}, title = {A Virtual Ring Method for Building SmallWorld Structured P2P Overlays}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {12}, issn = {10414347}, year = {2008}, pages = {17121725}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.102}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  A Virtual Ring Method for Building SmallWorld Structured P2P Overlays IS  12 SN  10414347 SP1712 EP1725 EPD  17121725 A1  Hai Zhuge, A1  Xiaoping Sun, PY  2008 KW  Emerging technologies KW  Distributed networks KW  Network topology VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] K. Aberer, L.O. Alima, A. Ghodsi, S. Girdzijauskas, M. Hauswirth, and S. Haridi, “The Essence of P2P: A Reference Architecture for Overlay Networks,” Proc. Fifth IEEE Int'l Conf. PeertoPeer Computing (P2P '05), Aug. 2005.
[2] R. Albert and A.L. Barabasi, “Statistical Mechanics of Complex Networks,” Rev. Modern Physics, vol. 74, no. 47, 2002.
[3] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2003.
[4] F. BanaeiKashani and C. Shahabi, “SWAM: A Family of Access Methods for SimilaritySearch in PeertoPeer Data Networks,” Proc. ACM 13th Conf. Information and Knowledge Management (CIKM '04), pp. 304313, 2004.
[5] L. Barrire, P. Fraigniaud, E. Kranakis, and D. Krizanc, “Efficient Routing in Networks with Long Contacts,” Proc. 15th Int'l Symp. Distributed Computing (DISC '01), pp. 270284, 2001.
[6] A. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable MultiAttribute Range Queries,” Proc. ACM SIGCOMM, 2004.
[7] P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, “Could Any Graph Be Turned into a Small World,” Theoretical Computer Science, vol. 355, no. 1, pp. 96103, 2006.
[8] P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, “Towards Small World Emergence,” Proc. 18th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA '06), pp. 225232, 2006.
[9] P. Fraigniaud, C.l. Gavoille, and C. Paul, “Eclecticism Shrinks Even Small Worlds,” Proc. 23rd Ann. ACM SIGACTSIGOPS Symp. Principles of Distributed Computing (PODC '04), pp. 169178, 2004.
[10] S. Girdzijauskas, A. Datta, and K. Aberer, “On Small World Graphs in NonUniformly Distributed Key Spaces,” Proc. First IEEE Int'l Workshop Networking Meets Databases (NetDB), 2005.
[11] K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, “The Impact of DHT Routing Geometry on Resilience and Proximity,” Proc. ACM SIGCOMM, 2003.
[12] N. Harvey, M. 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.
[13] M.F. Kaashoek and D.R. Karger, “Koorde: A Simple DegreeOptimal Distributed Hash Table,” Proc. Second Int'l Workshop PeertoPeer Systems (IPTPS '03), F.Kaashoek and I.Stoica,eds., pp. 98107, 2003.
[14] J. Kleinberg, “The SmallWorld Phenomenon: An Algorithmic Perspective,” Proc. 32nd ACM Symp. Theory of Computing (STOC'00), pp. 163170, 2000.
[15] J. Kleinberg, “SmallWorld Phenomena and the Dynamics of Information,” Advances in Neural Information Processing Systems (NIPS '01), vol. 14, 2001.
[16] M. Li, W.C. Lee, and A. Sivasubramaniam, “Semantic Small World: An Overlay Network for PeertoPeer Search,” Proc. 12th IEEE Int'l Conf. Network Protocols (ICNP '04), pp. 228238, 2004.
[17] D. Loguinov, J. Casas, and X. Wang, “GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience,” IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 11071120, Oct. 2005.
[18] S. Milgram, “The Small World Problem,” Psychology Today, vol. 1, no. 61, 1967.
[19] G. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed Hashing in a Small World,” Proc. Fourth USENIX Symp. Internet Technologies and Systems (USITS), 2003.
[20] D. Malkhi, M. Naor, and D. Ratajczak, “Viceroy: A Scalable and Dynamic Emulation of the Butterfly,” Proc. 21st Ann. ACM SIGACTSIGOPS Symp. Principles of Distributed Computing (PODC'02), pp. 183192, 2002.
[21] C. Martel and V. Nguyen, “Analyzing Kleinberg's (and Other) SmallWorld Models,” Proc. 23rd Ann. ACM SIGACTSIGOPS Symp. Principles of Distributed Computing (PODC '04), pp. 179188, 2004.
[22] R. Matei, A. Iamnitchi, and P. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, vol. 6, no. 1, pp. 5057, Jan./Feb. 2002.
[23] V. Nguyen and C. Martel, “Analyzing and Characterizing SmallWorld Graphs,” Proc. 16th ACMSIAM Symp. Discrete Algorithms (SODA '05), pp. 311320, 2005.
[24] C.G. Plaxton, R. Rajaraman, and A.W. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” Proc. Ninth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA'97), pp. 311320, June 1997.
[25] C. Qu, W. Nejdl, and M. Kriesell, “Cayley DHTsA GroupTheoretic Framework for Analyzing DHTs Based on CayleyGraphs,” Proc. Second Int'l Symp. Parallel and Distributed Processing and Applications (ISPA), 2004.
[26] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable ContentAddressable Network,” Proc. ACM SIGCOMM '01, Aug. 2001.
[27] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for LargeScale PeertoPeer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329350, 2001.
[28] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable PeertoPeer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149160, Aug. 2001.
[29] A. Spognardi and R. Di Pietro, “A Formal Framework for the Performance Analysis of P2P Networks Protocols,” Proc. 23rd IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '06), p. 8, 2006.
[30] M. Steiner and E. Biersack, “Shortcuts in a Virtual World,” Proc. Second Conf. Future Networking Technologies (CoNext), 2006.
[31] C. Tang, Z. Xu, and S. Dwarkadas, “PeertoPeer Information Retrieval Using SelfOrganizing Semantic Overlay Networks,” Proc. ACM SIGCOMM '03, pp. 175186, 2003.
[32] D. Watts and S. Strogatz, “Collective Dynamics of SmallWorld Networks,” Nature, vol. 393, pp. 440442, 1998.
[33] J. Xu, A. Kumar, and X. Yu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in PeertoPeer Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp.151163, Jan. 2004.
[34] Z. Xu and Z. Zhang, “Building LowMaintenance Expressways for P2P Systems,” Technical Report HPL200241, HewlettPackard Laboratories, 2002.
[35] C. Zhang, A. Krishnamurthy, and R.Y. Wang, “SkipIndex: Towards a Scalable PeertoPeer Index Service for High Dimensional Data,” Technical Report TR70304, Princeton Univ., 2004.
[36] B.Y. Zhao, H. Ling, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient GlobalScale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 4153, 2004.