محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
مجله برنامه های کاربردی شبکه و کامپیوتر
جزئیات رویداد
همایش ، رویداد ، ژورنال
اینستاگرام تی پی بین
حوزه های تحت پوشش رویداد

  • cooperative caching versus proactive replication for location dependent request patterns

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 773
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     today's trend to create and share personal content, such as digital photos and digital movies, results in an explosive growth of a user's personal content archive. managing such an often distributed collection becomes a complex and time consuming task, indicating the need for a personal content management system that provides storage space transparently, is quality-aware, and is available at any time and at any place to end-users. a key feature of such a personal content storage service (pcss) is the ability to search worldwide through the dataset of personal files. due to the extremely large size of the dataset of personal content, a centralized solution is no longer feasible and an interesting approach for an efficient distributed pcss implementation is to use a structured peer-to-peer network, and more in particular a distributed hash table (dht), providing a logarithmic lookup performance in the number of network nodes. in order to further increase the lookup performance, a caching layer is typically used between the application layer and the dht. these caching strategies are location neutral, and usually do not exploit location dependence of request patterns. in this article we present our cooperative caching framework and introduce the cooperative request times distance (rtd) caching algorithm. since, lookup patterns in a pcss typically have a power law popularity distribution and exhibit location dependent requests patterns, the proposed caching solution takes into account popularity and distance metrics. to enable cooperation between caches we introduce an update protocol, which only occasionally introduces one hop delay for a lookup operation. we present a systematic analysis of the caching framework and compare the cooperative caching algorithm to the state-of-the-art beehive replication strategy. the cooperative rtd caching solution shows that when request patterns are more localized, the increase in lookup performance through cooperation is significantly better than beehive.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها