The load of kautz networks with shortest paths

被引：0
|
作者：
Sun, Li [1 ]
Zhou, Changle [1 ]
Qian, Jianguo [1 ]
机构：
[1] Xiamen Univ, Comp & Informat Engn Coll, Xiamen 361005, Fujian Province, Peoples R China
来源：
DCABES 2007 Proceedings, Vols I and II | 2007年
关键词：
WDM networks; shortest path routing; network loads;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Under the all-to-all communication mode and shortest path scheme, this note shows that the load of an edge in a Kautz network K(d, k) is upper bounded by 1 + 2d + 3d(2) + - - - + kd(k-1). The sufficient-necessary condition for an edge to reach this bound is also given. This result implies that if d >= 2+root k-1 then the load of the Kautz network equals l(K(d, k)) = 1 + 2d + 3d(2) + - - - + kd(k-1).
引用
收藏
页码：332 / 333
页数：2
相关论文
共 50 条
  • [41] Continuously Monitoring Alternative Shortest Paths on Road Networks
    Li, Lingxiao
    Cheema, Muhammad Aamir
    Ali, Mohammed Eunus
    Lu, Hua
    Taniar, David
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (11): : 2243 - 2255
  • [42] Avoiding Spurious Paths in Centralities based on Shortest Paths in High Order Networks
    Wehmuth, Klaus
    Ziviani, Artur
    2018 EIGHTH LATIN-AMERICAN SYMPOSIUM ON DEPENDABLE COMPUTING (LADC), 2018, : 19 - 26
  • [43] Shortest Paths with Shortest Detours
    Torchiani, Carolin
    Ohst, Jan
    Willems, David
    Ruzika, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 858 - 874
  • [44] Shortest paths on a polyhedron .1. Computing shortest paths
    Chen, JD
    Han, YJ
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 127 - 144
  • [45] Oblivious routing scheme using load balancing over shortest paths
    Antic, Marija
    Smiljanic, Aleksandra
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 5783 - 5787
  • [46] CONNECTIVITY OF KAUTZ NETWORKS
    BERMOND, JC
    HOMOBONO, N
    PEYRAT, C
    DISCRETE MATHEMATICS, 1993, 114 (1-3) : 51 - 62
  • [47] Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
    Davies, C
    Lingras, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) : 27 - 38
  • [48] Node centrality in weighted networks: Generalizing degree and shortest paths
    Opsahl, Tore
    Agneessens, Filip
    Skvoretz, John
    SOCIAL NETWORKS, 2010, 32 (03) : 245 - 251
  • [49] DYNAMIC SHORTEST PATHS IN ACYCLIC NETWORKS WITH MARKOVIAN ARC COSTS
    PSARAFTIS, HN
    TSITSIKLIS, JN
    OPERATIONS RESEARCH, 1993, 41 (01) : 91 - 101
  • [50] Simulating SIR processes on networks using weighted shortest paths
    Tolic, Dijana
    Kleineberg, Kaj-Kolja
    Antulov-Fantulin, Nino
    SCIENTIFIC REPORTS, 2018, 8
12345