This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
April 2008 (vol. 19 no. 4)
pp. 503-514
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexibility and readily deployable nature. On-demand streaming with asynchronous requests, and in general, with VCR-like interactions, nevertheless remains a challenging task in overlay networks. In this paper, we introduce the Dynamic Skip List (DSL), a novel randomized and distributed structure that inherently accommodates dynamic and asynchronous clients. We establish the theoretical foundations of the DSL and demonstrate a practical DSL-based streaming overlay. In this overlay, the costs for typical operations, including join, leave, fast-forward, rewind, and random-seek are all sub-linear to the client population. The model also seamlessly integrates a smart data scheduling algorithm using linear network coding, yielding fast and robust downloading from multiple suppliers. Our simulation results show that the DSL-based overlay is highly scalable. It delivers reasonably smooth playback with diverse client interactivities, while keeping the computation and bandwidth overheads low.

[1] R. Ahlswede, N. Cai, S. Li, and R. Yeung, “Network Information Flow,” IEEE Trans. Information Theory, vol. 46, pp. 1204-1216, July 2000.
[2] K. Almeroth and M.H. Ammar, “The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service,” IEEE J. Selected Areas in Comm., vol. 14, no. 6, pp. 1110-1122, Aug. 1996.
[3] J. Aspnes and G. Shah, “Skip Graphs,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), Jan. 2003.
[4] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, Aug. 2002.
[5] M. Castro, P. Drushel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: High-Bandwidth Multicast in Cooperative Environments,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[6] Y. Chu, S. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS '00, June 2000.
[7] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[8] Y. Cui, B. Li, and K. Nahrstedt, “oStream: Asynchronous Streaming Multicast in Application-Layer Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 91-106, Jan. 2004.
[9] H. Deshpande, M. Bawa, and H. Garcia-Molina, “Streaming Live Media over Peer-to-Peer Network,” technical report, Stanford Univ., 2001.
[10] T. Do, K. Hua, and M. Tantaoui, “P2VoD: Providing Fault Tolerant Video-on-Demand Streaming in Peer-to-Peer Environment,” Proc. IEEE Int'l Conf. Comm. (ICC '04), June 2004.
[11] C. Gkantsidis and P. Rodriguez, “Network Coding for Large Scale Content Distribution,” Proc. IEEE INFOCOM '05, Mar. 2005.
[12] Y. Guo, K. Suh, J. Kurose, and D. Towsley, “P2Cast: Peer-to-Peer Patching Scheme for VoD Service,” Proc. 12th Int'l World Wide Web Conf. (WWW '03), May 2003.
[13] N. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS '03), Mar. 2003.
[14] T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference and Predication. Springer, 2001.
[15] M. Hefeeda and B. Bhargava, “On-Demand Media Streaming over the Internet,” Proc. Ninth IEEE Int'l Workshop Future Trends of Distributed Computing Systems (FTDCS '03), May 2003.
[16] T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, “The Benefits of Coding over Routing in a Randomized Setting,” Proc. IEEE Int'l Symp. Information Theory (ISIT '03), June 2003.
[17] A. Hu, “Video-on-Demand Broadcasting Protocols: A Comprehensive Study,” Proc. IEEE INFOCOM '01, Apr. 2001.
[18] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[19] Z. Li, B. Li, D. Jiang, and L. Lau, “On Achieving Optimal Throughput with Network Coding,” Proc. IEEE INFOCOM '05, Mar. 2005.
[20] W. Liao and V. Li, “The Split and Merge Protocol for Interactive Video-on-Demand,” IEEE Multimedia, vol. 4, no. 4, pp. 51-62, Oct. 1997.
[21] H. Ma, K. Shin, and W. Wu, “Best-Effort Patching for Multicast True VoD Service,” Kluwer Multimedia Tools and Applications, vol. 26, no. 1, pp. 101-122, 2005.
[22] M. Medard, S. Acedanski, S. Deb, and R. Koetter, “How Good Is Random Linear Coding Based Distributed Networked Storage,” Proc. First Workshop Network Coding, Theory, and Applications (NETCOD '05), Apr. 2005.
[23] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[24] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, “Distributing Streaming Media Content Using Cooperative Networking,” Proc. 12th Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV '02), May 2002.
[25] W. Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees,” Comm. ACM, vol. 33, no. 6, pp. 668-676, June 1990.
[26] D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks,” Proc. ACM SIGCOMM '04, Aug. 2004.
[27] R. Rejaie and A. Ortega, “PALS: Peer-to-Peer Adaptive Layered Streaming,” Proc. 13th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '03), June 2003.
[28] P. Rodriguez, C. Gkantsidis, and J. Miller, “Comprehensive View of a Live Network Coding P2P System,” Proc. ACM/Usenix Internet Measurement Conf. (IMC '06), Oct. 2006.
[29] H. Shojania and B. Li, “Parallelized Progressive Network Coding with Hardware Acceleration,” Proc. 15th IEEE Int'l Workshop Quality of Service (IWQoS '07), June 2007.
[30] D. Tran, K. Hua, and T. Do, “A Peer-to-Peer Architecture for Media Streaming,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 121-133, Jan. 2004.
[31] Y. Wang, J. Ostermann, and Y.-Q. Zhang, Video Processing and Communications. Prentice Hall, 2001.
[32] M. Wang and B. Li, “How Practical Is Network Coding,” Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS '06), June 2006.
[33] B. Wildemuth, G. Marchionini, M. Yang, G. Geisler, T. Wilkens, A. Hughes, and R. Gruss, “How Fast Is Too Fast? Evaluating Fast Forward Surrogates for Digital Video,” Proc. Joint Conf. Digital Libraries (JCDL '03), May 2003.
[34] H. Yin, C. Lin, F. Qiu, and D. Wu, “TrustStream: A Novel Secure and Scalable Media Streaming Architecture,” Proc. 13th ACM Int'l Conf. Multimedia (Multimedia '05), Nov. 2005.
[35] E. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM '96, Mar. 1996.
[36] X. Zhang, J. Liu, B. Li, and T.-S.P. Yum, “CoolStreaming/DoNet: A Data-Driven Overlay Network for Peer-to-Peer Live Media Streaming,” Proc. IEEE INFOCOM '05, Mar. 2005.
[37] M. Zhou and J. Liu, “Tree-Assisted Gossiping for Overlay Video Distribution,” Kluwer Multimedia Tools and Applications, 2005.
[38] Y. Zhu, B. Li, and J. Guo, “Multicast with Network Coding in Application Layer Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 107-120, Jan. 2004.

Index Terms:
Applications, Protocol architecture
Citation:
Dan Wang, Jiangchuan Liu, "A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 4, pp. 503-514, April 2008, doi:10.1109/TPDS.2007.70748
Usage of this product signifies your acceptance of the Terms of Use.