Optimal routing to parallel heterogeneous servers-small arrival rates

Zvi Rosberg · Armand M. Makowski

28 citations0/0 files storedIEEE Transactions on Automatic Control

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

Consider a set of k(>or=2) heterogeneous and exponential servers that operate in parallel. Customers arrive into a single infinite capacity buffer according to a Poisson process, and are routed to available servers in accordance with some routing policy. It is shown that for arrival rates in some possible interval (0, lambda /sub 0/), ever routing policy which minimizes the long-run expected holding cost is contained in the set of routing policies that minimize the expected flow time for a system with fixed initial population and no new arrivals.>

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 28 citations exist upstream.

References

1975Applying a New Device in the Optimization of Exponential Queuing Systems 1984Optimal control of a queueing system with two heterogeneous servers 1973Semi-Markov Decision Processes with Unbounded Rewards 1989Open Queueing Systems in Light Traffic 1984A note on “Optimal control of a queuing system with two heterogeneous servers”1981Control of multiple exponential servers with application to computer systems

Cited by

2008On performance characteristics for queueing systems with heterogeneous servers

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.