Computing Publications

Publications Home » Response times in G-nets

Response times in G-nets

Peter G. Harrison

Conference or Workshop Paper
13th International Symposium on Computer and Information Sciences (ISCIS 1998)
October, 1998
pp.9–16
ISBN 9051994052
Abstract

Although product-forms have long been known for the equilibrium probability distribution of queue lengths in Markovian G-Nets, sojourn (or response) time distribution pose a much more difficult problem. This is because customers can be affected by later arrivals, even under FCFS queueing discipline. Here, the Laplace transform of the probability density function of the response time in a single server, M/M/1 queue with negative rarivals is obtained and the result generalised to the end-to-end delay in tandem networks of two queues. The generalisation is complex, the method being based on the solution of a Riemann-Hilbert-Carleman boundary value problem on a closed contour in the complex plane. The solution is that of a Fredholm integral equation of the second kind.

Keywords
AESOP
Notes

Available on Google Books at http://books.google.co.uk/books?id=ClU2XG64UOIC&lpg=PA9&ots=RXnZw1Oo94&pg=PA9

BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.