This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Overlay Subscription Network for Live Internet TV Broadcast
December 2006 (vol. 18 no. 12)
pp. 1711-1720
ASCII Text
x 
 
Ying Cai, Jianming Zhou, "An Overlay Subscription Network for Live Internet TV Broadcast," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 1711-1720, December, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2006.181,
author = {Ying Cai and Jianming Zhou},
title = {An Overlay Subscription Network for Live Internet TV Broadcast},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {18},
number = {12},
issn = {1041-4347},
year = {2006},
pages = {1711-1720},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.181},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - An Overlay Subscription Network for Live Internet TV Broadcast
IS - 12
SN - 1041-4347
SP1711
EP1720
EPD - 1711-1720
A1 - Ying Cai,
A1 - Jianming Zhou,
PY - 2006
KW - Overlay subscription networks
KW - overlay multicast
KW - video services
KW - live streaming.
VL - 18
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
We propose a framework, called Overlay Subscription Network (OSN), for live Internet TV broadcast, where a subscriber can choose to watch at any time. This framework allows the source server to incrementally build a topology graph that contains the network connections not only from the server to each subscriber, but also among the subscribers themselves. With such a topology graph in place, we consider efficient overlay multicast for scalable OSN services. We first show that idling nodes, which do not receive video data for their own playback, can actually be used for data forwarding to significantly reduce the cost of overlay multicast. In light of this observation, we then propose a novel overlay multicast technique that distinguishes itself from existing schemes with these three aspects. First, the proposed technique is centered on the topology graph and can take advantage of the actual network connections among the subscribing nodes. Second, the new scheme is able to find and incorporate appropriate idling nodes in multicast to reduce network traffic. Third, with our approach, a node can be used in multiple multicast trees for data forwarding to improve the overall system performance. We evaluate the performance of the proposed technique through simulation. Our extensive studies show that the proposed framework has the potential to enable the Internet, a vehicle up to date mainly for transferring text and image data, for large-scale and cost-effective TV broadcast.

[1] ftp://ftp.inr.ac.ru/ip-routingiputils-current.tar.gz , 2005.
[2] http://www.cquest.utoronto.ca/env/env421h/ energy computers.html, 2005.
[3] http://www.cs.bu.edu/britedownload.html, 2005.
[4] C. Buragohain, D. Agrawal, and S. Suri, “A Game Theoretic Framework for Incentives in P2P Systems,” Proc. Int'l Conf. Peer-to-Peer Computing, Sept. 2003.
[5] Y.-H. Chu, S.G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture,” Proc. ACM SIGCOMM, pp. 55-67, 2001.
[6] Y.-H. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS, pp. 1-12, June 2000.
[7] Y. Cui, B. Li, and K. Nahrstedt, “Asynchronous Streaming Multicast in Application-Layer Overlay Networks,” IEEE J. Selected Areas in Comm., special issue on recent advances in overlay networks, vol. 22, no. 1, pp. 91-106, Jan. 2004.
[8] A. Dan, D. Sitaram, and P. Shahabuddin, “Scheduling Policies for an On-Demand Video Server with Batching,” Proc. ACM Multimedia, pp. 15-23, Oct. 1994.
[9] C. Diot, B.N. Levine, B. lyles, H. Kassem, and D. Balensiefen, “Deployment Issues for the IP Multicast Service and Architecture,” IEEE Network Megazine, special issue on multicasting, vol.14, pp. 78-88, 2000.
[10] T.T. Do, K.A. Hua, and M. Tantaoui, “P2VoD: Providing Fault Tolerant Video-on-Demand Streaming in Peer-to-Peer Environment,” Proc. IEEE Int'l Conf. Comm. (ICC), June 2004.
[11] D.L. Eager, M.K. Vernon, and J. Zahorjan, “Minimizing Bandwidth Requirements for On-Demand Data Delivery,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 5, pp. 742-757, Sept./Oct. 2001.
[12] M. Feldman, K. Lai, I. Stoica, and J. Chuang, “Robust Incentive Techniques for Peer-to-Peer Networks,” Proc. ACM Conf. Electronic Commerce (EC '04), May 2004.
[13] C. Griwodz, M. Liepert, M. Zink, and R. Steinmetz, “Tune to Lambda Patching,” ACM Performance Evaluation Rev., vol. 27, no. 4, pp. 20-26, Mar. 2000.
[14] M. Guo and M.H. Ammar, “Scalable Live Video Streaming to Cooperative Clients Using Time Shifting and Video Patching,” Proc. IEEE INFOCOM, 2004.
[15] B. Horne, B. Pinkas, and T. Sander, “Escrow Services and Incentives in Peer-to-Peer Networks,” Proc. Third ACM Conf. Electronic Commerce, 2001.
[16] K.A. Hua, Y. Cai, and S. Sheu, “Exploiting Client Bandwidth for More Efficient Video Broadcast,” Proc. Int'l Conf. Computer Comm. and Networks, pp. 848-856, Oct. 1998.
[17] K.A. Hua, Y. Cai, and S. Sheu, “Patching: A Multicast Technique for True Video-on-Demand Services,” Proc. ACM Multimedia, pp.191-200, Sept. 1998.
[18] K.A. Hua and S. Sheu, “Skyscraper Broadcasting: A New Broadcasting Scheme for Metropolitan Video-on-Demand Systems,” Proc. ACM SIGCOMM, Sept. 1997.
[19] M. Kwon and S. Fahmy, “Topology-Aware Overlay Networks for Group Communication,” Proc. ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), pp. 127-136, 2002.
[20] M. Kwon and S. Fahmy, “Path-Aware Overlay Multicast,” Computer Networks, vol. 47, pp. 23-45, 2005.
[21] K. Lai, M. Feldman, I. Stoica, and J. Chuang, “Incentives for Cooperation in Peer-to-Peer Networks,” Proc. Workshop Economics of Peer-to-Peer Systems, 2003.
[22] B.B.S. Banerjee and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM, pp. 205-217, 2002.
[23] S. Sheu, K.A. Hua, and W. Tavanapong, “Chaining: A Generalized Batching Technique for Video-on-Demand,” Proc. IEEE Int'l Conf. Multimedia Computing and Systems, pp. 110-117, June 1997.
[24] D.A. Tran, K.A. Hua, and T.T. Do, “ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,” Proc. IEEE INFOCOM, 2003.
[25] P.C.V. Padmanabhan, H. Wang, and K. Sripanidkulchai, “Distributing Streaming Media Content Using Cooperative Networking,” Proc. ACM/IEEE Int'l Workshop Network and Operating Systems Support for Digital Audio and Video, pp. 177-186, 2002.
[26] S. Viswanathan and T. Imielinski, “Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting,” Multimedia Systems, vol. 4, no. 4, pp. 179-208, Aug. 1996.
[27] X. Xu, Y. Wang, S.P. Panwar, and K.W. Ross, “A Peer-to-Peer Video-on-Demand System Using Multiple Description Coding and Server Diversity,” Proc. IEEE Int'l Conf. Image Processing (ICIP), Oct. 2004.

Index Terms:
Overlay subscription networks, overlay multicast, video services, live streaming.
Citation:
Ying Cai, Jianming Zhou, "An Overlay Subscription Network for Live Internet TV Broadcast," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 12, pp. 1711-1720, Dec. 2006, doi:10.1109/TKDE.2006.181
Usage of this product signifies your acceptance of the Terms of Use.