The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2010 vol.21)
pp: 594-606
Jung-Shian Li , National Cheng Kung University, Tainan
Chih-Hung Chao , National Cheng Kung University, Tainan
Two-layer hierarchy unstructured peer-to-peer (P2P) systems, comprising an upper layer of superpeers and an underlying layer of ordinary peers, are commonly used to improve the performance of large-scale P2P systems. However, the optimal superpeer network design involves several requirements including superpeer degree, network diameter, scalability, load balancing, and flooding performance. A perfect difference graph has desirable properties to satisfy the above design rationale of superpeers overlay network. This paper proposes a two-layer hierarchical unstructured P2P system in which a perfect difference graph (PDG) is used to dynamically construct and maintain the superpeer overlay topology. In addition, the broadcasting performance of the P2P system is enhanced through the use of a PDG-based forwarding algorithm, which ensures that each superpeer receives just one lookup query flooding message. The theoretical results show that the proposed system improves existing superpeer hierarchical unstructured P2P systems in terms of a smaller network diameter, fewer lookup flooding messages, and a reduced average delay, and the experimental results show that the proposed two-layer hierarchy P2P system performs very well in the dynamic network environment.
Unstructured peer-to-peer system, superpeer, perfect difference graph, forwarding algorithm.
Jung-Shian Li, Chih-Hung Chao, "An Efficient Superpeer Overlay Construction and Broadcasting Scheme Based on Perfect Difference Graph", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 5, pp. 594-606, May 2010, doi:10.1109/TPDS.2009.94
[1] Gnutella—A Protocol for Revolution, http:/rfc-gnutella.sourceforge., 2008.
[2] KaZaA, http:/, 2009.
[3] Overnet/edonkey2000, http:/, 2000.
[4] Bittorrent, http://bitconjurer.orgBitTorrent/, 2003.
[5] D.B. West, Introduction to Graph Theory. Prentice-Hall, Inc., 1996.
[6] B. Bollobás, Random Graphs. Academic Press, 1985.
[7] J.F. Kurose and K.W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, third ed. Addison Wesley.
[8] B. Parhami and M. Rakov, "Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 8, pp. 714-724, Aug. 2005.
[9] B. Parhami and M. Rakov, "Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 8, pp. 725-736, Aug. 2005.
[10] L. Xiao, Z. Zhuang, and Y. Liu, "Dynamic Layer Management in Superpeer Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 11, pp. 1078-1091, Nov. 2005.
[11] Y. Dalal and R. Metcalfe, "Reverse Path Forwarding of Broadcast Packets," Comm. ACM, vol. 21, no. 12, pp. 1040-1048, Dec. 1978.
[12] I. Stoica et al., "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
[13] R.G. Gallager, P.A. Humblet, and P.M. Spira, "A Distributed Algorithm for Minimum Weight-Spanning Trees," ACM Trans. Programming Languages and Systems, pp. 66-77, Jan. 1983.
[14] F.C. Gartner, "A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms," Technical Report IC/2003/38, Swiss Fed. Inst. of Technology, School of Computer and Comm. Sciences, June 2003.
[15] J. Yan, Y. Yang, and G.K. Raikundalia, "A SwinDeW p2p-Based Decentralized Workflow Management System," IEEE Trans. Systems, Man and Cybernetics, Part A, vol. 36, no. 5, pp. 922-935, Sept. 2006.
[16] L.D. Baumert, "Cyclic Difference Sets," Lecture Notes in Math., vol. 182, Springer-Verlag, 1971.
[17] T.P. Kirkman, "On the Perfect r-Partitions of ${\rm r}^{2}+{\rm r}+1$ ," Trans. Historical Soc. Lancashire and Cheshire, vol. 9, pp. 127-142, 1857.
[18] R.K. Guy, Unsolved Problems in Number Theory, second ed., pp. 118-121, Springer-Verlag, 1994.
[19] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. Conf. Middleware, 2001.
[20] B.Y. Zhao et al., "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[21] K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Comm. Surveys and Tutorials, vol. 7, pp. 72-93, 2005.
[22] C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks," Proc. Int'l Conf. Supercomputing (ICS), 2002.
[23] S. Ratnasamy et al., "A Scalable Content Addressable Network," Proc. ACM SIGCOMM, pp. 161-72, 2001.
[24] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, "A Local Search Mechanism for Peer-to-Peer Networks," Proc. Conf. Information and Knowledge Management (CIKM), 2002.
[25] D. Tsoumakos and N. Roussopoulos, "Adaptive Probabilistic Search for Peer-to-Peer Networks," Proc. Third IEEE Int'l Conf. P2P Computing, 2003.
[26] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, "A Local Search Mechanism for Peer-to-Peer Networks," Proc. Conf. Information and Knowledge Management (CIKM), 2002.
[27] J. Chu, K. Labonte, and B. Levine, "Availability and Locality Measurements of Peer-to-Peer File Systems," Proc. SPIE, 2002.
[28] B. Yang and H. Garcia-Molina, "Designing a Super-Peer Network," Proc. 19th Int'l Conf. Data Eng., Mar. 2003.
[29] K. Watanabe, N. Hayashibara, and M. Takizawa, "Performance Analysis of the Superpeer-Based Two-Layer P2P Overlay Network with the CBF Strategy," Proc. 27th Int'l Conf. Distributed Computing Systems Workshops (ICDCSW '07), pp. 32-32, June 2007.
[30] Y.J. Pyun and D.S. Reeves, "Constructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems," Proc. Fourth Int'l Conf. Peer-to-Peer Computing, pp. 210-218, Aug. 2004.
[31] A. Montresor, "A Robust Protocol for Building Superpeer Overlay Topologies," Proc. Fourth Int'l Conf. Peer-to-Peer Computing, pp. 25-27, Aug. 2004.
[32] A.T. Mizrak, Y. Cheng, V. Kumar, and S. Savage, "Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup," Proc. Third IEEE Workshop Internet Applications (WIAPP '03), pp. 104-111, June 2003.
[33] L. Jenn-Wei, Y. Ming-Feng, H. Chin-Yu, and L. Chu-Ti, "Reliable Hierarchical Peer-to-Peer File Sharing Systems," Proc. IEEE Region 10 Conf. (TENCON '06), pp. 1-4, Nov. 2006.
[34] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-Like P2P Systems Scalable," Proc. ACM SIGCOMM, 2003.
[35] S. Han and S. Park, "A Dynamic Layer Management Scheme for a Superpeer Ring with a Loosely Consistent DHT," Proc. IEEE Pacific Rim Conf. Comm., Computers, and Signal Processing, pp. 383-386, Aug. 2007.
[36] "Testbed@TWISC—Providing Integrated Access to a Wide Range of Experimental Environments: From Simulated to Emulated to Wide-Area Network Testbeds," http:/, 2009.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool