Approximations of open queueing networks by reflection mappings

This paper presents a three-step procedure which allows to approximate the queue-length and the busy-time processes associated with open queueing networks. These three approximations are based on reflection mappings and are introduced with explicit estimates of their accuracy. The third one may be t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Queueing systems 1999-01, Vol.32 (1-3), p.41
1. Verfasser: Sakhanenko, Alexander I
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a three-step procedure which allows to approximate the queue-length and the busy-time processes associated with open queueing networks. These three approximations are based on reflection mappings and are introduced with explicit estimates of their accuracy. The third one may be treated as approximation by accompanying reflection Brownian motions with rates of convergence. [PUBLICATION ABSTRACT]
ISSN:0257-0130
1572-9443
DOI:10.1023/A:1019130919230