scholarly journals A reactive resource defragmentation method for Virtual Links Mapping in software-defined networks

2017 ◽  
Author(s):  
A.F. Simo Tegueu ◽  
Slim Abdellatif ◽  
Thierry Villemur ◽  
Pascal Berthou
Keyword(s):  
Software Defined Networks ◽  
Virtual Links

Polynomial invariants for virtual marked graphs and virtual surface-link theory I

2017 ◽  
Vol 26 (12) ◽  
pp. 1750081
Author(s):  
Sang Youl Lee
Keyword(s):  
Natural Extension ◽  
Polynomial Invariants ◽  
Kauffman Bracket ◽  
Virtual Links ◽  
Link Theory ◽  
Marked Graphs ◽  
Bracket Polynomial ◽  
The Ideal

In this paper, we introduce a notion of virtual marked graphs and their equivalence and then define polynomial invariants for virtual marked graphs using invariants for virtual links. We also formulate a way how to define the ideal coset invariants for virtual surface-links using the polynomial invariants for virtual marked graphs. Examining this theory with the Kauffman bracket polynomial, we establish a natural extension of the Kauffman bracket polynomial to virtual marked graphs and found the ideal coset invariant for virtual surface-links using the extended Kauffman bracket polynomial.

Path Recovery Algorithm Using Fast-Failover for Software-Defined Networks

2020 ◽  
Author(s):  
Ian Vilar Bastos ◽  
Vinicius Correa Ferreira ◽  
Debora Christina Muchaluat-Saade ◽  
Celio Vinicius Neves de Albuquerque ◽  
Igor Monteiro Moraes
Keyword(s):  
Software Defined Networks ◽  
Recovery Algorithm

scholarly journals Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5042
Author(s):  
Tomasz Nycz ◽  
Tadeusz Czachórski ◽  
Monika Nycz
Keyword(s):  
Diffusion Approximation ◽  
Numerical Models ◽  
Software Defined Networks ◽  
Detailed Model ◽  
Preemptive Resume ◽  
Central Controller ◽  
Priority Systems ◽  
Primary Element ◽  
Preemptive Resume Priority ◽  
General Distributions

The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.

SDNRacer: concurrency analysis for software-defined networks

2016 ◽  
Vol 51 (6) ◽  
pp. 402-415 ◽  
Author(s):  
Ahmed El-Hassany ◽  
Jeremie Miserez ◽  
Pavol Bielik ◽  
Laurent Vanbever ◽  
Martin Vechev
Keyword(s):  
Software Defined Networks
Sign in / Sign up

Export Citation Format

Share Document