Closed reentrant queueing networks under affine index policies: Throughput bounds, examples and asym

James R. Morrison, Joshua Juen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We extend linear programming performance evaluation methods to closed reentrant queueing networks. The approach automatically generates the parameters for a surrogate of the differential cost function and enables us to obtain bounds on the system throughput at reduced computational cost than exact solution methodologies. A comparison study of the bounds with the actual performance for tractable examples is conducted. The results show that the bounds can be quite good, in particular for unbalanced networks. For the closed version of a well known unstable network, we investigate the performance of the bounds and explore the asymptotic loss of the system.

Original languageEnglish
Title of host publicationProceedings of the 17th World Congress, International Federation of Automatic Control, IFAC
Edition1 PART 1
DOIs
StatePublished - 2008
Event17th World Congress, International Federation of Automatic Control, IFAC - Seoul, Korea, Republic of
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1 PART 1
Volume17
ISSN (Print)1474-6670

Conference

Conference17th World Congress, International Federation of Automatic Control, IFAC
Country/TerritoryKorea, Republic of
CitySeoul
Period07/6/0807/11/08

Keywords

  • Discrete event systems modeling and control
  • Queueing systems
  • Stochastic control

Fingerprint

Dive into the research topics of 'Closed reentrant queueing networks under affine index policies: Throughput bounds, examples and asym'. Together they form a unique fingerprint.

Cite this