Pseudo-conservation laws in cyclic-service systems with a class of limited service policies |
| |
Authors: | Kow C. Chang Deniz Sandhu |
| |
Affiliation: | (1) IBM Research Division, Thomas J. Watson Research Center, 10598 Yorktown Heights, NY, USA;(2) Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, 12180 Troy, NY, USA |
| |
Abstract: | This paper considers a cyclic-service system with a class of limited service policies that consists of exhaustive limited, gated limited and general decrementing policies. Under these policies, the number of customers served consecutively during a server visit is limited by a vector of integers. The major results in this paper are derivations of expected amount of work left in the queues at the server departures for these three policies. Exact expressions of weighted sum of mean waiting times, known as pseudo-conservation laws, are subsequently obtained. The conservation laws for this class of policies contain unknown boundary probabilities. We estimate these probabilities using corresponding server vacation models. Numerical results presented for the exhaustive limited policy are noted to be very accurate compared with simulation results. Moreover, we have obtained analytical bounds for the weighted sums. Finally, we present a conservation law with mixed service policies, and mean waiting times for symmetric systems.This work was completed while the author was in the Ph.D. program at Rensselaer Polytechnic Institute.This work was partially supported by the Center for Advanced Technologies of the New York State. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|