✦ LIBER ✦

Optimal control of some queueing networks

✍ Scribed by Y. Yavin; C. Frangos

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 649 KB
Volume: 16
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90115-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal stochastic switching of some que

Optimal stochastic switching of some queueing networks

✍ Yaakov Yavin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Optimal control of Markovian queueing sy

Optimal control of Markovian queueing systems

✍ C. F. Klein; W. A. Gruver 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 643 KB

Optimal dynamic routing in Markov queuei

Optimal dynamic routing in Markov queueing networks

✍ Keith W. Ross 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinat

Near‐optimal analysis of homogeneous cen

Near‐optimal analysis of homogeneous central‐server queueing networks

✍ Pentzaropoulos, G. C. ;Giokas, D.I. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 1 views

Number of servers in a queueing network N population of network (user tasks) Σ i representation of server i = 1, 2, 3, …, K I total number of inputs received from environment C time between successive inputs (cycle time) T time corresponding to measurements L i mean queue length (tasks) at server i

Optimal service and arrival rates in Jac

Optimal service and arrival rates in Jackson queueing networks

✍ Kurt M. Bretthauer 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, b

Optimal server allocation in general, fi

Optimal server allocation in general, finite, multi-server queueing networks

✍ J. MacGregor Smith; F. R. B. Cruz; T. van Woensel 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

## Abstract Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series‐parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonst