Towards Cascading Problem for Dynamic Rate Allocations in ISP Networks with SDN
Chao Song, Jiqing Gu, Lei Shi, Yongqiang Qi, Ming Liu · 2019
To improve the experience of various network applications, dynamic rate allocation is an essential issue in recent ISP networks. The emergence of software-defined networking (SDN) and the OpenFlow specification makes dynamic rate allocation in ISP networks efficient. The allocation could locally run on a home network gateway (edge switch) under SDN, but such local range of rate allocation reduces the overall fairness and performance in the whole network. However, under a global range, the request of rate allocation from a small number of hosts will cause all switches on the entire network to participate. This is termed as cascading problem, which causes a high cost for re-allocating the rates with the global range of switches. In this paper, we investigate the cascading problem for dynamic rate allocation with SDN, and discuss the tradeoff between the performance and cost for the range of rate allocation. We propose a Rate Allocation algorithm with Limited Range (RALR) in SDN, and discuss it for dynamic rate allocation by the theory of Lyapunov drift. Our intensive simulations verify the performance of the proposed strategy of rate allocation in SDN.