Towards Causal Consistent Updates in Software-Defined Networks

Autor: Saul E. Pomares Hernandez, Amine Guidara, Lil Maria X. Rodriguez Henriquez, Ahmed Hadj Kacem, Hatem Hadj Kacem
Jazyk: angličtina
Rok vydání: 2020
Předmět:
consistent network updates
OpenFlow
Transient Forwarding Loop (TFL)
Computer science
Distributed computing
0102 computer and information sciences
02 engineering and technology
software-defined networks
pattern
01 natural sciences
lcsh:Technology
lcsh:Chemistry
0202 electrical engineering
electronic engineering
information engineering

Overhead (computing)
General Materials Science
Transient (computer programming)
Control logic
Instrumentation
lcsh:QH301-705.5
Fluid Flow and Transfer Processes
Asynchronous system
causal order delivery
Network packet
Event (computing)
lcsh:T
Process Chemistry and Technology
General Engineering
020206 networking & telecommunications
lcsh:QC1-999
Computer Science Applications
happened-before relation
lcsh:Biology (General)
lcsh:QD1-999
010201 computation theory & mathematics
lcsh:TA1-2040
Software-defined networking
lcsh:Engineering (General). Civil engineering (General)
lcsh:Physics
Zdroj: Applied Sciences
Volume 10
Issue 6
Applied Sciences, Vol 10, Iss 6, p 2081 (2020)
ISSN: 2076-3417
DOI: 10.3390/app10062081
Popis: A network paradigm called the Software-Defined Network (SDN) has recently been introduced. The idea of SDN is to separate the control logic from forwarding devices to enable a centralized control platform. However, SDN is still a distributed and asynchronous system: events can be triggered by any network entity, while messages and packets are prone to arbitrary and unpredictable transmission delays. Moreover, the absence of a global temporal reference results in a broad combinatorial range space of event order. During network updates, an out-of-order execution of events may result in a deviation from desirable consistent network update properties, leading, for example, to forwarding loops and forwarding black holes, among others. In this paper, we introduce a study of the Transient Forwarding Loop (TFL) phenomenon during SDN updates
for this, we define a formal model of the TFL based on causal dependencies that capture the conditions under which it may occur. Based on this model, we introduce an algorithm that ensures the causal dependencies of the system oriented toward TFL-free SDN updating. We formally prove that it is sufficient to ensure the causal dependencies in order to guarantee TFL-free network updates. Finally, we analytically evaluate our algorithm and discuss how it outperforms the state-of-the-art in terms of updating overhead.
Databáze: OpenAIRE