Distributed Selfish Caching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selfish Caching in Distributed Systems: A Game-Theoretic Analysis Write-up

Original Document: Selfish Caching in Distributed Systems: A Game-Theoretic Analysis [6], from B. Chun, K. Chaudhuri, H. Wee, M. Barreno, C. Papadimitriou and J. Kubiatowicz The authors analyze the caching problem in P2P systems when the peers behave selfishly, trying to maximize their own gain. They model the problem using a game-theoretic approach, and show that the game reaches a Nash Equili...

متن کامل

Web Caching Architectures: Hierarchical and Distributed Caching

Web caches are installed to reduce the receivers’ latency and save network bandwidth. These caches need to cooperate in order to improve their performance. A popular technique to make caches cooperate is by setting up a caching hierarchy. However, there are several problems associated with a caching hierarchy: i) every hierarchy level introduces additional delay, ii) redundant document copies a...

متن کامل

Distributed Caching Platforms

With the advances in processing, memory, and connectivity technologies, applications are becoming increasingly distributed, data-centric, and web based. These applications demand support for large number of users at high performance, requiring extreme scale, high availability, and low latency data access. Such applications are known as Extreme Transaction Processing (XTP) applications. Distribu...

متن کامل

Caching in distributed systems

Cache memory is a small but fast memory meant to hold data for reuse in the near future. Maurice V. Wilkes introduced the concept to fulfill the speed gap between the CPU and main memory.1 He envisioned that cache memory would bridge that gap by using the principles of spatial and temporal locality. Recent advances in computer systems engineering have pushed cache memory to higher levels in the...

متن کامل

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...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems

سال: 2007

ISSN: 1045-9219

DOI: 10.1109/tpds.2007.1076