Approximate techniques for general closed queueing networks with subnetworks having population constraints

  • Baynat B
  • Dallery Y
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 15

    Citations

    Citations of this article.

Abstract

We consider closed queueing networks with general service times and subnetworks having population constraints. Each such subnetwork consists of a subset of stations of the original network. The population constraint of a subnetwork prescribes that the total number of customers that can be simultaneously present inside the subnetwork is limited to a fixed value called the capacity of the subnetwork. A customer who wants to enter the subnetwork while it is full has to wait in an external queue. As soon as a customer leaves the subnetwork, the first-in-line customer is allowed to enter the subnetwork. We apply and compare two approximate techniques for analyzing such networks, namely the aggregation technique and Marie's method. We emphasize the similarities and differences between these two techniques. Finally, we compare their accuracy. © 1993.

Author-supplied keywords

  • Aggregation technique
  • Closed queueing networks
  • Marie's method
  • Population constraints
  • Product form approximation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Bruno Baynat

  • Yves Dallery

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free