2000 Articles
Workload bounds in fluid models with priorities
In this paper we establish upper and lower bounds on the steady-state per-class workload distributions in a single-server queue with multiple priority classes. Motivated by communication network applications, the model has constant processing rate and general input processes with stationary increments. The bounds involve corresponding quantities in related models with the first-come first-served discipline. We apply the bounds to support a new notion of effective bandwidths for multi-class systems with priorities. We also apply the lower bound to obtain sufficient conditions for the workload distributions to have heavy tails.
Subjects
Files
- bounds.pdf application/pdf 208 KB Download File
Also Published In
- Title
- Performance Evaluation
- DOI
- https://doi.org/10.1016/S0166-5316(99)00075-9
More About This Work
- Academic Units
- Industrial Engineering and Operations Research
- Published Here
- September 19, 2017