In this thesis, we present two fairly general classes of so called overflow queueing networks. These networks consist of two queues, where the capacity of the first queue is always finite. Customers arriving at the first queue have an overflow capability from the first to the second queue if the first queue operates at a certain fixed capacity, i.e., under certain conditions, demands arriving at the first queue are allowed to join the second queue. The overflow stream will additionally be weighted with a parameter p. This parameter can be used as a control parameter or to model the customers´ impatience. We reduce the number of unknown steady-state probabilities of these system in a considerable amount by a generating functions approach and a separation technique.
Identifer | oai:union.ndltd.org:uni-osnabrueck.de/oai:repositorium.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-2009100717 |
Date | 06 October 2009 |
Creators | Sendfeld, Walter Peter |
Contributors | Prof. Dr. Wolfgang Stadje, Prof. Dr. Uri Yechiali |
Source Sets | Universität Osnabrück |
Language | English |
Detected Language | English |
Type | doc-type:doctoralThesis |
Format | application/zip, application/pdf |
Rights | http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0122 seconds