Fair delay variation round-robin (FDVR) scheduler for ABR services carrying real-time traffic

We propose the fair delay variation round-robin (FDVR) scheduling algorithm for use in real-time ABR services in ATM networks. The FDVR scheduler operates in two procedures based on a simple and fast scheduling calculation and queueing. We investigated how the performance of the FDVR scheme varies depending on the round length, the waiting list management policy, and the distribution of the allocated rates. As the measure of performance of fair delay variation, we used a new measure called the fairness index. Through simulations, we confirmed that the FDVR algorithm maintains a small and constant computation time and supports fairness in delay variation for ABR virtual connections (VCs) of near-optimal manner.