TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Journal of Systems and Software
NAT-resilient Gossip Peer Sampling
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
On hierarchical routing in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Improving QoS in bittorrent-like VoD systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the ACM SIGCOMM 2010 conference
How P2P streaming systems scale over time under a flash crowd?
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Public and private BitTorrent communities: a measurement study
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
The peer-to-peer trace archive: design and comparative trace analysis
Proceedings of the ACM CoNEXT Student Workshop
Peer Selection Strategies for Improved QoS in Heterogeneous BitTorrent-Like VoD Systems
ISM '10 Proceedings of the 2010 IEEE International Symposium on Multimedia
ChurnDetect: a gossip-based churn estimator for large-scale dynamic networks
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Toward efficient on-demand streaming with bittorrent
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
A performance study of BitTorrent-like peer-to-peer systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Peer-to-peer applications generate most of the Internet traffic and have become an important determining factor for upgrading Internet backbone capacity. It is thus important to assure that these systems attain high performance and deliver good quality of service to their users. Thus, apart from off-line analysis of traces, online mechanisms for estimating real-time changes of the network characteristics (i.e., network size, churn, failures, etc.) are needed to enable the design of adaptive algorithms. In this paper we focus on the problem of online detection of the flash-crowd phenomenon, defined as a sudden, unexpected increase in the number of peers requesting a piece of content. The main contribution of the paper is made out of two distributed algorithms that allow peers to detect flash-crowds, using a gossiping alike protocol. To the best of our knowledge, this is the first online detection method for the flash-crowd phenomenon. We base our algorithms on a modified version of gossiping, where peers are requested to periodically, asynchronously, reset their local mass variable. By using different reset values for the joining nodes, the algorithms create distributed network aggregates that reflect the sudden relative increase in network size (as part of FlashDetect algorithm) or the absolute network size (as part of TrackerNetSize algorithm). We analyze the performance of the proposed algorithms and perform extensive simulations to showcase their behavior on both synthetic data as well as real-world traces. The results show that our proposed solution performs very well in both cases, achieving high detection rates of the flash-crowd phenomenon within short time intervals while keeping the traffic load at a minimum. Additionally, the comparison with related work shows that TrackerNetSize achieves similar results with current state-of-the-art network size estimation algorithms, while making use of a significantly reduced assumption set (in particular, the peers do not have to be synchronized and, tracking the departing peers is not required).