Approximations in Finite Capacity Multi-Server Queues with Poisson Arrivals

Abstract

This paper considers an M/G/K queueing model having finite capacity N. That is, a model in which customers, arriving in accordance with a Poisson process having rate lambda, enter the system if there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G. Upon entering, a customer will either immediately enter service if at least one server is free or else join the queue if all servers are busy. Our results will be independent of the order of service of those waiting in queue as long as it is supposed that a server will never remain idle if customers are waiting. To facilitate the analysis, however, assume a service discipline of first come first to enter service.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1977
Accession Number
ADA059461

Entities

People

  • Sheldon M. Ross
  • Shirley A. Nozaki

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • California
  • Equations
  • Identities
  • Military Research
  • North Carolina
  • Operations Research
  • Probability
  • Random Variables
  • Steady State
  • United States
  • Universities

Readers

  • Mathematical Modeling and Probability Theory.