Bounds and Comparisons for Some Queueing Systems.

Abstract

Bounds and comparisons for various performance measures in tandem queueing systems and loss systems are studied. Using a definition of variability of random variables, it is proven that for a tandem queueing system with n stations in series, where each station can have either one server with an arbitrary service distribution or a number of constant servers in parallel, the expected total waiting time in system of every customer decreases as the variability of interarrival and service distributions decreases. A new sufficient condition for customer average delay to be smaller (larger) than time average delay in single server queues is also given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1977
Accession Number
ADA047951

Entities

People

  • Shun-chen Niu

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Air Force
  • California
  • Differential Equations
  • Distribution Functions
  • Equations
  • Ergodic Processes
  • Markov Chains
  • Military Research
  • Notation
  • Numbers
  • Operations Research
  • Probability
  • Queueing Theory
  • Random Variables
  • Scientific Research
  • Security
  • United States

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Mathematics or Statistics