Distributed selfish caching

被引:12
|
作者
Laoutaris, Nikolaos
Smaragdakis, Georgios
Bestavros, Azer
Matta, Ibrahim
Stavrakakis, Ioannis
机构
[1] Harvard Univ, Cambridge, MA 02138 USA
[2] Boston Univ, Dept Comp Sci, Boston, MA 02215 USA
[3] Univ Athens, Dept Informat & Telecommunicat, Athens 15784, Greece
基金
美国国家科学基金会;
关键词
selfish caching; cooperative caching; overlay networks; peer-to-peer networks; content distribution networks;
D O I
10.1109/TPDS.2007.1076
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node's resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using online caching algorithms, where the exposed resource is the storage at each node. Motivated by content networking applications - including Web caching, content delivery networks ( CDNs), and peer-to-peer ( P2P) - this paper extends our previous work on the offline version of the problem, which was conducted under a game-theoretic framework and limited to object replication. We identify and investigate two causes of mistreatment: 1) cache state interactions ( due to the cooperative servicing of requests) and 2) the adoption of a common scheme for cache management policies. Using analytic models, numerical solutions of these models, and simulation experiments, we show that online cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. To appear in a substantial manner, the interaction through the exchange of miss streams has to be very intense, making it feasible for the mistreated nodes to detect and react to exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, that is, when they operate as Level-2 caches ( or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the "outlier" characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes.
引用
收藏
页码:1361 / 1376
页数:16
相关论文
共 50 条
  • [41] Competitive analysis of caching in distributed databases
    Wolfson, O
    Huang, YX
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (04) : 391 - 409
  • [42] Load Balancing in Distributed Web Caching
    Rajeev, Tiwari
    Gulista, Khan
    RECENT TRENDS IN NETWORK SECURITY AND APPLICATIONS, 2010, 89 : 47 - +
  • [43] Implementation and comparison of distributed caching schemes
    Selvakumar, S
    Prabhakar, P
    COMPUTER COMMUNICATIONS, 2001, 24 (7-8) : 677 - 684
  • [44] CACHING HINTS IN DISTRIBUTED SYSTEMS.
    Terry, Douglas B.
    1600, (SE-13):
  • [45] Implementation and comparison of distributed Caching schemes
    Selvakumar, S
    Prabhakar, P
    IEEE INTERNATIONAL CONFERENCE ON NETWORKS 2000 (ICON 2000), PROCEEDINGS: NETWORKING TRENDS AND CHALLENGES IN THE NEW MILLENNIUM, 2000, : 491 - 491
  • [46] Policy Enabled Caching for Distributed AI
    Verma, Dinesh C.
    Bent, Graham
    2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2017, : 3017 - 3023
  • [47] Mistreatment-resilient distributed caching
    Smaragdakis, Georgios
    Laoutaris, Nikolaos
    Bestavros, Azer
    Matta, Ibrahim
    Stavrakakis, Loannis
    COMPUTER NETWORKS, 2007, 51 (11) : 2917 - 2937
  • [48] Distributed Caching for Processing Raw Arrays
    Zhao, Weijie
    Rusu, Florin
    Dong, Bin
    Wu, Kesheng
    Ho, Anna Y. Q.
    Nugent, Peter
    30TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT (SSDBM 2018), 2018,
  • [49] Design considerations for distributed caching on the Internet
    Tewari, R
    Dahlin, M
    Vin, HM
    Kay, JS
    19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1999, : 273 - 284
  • [50] A caching strategy for distributed location services
    Al-Mubaid, H
    PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 2002, : 552 - 556