Stability of Data Networks: Stationary and Bursty Models
Operations Research
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
P2P IPTV measurement: a case study of TVants
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Gossiping With Multiple Messages
IEEE Transactions on Information Theory
Flow control for cost-efficient peer-to-peer streaming
INFOCOM'10 Proceedings of the 29th conference on Information communications
Reciprocity and barter in peer-to-peer systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal server scheduling in hybrid P2P networks
Performance Evaluation
On the stability and optimality of universal swarms
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the stability and optimality of universal swarms
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Learning the graph of epidemic cascades
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Modeling and performance analysis of pull-based live streaming schemes in Peer-to-Peer network
Computer Communications
| Hi-index | 0.00 |
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several network models and for each model we identify schemes that achieve successful diffusion of data at optimal rates. For edge-capacitated networks, we show optimality of the so-called ''random-useful'' packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph. For node-capacitated networks, assuming a complete communication graph, we show optimality of the so-called ''most-deprived'' neighbour selection scheme combined with random useful packet selection. We then show that optimality is preserved when each peer can exchange data with a limited number of neighbours, when neighbourhoods are dynamically adapted according to a particular scheme. Finally, we consider the case of multiple information sources, each creating distinct information to be disseminated to a specific set of receivers. In this context, we prove optimality of the so-called ''bundled most-deprived neighbour random useful packet'' selection.