一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

QoS路由問題的反向優(yōu)化算法

張品,  李樂民,  王晟

張品, 李樂民, 王晟. QoS路由問題的反向優(yōu)化算法[J]. 電子與信息學(xué)報(bào), 2005, 27(6): 952-956.
引用本文: 張品, 李樂民, 王晟. QoS路由問題的反向優(yōu)化算法[J]. 電子與信息學(xué)報(bào), 2005, 27(6): 952-956.
Zhang Pin, Li Le-min, Wang Sheng. Reverse Optimization Algorithm for QoS Routing Problem[J]. Journal of Electronics & Information Technology, 2005, 27(6): 952-956.
Citation: Zhang Pin, Li Le-min, Wang Sheng. Reverse Optimization Algorithm for QoS Routing Problem[J]. Journal of Electronics & Information Technology, 2005, 27(6): 952-956.

QoS路由問題的反向優(yōu)化算法

Reverse Optimization Algorithm for QoS Routing Problem

  • 摘要: 尋找滿足兩個(gè)加性QoS約束條件的路徑是網(wǎng)絡(luò)QoS路由研究的核心問題,線性搜索算法是重要近似算法之一。本文提出一種結(jié)合了反向優(yōu)化策略的線性搜索算法。當(dāng)線性搜索過程所得到的路徑不滿足QoS需求時(shí),對(duì)搜索到的路徑選取合適的節(jié)點(diǎn)進(jìn)行反向優(yōu)化。算法的時(shí)間復(fù)雜度為O(K(m+nlog2(n)))。仿真顯示本文的搜索策略擴(kuò)大了搜索空間,提高了尋找可行路徑的成功率。
    Abstract: Finding the path satisfying two additive QoS constraints is the key question of QoS research. The linear search algorithm is one of important approximation algorithms. This paper proposes a new linear search algorithm combined with the reverse optimization scheme. If the path found by the linear search procedure does not satisfy the QoS constraints, the proper nodes of the path are chosen to make the reverse optimization. The time complexity of proposed algorithm is 0(K(m+nlog2(n))). The simulation shows that the new approach extends the search fields and improves the succeeding ratio of finding the feasible paths.
    • HTML全文
  • Crawley E, Nair R, Rajagopalan B, Sandick H. A framework for QoS-based Routing in the intemet. Intemet Draft, RFC2386,1998.[2]Guerin R, kamat S, Orda A, Przygienda T, Williams D. QoS routing mechanisms and OSPF extensions. Intemet Draft,RFC2676, 1998.[3]Wang Z, Crowcroft J. QoS routing for supporting resource reservation. IEEE J. on SAC, 1996, 14(9): 1228- 1234.[4]Sobrinho J. Algebra and algorithms for path computation and hop-by-hop routing in the internet[J].IEEE/ACM Trans. on the Networking.2002, 10(4):541-[5]Garey M, Johnson D. Computers and Intractability: A Guide to the Theory ofNP Completeness.[M]. San. Francisco, New York:W. H. Freeman, 1979, chp. 4.[6]Chen S, Nahrstedt K. An overview of quality of service routing for next-generation high-speed networks: Problems and Solutions[J].IEEE Network.1998, 12(6):64-[7]Warburton A. Approximation of Pareto optima in multipleobjective, shortest path problems[J].Operations Research.1987,35(1):70-[8]Hassin R. Approximation schemes for the restricted shortest path problems. Mathematics Operations Research, 1992, 17(1):136- 142.[9]Yuan. X. Heuristic algorithms for multiconstrained quality-ofservice routing[J].IEEE/ACM Trans. on the Networking.2002,10(2):244-[10]Cheng S.[J].Nahrstedt K. On finding multi-constrained paths [A].IEEE ICC98[C], Atlanta, GA.1998,:-[11]Jaffe J. Algorithms for finding paths with multiple constraints.Networks, 1984, (14): 95 - 116.[12]Neve H, Mieghem P. A multiple quality of service routing algorithm for PNNI.[A] Proceedings IEEE ATM Workshop[C],May 26-29, Fairfax, VA, 1998:324 - 328.[13]Korkmaz T, Krunz M. An efficient algorithm for finding a path subject to two additive constraints [J].Computer Communications Journal.2002, 25(3):225-
  • 加載中
計(jì)量
  • 文章訪問數(shù):  2004
  • HTML全文瀏覽量:  74
  • PDF下載量:  494
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2004-01-09
  • 修回日期:  2004-06-25
  • 刊出日期:  2005-06-19

目錄

    /

    返回文章
    返回