Bandwidth Management in the Switch with Various Traffic Burstiness.

This paper proposes the bandwidth management algorithm that allows for packet transfer in the switch and admits packets based on the switch and network occupancy. The packets are transferred if the required bandwidth is smaller than the bandwidth currently available. Otherwise, the packets are stored in the buffer. If the buffer is full, the incoming packets are dropped and the transmission is delayed at the sender. It is proven analytically that the packets will not be dropped if the buffer size is greater than or equal to twice the size of queue length and the traffic will not increase during propagation delay of shut off signal between the switch and the source. Performance of the bandwidth management algorithm is analyzed and proven, and depends on the packet arrival rate, required bandwidth, and the network bandwidth. Different network types are chosen to evaluate performance of the bandwidth management algorithm.