On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers

Andreas Brandt () and Manfred Brandt ()

Mathematical Methods of Operations Research, 1998, vol. 47, issue 2, 220 pages

Abstract: We consider a single server system consisting of e queues with different types of customers (Poisson streams) andk 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). The stability condition and a pseudo work conservation law will be given for arbitrary service time distributions; for exponential service times a pseudo conservation law for the mean sojourn tunes can be derived. In case of two queues and exponential service times, the generating function of the stationary occupancy distribution satisfies a functional equation being a Riemann-Hilbert problem which can be reduced to a Dirichlet problem for a circle. The solution yields the mean sojourn times as an elliptic integral, which can be computed numerically very efficiently. In case ofn ≥ 2 a numerical algorithm for computing the performance measures is presented, which is efficient forn ≤ 3. Since forn ≥ 4 an exact analytical or/and numerical treatment is too complex a heuristic approximation for the mean sojourn times of the different types of customers is given, which in case of a (completely) symmetric system is exact. The numerical and simulation results show that, over a wide range of parameters, the approximation works well. Copyright Physica-Verlag 1998

Keywords: head-of-the-line processor-sharing; many queues; permanent customers; sojourn times; pseudo conservation law; Riemann-Hilbert problem; Dirichlet problem (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/BF01194397 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:47:y:1998:i:2:p:181-220

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/BF01194397

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().