The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2013 vol.24)
pp: 662-671
D. Carra , Comput. Sci. Dept., Univ. of Verona, Verona, Italy
M. Steiner , Bell Labs., Alcatel-Lucent, Murray Hill, NJ, USA
P. Michiardi , EURECOM, Sophia Antipolis, France
E. W. Biersack , EURECOM, Sophia Antipolis, France
W. Effelsberg , Dept. of Comput. Sci. IV, Univ. of Mannheim, Mannheim, Germany
T. En-Najjary , Orange Labs., RESA/PEAK, Orange, France
The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Based on an extensive measurement campaign, we pinpoint several deficiencies of KAD in handling popular content and provide a series of improvements to address such shortcomings. Our work reveals that keywords, which are associated with content, may become popular for two distinct reasons. First, we show that some keywords are intrinsically popular because they are common to many disparate contents: in such case we ameliorate KAD by introducing a simple mechanism that identifies stopwords. Then, we focus on keyword popularity that directly relates to popular content. We design and evaluate an adaptive load balancing mechanism that is backward compatible with the original implementation of KAD. Our scheme features the following properties: 1) it drives the process that selects the location of peers responsible to store references to objects, based on object popularity; 2) it solves problems related to saturated peers that would otherwise inflict a significant drop in the diversity of references to objects, and 3) if coupled with a load-aware content search procedure, it allows for a more fair and efficient usage of peer resources.
resource allocation, content management, content-based retrieval, peer-to-peer computing, Kademlia-based P2P routing system, KAD, large-scale peer-to-peer network, popular content handling, keyword popularity, adaptive load balancing mechanism, saturated peer resources, load-aware content search procedure, stopword identification, content popularity, Peer to peer computing, Publishing, Load management, Routing, Instruments, Search problems, Electronic mail, DHT, Peer-to-Peer, measurements
D. Carra, M. Steiner, P. Michiardi, E. W. Biersack, W. Effelsberg, T. En-Najjary, "Characterization and Management of Popular Content in KAD", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 4, pp. 662-671, April 2013, doi:10.1109/TPDS.2012.173
[1] F.L. Fessant, S.B. Handurukande, A.-M. Kermarrec, and L. Massoulié, "Clustering in Peer-to-Peer File Sharing Workloads," Proc. Third Int'l Conf. Peer-to-Peer Systems (IPTPS), 2004.
[2] J.S. Otto, M.A. Sanchez, D.R. Choffnes, F.E. Bustamante, and G. Siganos, "On Blind Mice and the Elephant - Understanding the Network Impact of a Large Distributed System," Proc. SIGCOMM, 2011.
[3] P. Maymounkov and D. Mazieres, "Kademlia: A Peer-to-Peer Information System Based on the XOR Metric," Proc. Int'l Conf. Peer-to-Peer Systems (IPTPS), 2002.
[4] Overnet, http:/, 2012.
[5] E-Mule, http:/, 2012.
[6] A-Mule, http:/, 2012.
[7] M. Steiner, T. En-Najjary, and E.W. Biersack, "Long Term Study of Peer Behavior in the KAD DHT," IEEE/ACM Trans. Networking, vol. 17, no. 5, pp. 1371-1384, Oct. 2009.
[8] DHT Spec., , 2012.
[9] Azureus/Vuze,, 2012.
[10] Ares,, 2012.
[11] M. Steiner, W. Effelsberg, T. En-Najjary, and E.W. Biersack, "Load Reduction in the KAD Peer-to-Peer System," Proc. Fifth Int'l Workshop Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), 2007.
[12] D. Carra, M. Steiner, and P. Michiardi, "Adaptive Load Balancing in KAD," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P), 2011.
[13] J.R. Douceur, "The Sybil Attack," Proc. Int'l Conf. Peer-to-Peer Systems (IPTPS), 2002.
[14] J. Dinger and H. Hartenstein, "Defending the Sybil Attack in P2P Networks: Taxonomy, Challenges, and a Proposal for Self-Registration," Proc. First Int'l Conf. Availability, Reliability and Security (ARES), 2006.
[15] G. Danezis, C. Lesniewski-Laas, M. Kaashoek, and R. Anderson, "Sybil-Resistant DHT Routing," Proc. European Symp. Research in Computer Security, 2005.
[16] Y. Qiao and F.E. Bustamante, "Structured and Unstructured Overlays under the Microscope - A Measurement-Based View of two P2P Systems that People Use," Proc. Ann. Conf. USENIX Ann. Technical Conf. (ATC), 2006.
[17] H.-J. Kang, E. Chan-Tin, Y. Kim, and N. Hopper, "Why Kad Lookup Fails," Proc. IEEE Ninth Int'l Conf. Peer-to-Peer Computing (P2P), 2009.
[18] D. Stutzbach and R. Rejaie, "Improving Lookup Performance over a Widely-Deployed DHT," Proc. IEEE INFOCOM, 2006.
[19] M. Steiner, D. Carra, and E.W. Biersack, "Faster Content Access in KAD," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P), 2008.
[20] M. Steiner, D. Carra, and E.W. Biersack, "Evaluating and Improving the Content Access in KAD," J. Peer-to-Peer Networks and Applications, vol. 3, no. 2, pp. 115-128, June 2010.
[21] F. Klemm, A. Datta, and K. Aberer, "A Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems," EDBT '04: Proc. Workshops Current Trends in Database Technology, pp. 506-515, 2004.
[22] K. Aberer, F. Klemm, M. Rajman, and J. Wu, "An Architecture for Peer-to-Peer Information Retrieval," Proc. Workshop Peer-to-Peer Information Retrieval, 2004.
[23] T. Suel, C. Mathur, J.-W. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, and K. Shanmugasundaram, "Odissea: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval," Technical Report TR-CIS-2003-01, Polytechnic Univ., Brooklyn, NY, June 2003.
[24] M. Bienkowski, M. Korzeniowski, and F.M. auf der Heide, "Dynamic Load Balancing in Distributed Hash Tables," Proc. Int'l Conf. Peer-to-Peer Systems (IPTPS), 2005.
[25] J. Byers, J. Considine, and M. Mitzenmacher, "Simple Load Balancing for Distributed Hash Tables," Proc. Int'l Conf. Peer-to-Peer Systems (IPTPS), 2003.
[26] B. Godfrey and I. Stoica, "Heterogeneity and Load Balance in Distributed Hash Tables," Proc. IEEE INFOCOM, 2005.
[27] B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load Balancing in Dynamic Structured P2P Systems," Proc. IEEE INFOCOM, 2004.
[28] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load Balancing in Strucured P2P Systems," Proc. Int'l Conf. Peer-to-Peer Systems (IPTPS), 2003.
[29] T.-T. Wu and K. Wang, "An Efficient Load Balancing Scheme for Resilient Search in Kad Peer to Peer Networks," Proc. IEEE Ninth Malaysia Int'l Conf. Comm. (MICC), 2009.
[30] D. Wu, Y. Tian, and N. Kam-wing, "Resilient and Efficient Load Balancing in Distributed Hash Tables," J. Network and Computer Applications, vol. 32, no. 1, pp. 45-60, 2009.
[31] Z. Xu and L. Bhuyan, "Effective Load Balancing in P2P Systems," Proc. IEEE Sixth Int'l Symp. Cluster Computing Grid (CCGRID), 2006.
[32] M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Press, 2005.
[33] KAD Load Balancing Simulator, " ~carra/downloads kadsim.tgz," 2012.
[34] KAD traces, "," 2012.
[35] T. Cholez, I. Chrisment, and O. Festor, "Efficient DHT Attack Mitigation through Peers' ID Distribution," Proc. Int'l Workshop Hot Topics in Peer-to-Peer Systems (HotP2P), 2010.
[36] T. Cholez, I. Chrisment, and O. Festor, "Evaluation of Sybil Attacks Protection Schemes in KAD," Proc. Third Int'l Conf. Autonomous Infrastructure, Management and Security: Scalability of Networks and Services (AIMS), 2009.
[37] Stop Words Used in Internet Search Engines, " ," 2012.
[38] S. Petrovic, P. Brown, and J.-L. Costeux, "Unfairness in the E-Mule File Sharing System," Proc. 20th Int'l Teletraffic Conf. Managing Traffic Performance in Converged Networks (ITC), 2007.
[39] M. Steiner, E.W. Biersack, and T. En-Najjary, "Exploiting KAD: Possible Uses and Misuses," ACM SIGCOMM Computer Comm. Rev., vol. 37, no. 5, pp. 65-70, 2007.
[40] L. Sheng, J. Song, X. Dong, and L. Zhou, "Emule Simulator: A Practical Way to Study the eMule System," Proc. Ninth Int'l Conf. Networks (ICN), 2010.
[41] P. Wang, J. Tyra, E. Chan-Tin, T. Malchow, D. Kune, N. Hopper, and Y. Kim, "Attacking the KAD Network: Real World Evaluation and High Fidelity Simulation Using DVN," Security and Comm. Networks, 2010.
[42] E.W. Biersack, D. Carra, R. Lo Cigno, P. Rodriguez, and P. Felber, "Overlay Architectures for File Distribution: Fundamental Performance Analysis for Homogeneous and Heterogeneous Cases," Computer Networks, vol. 51, no. 3, pp. 901-917, Feb. 2007.
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool