# Introduction to queueing networks

@inproceedings{Gelenbe1987IntroductionTQ, title={Introduction to queueing networks}, author={Erol Gelenbe and Guy Pujolle}, year={1987} }

Queues with a Single Server. Jackson Networks. Extensions to Queues with a Single Server. Baskett, Chandy, Muntz and Palacios Networks. Approximate Methods. Flows in Networks. G-Networks: Positive and Negative Customers, Signals and Batch Removal. G-Networks with Multiple Classes of Signals and Positive Customers. Discrete-Time Queueing Systems. Bibliography. Appendix. Index.

#### Topics from this paper

#### 634 Citations

A Queueing Network with Random-Delay Signals

- Mathematics
- 2002

A queueing network with an input flow of signals, along with a flow of ordinary (positive) customers, at its nodes is studied. A random time is required to activate a signal upon arrival at a node.… Expand

On Queueing Networks with Signals

- Computer Science
- 2002

Abstract—G-networks with ordinary (positive) customers and signals are considered under the assumption that signal processing (activation) requires a random amount of time. Activated signals either… Expand

Decomposition of Queueing Networks with Dependent Service and Negative Customers

- Computer Science
- 2004

Queueing networks with negative customers (G-networks) and dependent service at different nodes are studied and the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form. Expand

Static optimization of queueing systems

- Computer Science
- 1995

textabstractThis paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers,… Expand

Stability of queueing networks

- Mathematics
- 2008

Queueing networks constitute a large family of stochastic models, involving jobs that enter a network, compete for service, and eventually leave the network upon completion of service. Since the… Expand

CHAPTER 5 – Network of Queues

- Computer Science
- 2003

This chapter presents general network models and examines the systems in which services are required to be provided in a number of successive stages. Expand

KALASHNIKOV MEMORIAL SEMINAR On Queueing Networks with Signals

- 2002

Abstract—G-networks with ordinary (positive) customers and signals are considered under the assumption that signal processing (activation) requires a random amount of time. Activated signals either… Expand

Heavy-traffic limits for stationary network flows

- Computer Science
- Queueing Syst. Theory Appl.
- 2020

The existence of unique stationary flows in generalized Jackson networks and convergence to the stationary flows as time increases are established and heavy-traffic limits are established, allowing an arbitrary subset of the queues to be critically loaded. Expand

Networks of queues with service anticipating routing

- Computer Science, Mathematics
- 1988

A non-standard product form expression is obtained that averages out dependencies of routing and service times in queues with general service requirements and routing depending upon the next required service time. Expand

Optimal control of single-server queueing networks

- Computer Science
- ZOR Methods Model. Oper. Res.
- 1993

A general single-server queueing network model is considered and it is shown that an approximate largest-index policy yields an approximately optimal policy, which leads to efficient methods for computing the indices. Expand