Exploiting local popularity to prune routing indices in peer-to-peer systems

被引：1
|
作者：
Bressan, S [1 ]
Hidayanto, AN [1 ]
Hasibuan, ZA [1 ]
机构：
[1] Natl Univ Singapore, Dept Comp Sci, Singapore, Singapore
来源：
Sixteenth International Workshop on Database and Expert Systems Applications, Proceedings | 2005年
关键词：
D O I：
10.1109/DEXA.2005.89
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the routing indices are of manageable size. In this paper, we present a strategy to prune routing indices based on popularity of resources. Routing indices maintain routing information for queries to the most popular resources, leaving queries to other resources to be routed randomly. The popularity of resources at each node of a network is learnt by each routing index, by means of a replacement strategy. We compare the performance of the local popularity method against that of the global popularity method in pruning routing indices in both static and dynamic environments. We compare the effectiveness and the efficiency of two standard replacement strategies: Least Frequently Used (LFU) and Least Recently Used (LRU). Our results confirm the efficiency and effectiveness of pruning routing indices based on the local popularity of resources in unstructured peer-to-peer networks.
引用
收藏
页码：790 / 795
页数：6
相关论文
共 50 条
  • [1] Routing indices for peer-to-peer systems
    Crespo, A
    Garcia-Molina, H
    [J]. 22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, : 23 - 32
  • [2] On the Impact of Popularity Decays in Peer-to-Peer VoD Systems
    Chen, Fei
    Li, Haitao
    Liu, Jiangchuan
    [J]. 2013 IEEE/ACM 21ST INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2013, : 183 - 188
  • [3] Exploiting the heterogeneity in structured peer-to-peer systems
    Qiu, TQ
    Chen, GH
    [J]. GRID AND COOPERATIVE COMPUTING - GCC 2005, PROCEEDINGS, 2005, 3795 : 799 - 810
  • [4] Exploiting routing redundancy via structured peer-to-peer overlays
    Zhao, BY
    Huang, L
    Stribling, J
    Joseph, AD
    Kubiatowicz, JD
    [J]. 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, PROCEEDINGS, 2003, : 246 - 257
  • [5] Modeling file popularity in peer-to-peer file sharing systems
    Bolla, Raffaele
    Eickhoff, Mirko
    Pawlikowski, Krys
    Sciuto, Michele
    [J]. ASMTA 2007: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUES AND APPLICATIONS, 2007, : 149 - 155
  • [6] On using histograms as routing indexes in peer-to-peer systems
    Petrakis, Y
    Koloniari, G
    Pitoura, E
    [J]. DATABASES, INFORMATION SYSTEMS, AND PEER-TO-PEER COMPUTING, 2005, 3367 : 16 - 30
  • [7] An Approach to Analyze Reliability Indices in Peer-To-Peer Communication Systems
    Joshi, Tanuja
    Goyal, Nupur
    Ram, Mangey
    [J]. CYBERNETICS AND SYSTEMS, 2022, 53 (08) : 716 - 733
  • [8] Efficient Secure Message Routing for Structured Peer-to-Peer Systems
    Xiang, Xu
    Jin, Tan
    [J]. NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 2, PROCEEDINGS, 2009, : 354 - 357
  • [9] Popularity decays in peer-to-peer VoD systems: Impact, model, and design implications
    Chen, Fei
    Li, Haitao
    Liu, Jiangchuan
    [J]. COMPUTER NETWORKS, 2014, 60 : 75 - 87
  • [10] Adaptive peer-to-peer routing with proximity
    Liau, CY
    Hidayanto, AN
    Bressan, S
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, 2736 : 454 - 463
12345