On an Exponential Server with General Cyclic Arrivals.

Abstract

A G(superscript n)/M/1 queue is defined as a single server queue with exponential service time and general cyclic arrival distributions of cycle length n. The waiting time distribution for such a queue is proved to be a sum of n exponential terms; this is a generalization of g/M/1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for G(superscript n)/M/1 queues is introduced. An example is presented to show an application of G(superscript n)/M/1 queues in deterministic routing. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1980
Accession Number
ADA083782

Entities

People

  • Ashok Agrawala
  • Satish K. Tripathi

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Complex Variables
  • Computer Science
  • Computers
  • Delta Functions
  • Distribution Functions
  • Equations
  • Maryland
  • New York
  • Probability
  • Probability Distributions
  • Random Variables
  • Rational Functions
  • Scientific Research
  • Steady State
  • Stochastic Processes
  • Universities

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Computer Networking
  • Marksmanship and Weaponry.