Personal tools
You are here: Home Publications Journal Papers A Class of Scheduling Policies for Mixed Data with Renewal Arrival Processes

A Class of Scheduling Policies for Mixed Data with Renewal Arrival Processes

Filed under:
H. Deliç and P. Papantoni-Kazakos, IEEE Transactions on Automatic Control, Vol. 38, No. 3, pp. 455-459, March 1993.

Abstract—We consider two mutually independent traffic streams whose arrivals are modeled as renewal processes. 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, we find the class of nonpreemptive scheduling policies which satisfy the delay constraint while maintaining the system stability.  The delays induced by the latter policy are analyzed via a methodology based on the regenerative theorem. We provide a numerical example  where the policy that minimizes the expected delays for both traffic streams is also considered.

Article [pdf]

Document Actions
« August 2017 »
August
MoTuWeThFrSaSu
123456
78910111213
14151617181920
21222324252627
28293031