Analytical investigation of congestion -avoidance strategies in closed-type queuing models of computer networks with priority scheduling

• Autorzy: Oniszczuk W.
• Języki publikacji: EN

Abstrakty

EN

A new approach is presented to modeling intelligent admission control and congestion avoiding mechanism, without rejecting new requests, embedded into a priority closed computer network. Most Call Admission Control (CAC) algorithms treat every request uniformly and hence optimize network performance by maximizing the number of admitted and served requests. In practice, requests have various levels of importance to the network, for example priority classes. Here, the investigated closed network with priority scheduling has been reduced to two service centers, which allows for decomposition of a larger network into a chain of individual queues, where each queue can be studied in isolation. A new algorithm (approach) of this special type of closed priority queuing systems is presented, including a node consisting of several priority sources generating tasks, designated as an Infinite Server (IS), and a service centre with a single service line. This model type is frequently described as a finite source, pre-emptive-resume priority queue (with general distribution of service time). The pre-emptive service discipline allows a task of lower priority to be returned to the head of a queue when a new task of higher priority arrives. A mathematical model of provisioning and admission control mechanism is also described. The idea behind this mechanism has been derived from the Hidden Markov Model (HMM) theory. It is crucial in the CAC process that the network manager obtains correct information about the traffic characteristics declared by the user. Otherwise, the quality of service (QoS) may be dramatically reduced by accepting tasks based on erroneous traffic descriptors. Numerical results illustrate the strategy's effectiveness in avoiding congestion problems.

Słowa kluczowe

EN

pre-emptive-resume queuing model; mean value analysis (MVA); congestion problem; call admission con-trol (CAC); hidden Markov models (HMM's)

• Wydawca: Politechnika Gdańska
• Czasopismo: TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk
• Rocznik: 2007
• Tom: Vol. 11, No 3
• Strony: 237--252
• Opis fizyczny: Bibliogr. 26 poz., rys., tab.

Twórcy

autor

Oniszczuk W.

• Bialystok University of Technology, Faculty of Computer Science, Wiejska 45A, 15-351 Bialystok, Poland,

Bibliografia

• [1] Cheng S-T, Chen C-M and Chen I-R 2003 Perform. Eval. 52 1
• [2] Stavrakakis I and Chen G 2000 Perform. Eval. 41 (1) 37
• [3] Bruell S C and Balbo G 1980 Computational Algorithms for Closed Queueing Networks, North Holland, New York
• [4] Bryant R M, Krzesinski A E, Lakshmi M Sand Chandy K M 1984 AGM Trans. Comput. Syst. 2 (4) 335
• [5] Gelenbe E and Mitrani I 1980 Analysis and Synthesis of Computer Systems, Academic Press, London
• [6] Gelenbe E and Pujolle G 1987 Introduction to Queueing Networks, Wiley, New York
• [7] Jaiswal N K 1968 Priority Queues, Academic Press, New York and London
• [8] Morris R J T 1981 The Bell System Tech. J. 60 (8) 1745
• [9] Berger A Wand Whitt W 2000 Perform. Eval. 41 249
• [10] Choi B D, Choi D I, Lee Y and Sung D K 1998 IEEE Proc. Communications 145 (5) 331
• [11] Choi J S, Lee K S and Un Ch K 1997 Perform. Eval. 29 177
• [12] Laevens K and Bruneel H 1998 Perform. Eval. 33 (4) 249
• [13] Li Z G, Yuan X J, Wen C Y and Soong B H 2001 Computer Networks 35 203
• [14] Lavenberg S Sand Reiser M 1980 J. Appl. Probability 17 (4) 1048
• [15] Reiser M and Kobayashi H 1975 IBM J. Res. Dev. 19 (3) 283
• [16] Reiser M and Lavenberg S S 1980 J. Assoc. Comput. Machinery 27 (2) 313
• [17] Reiser M 1981 Perform. Eval. 1 7
• [18] Wang Hand Sevcik K C 2000 Perform. Eval. 39 189
• [19] Baum L E and Petrie T 1966 Annals of Math. Statistics 37 1554
• [20] Baum L E and Egon J A 1967 Bull. Amer. Math. Soc. 73 360
• [21] Bourlard H A and Morgan N 1994 Connectionist Speech Recognition, Kluwer Academic Publishers, Boston
• [22] Morgan Nand Bourlard H A 1995 Proc. IEEE 83 (5) 742
• [23] Rabiner L R 1989 Proc. IEEE 77 (2) 257
• [24] Rabiner L Rand Jaung B H 1993 Fundamentals of Speech Recognition, Prentice-Hall, Englewood Cliffs, NJ
• [25] Baum L E, Petrie T, Sallies G and Weiss N A 1970 Annals of Math. Statistics 41 (1) 164
• [26] Baum L E 1972 Inequalities 3 1