The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2013 vol.24)
pp: 1589-1601
Harris Papadakis , Foundation for Research and Technology-Hellas, Institute of Computer Science, Heraklion
Paraskevi Fragopoulou , Foundation for Research and Technology-Hellas, Institute of Computer Science, Heraklion
Evangelos P. Markatos , Foundation for Research and Technology-Hellas, Institute of Computer Science, Heraklion
Mema Roussopoulos , University of Athens, Athens
ABSTRACT
One of the most appealing characteristics of unstructured P2P overlays is their enhanced self-* properties, which results from their loose, random structure. In addition, most of the algorithms which make searching in unstructured P2P systems scalable, such as dynamic querying and 1-hop replication, rely on the random nature of the overlay to function efficiently. The underlying communications network (i.e., the Internet), however, is not as randomly constructed. This leads to a mismatch between the distance of two peers on the overlay and the hosts they reside on at the IP layer, which in turn leads to its misuse. The crux of the problem arises from the fact that any effort to provide a better match between the overlay and the IP layer will inevitably lead to a reduction in the random structure of the P2P overlay, with many adverse results. With this in mind, we propose ITA, an algorithm which creates a random overlay of randomly connected neighborhoods providing topology awareness to P2P systems, while at the same time has no negative effect on the self-* properties or the operation of the other P2P algorithms. Using extensive simulations, both at the IP router level and autonomous system level, we show that ITA reduces communication latencies by as much as 50 percent. Furthermore, it not only reduces by 20 percent the number of IP network messages which is critical for ISPs carrying the burden of transporting P2P traffic, but also distributes the traffic load more evenly on the routers of the IP network layer.
INDEX TERMS
Peer to peer computing, IP networks, Topology, Proposals, Clustering algorithms, Network topology, Heuristic algorithms, IP network layer, Peer to peer computing, IP networks, Topology, Proposals, Clustering algorithms, Network topology, Heuristic algorithms, communication latency, Peer-to-peer, unstructured overlay network, topology awareness, self-* properties
CITATION
Harris Papadakis, Paraskevi Fragopoulou, Evangelos P. Markatos, Mema Roussopoulos, "ITA: Innocuous Topology Awareness for Unstructured P2P Networks", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 8, pp. 1589-1601, Aug. 2013, doi:10.1109/TPDS.2012.137
REFERENCES
[1] Cooperative Association for Internet Data Analysis, http://www.caida.orghome, 2012.
[2] The Internet Assigned Numbers Authority (IANA), http:/www.iana.org/, 2012.
[3] Limewire inc, http:/www.limewire.com, 2012.
[4] E. Bangeman, "Study: Bittorrent Sees Big Growth Limewire Still nr.1 p2p App," ARS TECHNICA, 2008.
[5] M. Castro, P. Druschel, Y. Hu, and A. Rowstron, "Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays," Technical Report MSR-TR-2003-52, Harvard, 2003.
[6] V. Cholvi, P. Felber, and E. Biersack, "Efficient Search in Unstructured Peer-to-Peer Networks," Proc. 16th ACM Symp. Parallelism in Algorithms and Architectures, 2004.
[7] C. Cramer, K. Kutzner, and T. Fuhrmann, "Bootstrapping Locality-Aware p2p Networks," Proc. IEEE Int'l Conf. Networks (ICON), pp. 357-361, 2004.
[8] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A Decentralized Network Coordinate System," Proc. SIGCOMM, 2004.
[9] A. Dufour and L. Trajković, "Improving Gnutella Network Performance Using Synthetic Coordinates," Proc. Third Int'l Conf. Quality of Service in Heterogeneous Wired/Wireless Networks (QShine '06), p. 31, 2006.
[10] A. Fisk, "Gnutella Ultrapeer Query Routing, v. 0.1," 2003.
[11] T.G.D. Forum Gnutella 0.6 Protocol Specification.
[12] C. Gkantsidis, M. Mihail, and A. Saberi, "Hybrid Search Schemes for Unstructured Peer-to-Peer Networks," Proc. IEEE INFOCOM, pp. 1526-1537, 2005.
[13] H. Hsiao, H. Liao, and C. Huang, "Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 11, pp. 1668-1681, Nov. 2009.
[14] M. Jelasity, A. Montresor, and O. Babaoglu, "T-man: Gossip-Based Fast Overlay Topology Construction," Computer Networks, vol. 53, no. 13, pp. 2321-2339, 2009.
[15] J. Jernberg, V. Vlassov, A. Ghodsi, and S. Haridi, "Doh: A Content Delivery Peer-to-Peer Network," Proc. European Conf. Parallel Computing (EUROPAR '06), 2006.
[16] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, "A Local Search Mechanism for Peer-to-Peer Networks," Proc. 11th Int'l Conf. Information and Knowledge Management (CIKM '02), pp. 300-307, 2002.
[17] B. Krishnamurthy and J. Wang, "Topology Modeling Via Cluster Graphs," Proc. SIGCOMM Internet Measurement Workshop, 2001.
[18] N. Laoutaris, G. Smaragdakis, A. Bestavros, and J. Byers, "Implications of Selfish Neighbor Selection in Overlay Networks," Proc. IEEE INFOCOM, 2007.
[19] J. Leitao, J.P. Marques, J. Pereira, and L. Rodrigues, "X-bot: A Protocol for Resilient Optimization of Unstructured Overlays," Proc. IEEE 28th Int'l Symp. Reliable Distributed Systems (SRDS), 2009.
[20] Z. Li and P. Mohapatra, "Impact of Topology on Overlay Routing Service," Proc. IEEE INFOCOM, 2004.
[21] Y. Liu, "A Two-Hop Solution to Solving Topology Mismatch," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 11, pp. 1591-1600, Nov. 2008.
[22] Y. Liu, H. Zhang, W. Gong, and D. Towsley, "On the Interaction Between Overlay Routing and Underlay Routing," Proc. IEEE INFOCOM, 2005.
[23] P. Maymounkov and D. Mazieres, "Kademlia: A Peer-to-Peer Information System Based on the Xor Metric," Proc. Revised Papers from the First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), 2002.
[24] V. Padmanabhan and L. Subramanian, "An Investigation of Geographic Mapping Techniques for Internet Hosts," ACM SIGCOMM, vol. 31, pp. 173-185, 2001.
[25] H. Papadakis, P. Fragopoulou, M. Dikaiakos, A. Labrinidis, and E. Markatos, "Divide et Impera: Partitioning Unstructured Peer-to-Peer Systems to Improve Resource Location," Proc. Achievements in European Research on Grid Systems CoreGRID Integration Workshop (Selected Papers), 2007.
[26] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A Scalable Content-Addressable Network," Proc. SIGCOMM, pp. 161-172, 2001.
[27] C. Rohrs, "Query Routing for the Gnutella Network," 2001.
[28] H. Rostami and J. Habibi, "Topology Awareness of Overlay p2p Networks: Research Articles," Concurrency and Computation: Practice and Experience—Autonomous Grid Computing, vol. 19, pp. 999-1021, May 2007.
[29] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware), pp. 329-350, 2001.
[30] S. Saroiu, K. Gummadi, R. Dunn, S. Gribble, and H. Levy, "An Analysis of Internet Content Delivery Systems," Proc. Fifth Symp. Operating Systems Design and Implementation, 2002.
[31] S. Sen and J. Wang, "Analyzing Peer-to-Peer Traffic Across Large Networks," Proc. ACM SIGCOMM, 2002.
[32] G. Smaragdakis, N. Laoutaris, A. Bestavros, J. Byers, and M. Roussopoulos, "Egoist: Overlay Routing Using Selfish Neighbor Selection," BUCS-TR-2007-013, 2007.
[33] K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems," Proc. INFOCOM, 2003.
[34] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, pp. 149-160, 2001.
[35] D. Tam, R. Azimi, and H. Jacobsen, "Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables," Proc. Int'l Workshop Databases, Information Systems and Peer-to-Peer Computing, pp. 138-152, 2003.
[36] Wikipedia. Mark and Recapture Article.
[37] L. Yunhao, X. Li, L. Xiaomei, L. Ni, and Z. Xiaodong, "Location Awareness in Unstructured Peer-to-Peer Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 2, pp. 163-174, Feb. 2005.
[38] B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing," Technical Report UCB/CSD-01-1141, Univ. California, 2001.
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool