Peer-to-peer aggregation techniques dissected

被引:5
作者
Ogston, Elth [1 ]
Jarvis, Stephen A. [1 ]
机构
[1] Univ Warwick, Dept Comp Sci, Coventry, W Midlands, England
基金
英国工程与自然科学研究理事会;
关键词
peer-to-peer systems; aggregation algorithms; gossiping;
D O I
10.1080/17445760903155071
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Aggregation is the process of gathering and combining information from a number of sources. In peer-to-peer systems, aggregation is a basic component of a range of applications, including monitoring and complex-query resolution. Peer-to-peer aggregation services themselves are dependent on a number of other fundamental peer-to-peer services - directories, multicasting and system-size approximation. The overall performance characteristics of an aggregation service are affected by the chosen implementation method for these underlying services. To illustrate this relationship, aggregation techniques for internet-based peer-to-peer systems are surveyed and dissected into their component parts. We further consider the problem of running one-off aggregation queries in a peer-to-peer network. A new aggregation service, Bliksum, which uses a novel combination of underlying services, is introduced. Bliksum employs unstructured peer-to-peer techniques for node sampling, multicasting and system-size approximation, in combination with a method of building a temporary tree structure for aggregation itself. Unstructured peer-to-peer techniques have been shown to be highly resilient to node churn, avoiding the problem inherent in structured systems of maintaining the desired structure when the set of nodes changes rapidly. We present experiments showing that Bliksum retains these advantages while reducing communications cost and reducing information loss compared to pure gossip-based aggregation.
引用
收藏
页码:51 / 71
页数:21
相关论文
共 17 条
[1]   The price of validity in dynamic networks [J].
Bawa, Mayank ;
Gionis, Aristides ;
Garcia-Molina, Hector ;
Motwani, Rajeev .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (03) :245-264
[2]   Bimodal multicast [J].
Birman, KP ;
Hayden, M ;
Ozkasap, O ;
Xiao, Z ;
Budiu, M ;
Minsky, Y .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (02) :41-88
[3]  
Drost N., AARG REAL WORLD GOSS
[4]   Scalable fault-tolerant aggregation in large process groups [J].
Gupta, I ;
van Renesse, R ;
Birman, KP .
INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2001, :433-442
[5]  
Hellerstein JM, 2003, LECT NOTES COMPUT SC, V2634, P63
[6]   Gossip-based aggregation in large dynamic networks [J].
Jelasity, M ;
Montresor, A ;
Babaoglu, O .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2005, 23 (03) :219-252
[7]   Randomized rumor spreading [J].
Karp, R ;
Schindelhauer, C ;
Shenker, S ;
Vöcking, B .
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, :565-574
[8]   Gossip-based computation of aggregate information [J].
Kempe, D ;
Dobra, A ;
Gehrke, J .
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, :482-491
[9]   Probabilistic reliable dissemination in large-scale systems [J].
Kermarrec, AM ;
Massoulié, L ;
Ganesh, AJ .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) :248-258
[10]   The impact of data aggregation in wireless sensor networks [J].
Krishnamachari, B ;
Estrin, D ;
Wicker, S .
22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOP, PROCEEDINGS, 2002, :575-578