Tuxedo: A Peer-to-Peer Caching System

نویسندگان

  • Weisong Shi
  • Kandarp Shah
  • Yonggen Mao
  • Vipin Chaudhary
چکیده

We are witnessing two trends in Web content access: (a) increasing amounts of dynamic and personalized Web content, and (b) a significant growth in “on-the-move” access using various mobile resource-constrained devices by nomadic users. Web caching and the content distribution network (CDN) are popular solutions for improving Web access latency and have the effect of moving content closer to the client. However, these solutions typically do not work well with dynamically generated and personalized content. Transcoding is a popular solution to resolve server-client mismatches (device heterogeneity), but is unable to benefit from caching in general. These trends necessitate revisiting the traditional Web caching and CDN approaches. In this paper, we proposed Tuxedo, a peer-to-peer caching system, that complements to existing hierarchical-based Web caching for efficient delivery of Web content and value-added edge services. Tuxedo allows multiple caches (peers) to efficiently share not only original Web documents, but also computing resources for transcoding (by sharing transcoded versions) and other value-added edge services. The novelty of Tuxedo includes an adaptive neighbor set algorithm for different Web servers, and a hierarchical cache digest for sharing of transcoded versions and value-added services. Together, these two protocols contribute to the scalable and decentralized features of the Tuxedo system.

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

ثبت نام

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

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

An Effective Peer-to-Peer Web Caching System under Dynamic Participation of Peers

Peer-to-peer (P2P) web caching has been studied recently as it can exploit local caches of peers for web caching without additional infrastructure. However, dynamic join/leave behaviors or local caching strategies of the peers due to their autonomy in a P2P network may limit the performance of P2P web caching. To overcome these limitations, we propose an effective directory-based P2P web cachin...

متن کامل

Distributed caching in unstructured peer-to-peer file sharing networks

Nowadays, the peer-to-peer (P2P) system is one of the largest Internet bandwidth consumers. To relieve the burden on Internet backbone and improve the query and retrieve performance of P2P file sharing networks, efficient P2P caching algorithms are of great importance. In this paper, we propose a distributed topology-aware unstructured P2P file caching infrastructure and design novel placement ...

متن کامل

Peer-to-peer caching systems with selfish peers: A spectral approach

We consider a dynamic distributed caching system consisting of an “authoritative” server dispensing content only if the content fails to be found by searching an unstructured peer-to-peer system. In our model, the peers may not be fully cooperative, in probabilistic fashion, in this search process. We use a spectral approach to analyze the performance of this system, specifically the expected n...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003