The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Distributed prefetching scheme for random seek support in peer-to-peer streaming applications
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
A quicker way to discover nearby peers
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Advanced Scheme to Reduce IPTV Channel Zapping Time
APNOMS '07 Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services
Watching television over an IP network
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Modeling channel popularity dynamics in a large IPTV system
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Optimal prefetching scheme in P2P VoD applications with guided seeks
IEEE Transactions on Multimedia
On next-generation telco-managed P2P TV architectures
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Will IPTV ride the peer-to-peer stream? [Peer-to-Peer Multimedia Streaming]
IEEE Communications Magazine
Finding Good Partners in Availability-Aware P2P Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
OAZE: A network-friendly distributed zapping system for peer-to-peer IPTV
Computer Networks: The International Journal of Computer and Telecommunications Networking
Choosing partners based on availability in P2P networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Measurement study on P2P streaming systems
The Journal of Supercomputing
| Hi-index | 0.00 |
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P overlay network connecting the users. This significantly enhances the user experience by relieving the source from dealing with all connections. Yet, the joining process resulting in a peer to be integrated in channel overlay usually requires a significant amount of time. As a consequence, switching from one channel to another is far to be as fast as in IPTV solutions provided by telco operators. In this paper, we tackle the issue of efficient channel switching in P2P IPTV system. This is to the best of our knowledge the first study on this topic. First, we conducted and analyzed a set of measurements of one of the most popular P2P systems (PPlive). These measurements reveal that the set of contacts that a joining peer receives from the central server are of the utmost importance in the start-up process. On those neigbors, depends the speed to acquire the first video frames to play. We then formulate the switching problem, and propose a simple distributed algorithm, as an illustration of the concept, which aims at leveraging the presence of peers in the network to fasten the switch process. The principle is that each peer maintains as neighbors peers involved in other channels, providing peers with good contacts upon channel switching. Finally, simulations show that our approach leads to substantial improvements on the channel switching time. As our algorithmic solution does not have any prerequisite on the overlays, it appears to be an appealing add-on for existing P2P IPTV systems.