کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4954785 1443901 2017 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Enabling opportunistic search and placement in cache networks
ترجمه فارسی عنوان
امکان جستجو و قرار دادن فرصت های احتمالی در شبکه های حافظه پنهان
کلمات کلیدی
شبکه های حافظه پنهان تعیین سطح، مسیریابی شبکه اطلاعاتی محور مدل سازی شبکه و تجزیه و تحلیل، سنجش عملکرد،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
چکیده انگلیسی

Content distribution networks have been extremely successful in today's Internet. Despite their success, there are still a number of scalability and performance challenges that motivate clean slate solutions for content dissemination, such as content centric networking. In this paper, we address two of the fundamental problems faced by any content dissemination system: content search and content placement. We consider a multi-tiered, multi-domain hierarchical system wherein random walks are used to cope with the tradeoff between exploitation of known paths towards custodians versus opportunistic exploration of replicas in a given neighborhood. TTL-like mechanisms, referred to as reinforced counters, are used for content placement. We propose an analytical model to study the interplay between search and placement. The model yields closed form expressions for metrics of interest such as the average delay experienced by users and the load placed on custodians. Then, leveraging the model solution we pose a joint placement-search optimization problem. We show that previously proposed strategies for optimal placement, such as the square-root allocation, follow as special cases of ours, and that a bang-bang search policy is optimal if content allocation is given.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 119, 4 June 2017, Pages 17-34
نویسندگان
, , , , ,