Abstract

With the development of network technology such as software-defined network (SDN) and network function virtualization (NFV), Internet service providers (ISPs) are increasingly placing the virtual network function(VNF) instances at the network edge to provide network service. However, there are some issues to be tackled in the distributed SDN/NFV enabled cloud. Firstly, VNF instances require to be chained in predefined order to provide network services. It is a challenge to optimally select and chain VNF instances from the multi-instances. Moreover, due to the capacity limitation of the distributed edge nodes. The capacity of the Virtual Machines (VMs) that host VNFs should be proactively adjusted to cope with traffic demands. Since most existing works ignore the vertical capacity scaling problem in routing commodities with Service Function Chain (SFC) requests. In this paper, a fine-grained scheduling scheme at VM-level is proposed. Firstly, we formulate the SFC chaining problem as an Integer Linear Programming (ILP) model aiming to embed SFC requests with minimum estimated latency cost. Furthermore, we formulate the adaptive VNF resource allocation (VNF-AR) problem as a convex optimization. The theoretical optimal capacity for each VM can be derived from the Karush-Kuhn Tucker (KKT) conditions. At last, a novel joint optimization approach of VNF chaining and adaptive scaling (VNF-CAS) is proposed to efficiently embed the SFC requests. Performance evaluation shows that VNF-CAS can achieve better performance in SFC requests acceptance rate, average effective throughput, average load utilization and VM load balancing when it is compared with other algorithms in existing works.

Highlights

  • In traditional, the Internet service providers (ISPs) use the dedicated hardware equipment to offer different network functions such as Firewalls, Proxies, Network Address Translators (NATs) and Intrusion Detection Systems (IDSs), this can result in high cost and inflexible management of ISP’s network

  • The network function virtualization (NFV) architecture [2] is composed of three main components, Virtual Network Functions (VNF), Network Function Virtualization Infrastructure (NFVI), management and orchestration architectural framework (NFV MANO)

  • Bari et al [18] formulated this problem as an Integer Linear Programming (ILP) model, the costs of VNF deployment, energy, and Service Level Objective (SLO) violation are considered with the aim of minimum Operating Expenditures (OPEX) and fragmentation

Read more

Summary

INTRODUCTION

J. Zu et al.: Resource Aware Chaining and Adaptive Capacity Scaling for SFCs in Distributed Cloud Network. The work in [12] studied the joint problem of VNF placement and path selection to better utilize network resource, it was verified to serve more demands by optimizing the VM reuse factor and path length. Fig. shows a simple instance of the SFC in the distributed cloud system: a client needs to get social network service (e.g. logging in Facebook server through an SFC) This SFC is composed of 3 types of VNFs, the Web Proxy, the Firewall (FW) and the Load Balancer (LB). A joint VNF chaining and adaptive scaling optimization in the distributed cloud system is proposed. There are mainly two problems in the following to be solved: (1) How to optimally select and concatenate VNF instances based on the resource information of the substrate network.

RELATED WORK
SERVICE FUNCTION CHAIN REQUESTS
DEFINITION OF THE RESOURCE COST
PROPOSED ALGORITHM
PERFORMANCE EVALUATION
Findings
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call