A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks

Guang LU, Jian-Wen QI

Abstract


For the problem that traditional IPACT may cause superior USR, this paper constructs the Agent dynamic bandwidth allocation model. Introduced the idea of bargaining game. Proposed a local bandwidth allocation algorithm based on the bargain—bargain. Resequencing the date packets after bargaining according to the user level, delay and the size of packet. It Improves the thinking in traditional IPACT that date packet in order polling. The method may effectively solve the bandwidth allocation problem under the action of many factors. Experiments show that the model can effectively reduce the USR. It can also improve the efficiency of bandwidth allocation.

Keywords


Dynamic Bandwidth Allocation, Agent Model, IPACT, Bargain, USR


DOI
10.12783/dtcse/aice-ncs2016/5697

Full Text:

PDF

Refbacks

  • There are currently no refbacks.