The M/M/1 Queue with Randomly Varying Arrival and Service Rates.

Abstract

Computationally feasible solutions are studied for a number of problems related to a M/M/1 queve in which the arrival and service rates vary according to the state of an underlying Markov chain. Our results may be used to mode the effects of rush-hour phenomena or other extraneous fluctuations on the characteristics of an M/M/1 queue.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1977
Accession Number
ADA045943

Entities

People

  • Marcel F. Neuts

Organizations

  • University of Delaware

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Delaware
  • Differential Equations
  • Engineering
  • Equations
  • Generators
  • Intervals
  • Markov Chains
  • Probability
  • Probability Distributions
  • Stationary
  • Steady State
  • Systems Engineering

Readers

  • Life Cycle Cost Analysis
  • Mathematical Modeling and Probability Theory.
  • Optical Fiber Sensing and Electromagnetic Propagation.