Biblio

On cloud computing systems consisting of task queuing and resource allocations, it is essential but hard to model and evaluate the global performance. In most of the models, researchers use a stochastic process or several stochastic processes to describe a real system. However, due to the absence of theoretical conclusions of any arbitrary stochastic processes, they approximate the complicated model into simple processes that have mathematical results, such as Markov processes. Our purpose is to give a universal method to deal with common stochastic processes as long as the processes can be expressed in the form of transition matrix. To achieve our purpose, we firstly prove several theorems about the convergence of stochastic matrices to figure out what kind of matrix-defined systems has steady states. Furthermore, we propose two strategies for measuring the rate of convergence which reflects how fast the system would come to its steady state. Finally, we give a method for reducing a stochastic matrix into smaller ones, and perform some experiments to illustrate our strategies in practice.

Life-cycle management of stateful VNF services is a complicated task, especially when automated resiliency and scaling should be handled in a secure manner, without service degradation. We present FlowSNAC, a resilient and scalable VNF service for user authentication and service deployment. FlowSNAC consists of both stateful and stateless components, some of that are SDN-based and others that are NFVs. We describe how it adapts to changing conditions by automatically updating resource allocations through a series of intermediate steps of traffic steering, resource allocation, and secure state transfer. We conclude by highlighting some of the lessons learned during implementation, and their wider consequences for the architecture of SDN/NFV management and orchestration systems.