A class of scheduling policies for mixed data with renewal arrival processes

Two mutually independent traffic streams whose arrivals are modeled as renewal processes are considered. The arrivals are stored in an infinite capacity buffer. One of the processes requires a strict upper bound on the total delay per arrival, and it is assumed that the processing time per arrival for both processes is a constant. Given the above model, the class of nonpreemptive scheduling policies which satisfy the delay constraint while maintaining the system stability is found. The delays induced by the latter policy are analyzed via a methodology based on the regenerative theorem. A numerical example is given in which the policy that minimizes the expected delays for both traffic streams is also considered