支援低暫存空間與有限使用者頻寬之有效率熱門影片廣播法研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：7

、訪客IP：3.148.115.2

姓名

楊宏昌(Hung-Chang Yang) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

支援低暫存空間與有限使用者頻寬之有效率熱門影片廣播法研究
(Efficient Hot-Video Broadcasting with Small Buffer Demand and Limited Client Bandwidth)

相關論文

★ 整合多樣配置組態下的藍芽射頻驗證系統	★ 具檔案敘述相關語查詢之智慧型檔案搜尋系統
★ 具遲到者支援功能之網際網路簡報系統	★ 以快速廣播法建構熱門視訊隨選服務伺服器
★ 具事件同步再現特性之遠程電傳展示伺服器	★ 無線網路環境下之廣播資訊快速下載
★ 中文網站繁簡互訪協助系統	★ 支援時光平移播放之調適性現場直播演算法
★ 用於互動式廣播之段落對齊法	★ 熱門影片廣播法之影片區段復原機制
★ 配合熱門影片廣播的本地伺服器高效快取法	★ 一個增進SIP在防火牆環境中應用的協同模組
★ 考量網頁熱門度之一致性雜湊法解決網頁代理伺服器之負載平衡	★ 以網域名稱伺服器為基礎之色情網站過濾系統
★ 使用熱門廣播法及支援點對點傳輸之影音內容傳遞網路	★ 變動頻寬平滑化之熱門廣播演算法

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

隨著寬頻網路技術的進步與處理器及儲存空間的成長，隨選視訊 (video-on-demand) 服務越來越受使用者歡迎。然而，建立一個有成本效益、健全且擴充性強的隨選視訊串流系統仍然有許多挑戰。例如：目前流行的高畫質影片，其龐大的檔案容量與高速的頻寬需求，還有影片即時性的需求都會增加系統建置的成本。因此，許多基於影片區塊切割的廣播法 (segment based broadcasting schemes) 被提出來解決此問題。大多數這類演算法都注重在減少使用者的等待時間，而這些演算法通常都需要使用者端同時從所有的頻道接收影片區塊，造成使用者端需要大量的頻寬需求以及大量的暫存空間，因而讓使用者端的成本增加。
為了解決此問題，我們首先在此論文中提出一個基本的階梯和諧廣播法 (staircase-harmonic broadcasting scheme)，此演算法整合了階梯與和諧兩個演算法的特性達到較短使用者等待時間與較低使用者暫存空間的需求。接者，此論文更進一步提出調適性階梯和諧廣播法 (adaptive staircase-harmonic broadcasting scheme)，在保證某個使用者等待時間情形下，能夠有效率的協調利用伺服器頻寬、使用者暫存空間及使用者頻寬三項資源。當使用者端的暫存空間與頻寬不做額外限制時，此演算法只需使用者端有25%影片大小的暫存空間，並且使用者的等待時間只會比和諧廣播法較長一些，其中和諧廣播法已被證明為需求最短使用者的等待時間。跟快速廣播法 (fast broadcasting)、遞迴頻率切割廣播法 (recursive frequency splitting) 與和諧廣播法比較，此演算法能夠分別降低使用者暫存空間50%、33%與33%的需求量。當使用者端的暫存空間與頻寬有限制時，此演算法需求使用者的等待時間會比使用者為中心考量演算法 (client-centric approach)、貪婪節省磁碟廣播法 (greedy disk-conserving broadcasting) 與階梯廣播法還要短。例如：伺服器端的頻寬為十倍影片傳送速度、使用者頻寬需求為三倍影片傳送速度以及使用者暫存空間需求為25%影片大小，則所提演算法所需使用者的等待時間會分別比這些演算法低87%、87%與20%。
此論文還提出調適性有效率和諧廣播法 (adaptive efficient harmonic broadcasting scheme) 來說明如何調整和諧廣播法的影片區塊切割與分配，以做到符合使用者端頻寬與暫存空間的限制條件。此演算法能更有效率的協調利用伺服器頻寬、使用者暫存空間及使用者頻寬三項資源，並進一步地需求較短的使用者等待時間。由於使用者等待時間即為一個影片區塊的存取時間，如果一個影片能夠切割越多的區塊，則能夠有越短的使用者等待時間需求。當伺服器端的頻寬為十倍影片傳送速度、使用者頻寬需求為三倍影片傳送速度以及使用者暫存空間需求為25%影片大小，此演算法能夠切割成6485個區塊。相對的，調適性階梯和諧廣播法、限制使用者資源演算法 (limited client capability broadcasting)、使用者為中心考量演算法與貪婪節省磁碟廣播法只能切割成1151、364、169與161個區塊。由此可知，調適性有效率和諧廣播法能比這些演算法大大的提升效能。
調適性階梯和諧廣播法以及調適性有效率和諧廣播法的不同處為：調適性有效率和諧廣播法有較好的效能，但是調適性階梯和諧廣播法較為簡單容易計算，能夠快速的獲得影片所需要的廣播排程方式。

摘要(英)

With the advancement of broadband networking technology, and the growth of processor speed and storage capacity, Video-on-Demand (VoD) service is getting increasingly popular among users. However, there are still many challenges towards building cost-effective, robust and scalable VoD streaming systems due to the huge size, high bandwidth and delay requirements for video streaming. Hence, segment based broadcasting schemes are proposed to solve the problems. Many significant broadcasting schemes are proposed to reduce the client waiting time. However, these schemes usually require clients to receive video segments altogether from all channels. This disregard not only needs a lot of client bandwidth, but also incurs more client buffer space.
To escape from these constraints, in this dissertation, we first propose the basic staircase-harmonic broadcasting (SHB) scheme, which integrates harmonic broadcasting (HB) and staircase broadcasting (SB) schemes to obtain the strengths of small client waiting time and low client buffer space. Furthermore, this dissertation proposes adaptive staircase-harmonic broadcasting (ASHB) scheme, which goal is to guarantee a maximum client waiting time and effectively utilize other three resources: the number of dedicated server bandwidth, the client buffer space and the client bandwidth. When client buffer space and bandwidth are not constrained, the scheme requires a client to buffer only 25% of a playing video and the maximum waiting time is slightly higher than that of HB scheme, which provides a theoretical lower bound. In comparison with fast broadcasting (FB), recursive frequency splitting (RFS), and HB schemes, ASHB scheme saves the buffer space by 50%, 33%, and 33%. If client buffer space and bandwidth are constrained, ASHB scheme has the smallest client waiting time than client-centric approach (CCA), greedy disk-conserving broadcasting (GDB) and SB schemes. For example, at a server bandwidth of ten times the video playback rate, a client bandwidth of triple the playback rate, and a client buffer of 25% of the video size, ASHB has 87%, 87%, and 20% lower waiting time than CCA, GDB, and SB.
Furthermore, this dissertation propose a broadcasting scheme, called adaptive efficient harmonic broadcasting (AEHB) scheme, to show how to adjust the division and assignment of segments for HB scheme to meet the constraints of client bandwidth and client buffer space. AEHB scheme can effectively offers a tradeoff among three resources: the number of dedicated server bandwidth, the client buffer space and the client bandwidth, and further gives a smaller maximum client waiting time. Since the maximum client waiting time is equal to the access time of a segment, the larger number of segments a video program can divide can lead to a smaller client waiting time. Given server bandwidth of ten times the video playback rate, client bandwidth of triple the video playback rate, and a client buffer 25% of the video size, AEHB scheme can divide the video program into 6485 segments, while ASHB, limited client capability broadcasting (LCCB), CCA and GDB schemes can divide the video program into 1151, 364, 169 and 161 segments respectively. AEHB scheme can great outperforms than other schemes.
The difference between ASHB and AEHB schemes is: AEHB scheme has better performance than ASHB scheme, but ASHB scheme is much simpler to compute, so that it can easily get the broadcast schedule.

關鍵字(中)

★ 電纜線網路
★ 隨選視訊
★ 熱門影片廣播法
★ 低暫存空間
★ 有限使用者頻寬
★ 調適性階梯和諧廣播法
★ 調適性有效率和諧廣播法

關鍵字(英)

★ cable network
★ video-on-demand
★ hot-video broadcasting
★ small buffer demand
★ limited client bandwidth
★ adaptive staircase-harmonic broadcasting scheme
★ adaptive efficient harmonic broadcasting scheme

論文目次

摘要……………………………………………………………………………………….... i
Abstract…………………………………………………………………………………….iii
Acknowledgements………………………………………………………………………....v
Table of Contents…………………………………………………………………………..vi
List of Figures…………………………………………………………………………….viii
List of Tables…………………………………………………………………….................xi
1. Introduction………………………………………………………………………………1
2. Related Works……………………………………………………………………………8
2.1 Overview of the Segment Based Broadcasting Schemes...………………………....10
2.1.1 Client Waiting Time vs. Server Bandwidth..…………………………………...11
2.1.2 Buffer and Bandwidth Requirements at Client End…………………….……...13
2.1.3 Other Issues………………………...….……………………………………….16
2.2 Details of Both Buffer and Bandwidth Constrained Schemes……………………...19
2.2.1 Buffer and Bandwidth Constrained Schemes...……………………………..….20
2.2.2 Harmonic Broadcasting Scheme…..........…………………………...…………28
2.2.3 Staircase Broadcasting Scheme…..........…..………………………...…………32
3. Adaptive Staircase-Harmonic Broadcasting Scheme…………………………………...37
3.1 Basic Staircase-Harmonic Broadcasting Scheme………………………..………….37
3.1.1 Continuity Verification…..…..…………………………………...…………….40
3.1.2 Client Waiting Time vs. Server Bandwidth………………….…...…………….40
3.1.3 Client Buffer Requirements…………….………………………...…………….41
3.1.4 Client Bandwidth vs. Client Waiting Time………………….........…………….45
3.2 Adaptive Staircase-Harmonic Broadcasting Scheme………………..……………...46
3.2.1 Continuity Verification…………………………………………...…………….50
3.2.2 Client Waiting Time vs. Server Bandwidth………………….…...…………….51
3.2.3 Client Buffer Requirements…………….………………………...…………….51
3.2.4 Client Bandwidth vs. Client Waiting Time………………….........…………….53
4. Adaptive Efficient Harmonic Broadcasting Scheme…………………...………..……...57
4.1 AEHB Scheme with Constrained Client Bandwidth……………….…...…………..57
4.2 AEHB Scheme with Constrained Client Buffer…………………………...………..61
4.3 Client Buffer Space vs. Client Waiting Time…..……………………….....………..66
4.4 Client Bandwidth vs. Client Waiting Time…..………………………….....………..68
4.5 Constrained Client Buffer and Bandwidth vs. Client Waiting Time…..…………....71
5. Conclusions…………………………………………………..…………………………74
References…………………………………………………………………………………77

參考文獻

[1] “ITFacts WWW, Video on demand to generate $12.6 bln by 2006,” [Online]. Available: www.itfacts.biz/index.php?id=P7362.
[2] “Clickzstats, Trends & Statistics: The Web’s Richest Source,” [Online]. Available: www.clickz.com/showPage.html?page=3360511.
[3] Chris Forrester, “European HDTV arrives,” IEE Communications Engineer, pp. 10, Feb/Mar 2006.
[4] T. D. C. Little and D. Venkatesh, “Prospects for interactive video on demand,” IEEE Journal of Selected Areas on Communications, vol. 14, pp. 1099-1109, Aug. 1996.
[5] Asit Dan, Dinkar Sitaram, Perwez Shahabuddin, “Dynamic batching policies for an on-demand video server,” Multimedia Systems, vol. 4, no. 3, pp. 112–121, June 1996.
[6] L.S. Juhn and L.M. Tseng, “Fast data broadcasting and receiving scheme for popular video services,” IEEE Transactions on Broadcasting, vol. 44, no. 1, pp. 100-105, Mar 1998.
[7] Yu-Chee Tseng, Ming-Hour Yang and Chi-He Chang, “A Recursive Frequency-Splitting Scheme for Broadcasting Hot Videos in VOD Service”, IEEE Transactions on Communications, vol. 50, issue:8, pp. 1348-1355, Aug 2002.
[8] L.S. Juhn and L.M. Tseng, “Harmonic broadcasting for video-on-demand service,” IEEE Transactions on Broadcasting, vol. 43, no. 3, pp. 268-271, Sep 1997.
[9] L.S. Juhn and L.M. Tseng, “Staircase data broadcasting and receiving scheme for hot video service,” IEEE Transactions on Consumer Electronics, vol. 43, no. 4, pp. 1110-1117, Nov 1997.
[10] Ying Cai, Kien A. Hua and Simon Sheu, “Leverage client bandwidth to improve service latency of distributed multimedia applications,” Journal of Applied Systems Studies, 2(3), 2001
[11] Lixin Gao, Jim Kurose, and Don Towsley, “Efficient schemes for broadcasting popular videos,” Multimedia Systems, vol. 8, pp. 284-294, 2002.
[12] K. C. Almeroth and M. H. Ammar, “The use of multicast delivery to provide a scalable and interactive video-on-demand service,” IEEE Journal on Selected Areas in Communications, 14(50):1110-1122, Aug. 1996.
[13] S. Viswanathan and T. Imielinski, “Pyramid broadcasting for video on demand service,” in Proceedings of IEEE Multimedia Computing and Networking Conference, vol. 2417, pp. 66-77, San Jose, California, 1995.
[14] J. F. Paris, S. W. Carter and D. D. E. Long, “A hybrid broadcasting protocol for video on demand,” Proceedings of Multimedia Computing and Networking Conference (MMCN), pp. 317-326, 1999.
[15] J-F. Paris, “A simple low bandwidth broadcasting protocol for video on demand,” Proc. 7th Int. Conf. on Computer Communications and Networks, pp. 690-697, Oct 1999.
[16] A. Bar-Noy and E. Ladner, “Windows scheduling problems for broadcast systems,” SIAM Journal of Computing, vol. 32, no. 4, pp. 1091-1113, 2003.
[17] J. P. Sheu, H. L. Wang, C. H. Chang and Y. C. Tseng,” A fast video-on-demand broadcasting scheme for popular videos,” IEEE Transactions on Broadcasting, vol. 50, no. 2, pp. 120-125, June 2004.
[18] J-F. Paris, “A fixed-delay broadcasting protocol for video-on-demand,” Proc. of Int’l Conf. on Computer Communications and Networks, pp. 418-423, 2001.
[19] Z.-Y. Yang, L.-S. Juhn, and L.-M. Tseng, “On Optimal Broadcasting Scheme for Popular Video Service,” IEEE Transactions on Broadcasting, vol. 45, no. 3, pp. 318-322, September 1999.
[20] J.-F. Paris, S. W. Carter, and D.D. E. Long, “Efficient broadcasting protocols for video on demand,” in Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Montreal, Canada, pp. 127-132, July 1998.
[21] L.S. Juhn and L.M. Tseng, “Enhanced harmonic data broadcasting and receiving scheme for popular video service,” IEEE Transactions on Consumer Electronics, vol. 44, pp. 343-346, 1998.
[22] J-F. Paris, S. W. Carter, and D. D. E. Long, “A low bandwidth broadcasting protocol for video on demand,” Proc. Int’l Conf. on Computer Communications and Networks, pp. 690-697, Oct. 1998.
[23] Ailan Hu, “Video-on-Demand Broadcasting Protocols: A Comprehensive Study,” IEEE INFOCOM, pp. 508-517, 2001.
[24] K. A. Hua and S. Sheu, “An efficient periodic broadcast technique for digital video libraries,” Journal of Multimedia Tools and Applications, 5, pp. 1-20, 1998.
[25] Satish Chand and Hari Om, “Modified staircase data broadcasting scheme for popular videos,” IEEE Trans. on Broadcasting, vol. 48, no. 4, pp. 274-280, Dec. 2002.
[26] Hung-Chang Yang, Hsiang-Fu Yu, Li-Ming Tseng and Yi-Ming Chen, “An efficient staircase-harmonic scheme for broadcasting popular videos,” IEEE Communications and Networking Conference (CCNC), pp. 122-127, Las Vegas, Nevada, USA, 3-6 Jan. 2005.
[27] J-F. Paris and D. D. E. Long, “Limiting the user bandwidth of broadcasting protocols for video-on-demand”, Proc. Euromedia conf., May 2000.
[28] J-F. Paris and D. D. E. Long, “A proactive implementation of interactive video-on-demand,” Proc. of IPCCC Conf., Apr. 2003.
[29] Anirban Mahanti, Derek L. Eager, Mary K. Vernon and David Sundaram-Stukel, “Scalable On-Demand Media Streaming with Packet Loss Recovery,” IEEE Trans. on Networking, vol. 11, no. 2, pp. 195-209, April 2003.
[30] Hsiang-Fu Yu, Hung-Chang Yang and Li-Ming Tseng, “Reverse fast broadcasting (RFB) for video-on-demand applications,” IEEE Transactions on Broadcasting, vol. 53, no. 1, pp. 103-111, March 2007.
[31] Hsiang-Fu Yu, “Hybrid broadcasting with small buffer demand and waiting time for video-on-demand applications,” IEEE Transactions on Broadcasting, vol. 54, no. 2, pp. 304-311, June 2008.
[32] Hsiang-Fu Yu, Ying-Nan Chen, Hung-Chang Yang, Zeng-Yuan Yang and Li-Ming Tseng, “An efficient scheme for broadcasting popular videos at low buffer demand,” Computer Communications, vol. 31, no. 10, pp. 2270-2279, June 2008.
[33] Hsiang-Fu Yu, Hung-Chang Yang, Chu-Yi Chien and Yao-Tien Wang, “A limited-client-capability broadcasting scheme for vod applications,” International Conference on Networking (ICN), pp. 192-196, Cancun, Mexico, 13-18 April 2008.
[34] Eundon Song, Hongik Kim and SungKwon Park, “Fast patching scheme for video-on-demand service,” Proceedings of Asia-Pacific Conference on Communications (APCC), Oct. 2007.
[35] Taesoo Kim, Hongik Kim and SungKwon Park, “A hybrid multicast patching method using staircase scheme for vod broadcasting,” Proceedings of IEEE Region 10 Conference (TENCON), 2007.
[36] Yong-Hwan Shin, Seong-Min Joe and Sung-Kwon Park, “A simple and bandwidth efficient staggered broadcasting protocol for hot videos in vod service,” International Conference on Information, Communications and Signal Processing (ICICS), Dec. 2007.
[37] Hee Jeong, Jong-woo Hong, Eun-jo Lee and Sung-kwon Park, “Simple architecture and performance efficient reverse fast staggered broadcasting scheme for video-on-demand systems,” International Symposium on Consumer Electronics (ISCE), April 2008.
[38] Sang-Seok Jung, Joo-Han Lee and Sung-Kwon Park, “Poly harmonic staggered broadcasting method for efficient video on demand service,” IEEE Symposium on Object Oriented Real-Time Distributed Computing (ISORC), May 2008.
[39] D. Saparilla, K. Ross, and M. Reisslein, “Periodic broadcasting with VBR-encoded video,” IEEE INFOCOM 1999, pp 464-471, 1999.
[40] F. Li, and I. Nikolaidis, “Trace-adaptive fragmentation for periodic broadcasting of VBR video,” in Proceedings of 9th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV’99), June 1999.
[41] J. F. Paris, “A broadcasting protocol for compressed video,” in Proceedings of Euromedia’99 Conference, Munich, Germany, pp 78-84, Apr 1999.
[42] I. Nikolaidis, F. Li and A. Hu, “An Inherently Loss-Less and Bandwidth-Efficient Periodic Broadcast Scheme for VBR Video,” in Proceedings of ACM SIGMETRICS, 2000.
[43] Hung-Chang Yang, Hsiang-Fu Yu, Li-Ming Tseng and Yi-Ming Chen, “Fast and lossless broadcasting schemes for VBR-encoded hot videos,” IEEE International Conference on Networks (ICON), pp. 165-169, Singapore, 16-19 Nov. 2004.
[44] Hsiang-Fu Yu, Hung-Chang Yang, Li-Ming Tseng and Yi-Ming Chen, “The enhanced staircase broadcasting for VBR videos,” Computer Communications, vol. 28, no. 17, pp. 1903-1909, 17 Oct. 2005.
[45] Hung-Chang Yang, Hsiang-Fu Yu, Zeng-Yuan Yang, Li-Ming Tseng and Yi-Ming Chen, “A live harmonic broadcasting scheme for VBR-encoded hot videos,” Lecture Notes in Computer Science, vol. 3970, pp. 236-246, 2006.
[46] Hsiang-Fu Yu, Hung-Chang Yang, Yi-Ming Chen, Li-Ming Tseng and Chen-Yi Kuo, “Smooth Fast Broadcasting (SFB) for Compressed Videos,” Lecture Notes in Computer Science, 2957, pp. 272-283, Jan. 2004.
[47] Hsiang-Fu Yu, Hung-Chang Yang, Pin-Han Ho, Yi-Ming Chen and Li-Ming Tseng, “A smooth broadcasting scheme for VBR-encoded hot videos,” Computer Communications, vol. 29, no. 15, pp. 2904-2916, 5 September 2006.
[48] Jin B. Kwon and Heon Y. Yeom, “Providing VCR Functionality in Staggered Video Broadcasting,” IEEE Transactions on Consumer Electronics, vol. 48, issue:1, pp. 41-48, Feb 2002.
[49] Yiu-Wing Leung and Tony K. C. Chan, “Design of an Interactive Video-on-Demand System,” IEEE Transactions on Multimedia, vol. 5, no. 1, pp. 130-140, Mar 2003.
[50] J.-F. Paris, “An Interactive Broadcasting Protocol for Video-on-Demand,” Proceedings of the 20th IEEE International Performance, Computing, and Communications Conference (IPCCC 2001), Phoenix, AZ, Apr. 2001, pages 347-353.
[51] Mounir A. Tantaoui, Kien A. Hua and Simon Sheu, “Interaction with Broadcast Video,” Proceedings of the 10th ACM International Conference on Multimedia, pp. 29-38, Dec 2002.
[52] Shu-Zhe Weng, Simon Sheu and Jun-Yi Li, “A Cost-Effective Interactive Broadcasting Protocol for Media Streaming,” Proceedings of the National Computer Symposium, vol. D, pp. 115-122, Dec 2001.
[53] Hung-Chang Yang, Hsiang-Fu Yu, Li-Ming Tseng and Yi-Ming Chen, “A segment-alignment interactive broadcasting scheme,” IEEE International Conference on Advanced Communication Technology (ICACT), pp. 1040-1045, Phoenix Park, Korea, 9-11 Feb. 2004.
[54] 楊政遠, 陳奕明, 曾黎明, 游象甫 and 翁志達, “Data Stream Broadcasting with Live program support,” Proceedings of TANet Conference, Oct. 2001.
[55] Hung-Chang Yang, Hsiang-Fu Yu and Li-Ming Tseng, “Adaptive Live Broadcasting for Highly-Demand Videos,” Journal of Information Science and Engineering, vol. 19, no. 3, pp. 531-549, May 2003.
[56] Y. C. Tseng, M. H. Yang, C. M. Hsieh, W. H. Liao and J. P. Sheu, “Data broadcasting and seamless channel transition for highly demanded videos,” IEEE Trans. on Communications, vol. 49, no. 5, May 2001.
[57] Y. C. Tseng, Y. C. Chueh and J. P. Sheu, “Seamless channel transition for the staircase video broadcasting scheme,” IEEE/ACM Trans. on Networking, vol. 12, no. 3, June 2004.
[58] Y. Guo, L. Gao, D. Towsley and S. Sen, “Smooth workload adaptive broadcast,” IEEE Trans. on Multimedia, vol. 6, no. 2, pp. 387-395, Apr. 2004.
[59] W. D. Chien, Y. S. Yeh and J. S. Wang, “Practical channel transition for near-vod services,” IEEE Trans. on Broadcasting, vol. 51, no. 3, pp. 360-365, Sep. 2005.
[60] W. D. Chien and J. S. Wang, “A widely-applicable channel transition scheme for pyramid-based near-vod services,” Proc. International Conference on Communications (ICC), 2006.
[61] Olivier Bagouet, Kien A. Hua and David Oger, “A periodic broadcast protocol for heterogeneous receivers,” SPIE Conf. Multimedia Computing and Networking (MMCN), Jan. 2003.
[62] Mounir A. Tantaoui, Kien A. Hua and Tai T. Do, “Broadcatch: a periodic broadcast technique for heterogeneous video-on-demand,” IEEE Trans. on Broadcasting, vol. 50, no. 3, Sep. 2004.
[63] Chin-Tsai Lin and Jen-Wen Ding, “CAR: a low latency video-on-demand broadcasting scheme for heterogeneous receivers,” IEEE Trans. on Broadcasting, vol. 52, no. 3, Sep. 2006.
[64] Lixin Gao, Zhi-Li Zhang and Don Towsley, “Proxy-assisted Techniques for Delivering Continuous Multimedia Streams,” IEEE/ACM Transactions on Networking, vol. 11, no. 6, Dec. 2003.

指導教授

曾黎明(Li-Ming Tseng)

審核日期

2008-10-16

推文