Individual customer’s behaviour in networks with state-dependent arrival rates

Authors:
Hans Daduna;Stephan Meyer
Affiliations:
Institute of Mathematical Stochastics, University of Hamburg, Bundesstrasse 55, D-20146 Hamburg, Germany E-mail: daduna@math.uni-hamburg.de;Institute of Mathematical Stochastics, University of Hamburg, Bundesstrasse 55, D-20146 Hamburg, Germany E-mail: daduna@math.uni-hamburg.de
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 8
Cited 1

Some results for steady-state and sojourn time distributions in open and closed linear networks of Bernoulli servers with state-dependent service and arrival rates

Performance Evaluation - Special issue on applied probability modelling in telecommunication
Sojourn time distributions in non-product queueing networks

Frontiers in queueing
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
The Distribution of Queuing Network States at Input and Output Instants

Journal of the ACM (JACM)
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues

Journal of the ACM (JACM)
Stochastic Analysis of Computer and Communication Systems

Stochastic Analysis of Computer and Communication Systems
Discrete Time Analysis of a State Dependent Tandem with Different Customer Types

Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Queueing Networks and Markov Chains

Queueing Networks and Markov Chains

On the M(n)/G/∞ steady-state distribution

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Jackson networks with state-dependent arrival and service rates which show product form or nearly product form steady-states and come up with examples of load-dependent admission control. For these networks we prove an arrival theorem for external as well as for internal arrivals. In case of open tandem systems with state-independent service rates we compute the joint distribution of the sojourn times of a customer in the nodes and the distribution of the customer’s end-to-end-delay.