IN THE above article[1], in(5), the allocated bandwidth is corrected as

With the emerging paradigm of Virtual Network and Network Function Virtualization (NFV), the data center operator can flexibly manage the network to reduce Operating Expenditures (OPEX) and Capital Expenditures (CAPEX). Some new issues including the assignment of Virtual Network Functions (VNFs) and Service Function Chain (SFC) scheduling should be considered to apply in the communication. Mathematically, the SFC scheduling process can be formulated as a queuing system, and every server installed with VNF instances can be regarded as a service node, where batched requests are parallel submitted and processed one after another. In the management of SFC, the cloud service provider needs to resolve the problem of network congestion. Latency and throughput are two important but contradictory indexes in the network management, and both of them are deserved to be optimized during the scheduling of SFC requests. In this paper, different from most existing studies, we focus on the service rate control problem in the scheduling of SFC requests. Firstly, we formulate this problem as an integer programming problem. Through a cooperative game approach, a Nash bargaining based model is proposed to jointly optimize the latency and throughput, which is proven to provide fair performance guarantees by both theoretical analysis and simulation. To improve the scalability of the proposed algorithm, we also design a polynomial two-phase heuristic to perform Pareto optimization. Simulation evaluation shows that the proposed algorithm can implement balanced traffic scheduling and avoid excessive server latency caused by network congestion.