Elements of information theory
Elements of information theory
Scalable feedback control for multicast video distribution in the Internet
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Estimating network size from local information
Information Processing Letters
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Practical summation via gossip
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Journal of Systems and Software
The promise, and limitations, of gossip protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Gossiping on MANETs: the beauty and the beast
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
MuON: Epidemic based mutual anonymity in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the 6th workshop on Middleware for network eccentric and mobile applications
HRS: A Hybrid Replication Strategy for Exhaustive P2P Search
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
A Practical Approach to Network Size Estimation for Structured Overlays
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Maintaining replicas in unstructured P2P systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Fast summation via sampling in large-scale sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
ACM SIGOPS Operating Systems Review
Estimation of a population size in large-scale wireless sensor networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Proceedings of the Fifth Workshop on Programming Languages and Operating Systems
Two algorithms for network size estimation for master/slave ad hoc networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Achieving and maintaining cost-optimal operation of a hierarchical DHT system
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
PINTS: peer-to-peer infrastructure for tagging systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
An empirical analysis of serendipitous media sharing among campus-wide wireless users
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Estimating and sampling graphs with multidimensional random walks
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Asynchronous peer-to-peer data mining with stochastic gradient descent
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Improving multi-view peer-to-peer live streaming systems with the divide-and-conquer strategy
Computer Networks: The International Journal of Computer and Telecommunications Networking
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on Computing
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
A Bayesian approach for user aware peer-to-peer video streaming systems
Image Communication
Characterizing continuous time random walks on time varying graphs
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
Efficient and secure decentralized network size estimation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Gossip-Based counting in dynamic networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Self-adaptive approximate queries for large-scale information aggregation
International Journal of Web and Grid Services
Distributed online flash-crowd detection in P2P swarming systems
Computer Communications
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
Decentralized monitoring in peer-to-peer systems
Benchmarking Peer-to-Peer Systems
Gossip-based density estimation in dynamic heterogeneous wireless sensor networks
International Journal of Autonomous and Adaptive Communications Systems
Reliable and Timely Event Notification for Publish/Subscribe Services Over the Internet
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this article we address the problem of counting the number of peers in a peer-to-peer system, and more generally of aggregating statistics of individual peers over the whole system. This functionality is useful in many applications, but hard to achieve when each node has only a limited, local knowledge of the whole system. We propose two generic techniques to solve this problem. The Random Tour method is based on the return time of a continuous time random walk to the node originating the query. The Sample and Collide method is based on counting the number of random samples gathered until a target number of redundant samples are obtained. It is inspired by the "birthday paradox" technique of [6], upon which it improves by achieving a target variance with fewer samples. The latter method relies on a sampling sub-routine which returns randomly chosen peers. Such a sampling algorithm is of independent interest. It can be used, for instance, for neighbour selection by new nodes joining the system. We use a continuous time random walk to obtain such samples. We analyse the complexity and accuracy of the two methods. We illustrate in particular how expansion properties of the overlay affect their performance.