On the Applications of Dijkstra's Shortest Path Algorithm in Software Defined Networks

被引：1
|
作者：
Grbac, Tihana Galinac [1 ]
Domazet, Nikola [2 ]
机构：
[1] Univ Rijeka, Fac Engn, Vukovarska 58, HR-51000 Rijeka, Croatia
[2] Ericsson Nikola Tesla, Krapinska 45, HR-10000 Zagreb, Croatia
来源：
INTELLIGENT DISTRIBUTED COMPUTING XI | 2018年 / 737卷
关键词：
Software defined network; Network topology; Dijkstra's shortest path algorithm; Dynamic network definition and management; FUTURE;
D O I：
10.1007/978-3-319-66379-1_4
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The software defined networking has opened new opportunities for offering network resources to end users "as a service". For these purposes a number of technologies have been proposed and implemented to enable easy definition and management of network resources dynamically. In this paperwe provide an overview of software defined network and technologies used for identifying network topology. We present three approaches based on Dijkstra's Shortest Path Algorithm and evaluate their performance in an experimental study.
引用
收藏
页码：39 / 45
页数：7
相关论文
共 50 条
  • [1] Extending Dijkstra's Shortest Path Algorithm for Software Defined Networking
    Jiang, Jehn-Ruey
    Huang, Hsin-Wen
    Liao, Ji-Hau
    Chen, Szu-Yuan
    2014 16TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2014,
  • [2] A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
    Peyer, Sven
    Rautenbach, Dieter
    Vygen, Jens
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 377 - 390
  • [3] A parallelization of Dijkstra's shortest path algorithm
    Crauser, A
    Mehlhorn, K
    Meyer, U
    Sanders, P
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 722 - 731
  • [4] Modified Dijkstra Shortest Path Algorithm for SD Networks
    Abdelghany, Haitham M.
    Zaki, Fayez W.
    Ashour, Mohammed M.
    INTERNATIONAL JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING SYSTEMS, 2022, 13 (03) : 203 - 208
  • [5] Parallel Bidirectional Dijkstra's Shortest Path Algorithm
    Vaira, Gintaras
    Kurasova, Olga
    DATABASES AND INFORMATION SYSTEMS VI: SELECTED PAPERS FROM THE NINTH INTERNATIONAL BALTIC CONFERENCE (DB&IS 2010), 2011, 224 : 422 - 435
  • [6] The Improved Dijkstra's Shortest Path Algorithm and Its Application
    Wang Shu-Xi
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1186 - 1190
  • [7] Micro crack detection with Dijkstra’s shortest path algorithm
    Christina Gunkel
    Alexander Stepper
    Arne C. Müller
    Christine H. Müller
    Machine Vision and Applications, 2012, 23 : 589 - 601
  • [8] Micro crack detection with Dijkstra's shortest path algorithm
    Gunkel, Christina
    Stepper, Alexander
    Mueller, Arne C.
    Mueller, Christine H.
    MACHINE VISION AND APPLICATIONS, 2012, 23 (03) : 589 - 601
  • [9] An improved Dijkstra's shortest path algorithm for sparse network
    Xu, M. H.
    Liu, Y. Q.
    Huang, Q. L.
    Zhang, Y. X.
    Luan, G. F.
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (01) : 247 - 254
  • [10] An Improvement of the Shortest Path Algorithm Based on Dijkstra Algorithm
    Xiao, Ji-Xian
    Lu, Fang-Ling
    2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 2, 2010, : 383 - 385
12345