【摘要】提出了在組播應(yīng)用中滿足多個(gè)約束條件的一種組播路由算法。該算法以最短路徑算法為基礎(chǔ)，通過(guò)調(diào)整當(dāng)前形成的路由樹(shù)中節(jié)點(diǎn)的排列順序，依次為目的節(jié)點(diǎn)選擇到路由樹(shù)的最短路徑并加入到該路由樹(shù)中，得到滿足跳數(shù)約束條件的低代價(jià)組播樹(shù)，再對(duì)所構(gòu)成的低代價(jià)組播樹(shù)進(jìn)行同級(jí)中繼合并，得到最后的組播樹(shù)。該組播樹(shù)因?yàn)橹欣^最少，所以時(shí)隙資源消耗最小。
關(guān) 鍵 詞 組播路由算法; 組播樹(shù); 資源消耗; 時(shí)分多址

The article presents a multicast routing algorithm that meets three constraint conditions in the multicast application. The algorithm comprises two steps. First the algorithm is based on MPH and adjusts the nodes’ rank in the current multicast tree, and gradually gets the low cost and hop constrained multicast tree by selecting the destination node with minimum cost to current multicast tree in turn. Then some relay nodes, which is not fit for the requirement of the resource consumption, is deleted. The rest of the relay nodes makes up of the final multicast tree, which consumes the least time slot.