Distributed bandwidth allocation based on alternating evolution algorithm

  • Authors:
  • Xiaomeng Huang;Yongwei Wu;Guangwen Yang;Weiming Zheng;Jinlei Jiang

  • Affiliations:
  • Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a network, end nodes have to compete for bandwidth through some distributed congestion control algorithms. It is a great challenge to ensure the efficiency and fairness of the distributed control algorithms. TCP congestion control algorithms do not perform well in terms of their efficiency and fairness in high speed networks. In this paper, we propose a novel asymptotic evolution algorithm based on the Logistic Model to allocate limited bandwidth resource. The algorithm introduces an explicit bandwidth pre-allocation factor. The factor is carried by the packet and is computed in routers based on the information of the router capacity, the aggregate load, and the instantaneous queue length; therefore the algorithm does not require the routers to keep the per-flow state. According to this pre-allocation bandwidth factor, the senders asymptotically adjust their sending rate and the bandwidth factor changes asymptotically along with the variation of the aggregate load and the queue length in the routers; therefore the sending rate and the pre-allocation bandwidth factor form alternating evolution and eventually reach a steady state. Theoretical analysis and simulation experiments were conducted to compare our algorithm with related ones. The results show that our algorithm not only provides fast convergence to efficiency and fairness, but also keeps a strong robustness against crossing traffic.