Analysis of core-stateless fair queuing for fair bandwidth allocation in an IP network

Abstract

CSFQ is used to improve the quality of packet transmission by dividing the network into 2 routers, edge routers perform the scheduling of each packet flow queue and core routers provide a label that contains information the bandwidth allocation of each flow packet queue. However, CSFQ consume bandwidth for each flow, so less fit when applied to peer-to-peer traffic. In this paper, the calculation and analysis of the implementation of CSFQ, which is performed until the packet flow is the 50th. The analysis shows that for the conditions of fair share rate of 2 Mbps and a constant arrival rate of 4 Mbps, then the output link speed up to 100 Mbps and there is no probability that the packet is discarded. In addition, the packet length and the rate of arrival, does not significantly affect the rate of arrival estimation. In the flow 1st until 32nd, while the size of the packet and the arrival rate is greater, has led to the estimated arrival rate increases. However, in the flow 33rd, the estimated arrival rate will be equal to the arrival rate, which is equal to 4 Mbps.