Modified fair queueing for finite buffer in ATM networks

A service scheduling scheme that controls the order of servicing cells within an ATM node is very important in providing guaranteed services. Much attention has previously been paid to emulating the general processor sharing (GPS) system as closely as possible with low computational complexity. The primary motivation of emulating the GPS system is to provide traffic isolation and thus to achieve a maximum delay bound. This delay bound is guaranteed by guaranteeing the minimum bandwidth. However, after guaranteeing the minimum bandwidth, some excess bandwidth might be left over and we argue that it should be used more intelligently to improve other system performance. In this paper, we propose a novel scheduling scheme that guarantees each traffic stream a minimum bandwidth while achieving a low cell loss probability in a finite buffer ATM node