✦ LIBER ✦

Optimal stopping and control of dynamic routing in networks

✍ Scribed by Y. Yavin

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 549 KB
Volume: 17
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(93)90039-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Optimal stochastic switching of dynamic

Optimal stochastic switching of dynamic routing in networks

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

The theory of optimal stochastic switching with switching costs is applied in the control of dynamic routing in networks with randomly perturbed flows. An example is numerically solved and a numerical study is conducted.

Integrated dynamic distributed routing a

Integrated dynamic distributed routing and admission control in ATM networks

✍ R. Bolla; A. Dalal'Ah; F. Davoli; M. Marchese; M. S. Obaidat 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB 👁 2 views

A node-by-node admission control and routing scheme for ATM networks is devised. The scheme is based on the subdivision of traffic into a number of classes, characterized by different performance requirements. At each network node, for all outgoing links, link capacity partitions are periodically as

Control of dynamic routing in networks w

Control of dynamic routing in networks with Markov jump parameters

✍ Y. Yavin; C. Frangos 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 643 KB

A stochastic control problem concerning the dynamic routing of a randomly perturbed flow in a network is considered. The main source for the random perturbations in the network is a random failure and repair process that is modelled here by Markov jump parameters. Sufficient conditions on optimal fe

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 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