Optimal Bernoulli Routing in an Unreliable M/G/1 Retrial Queue

Abstract

Recently, Sherman et al. [14] analyzed an M=G=1 retrial queueing model in which customers are forced to retry their service if interrupted by a server failure. Using classical techniques they provided a stability analysis, queue length distributions, key performance parameters, and stochastic decomposition results. We analyze the system under a static Bernoulli routing policy that routes a proportion of arriving customers directly to the orbit when the server is busy or failed. In addition to providing the key performance parameters, we show that this system exhibits a dual stability structure, and we characterize the optimal Bernoulli routing policy that minimizes the total expected holding costs per unit time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2011
Accession Number
ADA536699

Entities

People

  • Jeffrey P. Kharoufeh
  • Nathan P. Sherman

Organizations

  • University of Pittsburgh

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Coefficients
  • Computer Networks
  • Congestion
  • Engineering
  • Equations
  • Industrial Engineering
  • Local Area Networks
  • Markov Chains
  • Markov Processes
  • Network Protocols
  • Networks
  • Probability
  • Random Variables
  • Stability Conditions
  • Steady State
  • Stochastic Processes

Readers

  • Computer Networking
  • Control Systems Engineering.
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space