✦ LIBER ✦

Optimal dynamic routing in Markov queueing networks

✍ Scribed by Keith W. Ross

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 369 KB
Volume: 22
Category: Article
ISSN: 0005-1098
DOI: 10.1016/0005-1098(86)90035-x

No coin nor oath required. For personal study only.

✦ Synopsis

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 subordinated process, fast algorithms are derived for locating an optimal routing policy. A numerical example is given and the application of the theory to computer communication networks is discussed.

📜 SIMILAR VOLUMES

Optimal routing in toroidal networks

✍ Izidor Jerebic; Roman Trobec 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Queue length distributions in a markov m

Queue length distributions in a markov model of a multistage clocked queueing network

✍ Ora E. Percus; J. K. Percus 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

In (41, we treated the problem of passage through a discrete-time clock-regulated multistage queueing network by modeling the input time series (a,,) to each queue as a Markov chain. We showed how to transform probability transition information from the input of one queue to the input of the next in

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 packet fragmentation and routing

Optimal packet fragmentation and routing in computer networks

✍ Orda, Ariel; Rom, Raphael 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB 👁 1 views

The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet-size limitations along the packet's route. This is a typical internetworking problem. We show that the commonly used simplistic approach whereby the routing and fragmentat

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