Bolch G (1998)
Publication Type: Journal article
Publication year: 1998
Publisher: Elsevier
Pages Range: 819-832
A very well-known and popular technique for the performance evaluation of current computer, communication and operating systems is analytical modeling based on queuing networks because they are easy to understand and use compared to other modeling techniques. For so called product form queuing networks efficient exact and approximate analysis algorithms exist but most queuing networks of realistic systems do not fulfill the requirements of product form queuing networks. To solve this kind of networks Markovian analysis or discrete event simulation is used. The disadvantage of these techniques is that they are very time consuming to prepare, implement and run, especially when we want to analyze the system on a wide range of parameter values. Problems that appear very often in realistic systems are priorities with and without preemption, mixed priorities and class switching. These problems appear in many fields of computer and telecommunications systems. In this paper we show how to transform a queuing network that cannot be solved because of the above restrictions into a network that can be solved using a standard analysis technique (like MVA, SCAT, Convolution). The applicability of the technique is shown on an example of Cellular Mobile Communications Networks with Multimedia Services. © 1998 Elsevier Science B.V.
APA:
Bolch, G. (1998). A generalized analysis technique for queuing networks with mixed priority strategy and class switching. Computer Communications, 819-832.
MLA:
Bolch, Gunter. "A generalized analysis technique for queuing networks with mixed priority strategy and class switching." Computer Communications (1998): 819-832.
BibTeX: Download