2019/11/15 by Mohammad Karimzadeh‐Farshbafan, Farshbafan, Mohammad Karimzadeh, Vahid Shah‐Mansouri +3
Computer Science · Engineering · #Cloud Computing and Resource Management #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Radiation Effects in Electronics #Software System Performance and Reliability #Software-Defined Networks and 5G
paper · pdf · doi:10.48550/arxiv.1911.06532
openalex publication_date 2019/11/15 · openalex created_date 2022/09/28 · openalex updated_date 2026/07/28
Network softwarization is one of the major paradigm shifts in the next\ngeneration of networks. It enables programmable and flexible management and\ndeployment of the network. Network function virtualization (NFV) is referred to\nthe deployment of software functions running on commodity servers instead of\ntraditional hardware-based middle-boxes. It is an example of network\nsoftwarization. In NFV, a service is defined as a chain of software functions\nnamed service chain function (SFC). The process of allocating the resources of\nservers to the services, called service placement, is the most challenging\nmission in NFV. Dynamic nature of the service arrivals and departures as well\nas meeting the service level agreement make the service placement problem even\nmore challenging. In this paper, we propose a model for dynamic\nreliability-aware service placement based on the simultaneous allocation of the\nmain and backup servers. Then, we formulate the dynamic reliability-aware\nservice placement as an infinite horizon Markov decision process (MDP), which\naims to minimize the placement cost and maximize the number of admitted\nservices. In the proposed MDP, the number of active services in the network is\nconsidered to be the state of the system, and the state of the idle resources\nis estimated based on it. Also, the number of possible admitted services is\nconsidered as the action of the presented MDP. To evaluate each possible action\nin the proposed MDP, we use a sub-optimal method based on the Viterbi algorithm\nnamed Viterbi-based Reliable Static Service Placement (VRSSP) algorithm. We\ndetermine the optimal policy based on value iteration method using an algorithm\nnamed VRSSP-based Value Iteration (VVI) algorithm. Eventually, through the\nextensive simulations, the superiority of the proposed model for dynamic\nreliability-aware service placement compared to the static solutions is\ninferred.\n