IDENTIFIABILITY IN GI/G/K QUEUES

Abstract

Consider a queueing system in which customers arrive in accordance with a renewal process having an unknown distribution F, and in which the service times are independent and have unknown distribution G. We assume that there are k(k < or = infinity) servers. Let C(t) denote the number of customers in the system at time t. It is shown that F and G are identifiable from the set (C(t), t = or > 0) if either G or F is continuous, if F(x) < 1 for all x, and if the number of busy periods is infinite almost surely. Secondly, it is shown that F and G are identifiable if G is not lattice and the queue size a.s. converges to infinity.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1970
Accession Number
AD0712066

Entities

People

  • Sheldon M. Ross

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • California
  • Continuity
  • Engineering
  • Ergodic Processes
  • Industrial Engineering
  • Military Research
  • North Carolina
  • Operations Research
  • Random Walk
  • Stationary
  • Stationary Processes
  • Statistical Analysis
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Analytical Mechanics
  • Mathematical Modeling and Probability Theory.
  • Statistical inference.