Research On Bandwidth Broker Guaranteeing Quality Of Service In The Grid

As a new generation infrastructure built on the Internet, the Grid has brought wide attention in both foreign and domestic academia and industry. The earliest foreign research on Grid Computing began in the early 1990's, while the domestic research on Grid Computing probably began in the year of 2000 or so.This paper mainly does some research on bandwidth broker providing quality of service guarantees in the Grid. This paper presents a Core-Stateless Adaptive Proportional Fair Bandwidth Allocation algorithm on the basis of the Core-Stateless Fair Queueing algorithm. The basic thought of the CSAPFBA algorithm is: the edge routers perform the state management per flow, and the edge routers differentiate between the marked flows and the non-marked flows, and the edge routers insert the relevant information into the packet header by using Dynamic Packet State; the core routers divide the output link bandwidth into two parts in the light of the state information of the packet header by using Class-Based Queueing, and the core routers allocate proportionally thebandwidth to the marked flows according to their service profiles and the current network load, and the core routers allocate the bandwidth to the non-marked flows according to the principle of max-min fairness, and the CSAPFBA algorithm can adaptively dynamically adjust the bandwidth allocation between the marked flows and the non-marked flows.This paper designs four simulation experiments to verify the CSAPFBA algorithm, and the results of the four simulation experiments are given. This paper lengthways compares the CSAPFBA algorithm with the CSFQ algorithm and breadthwise compares the CSAPFBA algorithm with the CSPAFA algorithm so as to analyze the performance of the CSAPFBA algorithm from the theoretical and experimental aspects.