Multiple QoS Constraints Finding Paths Algorithm in TMN

被引：0
|
作者：
Li Qianmu [1 ]
机构：
[1] Nanjing Univ Sci & Technol, Dept Comp Sci, Nanjing 210094, Peoples R China
来源：
INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL | 2011年 / 14卷 / 03期
关键词：
Multiple QoS Constraints; Finding Paths Algorithm; TMN;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Analysing the topology of TMN and the target of QoS routing, this paper proposes a new model of QoS routing algorithm (QRA), which includes the precomputation and searching procedures. The precomputation is able to create and update the routing tables in each node. Then, the searching procedure could select an optimal path satisfying several constraints in the hierarchical architecture. The results of extensive simulation show that QRA achieves satisfactory performance and efficiently solves the problem of multi-constrained QoS routing in TMN.
引用
收藏
页码：731 / 737
页数：7
相关论文
共 50 条
  • [21] Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA
    Baolin Sun a
    Progress in Natural Science:Materials International, 2008, (03) : 331 - 336
  • [22] A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs
    Guo, Jianyuan
    Jia, Limin
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2017, 11 (02) : 170 - 177
  • [23] Finding a path subject to many additive QoS constraints
    Xue, Guoliang
    Sen, Arunabha
    Zhang, Weiyi
    Tang, Jian
    Thulasiraman, Krishnaiya
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (01) : 201 - 211
  • [24] Finding Temporal Paths Under Waiting Time Constraints
    Casteigts, Arnaud
    Himmel, Anne-Sophie
    Molter, Hendrik
    Zschoche, Philipp
    ALGORITHMICA, 2021, 83 (09) : 2754 - 2802
  • [25] THE COMPLEXITY OF FINDING MAXIMUM DISJOINT PATHS WITH LENGTH CONSTRAINTS
    ITAI, A
    PERL, Y
    SHILOACH, Y
    NETWORKS, 1982, 12 (03) : 277 - 286
  • [26] Finding Temporal Paths Under Waiting Time Constraints
    Arnaud Casteigts
    Anne-Sophie Himmel
    Hendrik Molter
    Philipp Zschoche
    Algorithmica, 2021, 83 : 2754 - 2802
  • [27] A Fast Lagrangian Relaxation Algorithm for Finding Multi-Constrained Multiple Shortest Paths
    Feng, Gang
    2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014), 2014, : 1949 - 1955
  • [28] An efficient multiple-constraints QoS routing algorithm based on nonlinear path distance
    Yang, Xiaolong
    Zhang, Min
    Long, Keping
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3314 : 365 - 370
  • [29] An efficient multiple-constraints QoS routing algorithm based on nonlinear path distance
    Yang, XL
    Zhang, M
    Long, KP
    COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, 2004, 3314 : 365 - 370
  • [30] An algorithm for finding reasonable paths in transit networks
    Tan, Man-chun
    Tong, C. O.
    Wong, S. C.
    Xu, Jian-min
    JOURNAL OF ADVANCED TRANSPORTATION, 2007, 41 (03) : 285 - 305
12345