Tandem Queues with Constant Channel Service Times and Group Arrivals.

Abstract

A model of queues in series with constant channel service-times and group arrivals is considered. Groups are assumed to arrive at the queueing chain in accordance with a Poisson stream and to be of random size governed by an arbitrary distribution. Infinite-space queueing facilities are provided between any two consecutive queueing channels. Units are served independently along the queueing chain and are reassembled into the original groups when departing from the last channel of the chain. The author solves for the group and unit waiting-time, delay-time, idle-period and busy-period distributions at the channels along the queueing chain, as well as for the distribution of the overall group delay time. The analysis incorporates the study of the embedded waiting-time sequence at any (ladder) channel, obtained by considering the arrivals of only those groups who were the busy-period leaders at the preceding (ladder) channel. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1974
Accession Number
AD0778347

Entities

People

  • Izhak Rubin

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Buildings And Structures
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Materials Science.
  • Radio communications and signal processing.

Technology Areas

  • Space