Routing in queueing networks under imperfect information: stochastic dominance and thresholds

DOI10.1080/17442508908833551zbMath0669.90049OpenAlexW1973701469MaRDI QIDQ3823397

Demosthenis Teneketzis, Frederick J. Beutler

Publication date: 1989

Published in: Stochastics and Stochastic Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17442508908833551

zbMATH Keywords

convexitysubmodularitybang-bang controlimperfect informationOptimal policies for routing between two serversstochastic ordering of information measuresthreshold routing policies

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (6)

Cost-aware defense for parallel server systems against reliability and security failures ⋮ Monotone control of queueing networks ⋮ Stochastic comparisons for rooted butterfly networks and tree networks, with random environments ⋮ A survey of Markov decision models for control of networks of queues ⋮ On the Shortest Queue Policy for the Tandem Parallel Queue ⋮ Signaling for decentralized routing in a queueing network

This page was built for publication: Routing in queueing networks under imperfect information: stochastic dominance and thresholds