Optimal Routing Among ⋅/M/1 Queues with Partial Information

DOI10.1081/STM-120034126zbMath1060.60087MaRDI QIDQ3157852

Uri Yechiali, Tania Jiménez, Rudesindo Núñez-Queija, Eitan Altman

Publication date: 19 January 2005

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

communication networks; performance optimization; dynamic routing

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

EXPLICIT SOLUTIONS FOR CONTINUOUS-TIME QBD PROCESSES BY USING RELATIONS BETWEEN MATRIX GEOMETRIC ANALYSIS AND THE PROBABILITY GENERATING FUNCTIONS METHOD, Proofs of conjectures on the competition between observable and unobservable servers, The age of the arrival process in the G/M/1 and M/G/1 queues, Optimal arrivals in a two-server rational random-access system with loss, Optimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space, Equilibrium customers' choice between FCFS and random servers, Customer equilibrium in a single-server system with virtual and system queues, Strategic customer behavior in a queueing system with a loss subsystem, On equilibrium threshold strategies when choosing between observable and unobservable queues, Computational schemes for two exponential servers where the first has a finite buffer, An Overview for Markov Decision Processes in Queues and Networks

Cites Work

• Unnamed Item
• A logarithmic reduction algorithm for quasi-birth-death processes
• On the Advantage of Being the First Server
• Spectral analysis of M/G/1 and G/M/1 type Markov chains