The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Creating social networks to improve peer-to-peer networking
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Early experience with an internet broadcast system based on overlay multicast
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Can internet video-on-demand be profitable?
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding
IEEE Transactions on Parallel and Distributed Systems
Is There a Future for Mesh-Based live Video Streaming?
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
User interactions in social networks and their implications
Proceedings of the 4th ACM European conference on Computer systems
The Design and Deployment of a BitTorrent Live Video Streaming Solution
ISM '09 Proceedings of the 2009 11th IEEE International Symposium on Multimedia
AQCS: adaptive queue-based chunk scheduling for P2P live streaming
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Linear programming models for multi-channel P2P streaming systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
A DHT-Aided Chunk-Driven Overlay for Scalable and Efficient Peer-to-Peer Live Streaming
ICPP '10 Proceedings of the 2010 39th International Conference on Parallel Processing
Delay bounds of chunk-based peer-to-peer video streaming
IEEE/ACM Transactions on Networking (TON)
Understanding the impact of video quality on user engagement
Proceedings of the ACM SIGCOMM 2011 conference
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
In current peer-to-peer (P2P) live streaming systems, nodes in a channel form a P2P overlay for video sharing. To watch a new channel, a node depends on the centralized server to join in the overlay of the channel. The increase in the number of channels in today's live streaming applications triggers users' desire of watching multiple channels successively or simultaneously. However, the support of such watching modes in current applications is no better than joining in different channel overlays successively or simultaneously, which if widely used, poses heavy burden on the centralized server. In order to achieve higher efficiency and scalability, we propose a Social network-Aided efficient liVe strEaming system (SAVE). SAVE regards users' channel switching or multi-channel watching as interactions between channels. By collecting the information of channel interactions and nodes' interests and watching times, SAVE forms nodes in multiple channels with frequent interactions into an overlay, constructs bridges between overlays of channels with less frequent interactions, and enables nodes to identify friends sharing similar interests and watching times. Thus, a node can connect to a new channel while staying in its current overlay, using bridges or relying on its friends, reducing the need to contact the centralized server. Extensive experimental results from the PeerSim simulator and PlanetLab verify that SAVE outperforms other popular protocols in system efficiency and server load reduction.