Approximate analysis of load dependent general queueing networks

Author

Akyildiz, I.F. ; Sieber, Albrecht

Author_Institution

Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA

Volume

14

Issue

11

fYear

1988

fDate

11/1/1988 12:00:00 AM

Firstpage

1537

Lastpage

1545

Abstract

A method for obtaining approximate solutions to load-dependent closed queueing networks containing general service-time distributions and first-come-first-served scheduling disciplines is presented. The technique demonstrated is an extension of the well-known method of R. Marie (1979). A formula for the conditional throughputs is derived. After each iteration a check is performed to guarantee that the results obtained are within a tolerance level ε. These iterations are repeated whenever invalid results are detected. On the average, the solutions obtained vary by less than 5% from their respective exact and simulation results

Keywords

performance evaluation; queueing theory; scheduling; conditional throughputs; load-dependent; performance evaluation; queueing networks; scheduling; service-time distributions; tolerance level; Communication networks; Computational efficiency; Computational modeling; Computer architecture; Computer networks; Computer science; Performance analysis; Predictive models; Queueing analysis; Throughput;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.9042

Filename

9042