HOL-EDD: a flexible service scheduling scheme for ATM networks

Abstract

The salient properties of a work-conserving, rate-based service scheduling scheme for ATM networks, called the head-of-the-line earliest due date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the HOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.