On the algorithm for finding an optimal routing

被引：0
|
作者：
Wang, XP [1 ]
Wang, QA [1 ]
Wen, YD [1 ]
Zeng, LB [1 ]
机构：
[1] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Hubei, Peoples R China
来源：
7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMMUNICATION, NETWORK AND CONTROL SYSTEMS, TECHNOLOGIES AND APPLICATIONS: II | 2003年
关键词：
computer networks; forwarding index; routing;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Computer network is a system (G, R). G is a simple connected graph. R is a set of simple paths connecting every pair of vertices in the graph G, is defined as a routing. The edge (vertex) load is the number of paths passing through the edge (vertex), and the forwarding index of (G, R) is the maximum load when the routing is R. The forwarding index of (G, R) is a distribution of the loads on the network G. This paper discusses a new analysis modeling of computer networks based the forwarding index, presents an algorithm for finding an optimal routing.
引用
收藏
页码：272 / 275
页数：4
相关论文
共 50 条
  • [1] An Optimal Algorithm for Finding Disjoint Rectangles and Its Application to PCB Routing
    Kong, Hui
    Ma, Qiang
    Yan, Tan
    Wong, Martin D. F.
    [J]. PROCEEDINGS OF THE 47TH DESIGN AUTOMATION CONFERENCE, 2010, : 212 - 217
  • [2] An algorithm for optimal routing
    Ribeiro, CM
    Luvezute, RM
    Ribeiro, JFF
    [J]. LARGE SCALE SYSTEMS: THEORY AND APPLICATIONS 1998 (LSS'98), VOL 1, 1999, : 209 - 213
  • [3] Finding optimal paths in MREP routing
    Fleischer, R
    Golin, M
    Lea, CT
    Wong, S
    [J]. INFORMATION PROCESSING LETTERS, 2004, 89 (02) : 57 - 63
  • [4] A PARALLEL OPTIMAL ROUTING ALGORITHM
    RIBEIRO, C
    ELBAZ, D
    [J]. PARALLEL COMPUTING, 1992, 18 (12) : 1393 - 1402
  • [5] AN OPTIMAL ADAPTIVE ROUTING ALGORITHM
    CHANG, F
    WU, L
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1986, 31 (08) : 690 - 700
  • [6] AN OPTIMAL DISTRIBUTED ROUTING ALGORITHM
    WANG, ZG
    BROWNING, DW
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (09) : 1379 - 1388
  • [7] OPTIMAL ALGORITHM FOR FINDING THE KERNEL OF A POLYGON
    LEE, DT
    PREPARATA, FP
    [J]. JOURNAL OF THE ACM, 1979, 26 (03) : 415 - 421
  • [8] ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE
    FUJISHIGE, S
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1977, 20 (01) : 59 - 75
  • [9] AN OPTIMAL ALGORITHM FOR SINK-FINDING
    KING, KN
    SMITHTHOMAS, B
    [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 109 - 111
  • [10] ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT ASSIGNMENT
    IRI, M
    TOMIZAWA, N
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1976, 19 (01) : 32 - 57
12345