Recursive Relations in the computation of the Equilibrium Results of Finite Queues.

Abstract

Imbedded Markov chains of finite queueing systems with unit jumps at regeneration points have an almost left triangular (in system of the type G/M/s/N - in Kendall notation modified to include system capacity) or an almost right triangular (in systems of the type M/G/1/N) structure. Using this structure a fundamental recursion on the elements of the transition probability matrix is developed, which in turn helps derive first passage as well as equilibrium results in computationally feasible forms. The computational procedure is illustrated using the system G/M/s/N with two arrival classes and priority service. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA032661

Entities

People

  • Sagi N. Raju
  • U. Narayan Bhat

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computations
  • Computers
  • Engineering
  • Equations
  • Industrial Engineering
  • Information Science
  • Markov Chains
  • Markov Processes
  • Notation
  • Operations Research
  • Probability
  • Random Variables
  • Steady State
  • Stochastic Processes
  • Structural Properties
  • Transitions

Readers

  • Mathematical Modeling and Probability Theory.