- 學位論文
俱延遲限制之多媒體服務的覆疊網路建構
Overlay Networking for Delay Bound Interactive Multimedia Services
若您是本文的作者，可授權文章由華藝線上圖書館中協助推廣。
摘要
在一個任意來源端互動式多媒體服務應用中，例如：視訊會議，都需要多播網路的服務及較短的傳輸延遲。在目前既有的網際網路中，支援跨越廣域網路的網路層多播是不可能的。最近的焦點多集中在應用層多播。在過去，只有少數的學者探討具有Δ限制(Δconstrained)的應用層多播。本論文提出一個具有延遲限制及分支容量限制的多播擴張樹(Delay and Degree constrained Multicasting Spanning Tree(D2MST))演算法，以建立一個共用樹，使得大多數點對點的延遲都能符合延遲限制。D2MST使用網路中心及重心的概念，依據選擇適當的根節點價格函數”merit”，來開始多播樹的建置。並使用價格函數”power”選擇節點加入多播樹的優先順序。此外，一個具有最短路徑及分支容量限制的演算法(Shortest Path with Degree Constrained (SPDC))，使加入節點可透過已知節點連接到擴張樹，使得點對點之間的延遲能夠符合Δ限制的要求。由模擬結果顯示出D2MST能有效建立一個符合Δ限制的覆疊多播樹。
並列摘要
Any to any source interactive multimedia services, such as video conference, demand multicasting network services and short communicate delay among end points. As for present Internet, the support of network layer multicasting across WAN is impossible. Recent focus is thus mostly on the application layer multicasting. In the past, very few researchers probe into the field of application layer multicasting on Δ-constrained. This thesis proposes an algorithm called Delay and Degree constrained Multicast Spanning Tree (D2MST) to establish a shared tree that makes end to end delay among high percentage of nodes within Δ-constrained. D2MST uses a novel concept of network center and gravity, based on which a cost function “merit” is defined to choose an appropriate root to start the construction of multicasting tree. The other cost function “power” is used therefore to choose which node can enter the multicasting tree first. An algorithm called Shortest Path with Degree Constrained (SPDC) is also proposed to connect a given node to the spanning tree so that the delay between node and node can conform to the need of Δ-constrained. The simulation results show that D2MST performs well and can establish a Δ-constrained overlay multicasting tree effectively.
參考文獻
[1] Yang-hua Chu; S.G.Rao; S.Seshan and Zhang. Hui，”A Case for End System Multicast ，”IEEE JSAC on Volume 20，Issue 8，pp.1456—1471，2002.
[2] N.M.Malouch; Zhen Liu; D.Rubenstein and S.Sahu，”A Graph Theoretic Approach to Bounding Delay in Proxy-Assisted， End-System Multicast，”in proceedings of Quality of Service，Tenth IEEE International Workshop，pp.106-115，2002.
[4] Y.Chawathe; S.McCanne and E.A.Brewer，”RMX: Reliable Multicast for Heterogeneous Networks，”in proceedings of IEEE INFOCOM，Volume 2，pp.795—804，2000.
[5] Suman Banerjee; Bobby Bhattacharjee; Christopher Kommareddy，”Scalable Application Layer Multicast，”in proceedings of conference on Applications， technologies， architectures， and protocols for computer communications，pp.205-217，2002.
[6] S.Banerjee; C.Kommareddy; K.Kar; B.Bhattacharjee and S.Khuller，”Construction of An Efficient Overlay Multicast Infrastructure for Real-Time Applications，”IEEE INFOCOM ，Volume 2， pp.1521-1531，2003.