Robustness of Rootfinding in Queueing Analyses

Abstract

There has been frequent controversy over the years regarding the use of numerical rootfinding for the solution of queueing problems. It has been said that such problems quite often present fairly typical computational difficulties. However, it turns out that rootfinding in queueing is so well structured that problems do not occur. There are fundamental properties possessed by the well-known queueing models that eliminate classical rootfinding problems. Most importantly, we show that uniqueness of roots is standard within simply determined regions in the complex plane and prove that the G/EK/1 model has unique roots easily found inside the complex unit circle. Extensive computational results are given to support our contentions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 31, 1988
Accession Number
ADA198916

Entities

People

  • Carl M. Harris
  • Mohan L. Chaudhry
  • William G. Marchal

Organizations

  • George Mason University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Contracts
  • Engineering
  • Equations
  • Ergodic Processes
  • Information Systems
  • Military Research
  • Numerical Analysis
  • Operations Research
  • Probability
  • Probability Distributions
  • Queueing Theory
  • Random Variables
  • Standards
  • Statistics
  • Stochastic Processes
  • Universities

Readers

  • Computational Modeling and Simulation
  • Materials Science and Engineering.
  • Systems Analysis and Design