Abstract
We consider a collection of queues operating in parallel and sharing a common server via the idling randomized service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: 'smoothed' perturbation analysis and stochastic intensity-based estimators.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2627-2630 |
| Number of pages | 4 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 3 |
| State | Published - Dec 1 1994 |
| Event | Proceedings of the 2nd IEEE International Symposium on Requirements Engineering - York, Engl Duration: Mar 27 1995 → Mar 29 1995 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization