Abstract
Middleboxes work as software which runs on a general-purpose server by adopting network function virtualization. The unavailability of middlebox is a key metric. The previous study considers allocating backup servers to middleboxes to reduce the unavailability. While it adopts shared protection to save backup capacity, resource sharing has not been sufficiently explored as each middlebox can only use one backup server. This paper presents a backup allocation model in which a function can be protected by two backup servers and a backup server can protect multiple functions under a shared protection strategy to minimize the maximum unavailability among functions. We use Markov chain to analyze the state transitions and make equilibrium-state equations. By solving them, we obtain the probability of each state of the allocation and compute an unavailability of function. We introduce two algorithms to examine the proposed model; one of them uses the performance bound of the maximum unavailability which is analyzed in this paper. Numerical results show that the proposed model reduces the maximum unavailability by 9.5–51.2% compared to a baseline model that allocates one backup server for each middlebox in our examined cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Network and Service Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.