一種基于克隆策略的多播路由算法
A Multicast Routing Algorithm Based on Clonal Strategies
-
摘要: 該文針對網(wǎng)絡(luò)計(jì)算中的NPcomplet問題一帶時延約束的多播路由問題，提出了一種基于克隆策略的路由算法．仿真實(shí)驗(yàn)表明，與基于遺傳算法的多播路由算法相比，該算法具有更快的收斂速度和更好的全局尋優(yōu)能力，而且算法穩(wěn)定、靈活，操作簡單．
-
關(guān)鍵詞:
- 多播路由;克隆策略;時延約束
Abstract: An algorithm based on Clonal Strategies(CS) is presented to deal with the delay-constrained and least-cost multicast routing problem known as NP-complet. Simulations show that compared with those based on genetic algorithm, the multicast routing based on CS has faster converging speed and better ability of global searching with the property of stabilization, agility and operating simply. -
Kou L. A fast algorithm for the Steiner trees. Acta Informatic, 15(2): 141-145.[2]Takahashi H. An approximate solution for the Steiner problem in graphs, Math. Japonica, 24(6):573-577.[3]Mehrdad Parsa. An interative algorithm for delay-constrained minimum-cost multicasting.IEEE/ACM Trans on Networking, 6(4): 461-474.[4]Salama H F. Evaluation of multicast routing algorithm for real-time communication on high-speed networks. IEEE J on Sel. Areas in Comm, 15(3): 332-345.[5]陳國良等.遺傳算法及其應(yīng)用.北京:人民郵電出版社,1996:28-98.[6]石堅(jiān),鄒玲等.遺傳算法在組播路由選擇中的應(yīng)用.電子學(xué)報,2000,28(5):88-89.[7]王新紅,王光興.基于遺傳算法的時延受限代價最小組播路由選擇方法[J].通信學(xué)報,2002,23(3):112-117.[8]劉瑩.計(jì)算機(jī)網(wǎng)略中的多播路由算法.[博士論文],西安:西安電子科技大學(xué),2002.12.[9]劉若辰,杜海峰,焦李成.免疫克隆策略.[研究報告],西安:西安電子科技大學(xué)雷達(dá)信號處理國家重點(diǎn)實(shí)驗(yàn)室,2002年. -
計(jì)量
- 文章訪問數(shù): 2303
- HTML全文瀏覽量: 124
- PDF下載量: 786
- 被引次數(shù): 0
下載:
