多媒體通信的多播路由算法
Multicast routing algorithm for multimedia communication
-
摘要: 在多媒體通信網(wǎng)的實際應用中,多播(multicasting)技術(shù)日顯重要,在實際網(wǎng)絡(luò)中,網(wǎng)絡(luò)節(jié)點具備不同的多播能力,有些節(jié)點不具備多播能力,而具備多播能力的節(jié)點要限制其復制信息的數(shù)量,即節(jié)點多播能力受限,該文用節(jié)點的度約束來表示每個節(jié)點的多播能力;此外網(wǎng)絡(luò)中的很多業(yè)務(wù)要求信息從源節(jié)點傳送到目的節(jié)點的時延受限;因此該文研究帶度約束和時延約束的多播路由問題,給出了一種Lagrange松弛法,能夠較好地解決這類問題。
-
關(guān)鍵詞:
- 多播路由; 度約束; 時延約束; Lagrange松弛法
Abstract: In multimedia communication networks, the multicasting is increasingly important. Nodes in the networks will likely vary in their abilities to support multicasting. Some nodes do not have multicasting ability, other nodes may be limited in the number of multicast copies they can reasonably make. So in this paper the degree-constraint of the node is used to represent its multicasting ability. Furthermore many services in networks require that the accumulated delay from the source node to every destination node can not exceed a pre-specified delay bound. In this paper the multicast routing algorithm with degree and delay constraints is proposed, and the Lagrange relaxation method is used to solve this problem. -
計量
- 文章訪問數(shù): 2171
- HTML全文瀏覽量: 113
- PDF下載量: 412
- 被引次數(shù): 0
下載:
