A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Journal of Systems and Software
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
International Journal of Mobile Network Design and Innovation
An unstructured peer-to-peer approach to aggregate node selection
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
San Fermín: aggregating large data sets using a binomial swap forest
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Timed buffers: A technique for update propagation in nomadic environments
Computer Communications
Genetic Programming for Proactive Aggregation Protocols
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
ACM Transactions on Computer Systems (TOCS)
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Bio-Inspired Computing and Communication
Tag-Based Cooperation in Peer-to-Peer Networks with Newscast
Proceedings of the 2005 conference on Self-Organization and Autonomic Informatics (I)
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks
WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
Statistical structures for Internet-scale data management
The VLDB Journal — The International Journal on Very Large Data Bases
A Robust Algorithm for the Membership Management of Super-Peer Overlay
MMNS 2009 Proceedings of the 12th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Wired-Wireless Multimedia Networks and Services Management
Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Probabilistic guarantees for rendezvous under noisy measurements
ACC'09 Proceedings of the 2009 conference on American Control Conference
HyperVerse: simulation and testbed reconciled
International Journal of Advanced Media and Communication
Towards a society of peers: expert and interest groups in peer-to-peer systems
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Managing peer-to-peer live streaming applications
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Tagster - tagging-based distributed content sharing
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
PINTS: peer-to-peer infrastructure for tagging systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem
INFORMS Journal on Computing
Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
P2Prec: a P2P recommendation system for large-scale data sharing
Transactions on large-scale data- and knowledge-centered systems III
Using aggregation for adaptive super-peer discovery on the gradient topology
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
Grassroots approach to self-management in large-scale distributed systems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
PeerTrack: a platform for tracking and tracing objects in large-scale traceability networks
Proceedings of the 15th International Conference on Extending Database Technology
A deniable and efficient question and answer service over ad hoc social networks
Information Retrieval
Gossip-Based counting in dynamic networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Spectra: robust estimation of distribution functions in networks
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
Aggregation & that is, the computation of global properties like average or maximal load, or the number of nodes & is an important basic functionality in fully distributed environments. In many cases & which include protocols responsible for self-organization in large-scale systems and collaborative environments & it is useful if all nodes know thevalue of some aggregates continuously. In this paper we present and analyze novel protocols capable of providing this service. The proposed anti-entropy aggregation protocols compute different aggregates of component properties like extremal values, average and counting. Our protocols are inspired by the anti-entropy epidemic protocol where random pairs of databases periodically resolve their differences. In the case of aggregation, resolving difference is generalized to an arbitrary (numeric) computation based on the states of the two communicating peers. The advantage of this approach is that it is proactive and "democratic", which means it has no performance bottlenecks, and the approximation of the aggregates is present continuously at all nodes. These properties make our protocol suitable for implementing e.g. collective decision making or automatic system maintenance based on global information in a fully distributed fashion. As our main contribution we provide fundamental theoretical results on the proposed averaging protocol.