Bandwidth allocation in virtual network based on traffic prediction

Abstract

For future internet, network virtualization provides the feasibility of running multiple routing architectures on a shared physical infrastructure. This paper presents the design and evaluation of a bandwidth allocation algorithm based on multi-commodity flow problem solver ?? which integrated with a traffic predictor. The basic idea of our design is that some failure in the MFP computation implies that one or more links do not have enough available capacity, which violates the linear constraints on the commodities for each link when modeling MFP. To avoid producing bottleneck links, we employed traffic predictor. On one hand, MFP solver makes better resource utilization by making use of the thin pieces of available bandwidth, by which the virtual network can accept more service requests. On the other hand, the traffic predictor adjusts the link with the largest occupation (bottleneck link) by checking the traffic rate of a user link and adjusting the reserved bandwidth based on the Forecasting of the traffic history. Then we present the results of performance comparisons of the predictor-integrated algorithm and the allocation algorithm only by Solving MFP. The comparisons are based on the mean packet delay, the variance of the packet delay, and the buffer requirements. Our performance tests show that predictor-integrated algorithm works better than the allocation algorithm only by Solving MFP in terms of the three metrics listed above.