Analysis of bittorrent-like protocols for on-demand stored media streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Revisiting multimedia streaming in mobile ad hoc networks
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
On workload merging and filtering effects in hierarchical wireless media streaming
Proceedings of the 4th ACM workshop on Wireless multimedia networking and performance modeling
Peer-assisted on-demand streaming of stored media using BitTorrent-like protocols
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Data caching in selfish MANETs
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Insights on media streaming progress using BitTorrent-like protocols for on-demand streaming
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Ad-hoc overlay networks are increasingly used for sharing static bulk content but their promise for scaling the delivery of on-demand, realtime content is yet to be tapped. In this paper, we show that overlay networks could be used ef.ciently to distribute popular real-time streaming media on-demand to a large number of clients. We propose and evaluate OSMOSIS a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. OSCMOSIS is fully distributed, scalable, and ef.cient in terms of network link costs. We present analytical and empirical results of our evaluation of OSMOSIS. Our analysis establishes OSMOSIS scalability characteristics under a variety of assumptions. Our simulations are over large, synthetic random networks, power-law degree networks, and small-world networks (all of which could well be representative of ad-hoc overlay topologies, as well as over large real router-level Internet maps.