The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2009 vol.20)
pp: 1023-1037
Hung-Chang Hsiao , National Cheng-Kung University, Tainan
Yung-Chih Lin , National Cheng-Kung University, Tainan
Hao Liao , National Cheng-Kung University, Tainan
ABSTRACT
Small-world (SW) networks possess two properties, namely low diameter and high clustering coefficient, which are often desired by large-scale peer-to-peer networks. Prior studies have shown that the construction of an SW network can be based on a d-regular graph, and each node in the graph maintains d local neighbors and a small constant number of long-distance contacts. However, it is commonly understood that it is difficult to construct a short route in an SW network, given source (s) and target (t) nodes, though an SW network guarantees that a short route from s to t exists. Prior work in [1] proposed a navigable SW network for a d-dimensional lattice such that a simple localized routing algorithm can be devised to route a message from s to t using O(\log^{2}{\cal X}) hops, where {\cal X} is the number of nodes in the network. In this paper, we present a novel navigable SW network based on a hierarchical model. Compared to previous efforts, the novelty of our study presents 1) that our network construction based on a hierarchical model is decentralized, 2) that routing a message between any two nodes in our SW network takes logarithmic hopcount in expectation, 3) that our SW network has high cluster coefficient, and 4) that the performance of our proposal is mathematically provable. We support the performance of our proposal in this study through rigorous, thorough performance analysis and extensive simulations.
INDEX TERMS
Peer-to-peer systems, small world, overlay networks, tree hierarchy, performance analysis.
CITATION
Hung-Chang Hsiao, Yung-Chih Lin, Hao Liao, "Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 7, pp. 1023-1037, July 2009, doi:10.1109/TPDS.2008.173
REFERENCES
[1] J.M. Kleinberg, “The Small-World Phenomenon: An Algorithm Perspective,” Proc. 32nd Ann. Symp. Theory of Computing (STOC'00), pp. 163-170, May 2000.
[2] J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, “OceanStore: An Architecture for Global-Scale Persistent Storage,” Proc. Ninth Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '00), pp. 190-201, Nov. 2000.
[3] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[4] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM'01, pp. 161-172, Aug. 2001.
[5] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149-160, Aug. 2001.
[6] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” LNCS, vol. 2218, pp. 161-172, Nov. 2001.
[7] Gnutella, http:/rfc-gnutella.sourceforge.net/, 2008.
[8] S. Milgram, “The Small-World Problem,” Psychology Today, vol. 2, pp. 60-67, 1967.
[9] B. Bollobás and F.R.K. Chung, “The Diameter of a Cycle Plus a Random Matching,” SIAM J. Discrete Math., vol. 1, no. 3, pp.328-333, Aug. 1988.
[10] D.J. Watts and S.H. Strogatz, “Collective Dynamics of Small-World Networks,” Nature, vol. 393, pp. 440-442, June 1998.
[11] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” ACM/IEEE Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.
[12] H. Zhang, A. Goel, and R. Govindan, “Using the Small-World Model to Improve Freenet Performance,” Computer Networks, vol. 46, no. 4, pp. 555-574, Nov. 2004.
[13] I. Clarke, S.G. Miller, T.W. Hong, O. Sandberg, and B. Wiley, “Protecting Free Expression Online with Freenet,” IEEE Internet Computing, vol. 6, no. 1, pp. 40-49, Jan./Feb. 2002.
[14] Y. Hui, C. Lui, and K. Yau, “Small-World Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd,” Computer Networks, vol. 50, no. 15, pp. 2727-2746, Oct. 2006.
[15] M. Li, W.-C. Lee, and A. Sivasubramaniam, “Semantic Small World: An Overlay Network for Peer-to-Peer Search,” Proc. 12th Int'l Conf. Network Protocols (ICNP '04), pp. 228-238, Oct. 2004.
[16] A. Iamnitchi and I. Foster, “Interest-Aware Information Dissemination in Small-World Communities,” Proc. 14th Int'l Symp. High Performance Distributed Computing (HPDC '05), pp.167-175, July 2005.
[17] J.M. Kleinberg, “Navigation in a Small World,” Nature, vol. 406, p.845, Aug. 2000.
[18] D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, “Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience,” Proc. ACM SIGCOMM '03, pp. 395-406, Aug. 2003.
[19] Advances in Neural Information Processing Systems 14, T.G. Dietterich, S. Becker, and Z. Gharamani, eds., chapter on small-world phenomena and the dynamics of information, pp. 431-438, MIT Press, Dec. 2001.
[20] P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, “Towards Small World Emergence,” Proc. 18th Ann. Symp. Parallelism in Algorithms and Architectures (SPAA '06), pp. 225-232, July 2006.
[21] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 500-508, May 2003.
[22] Y. Zhu and Y. Hu, “Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 349-361, Apr. 2005.
[23] H. Shen and C.-Z. Xu, “Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849-862, June 2007.
[24] G. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed Hashing in a Small World,” Proc. Fourth USENIX Symp. Internet Technologies and Systems (USITS '03), Mar. 2003.
[25] D. Malkhi, M. Naor, and D. Ratajczak, “Viceroy: A Scalable and Dynamic Emulation of the Butterfly,” Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC '02), pp.183-192, July 2002.
[26] M.F. Kaashoek and D.R. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” LNCS, vol. 2735, pp. 98-107, Oct. 2003.
[27] H. Shen, C.-Z. Xu, and G. Chen, “Cycloid: A Scalable Constant-Degree Lookup-Efficient P2P Overlay Network,” Performance Evaluation, vol. 63, no. 3, pp. 195-216, Mar. 2006.
[28] 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 '03, pp. 381-394, Aug. 2003.
[29] H. Zhang, A. Goel, and R. Govindan, “Improving Lookup Latency in Distributed Hash Table Systems Using Random Sampling,” ACM/IEEE Trans. Networking, vol. 13, no. 5, pp.1121-1134, Oct. 2005.
[30] D.J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.
[31] D.R. Karger and M. Ruhl, “Finding Nearest Neighbors in Growth-Restricted Metrics,” Proc. 34th Ann. Symp. Theory of Computing (STOC '02), pp. 741-750, May 2002.
[32] S. Wang, D. Xuan, and W. Zhao, “Analyzing and Enhancing the Resilience of Structured Peer-to-Peer Systems,” J. Parallel and Distributed Computing, vol. 65, no. 2, pp. 207-219, Feb. 2005.
[33] S. Merugu, S. Srinivasan, and E. Zegura, “Adding Structure to Unstructured Peer-to-Peer Networks: The Use of Small-World Graphs,” J. Parallel and Distributed Computing, vol. 65, no. 2, pp.142-153, Feb. 2005.
[34] S. Dongen, “A New Cluster Algorithm for Graphs,” technical report, Centrum voor Wiskunde en Informatica, Dec. 1998.
[35] L. Ramaswamy, B. Gedik, and L. Liu, “A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 9, pp. 1-16, Sept. 2005.
[36] Y. Li, S. Verma, L. Lao, and J.-H. Cui, “SACA: SCM-Based Adaptive Clustering Algorithm,” Proc. 13th Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '05), pp. 271-279, Sept. 2005.
[37] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[38] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[39] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” J. Comm. and Networks, vol. 5, no. 2, pp. 169-178, Mar. 2002.
[40] P.-J. Wan, K.M. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless AdHoc Networks,” Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, Apr. 2004.
[41] Y. Liu, L. Xiao, X. Liu, L.M. Ni, and X. Zhang, “Location Awareness in Unstructured Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 163-174, Feb. 2005.
[42] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection,” Proc. IEEE INFOCOM '02, pp. 1190-1199, June 2002.
[43] D. Eastlake and P. Jones, US Secure Hash Algorithm 1 (SHA1), RFC3174, Sept. 2001.
[44] R. Rivest, The MD5 Message-Digest Algorithm, RFC 1321, Apr. 1992.
[45] M. Mitzenmacher and E. Upfal, Probability and Computing. Cambridge, 2005.
[46] J.C. Chu, K.S. Labonte, and B.N. Levine, “Availability and Locality Measurements of Peer-to-Peer File Systems,” Proc. ITCom: Scalability and Traffic Control in IP Networks, pp. 310-321, July 2002.
[47] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN), 2002.
[48] Napster, http:/www.napster.com/, 2008.
[49] G. Pandurangan, P. Raghavan, and E. Upfal, “Building Low-Diameter Peer-to-Peer Networks,” IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 995-1002, Aug. 2003.
[50] K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, “Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload,” Proc. 19th Symp. Operating Systems Principles (SOSP '03), pp. 314-329, Oct. 2003.
[51] S.M. Ross, Introduction to Probability Models, second ed. Academic Press, 1980.
[52] BitTorrent, http:/www.bittorrent.com/, 2008.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool