Zusammenfassung
Mehrklassen-Warteschlangennetzwerke mit Produktformlösungen (1), (2) werden benutzt, um Computer und Kommunikationssysteme nachzubilden und zu bewerten (3). Effiziente Berechnungsalgorithmen für Produktformnetze wurden entwickelt (4), (5), (6), (7), mit denen auch größere Netze numerisch ausgewertet werden können. Viele interessante Systemcharakteristiken und Parameter können jedoch in einem Produktformnetz nicht berücksichtigt werden.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Literaturverzeichnis
F. Baskett, K. Chandy, R. Muntz, P. Palacios.Open, closed and mixed networks of queues with different classes of customers. J. ACM, Vol. 22, No. 2 , April 1975.
G. Bolch, H. Riedel: Leistungsbewertung von Rechensystemen. Verlag B.G.Teubner, Stuttgart 1989.
G. Graham (Ed.): Special Issue — Queueing network models for computer system performance. ECM Comp. Surv., Vol.20, No.3, Sept. 1987.
J. Buzen: Computational algorithms for closed queueing networks with exponential servers. Commun. ACM, Vol.16, No.9, Sept. 1973.
K. Chandy, C. Sauer: Computational algorithms for product form queueing networks. Commun. ACM, Vol.23, No. 10, Okt. 1980.
M. Reiser, H. Kobayashi: Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J.Res. and Devel., Vol.19, No.3, Mai 1975.
M. Reiser, S. Lavenberg: Mean value analysis of closed multichain queueing networks. J. ACM, Vol.27, No.2, April 1980.
M. Schummer: Kommunikationssysteme in Echtzeitumgebungen — Modellierung und Bewertung von Fertigungs- und Intra-Vehikel-Kommunikationssystemen. Dissertation an der RWTH Aachen, Oktober 1990.
W.T. Scrayer, A.C. Weaver: Performance Measurement of data services in MAP, IEEE Network, Vol. 2, No. 3, Mai 1988.
Wo. Kremer, R. Hager: Feasibility study of a multiplexing strategy in road transport informatics for short range MRNs. ACM/IEEE SAC91, Kansas City, April 1991.
R. M. Bryant, A. E. Krzesinski, M. S. Lakshmi, K. M. Chandy: The MVA Priority Approximation. ACM Trans. Comput.Syst., Vol.2, No.4, Nov. 1984.
Wo. Kremer: Lokale Mobilfunknetze im Straßenverkehr — Entwurf, Dimensionierung und Leistungsbewertung. Dissertation, RWTH Aachen, Lehrstuhl für Informatik IV, 1992.
A. Fasbender: Leistungsbewertung eines prioritätsgesteuerten Realzeit-Kommunikationssystems. Diplom-Arbeit am Lehrstuhl für Informatik IV der RWTH Aachen, Oktober 1991.
Wo. Kremer, A. Fasbender: A New Approximation Algorithm for Tandem Networks with Priority Nodes. Aachener Informatik-Berichte, ISSN 0935–3232, Nr. 91–14, 1991.
A. E. Conway: Performance modeling of multilayered OSI communication architectures. Proc. of Int. Conf. Commun. ICC’89, Boston, June 1989.
P. Kritzinger: A performance model of the OSI communication architecture, IEEE Trans. Commun. COM-34, No. 6, 1986.
M. Reiser: Interactive modeling of computer systems. IBM Syst. J., Vol. 15, No. 4, 1976.
M. Reiser: A queueing network analysis of computer communication networks with window flow control, IEEE Trans. Commun. COM-27, No. 8, August 1979.
K. Sevcik: Priority scheduling disciplines in queueing network models of computer systems, in Proc. of IFIP Congress ‘77 in Toronto, North Holland, Amsterdam, 1977.
C. Sauer, K. Chandy: Approximate analysis of central server models. IBM Journal Res. Devel. 19, Mai 1975.
D. Neuse, K. M. Chandy: HAM: The heuristic aggregation method for solving general closed network models of computer systems. Perform. Eval. Rev. 11, No. 4, 1982–1983.
J. D. C. Little: A Proof of the Formular L= λW. Oper. Res., Vol.9, No.3, Mai 1961.
S. S. Lavenberg, M. Reiser: Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with Multiple Types of Customers. J. Appl. Prob., Vol.17, 1980.
K. Sevcik, I. Mitrani: The Distribution of Queueing Network States at Input and Output Instants. J. of ACM, Vol.28, No.2, April 1981.
J. Zahorjan, E. Wong: The Solution of Separable Queueing Network Models Using Mean Value Analysis. ACM Sigm.Perform.Eval. Review, Vol.10, No.3, 1981.
A. Cobham: Priority assignment in waiting line problems. Operations Research, Vol. 2, 1954.
Kleinrock, L., Queueing Systems, Vol. 1 (Theory) and Vol. 2 (Computer Applications), John Wiley & Sons, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 B. G. Teubner Verlagsgesellschaft, Leipzig
About this chapter
Cite this chapter
Spaniol, O., Kremer, W., Fasbender, A. (1992). TPNA: Ein neues Analyseverfahren für Tandem-Prioritäten-Netze. In: Buchmann, J., Ganzinger, H., Paul, W.J. (eds) Informatik. TEUBNER-TEXTE zur Informatik, vol 1. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-322-95233-2_25
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-8154-2033-1
Online ISBN: 978-3-322-95233-2
eBook Packages: Springer Book Archive