PDX-PLUS: An SDN Controller with Dynamic Shortest Path Routing

被引：0

作者：

Alshammari, Muteb ^{[1
]}

Rezgui, Abdelmounaam ^{[2
]}

机构：

[1] Northern Border Univ, Fac Comp & Informat Technol, Rafha, Saudi Arabia

[2] Illinois State Univ, Sch Informat Technol, Normal, IL 61761 USA

来源：

2020 IEEE 9TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET) | 2020年

关键词：

Software-defined networks; SDN; Dynamic shortest paths; APSP; Routing;

D O I：

10.1109/CLOUDNET51028.2020.9335792

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Routing in SDNs exploits the controller's global view and computes paths either using a single-source shortest path algorithm (e.g., Dijkstra, Bellman-Ford) or an all-pairs shortest path (APSP) algorithm (e.g., Floyd-Warshall). Existing APSP routing algorithms for SDNs have substantial performance limitations in handling changes in the routes due to link deletion (failure) and link insertion (recovery). In this paper, we present PDX-PLUS, a new SDN controller based on the popular PDX controller. PDX-PLUS includes a new routing module called DR-APSP (Dynamic Routing based on All Pairs Shortest Paths) that computes and efficiently maintains shortest paths between nodes in the SDN.

引用

页数：4

共 16 条

[1]

Al-Fares M., 2010, Nsdi, V10, P89

[2]

Alshammari M, 2020, INT J MATH COMPUT SC, V15, P347

[3]

[Anonymous], POX PLUS CONTROLLER

[4]

Handigol N., 2009, ACM SIGCOMM DEMO, V4, P6

[5]

Heller B., 2010, USENIX NSDI, V10, P249

[6]

Iqbal M., 2017, 2017 INT C INNOVATIO, P1

[7]

Ishimori Airton, 2013, 2013 Second European Workshop on Software Defined Networks (EWSDN), P81, DOI 10.1109/EWSDN.2013.20

[8]

Jeong K, 2012, IEEE IFIP NETW OPER, P1167, DOI 10.1109/NOMS.2012.6212044

[9]

Lantz B., 2010, P ACM SIGCOMM WORKSH, P1, DOI 10.1145/1868447.1868466

[10]

Leskovec J., 2014, SNAP DATASETS STANFO

← 1 2 →