Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 11 March 2019

A Conflict-Free Routing Tables Update Method for Persistent Multilink and Node Failures in SDN Architectures

Yannick Florian Yankam1, Jean Frédéric Myoupo2 & Vianney Kengne Tchendji1

Journal of Computer Science, Volume 15, Issue 3, pp. 332–345 · doi.org/10.3844/jcssp.2019.332.345

7,469 accesses4,031 downloads3 citations (Crossref)Metrics
Cite Check for updates

Abstract

The large-scale network management abilities of centralized architectures, such as Software-Defined Networking (SDN), are attracting increasing interest from major computer networking companies. In this architecture type, the nodes follow the rerouting rules predefined by the control plane in the controller. However, when a link or node failure becomes persistent over the time, the controller must recompute the routing and rerouting rules and update the relevant nodes to maintain an acceptable quality of service (QoS). In this study, we propose a conflict-free mechanism for updates of routing and rerouting tables of nodes by the controller. This mechanism works without disrupting the current traffic if both persistent multilink and node failures occur. We describe an efficient strategy for choosing the nodes to update and define an update scheme for these nodes. We show through the simulations of our updating scheme on various networks that our strategy improves QoS by reducing packet routing delays and the data loss rate in case of persistent multilink and node failures in the network. We also compare our results to those of several existing studies.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Yankam, Y. F., Myoupo, J. F. & Tchendji, V. K. (2019). A Conflict-Free Routing Tables Update Method for Persistent Multilink and Node Failures in SDN Architectures. Journal of Computer Science, 15(3), 332–345. https://doi.org/10.3844/jcssp.2019.332.345

Licence
CC BY 3.0
Issue
Volume 15, Issue 3
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
A Conflict-Free Routing Tables Update Method for Persistent Multilink and Node Failures in SDN ArchitecturesJournal of Computer Science · Volume 15, Issue 3 · pp. 332–345 · CC BY 3.0Download