Characterization and Management of Popular Content in KAD

被引：0

作者：

Carra, Damiano ^{[1
]}

Steiner, Moritz ^{[2
]}

Michiardi, Pietro ^{[3
]}

Biersack, Ernst W. ^{[3
]}

Effelsberg, Wolfgang ^{[4
]}

En-Najjary, Taoufik ^{[5
]}

机构：

[1] Univ Verona, Dept Comp Sci, I-37134 Verona, Italy

[2] Alcatel Lucent, Bell Labs, Murray Hill, NJ 07974 USA

[3] EURECOM, F-06560 Valbonne, France

[4] Univ Mannheim, Dept Comp Sci 4, D-68159 Mannheim, Germany

[5] RESA PEAK, Orange Labs, F-92130 Issy Les Moulineaux, France

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2013年 / 24卷 / 04期

关键词：

Peer-to-Peer; measurements; DHT;

D O I：

10.1109/TPDS.2012.173

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：662 / 671

页数：10

共 33 条

[1]

Aberer K., 2004, P WORKSH PEER TO PEE

[2]

Bienkowski M., 2005, P INT C PEER TO PEER

[3] Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases [J].

Biersack, E. W. ;

Carra, D. ;

Lo Cigno, R. ;

Rodriguez, P. ;

Felber, P. .

COMPUTER NETWORKS, 2007, 51 (03) :901-917

[4]

Brighten P. Godfrey, 2005, P IEEE INFOCOM

[5]

Byers J., 2003, P INT C PEER TO PEER

[6]

Carra D., 2011, P IEEE INT C PEER TO

[7]

Cholez T., 2009, P 3 INT C AUT INFR M

[8]

Cholez T., 2010, P INT WORKSH HOT TOP

[9]

DANEZIS G, 2005, P EUR S RES COMP SEC

[10]

Dinger J., 2006, P 1 INT C AV REL SEC

← 1 2 3 4 →