Global ETD Search

1	Two-dimensional Overflow Queueing Systems Sendfeld, Walter Peter 06 October 2009 (has links) 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. overflow queueing networks overflow two-queue network state-dependent rates jockeying separation method 90B22 90B15 60J22 27 - Mathematik ddc:510