کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
425954 685958 2013 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery
چکیده انگلیسی

Resource discovery in large-scale Peer-to-Peer (P2P) networks is challenging due to lack of effective methods for guiding queries. Based on the observation that the effectiveness of P2P resource discovery is determined by the utilization of hints, i.e., a summary of where the resources are, scattered in the network, in this paper we propose the distance-aware bloom filters (DABF) that disseminate hint information to faraway nodes by decaying BFs with different deterministic masks. Based on DABF, we design a novel Collaborative P2P Search (CPS) mechanism, which supports intelligent message behaviors including suspend, resume, terminate, move, reside, dispatch, notify and order. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations, in which we observed a remarkable reduction in search latency over previous approaches.


► Decaying BF with different deterministic masks for faraway information propagation.
► Intelligent message behaviors like suspend, resume, terminate, move, order, reside.
► Achieve a remarkable reduction in search latency and cost over previous approaches.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 29, Issue 6, August 2013, Pages 1621–1630
نویسندگان
, ,