A Note on the Stability of the Many-Queue Head-of-the Line Processor-Sharing System with Permanent Customers

Please always quote using this URN: urn:nbn:de:0297-zib-2659
  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Andreas Brandt, Manfred Brandt
Document Type:ZIB-Report
Date of first Publication:1996/12/11
Series (Serial Number):ZIB-Report (SC-96-55)
Published in:Appeared in: Queueing Systems, 32 (1999) 363-381