Distributed selfish caching

被引:13
作者
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
相关论文
共 32 条
  • [1] ARLITT MF, 1996, P ACM SIGMETRICS 96, P126, DOI DOI 10.1145/233013.233034
  • [2] Breslau L., 1999, P INFOCOM 99 MAR
  • [3] Informed content delivery across adaptive overlay networks
    Byers, JW
    Considine, J
    Mitzenmacher, M
    Rost, S
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (05) : 767 - 780
  • [4] CHUN BG, 2004, P ACM S PRINC DISTR
  • [5] Coffman Edward Grady, 1973, Operating Systems Theory
  • [6] COHEN E, 2002, P ACM SIGCOMM 02 AUG
  • [7] DAN A, 1990, PERF E R SI, V18, P143, DOI 10.1145/98460.98525
  • [8] Market-based resource allocation for, content delivery in the Internet
    Erçetin, Ç
    Tassiulas, L
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (12) : 1573 - 1585
  • [9] Summary cache: A scalable wide-area Web cache sharing protocol
    Fan, L
    Cao, P
    Almeida, J
    Broder, AZ
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (03) : 281 - 293
  • [10] Guirguis M., 2004, P 12 IEEE INT C NETW