Busy periods for subnetworks in stochastic networks: mean value analysis

Authors:
Hans Daduna
Affiliations:
Univ. Hamburg, Hamburg, W. Germany
Venue:
Journal of the ACM (JACM)
Year:
1988

Citing 5
Cited 0

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Computer Performance Modeling Handbook

Computer Performance Modeling Handbook
Analysis of Busy Periods and Response Times in Queueing Networks by the Method of First Passage Times

Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Analysis of Busy Period and Response Time Distributions in Queueing Networks

Messung, Modellierung und Bewertung von Rechensystemen, 2. GI/NTG-Fachtagung
Aggregation and Disaggregation in Queueing Networks: The Principle of Product-Form Synthesis

Proceedings of the International Workshop on Computer Performance and Reliability

Quantified Score

Hi-index	0.01

Visualization

Abstract

The busy period of order n for a subnetwork, which for large n describes heavy traffic periods of that subnetwork, is described for queuing networks. The mean duration of such busy periods and efficient algorithms for computing these quantities are determined.