Adaptive overlay topology for mesh-based P2P-TV systems
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
On the Optimal Scheduling of Streaming Applications in Unstructured Meshes
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Network Awareness in P2P-TV Applications
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
Scheduling in P2P Streaming: From Algorithms to Protocols
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
On the effects of overlay localization on P2P networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Push/pull protocols for streaming in P2P systems
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Scheduling P2P multimedia streams: can we achieve performance and robustness?
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
Quantifying operational cost-savings through ALTO-guidance for P2P live streaming
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
Topology control strategies on P2P live video streaming service with peer churning
Computer Communications
A delay-based aggregate rate control for P2P streaming systems
Computer Communications
Multimedia Tools and Applications
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
Towards efficient video chunk dissemination in peer-to-peer live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at the peers to select the chunk to distribute and the destination neighboring peer. Recent work showed that a good strategy consists in selecting the latest received chunk and a random neighboring peer (latest useful chunk, random peer). In this paper, leveraging on the idea that it is convenient to favor those peers that can contribute the most to the chunk distribution, we propose to select the destination peer with a probability proportional to the peer upload bandwidth. We show that the proposed scheme has a limited sensitivity to cheating peers that maliciously declare higher bandwidth than they actually have. Considering the overlay topology, we evaluate both systems in which nodes have fixed degree and systems whose overlay setup takes into account the actual peer bandwidth by assigning more neighbors to peer with higher bandwidth. We evaluate the performance in terms of delay percentiles and loss probability and evaluate the achieved improvements. Simulation results considering scenarios with upto 10,000 peers shows that the proposed schemes significantly outperform the traditional ones, so that the chunk distribution delay drops to less than 2s from about 12s.