Mistreatment-resilient distributed caching

The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is increasingly emerging as a hallmark of many newly-proposed overlay and peer-topeer applications. Distributed caching protocols in which group members cooperate to satisfy local requests for objects is a canonical example of such applications. In recent work of ours we identified mistreatment as a potentially serious problem for nodes participating in such cooperative caching arrangements. Mistreatment materializes when a node’s access cost for fetching objects worsens as a result of cooperation. To that end, we outlined an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. Under this framework, a node opts to participate in the group only if its individual access cost is less than the one achieved while in isolation. In this paper, we argue against...

• Type: Journal
• Year: 2007
• Where: CN
• Authors: Georgios Smaragdakis, Nikolaos Laoutaris, Azer Bestavros, Ibrahim Matta, Ioannis Stavrakakis
• Keywords: Access Cost, Caching, CN 2007, Cooperative Group