کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
452281 694498 2009 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination
چکیده انگلیسی

We consider buffer management in support of large-scale gossip-based peer-to-peer data dissemination protocols. Coupled with an efficient buffering mechanism, system-wide buffer usage can be optimized while providing reliability and scalability in such protocols. We propose a novel approach, stepwise fair-share buffering, that provides uniform load distribution and reduces the overall buffer usage where every peer has a partial view of the system. We report and discuss the comparative performance results with existing buffering approaches as well as random buffering which serves as a benchmark. We present separate evaluations of bufferer selection and gossip-based data dissemination. Reliability, content dissemination time, message delay, buffering delay, and minimum buffer requirements are considered as the key metrics investigated through simulations. The performance of our approach in the case of multiple senders, link failures with multiple bufferers, and scalability to larger networks are investigated. Several power-law and hierarchical overlay topologies are considered. Analytical bounds for reliability of dissemination are also provided.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 53, Issue 13, 28 August 2009, Pages 2259–2274
نویسندگان
, , , , ,