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

Author(s):  
Ian Vilar Bastos ◽  
Vinicius Correa Ferreira ◽  
Debora Christina Muchaluat-Saade ◽  
Celio Vinicius Neves de Albuquerque ◽  
Igor Monteiro Moraes
Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1079
Author(s):  
Vladimir Kazakov ◽  
Mauro A. Enciso ◽  
Francisco Mendoza

Based on the application of the conditional mean rule, a sampling-recovery algorithm is studied for a Gaussian two-dimensional process. The components of such a process are the input and output processes of an arbitrary linear system, which are characterized by their statistical relationships. Realizations are sampled in both processes, and the number and location of samples in the general case are arbitrary for each component. As a result, general expressions are found that determine the optimal structure of the recovery devices, as well as evaluate the quality of recovery of each component of the two-dimensional process. The main feature of the obtained algorithm is that the realizations of both components or one of them is recovered based on two sets of samples related to the input and output processes. This means that the recovery involves not only its own samples of the restored realization, but also the samples of the realization of another component, statistically related to the first one. This type of general algorithm is characterized by a significantly improved recovery quality, as evidenced by the results of six non-trivial examples with different versions of the algorithms. The research method used and the proposed general algorithm for the reconstruction of multidimensional Gaussian processes have not been discussed in the literature.


Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5042
Author(s):  
Tomasz Nycz ◽  
Tadeusz Czachórski ◽  
Monika Nycz

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.


Sign in / Sign up

Export Citation Format

Share Document