Author:
Hanuliak Michal,Hanuliak Ivan
Abstract
PurposeThis paper considers correction aspects of computer communication networks modelling with emphasis on their performance evaluation. In general, the problem is to achieve the highest possible performance given constraints on the system.Design/methodology/approachThe paper reviews the application of the analytical methods, based on the queueing theory, to the computer communication systems and makes an extension of theory to the improvement of the developed analytical models. In this sense the paper describes the derivation of a correction factor for analytical models to study more precise their basic parameters (end‐to‐end delay, performance, etc.).FindingThe contribution is in incorporating the derived correction factor to account for the real non‐exponential nature of the input to the transmission channels of computer communication systems. The produced results by corrected analytical model are compared with results previously reported in the literature to estimate the magnitude of improvement.Practical implicationsThe improved analytical models were tested under various ranges of parameters, which influence the architecture of the computer communication networks and which are important for practical use.Research limitations/implicationsThe rapid rate of growth of computer‐based communication systems (e.g. distributed computer networks, mobile data networks) has resulted in a renewed and intensive interest in this area. Efficient design of their service facilities leads to the sharing of resources among users. Such public shared networks are largely oversubscribed by independent users, which make random demands on the network resources. The optimal resource allocation to satisfy such demands and the proper settlement of contention when demands exceed the capacity of the resources, constitute the problem of being able to understand and to predict system behaviour.Originality/valueTo behaviour analysis we can use both analytical and simulation methods. Modelling and simulation are methods, which are commonly used by performance analysts to represent constraints and optimise performance. Principally the application of analytical queuing theory results belongs to the preferred method in comparison to the simulation method, because of their ability to analyse also very large networks.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference27 articles.
1. Altiok, T. and Perros, H.G. (1996), “Open network of queues with blocking: split and merge configuration”, IEEE Transaction, Vol. 18, pp. 251‐61.
2. Bahadori, H.R. (1998), Approximate Algorithms for Solving Queueing Network Models of Large Distributed Systems, Reports, California University, Berkeley, CA, p. 117.
3. Banks, J. and Dai, J.G. (1997), “Simulation studies of multiclass queueing networks”, IEEE Transactions, Vol. 29, pp. 213‐9.
4. Baskett, F., Chandy, K., Muntz, R. and Palacios, F. (1975), “Open closed and mixed networks of queues with different classes of customers”, Journal of the Association for Computing Machinery, Vol. 22 No. 4, pp. 248‐60.
5. Boes, D.C. (1969), “Note of the output of a queueing system”, Journal of Applied Probability, p. 6.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献