臺灣博碩士論文加值系統

[摘要]
在現今高度發展的網際網路環境之下，造就了眾多新穎的網路應用程式，舉例而言，這些應用程式包括隨選視訊(VOD) ， 影像電話，遠距教學，互動式遊戲等等，讓人目不暇給. 上述所提到的這些應用程式有兩項只要的特點，第一項特點是和其他台機器群集體通訊是必須的。另一項特點是為了達到即時多媒體應用的需求.這類應用程式往往需要更多的網路頻寬以及服務品質保證(QoS) 。 因此,應用層之下的路由選擇協定必須提供一種實際且高效率的機制來傳送資料。 實務上，新興的網際網路群播機制諸如CBT (Core Based Tree)和DVMRP (Distance Vector Multicast Routing Protocol)都支援了群體通訊的服務，本篇論文中，我們探討許多多媒體應用方面的選徑 (routing) 問題，並將之實現在現有的網際網路群播選徑協定。透過我們的實驗結果得知，我們可以由下列幾方面去增進路徑選擇的效率: 一個謹慎選擇的群播樹源點 (root) ，合適的路徑成本計算函式，以及多群播樹選徑。

[ABSTRACT]
The exploding Internet has arisen many novel network applications. These applications include video on demand
(VOD), video/audio phone, distance learning, interactive
games, and so on. There are two major characteristics of
these applications. One of the characteristics is group communicating with other hosts is required. The other one
is requirement of more network bandwidth and quality of service guarantee for real-time multimedia applications.
Thus, the underlying routing protocols must provide an efficient scheme for more effective and efficient data transmission. In practical, emerging multicast schemes
such as Core-Based Tree (CBT) and Distance Vector Multicast Routing Protocol (DVMRP) support group communication service. In this thesis, we study many performance issues of routing multimedia applications using existing Internet multicast routing protocols. Our numerical results show that the
routing performance can be improved by careful core
placement, appropriate link cost function, and multiple multicast trees routing.

Table of Contents
Chapter
1 Introduction 1
2 Network Model 4
2.1 Network Model 4
2.2 Problem Definition 5
3 Link Cost Function 8
3.1 COL Approach 8
3.2 Call admission control of COL approach 9
4 Multicast-Tree Algorithms 11
4.1 Multicast-tree algorithms 11
4.2 Source-based trees (Distance Vector
MulticastRoutingrotocol) 12
4.3 Group-shared trees (Core-Based Trees) 14
4.3.1 Obtaining Core information of CBT 16
5 Simulation Result 17
5.1 Simulation Model 17
Topology model17
Traffic Model and Other Assumptions 18
5.2 Simulation Results 19
5.2.1 Performance Evaluation of Core Placement 20
5.2.2 Performance Comparison of CBT and DVMRP 21
5.2.3 Multiple Multicast Trees 22
5.2.4 Efficiency of Traffic Dispersing 24
5.2.5 Tree Constructing Order 27
6 Conclusion and Future Work 28
Reference 29

REFERENCES
[1] R. Karp, “Reducibility among combinatorial problems,” Complexity of Computer Computations, (New York: Plenum Press), Pages :85-103, 1972.
[2] Jhyda Lin, Ruay-Shiung Chang “A Comparison of the Internet multicast routing protocols”, Computer Communications 22, Pages:144-155, 1999.
[3] T. Pusateri, “Distance vector multicast routing protocol”, Internet draft,, February 1997.
[4] A. Ballardie, “Core Based Trees (CBT) Multicast Architecture”, RFC 2189,September 1997.
[5] D. Estrin, D. Farinacci , A. Helmy, D. Thaler, S. Deering, M. Handley, V.Jacobson, C. Liu, P. Sharma, L. Wei, “Protocol Independent Multicast-SparseMode (PIM-SM): Protocol Specification”, RFC 2362, June, 1998.
[6] Andrew S. Tanenbaum, “Computer Networks Third Edition”, Prentice Hall,Pages: 723, 1996.
[7] Chung-Ming Huang and Hsu-Yang Kung, “A Multicast Multiple-Stream Multimedia Presentation System Over Internet”, IEEE, Autonomous Decentralized Systems, Pages: 353 — 360, 1999.
[8] V. P. Kompella, J. c. Pasquale, and G. C. Polyzos, “Multicast routing for Multimedia communication”, IEEE/ACM Transactions on Networking, vol. 1, no.3, pp. 286-292, June 1993.
[9] Changdong Liu, Myung J. Lee, Tarek N. Saadawi, “Core-Manager Based Scalable Multicast Routing”, IEEE Communications, vol.2, Pages: 1202 — 1207,1998.
[10] Hwa-Chun Lin and Shou-Chuan Lai “A Near Optimal Core Placement Method for the Core Based Tree Multicast Routing Architecture”, Proceedings of the 14th International Conference on Information Networking, Hsinchu, Taiwan,
R. O. C.,Jan. 26 - 28, 2000.
[11] Serge Plotkin, “Competitive Routing of Virtual Circuits in ATM networks”,IEEE Journal on Selected Areas in Communications, Volume: 13, Issue: 6, pages 1128 —1136.
[12] Z. Dziong and L. Mason, “Control of Multi-Service Loss Networks”, Proc. Of the 28th Conference on Decision and Control, (Tampa, Florida), December 1989.
[13] R.-H. Hwang, “Adaptive Multicast Routing in Single Rate Loss Networks”,INFOCOM ’95, Page 571-578, April 1995.
[14] Rainer Gawlick, Anil Kamath, Serge Plotkin, and K.G. Ramakrishnan, “Routing and Admission Control in General Topology Networks”, technical report stan-cs-tr-95-1548, February 1995.
[15] William Aiello, Matthew Andrews, Sandeep Bhatt, and K.R. Krishnan, Lisa Zhang “A Performance Comparison of Competitive On- line Routing and State-Dependent Routing”, GLOBECOM ’97, Nov. 1997.
[16] B. Waxman. “Routing of Multipoint Connections ”, IEEE J. on Selected Areas in Commun, vol. 1,no.9, Page 1617-1622, December 1988.
[17] Mark Handley, ACIRI and Jon Crowcroft, “Internet Multicast Today”, The Internet Protocol Journal, vol. 2, no.4, Page2-page 19, December 1999