樹狀結構為基礎的串流式多媒體快取機制｜國立清華大學博碩士論文庫

簡易檢索 / 詳目顯示

回結果列表

研究生：	詹振隆 Chen-Lung Chan
論文名稱：	樹狀結構為基礎的串流式多媒體快取機制 A Tree-Based Video Caching Scheme for Streaming Applications
指導教授：	王家祥 Jia-Shung Wang
口試委員:
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 資訊工程學系 Computer Science
論文出版年：	2001
畢業學年度：	89
語文別：	英文
論文頁數：	61
中文關鍵詞：	串流式多媒體、多點傳播
外文關鍵詞：	streaming, multicast
相關次數：	點閱：1 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

在現今的網際網路 (Internet) 上，串流式 (Streaming) 系統為多媒體傳輸提供了一個很便利的平台。然而，此系統有一個很嚴重的限制，就是當使用者人數大量增加以後，伺服器有限的負載能力以及網路的頻寬很可能會成為瓶頸。為了減輕伺服器的負載與網路頻寬的使用，通常會避免每位使用者都直接由伺服器下載資料，而在眾多策略中，多點傳播 (Multicast) 是一種很常用的技術。然而，傳統的多點傳播技術並不適合隨選 (On-Demand) 多媒體系統，因為在隨選多媒體系統中，使用者會在不同的時間點播自己喜歡的節目，導致無法分享同一個資料流 (Stream) 。為了克服這個問題，蘇德宙和王家祥提出了隨意多點傳播技術 (On-Demand Multicast Routing Scheme) [1] [2] 的概念。在這個機制中，首先要在網路的節點中設置緩衝區 (Cache) ，當影片資料流經這些節點時，就可以為不同使用者分支出多條不同時間點的資料流。另外，他們也設計了一套適用於完整連接 (Complete Graph) 網路的高效率緩衝機制。本篇研究的目的是要把隨意多點傳播機制擴充到樹狀 (Tree-Based) 網路上，所採用的策略是整合同一路徑上的節點，由上而下依序使用緩衝區，同時搭配重新繞路 (Re-Route) 與門檻值 (Threshold) 的觀念，更進一步的提高系統效能。

Nowadays the streaming technology provides a flexible platform for serving multimedia distribution over Internet. However, the service scalability may be restricted because the server load and network bandwidth are not resolved yet. One possible way to reduce the server load as well as the bandwidth is to reduce the requirement of resources from the server directly. The benefit of the multicast technology is usually helpful to do so. However, traditional multicast does not accommodated to on-demand applications owing to the requests are time-variant. On-demand multicast routing scheme [1] [2] can eliminate this limitation. By appropriately equipping caches on routing nodes, time-variant streams can be branched to serve distinct users. Furthermore, Su and Wang gave an efficient greedy routing mechanism to implement the on-demand multicast routing scheme over complete graphs. It demonstrates an amazing enhancement. Extending on-demand multicast routing scheme to tree-based networks is the thesis purpose. The primary strategy is integrating caches belong to the same path and employing these caches sequentially from the root to the leaf. In addition, re-route and threshold functionalities are embedded to enhance utilization.

CHAPTER I    INTRODUCTION    I-1
I.1. PROBLEMS OF STREAMING SYSTEMS   I-1

I.2. RELATED WORKS   I-2

I.3. ON-DEMAND MULTICAST ROUTING SCHEME      I-8

I.3.1.       Buffering mechanism for caching a stream        I-9

I.3.2.       Cooperation of caches   I-11

I.3.3.       On-demand multicast routing tree        I-13

I.4. PURPOSE OF THIS STUDY   I-15

CHAPTER II   CHARACTERISTICS OF TREE-BASED NETWORKS  II-1

II.1.        PROBLEMS OF INVESTIGATING CACHING SCHEMES       II-1

II.2.        AVAILABLE BUFFERS FOR EACH CLIENT       II-2

II.3.        BUFFER ALLOCATION       II-3

II.4.        DISCUSS II-3

CHAPTER III  SOME CACHING SCHEMES    III-1

III.1.       PRIMARY FUNCTIONALITIES III-1

III.1.1.     Bridge  III-1

III.1.2.     Patching        III-2

III.2.       SCHEME 1        III-3

III.2.1.     Simulation models       III-5

III.2.2.     Evaluation      III-7

III.3.       SCHEME 2 (SCHEME 1 WITH SYSTEM-WIDE THRESHOLD)  III-10

III.3.1.     Evaluation      III-12

III.4.       SCHEME 3 (SCHEME 1 WITH RE-ROUTE)       III-15

III.4.1.     Re-route        III-15

III.4.2.     Enhanced scheme III-16

III.4.3.     Evaluation      III-19

III.5.       SCHEME 4 (SCHEME 2 WITH ESTIMATED THRESHOLDS)   III-22

III.5.1.     Released buffer caused by re-route      III-22

III.5.2.     Enhanced scheme III-24

III.5.3.     Evaluations     III-26

III.6.       SCHEME 5 (HYBRID OF SCHEME 3 AND SCHEME 4)      III-28

CHAPTER IV   SIMULATION RESULTS      IV-1

IV.1.        SERVER STREAMS  IV-1

IV.2.        MAXIMAL BANDWIDTH       IV-3

CHAPTER V    IMPLEMENTATION  V-1

V.1. ARCHITECTURE    V-1

V.2. MODIFIED ROUTING SCHEME V-2

CHAPTER VI   CONCLUSIONS     VI-1

VI.1.        CONTRIBUTIONS   VI-1

VI.2.        FUTURE WORKS    VI-2

[1] Te-Chou Su and Jia-Shung Wang, “Buffered Multicast Routing for Video-on-Demand Systems,” IEEE International Conference on Communications, June 1999, pp. 1000-1004.
[2] Te-Chou Su and Jia-Shung Wang, “On-Demand Multicast Routing Scheme and Its Algorithms,” International Parallel Processing Symposium, April 1999, pp. 212-217.
[3] Kevin C. Almeroth and Mostafa H. Ammar, “The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service,” IEEE Journal on Selected Areas in Communications, VOL. 14, NO. 6, August 1996, pp. 1110-1122.
[4] Asit Dan, Dinkar Sitaram, and Perwez Shahabuddin, “Dynamic Batching Policies for an On-Demand Video Server,” Multimedia systems, 1996, pp. 112-121.
[5] Asit Dan, Martin Kienzle, and Dinkar Sitaram, “A Dynamic Policy of Segment Replication for Load-Balancing in Video-on-Demand Servers,” Multimedia systems, 1995, pp. 93-103.
[6] Greg Barish and Katia Obraczka, “World Wide Web Caching: Trends and Techniques,” IEEE Communications Magazine, VOL. 38, NO. 5, May 2000, pp. 178-184.
[7] Ellen W. Zegura, Mostafa H. Ammar, Zongming Fei, and Samrat Bhattacharjee, “Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service,” IEEE/ACM Trans. on Networking, VOL. 8, NO. 4, August 2000, pp. 455-466.
[8] P. Krishnan, Danny Raz, and Yuval Shavitt, “The Cache Location Problem,” IEEE/ACM Trans. on Networking, VOL. 8, NO.5, October 2000, pp. 568-582.
[9] Brett J. Vickers, Celio Albuquerque, and Tatsuya Suda, “Source-Adaptive Multilayered Multicast Algorithms for Real-Time Video Distribution,” IEEE/ACM Trans. on Networking, VOL. 8, NO.6, December 2000, pp. 720-733.
[10] Wu-Chan Feng, Dilip D. Kandlur, Debanjan Saha, and Kang G. Shin, “Adaptive Packet Marking for Maintaining End-to-End Throughput in a Differentiated-Services Internet,” IEEE/ACM Trans. On Networking, VOL. 7, NO. 5, October 1999, pp.685-697.
[11] T. V. Lakshman, Partho P. Mishra, and K. K. Ramakrishnan, “Transporting Compressed Video Over ATM Networks with Explicit-Rate Feedback Control,” IEEE/ACM Trans. On Networking, VOL. 7, NO. 5, October 1999, pp. 710-723.
[12] James D. Salehi, Zhi-Li Zhang, Jim Kurose, and Don Towsley, “Supporting Stored Video: Reducing Rate Variability and End-to-End Resource Requirements Through Optimal Smoothing,” IEEE/ACM Trans. On Networking, VOL. 6, NO. 4, August 1998, pp. 397-410.
[13] Wanjiun Liao, Victor O.K. Li, “The Split and Merge Protocol for Interactive Video-on-Demand,” IEEE Multimedia, VOL. 4, NO. 4, pp. 51-62, October 1997.
[14] Asit Dan, Dinkar Sitaram, Perwez Shahabuddin, “Dynamic Batching Policies for an On-Demand Video Server,” Multimedia systems, 1996, pp. 112-121.
[15] Hua K.A., Sheu S., and Wang J.Z, “Earthworm: a Network Memory Management Technique for Large-Scale Distributed Multimedia Applications,” Proceedings IEEE INFOCOM '97, VOL. 3, 1997, pp. 990-997.
[16] Sheu S., Hua K.A., and Tavanapong W, “Chaining: a Generalized Batching Technique for Video-on-Demand Systems,” Proceedings IEEE International Conference on Multimedia Computing and Systems, 1997, pp. 110-117.
[17] Jen-Kai Chen and Wu J.-L.C, “Adaptive Chaining Scheme for Distributed VOD Applications,” IEEE Trans. on Broadcasting, VOL. 45, NO. 2, June 1999, pp. 215-224.

全文公開日期本全文未授權公開 (校內網路)
全文公開日期本全文未授權公開 (校外網路)
全文公開日期本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)

簡易檢索 / 詳目顯示

相關論文