A finite buffer scheduling scheme with statistical guarantee for VBR traffic in ATM networks

Abstract

Future ATM networks will support real-time voice and video services and Re need to guarantee cell transfer delay and cell loss probability to launch such services. The earliest deadline first (EDF) scheme is a suitable service scheduling scheme for these services since it has been proven that it can minimize the number of late cells by assigning deadlines to the cells. However, the EDF scheme considers only the infinite buffer case and is susceptible to buffer overflow when finite buffer is considered. In this paper, we propose a novel scheme, earliest deadline first for finite buffer (EDF-FB), which is able to provide a statistical delay bound while having a lower chance of buffers overflow than the EDF scheme.