Issue No.08 - August (2008 vol.19)
pp: 1099-1110
Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system-wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low system-wide overhead, a P2P network minimizes its traffic in maintaining its performance efficiency and functional correctness. In this paper, we present a novel tree-based P2P network with low communication delay and low system-wide overhead. The merits of our tree-based network include: $(i)$ a tree-shaped P2P network which guarantees that the degree of a node is constant in probability regardless of the system size. The network diameter in our tree-based network increases logarithmically with an increase of the system size. Specially, given a physical network with a power-law latency expansion property, we show that the diameter of our tree network is constant. $(ii)$ Our proposal has the provable performance guarantees. We evaluate our proposal by rigorous performance analysis, and validate by extensive simulations.
Distributed networks, Distributed Systems, Multicast
Hung-Chang Hsiao, Chih-Peng He, "A Tree-Based Peer-to-Peer Network with Quality Guarantees", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 8, pp. 1099-1110, August 2008, doi:10.1109/TPDS.2007.70798
[1] 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 ACM Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '00), pp. 190-201, Nov. 2000.
[2] 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.
[3] D. England, B. Veeravalli, and J.B. Weissman, “A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 5, pp. 608-620, May 2007.
[4] J. Li, J. Stribling, T.M. Gil, R. Morris, and M.F. Kaashoek, “Comparing the Performance of Distributed Hash Tables under Churn,” LNCS 3279, pp. 87-99, Jan. 2005.
[5] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: AnEngineering Approach. Morgan Kaufmann, 2002.
[6] Y. Chu, S. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS '00, pp. 1-12, 2000.
[7] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, pp.205-217, Aug. 2002.
[8] D.A. Tran, K.A. Hua, and T. Do, “ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,” Proc. IEEE INFOCOM '03, pp.1283-1292, Mar. 2003.
[9] M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. Bhargava, “PROMISE: Peer-to-Peer Media Streaming Using CollectCast,” Proc. 11th ACM Int'l Conf. Multimedia (Multimedia '03), pp. 45-54, Nov. 2003.
[10] X. Liao, H. Jin, Y. Liu, L.M. Ni, and D. Deng, “AnySee: Peer-to-Peer Live Streaming,” Proc. IEEE INFOCOM '06, pp.1-10, Mar. 2006.
[11] V. Venkataraman, K. Yoshida, and P. Francis, “Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast,” Proc. 14th IEEE Int'l Conf. Network Protocols (ICNP '06), pp. 2-11, Nov. 2006.
[12] S.M. Banik, S. Radhakrishnan, and C.N. Sekharan, “Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 3, pp. 421-431, Mar. 2007.
[13] 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.
[14] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” LNCS 2218, pp. 161-172, Nov. 2001.
[15] M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: High-Bandwidth Content Multicast in a Cooperative Environment,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 298-313, Oct. 2003.
[16] C. Chou, T.-Y. Huang, K.-L. Huang, and T.-Y. Chen, “SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 5, pp.419-433, May 2006.
[17] C.G. Plaxton, R. Rajaraman, and A.W. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” Proc.Ninth ACM Symp. Parallel Algorithms and Architectures (SPAA'97), pp. 311-320, June 1997.
[18] M. Castro, M.B. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman, “An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays,” Proc. IEEE INFOCOM '03, pp. 1510-1520, Mar. 2003.
[19] S. El-Ansary, L.O. Alima, P. Brand, and S. Haridi, “Efficient Broadcast in Structured P2P Networks,” LNCS 2735, pp. 304-314, Oct. 2003.
[20] A. Bharambe, S. Rao, V. Padmanabhan, S. Seshan, and H. Zhang, “The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols,” LNCS 3640, pp. 115-126, Feb. 2005.
[21] T. Cormen, C. Leiserson, and R. Rivest, “Recurrences,” Introduction to Algorithms, second ed. MIT and McGraw-Hill, 2001.
[22] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. ACM SIGCOMM'99, pp. 251-262, Aug. 1999.
[23] Gnutella, http:/, 2007.
[24] D.R. Karger and M. Ruhl, “Finding Nearest Neighbors in Growth-Restricted Metrics,” Proc. 34th ACM Ann. Symp. Theory of Computing (STOC '02), pp. 741-750, May 2002.
[25] 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.
[26] T.S.E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordinates-Based Approaches,” Proc. IEEE INFOCOM '02, pp. 170-179, June 2002.
[27] J.C. Chu, K.S. Labonte, and B.N. Levine, “Availability and Locality Measurements of Peer-to-Peer File Systems,” Proc. SPIE—ITCom: Scalability and Traffic Control in IP Networks, pp. 310-321, July 2002.
[28] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MCN '02), pp. 18-25, Jan. 2002.
[29] Napster, http:/, 2007.
[30] 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.
[31] H.-C. Hsiao and C.-P. He, “A Tree-Based Peer-to-Peer Network with Quality Guarantees,” technical report (available upon request), Dept. of Computer Science and Information Eng., Nat'l Cheng-Kung Univ., June 2007.
[32] KaZaA, http:/, 2007.
[33] 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 ACM Symp. Operating Systems Principles (SOSP '03), pp. 314-329, Oct. 2003.
[34] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, “Handling Churn in a DHT,” Proc. Usenix Ann. Technical Conf., 2004.
[35] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: An Approach to Universal Topology Generation,” Proc. Ninth Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '01), pp. 346-353, Aug. 2001.
[36] PlanetLab, http:/, 2007.
[37] M. Bishop, S. Rao, and K. Sripanidkulchai, “Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments,” Proc. IEEE INFOCOM '06, pp. 1-13, Mar. 2006.
[38] Y.-W. Sung, M. Bishop, and S. Rao, “Enabling Contribution Awareness in an Overlay Broadcasting System,” Proc. ACM SIGCOMM '06, pp. 411-422, Sept. 2006.