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 条

[31] Finding shortest paths on real road networks: the case for A*
Zeng, W.
Church, R. L.
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2009, 23 (04) : 531 - 543
[32] Shortest Paths between Shortest Paths and Independent Sets
Kaminski, Marcin
Medvedev, Paul
Milanic, Martin
COMBINATORIAL ALGORITHMS, 2011, 6460 : 56 - +
[33] Expected shortest paths in dynamic and stochastic traffic networks
Fu, LP
Rilett, LR
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1998, 32 (07) : 499 - 516
[34] To Meet or Not to Meet: Finding the Shortest Paths in Road Networks
Huang, Weihuang
Zhang, Yikai
Shang, Zechao
Yu, Jeffrey Xu
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (04) : 772 - 785
[35] Complexity and approximate algorithm of shortest paths in dynamic networks
School of Electronics and Information Engineering, Tongji University, Shanghai 200092, China
不详
Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (04): : 608 - 614
[36] Querying Shortest Paths on Time Dependent Road Networks
Wang, Yong
Li, Guoliang
Tang, Nan
PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (11): : 1249 - 1261
[37] Fault tolerance with shortest paths in regular and irregular networks
Sem-Jacobsen, Frank Olaf
Lysne, Olav
2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 1500 - +
[38] A new algorithm for shortest paths in discrete dynamic networks
Chabini, I
TRANSPORTATION SYSTEMS 1997, VOLS 1-3, 1997, : 537 - 542
[39] SHORTEST PATHS IN NETWORKS WITH EXPONENTIALLY DISTRIBUTED ARC LENGTHS
KULKARNI, VG
NETWORKS, 1986, 16 (03) : 255 - 274
[40] Finding Reliable Shortest Paths in Dynamic Stochastic Networks
Wu, Xing
TRANSPORTATION RESEARCH RECORD, 2013, (2333) : 80 - 90

← 1 2 3 4 5 →