ISSN:
1572-9443
Keywords:
head-of-the-line processor-sharing
;
many queues
;
permanent customers
;
marked point process
;
stability condition
;
Loynes’ construction
;
ergodicity
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We consider a single server system consisting of n queues with different types of customers and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). By means of Loynes’ monotonicity method a stationary work load process is constructed and using sample path analysis general stability conditions are derived. They allow to decide which queues are stable and, moreover, to compute the fraction of processor capacity devoted to the permanent customers. In case of a stable system the constructed stationary state process is the only one and for any initial state the system converges pathwise to the steady state.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1019155524681
