| Summary: | 碩士 === 國立臺灣科技大學 === 電子工程系 === 87 === Due to increasing network usage, the need for obtaining real-time multimedia service is getting more and more. How to plan and design a heuristic algorithm to satisfy the Quality of Service (QOS) in real-time systems is a cardinal issue to be dealt with by researchers. The muticast routing plays an indispensable role in this issue. Proper multicast routing makes multimedia systems not only meet the real-time requirement, but also facilitate the effective utility of network resources, leading to higher network performance.
The major objective of my thesis is to develop an effective distributed multicast routing for multimedia applications, such as videoconferencing and distance learning. In the thesis, we want to propose four feasible algorithms that can obtain, in a reasonable time-limit, multicast routing paths which not only meet the real-time requirement but also use less network resources.
The main reason for adopting distributed method is that it reads only local information, but not the global information in the network. It not only saves a considerable amount of storage space but also possesses better scalability. Because of keeping only local network information, it needs a lot of message exchanges to get a multicast routing path. In order to reduce the usage of network resource, we also try to decrease the number of message exchanges in the four algorithms and how to improve it for the better is the future work.
第二章 國內外相關研究 02
第三章 演算法 06
3.1 定義 06
3.2 演算法敘述 11
3.3 演算法範例 20
3.4 演算法證明 35
第四章 實驗與模擬 38
4.1 實驗環境敘述 38
4.2 模擬結果 40
4.3 結果分析 106
第五章 結論 110
參考文獻 111
|
|---|
