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 条
  • [1] A randomized algorithm for finding a path subject to multiple QoS constraints
    Korkmaz, T
    Krunz, M
    GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1694 - 1698
  • [2] A *Prune: An algorithm for finding K shortest paths subject to multiple constraints
    Liu, G
    Ramakrishnan, KG
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 743 - 749
  • [3] ALGORITHMS FOR FINDING PATHS WITH MULTIPLE CONSTRAINTS
    JAFFE, JM
    NETWORKS, 1984, 14 (01) : 95 - 116
  • [4] Studies for disjoint paths algorithm with QoS constraints
    Ren Hong
    Zhang Min
    Jiang Yinghua
    Ren Jingan
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 127 - +
  • [5] ALGORITHMS FOR FINDING PATHS WITH MULTIPLE CONSTRAINTS.
    Jaffe, Jeffrey M.
    Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 1980, : 668 - 676
  • [6] Distributed routing algorithm with multiple QoS constraints
    Guo Zhuo
    Wang Xiang-Dong
    PROCEEDINGS OF THE 2007 CHINESE CONTROL AND DECISION CONFERENCE, 2007, : 731 - 734
  • [7] Multi-Constraint-Pruning: an algorithm for Finding K Shortest Paths subject to Multiple Constraints
    Zhang, Ziang
    Zhao, Jihong
    2008 14TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS, (APCC), VOLS 1 AND 2, 2008, : 354 - 358
  • [8] An efficient approximate algorithm for finding paths with two additive constraints
    Feng, G
    Douligeris, C
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2002, E85B (06) : 1143 - 1151
  • [9] Approximation Algorithm for QoS Routing with Multiple Additive Constraints
    Hou, Ronghui
    Lui, King-Shan
    Leung, Ka-Cheong
    Baker, Fred
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 1142 - +
  • [10] An algorithm for multicast with multiple QoS constraints and dynamic membership
    Fei, AG
    Gerla, M
    NETWORKING 2000, 2000, 1815 : 132 - 143
12345