English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Network softwarization is one of the major paradigm shifts in the nextgeneration of networks. It enables programmable and flexible management anddeployment of the network. Network function virtualization (NFV) is referred tothe deployment of software functions running on commodity servers instead oftraditional hardware-based middle-boxes. It is an example of networksoftwarization. In NFV, a service is defined as a chain of software functionsnamed service chain function (SFC). The process of allocating the resources ofservers to the services, called service placement, is the most challengingmission in NFV. Dynamic nature of the service arrivals and departures as wellas meeting the service level agreement make the service placement problem evenmore challenging. In this paper, we propose a model for dynamicreliability-aware service placement based on the simultaneous allocation of themain and backup servers. Then, we formulate the dynamic reliability-awareservice placement as an infinite horizon Markov decision process (MDP), whichaims to minimize the placement cost and maximize the number of admittedservices. In the proposed MDP, the number of active services in the network isconsidered to be the state of the system, and the state of the idle resourcesis estimated based on it. Also, the number of possible admitted services isconsidered as the action of the presented MDP. To evaluate each possible actionin the proposed MDP, we use a sub-optimal method based on the Viterbi algorithmnamed Viterbi-based Reliable Static Service Placement (VRSSP) algorithm. Wedetermine the optimal policy based on value iteration method using an algorithmnamed VRSSP-based Value Iteration (VVI) algorithm. Eventually, through theextensive simulations, the superiority of the proposed model for dynamicreliability-aware service placement compared to the static solutions isinferred.

A Dynamic Reliability-Aware Service Placement for Network Function Virtualization (NFV)