ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING
A new approach is presented to modelling 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 performan...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gdańsk University of Technology
2007-07-01
|
| Series: | TASK Quarterly |
| Subjects: | |
| Online Access: | https://journal.mostwiedzy.pl/TASKQuarterly/article/view/2069 |
| _version_ | 1811306789928435712 |
|---|---|
| author | WALENTY ONISZCZUK |
| author_facet | WALENTY ONISZCZUK |
| author_sort | WALENTY ONISZCZUK |
| collection | DOAJ |
| description |
A new approach is presented to modelling 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 centres, 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.
|
| first_indexed | 2024-04-13T08:52:02Z |
| format | Article |
| id | doaj.art-274d6c1dcef54ecfb340de166f756101 |
| institution | Directory Open Access Journal |
| issn | 1428-6394 |
| language | English |
| last_indexed | 2024-04-13T08:52:02Z |
| publishDate | 2007-07-01 |
| publisher | Gdańsk University of Technology |
| record_format | Article |
| series | TASK Quarterly |
| spelling | doaj.art-274d6c1dcef54ecfb340de166f7561012022-12-22T02:53:27ZengGdańsk University of TechnologyTASK Quarterly1428-63942007-07-01113ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULINGWALENTY ONISZCZUK0Bialystok University of Technology, Faculty of Computer Science A new approach is presented to modelling 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 centres, 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. https://journal.mostwiedzy.pl/TASKQuarterly/article/view/2069pre-emptive-resume queuing modelmean value analysis (MVA)congestion problemcall admission control (CAC)hidden Markov models (HMM’s) |
| spellingShingle | WALENTY ONISZCZUK ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING TASK Quarterly pre-emptive-resume queuing model mean value analysis (MVA) congestion problem call admission control (CAC) hidden Markov models (HMM’s) |
| title | ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING |
| title_full | ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING |
| title_fullStr | ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING |
| title_full_unstemmed | ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING |
| title_short | ANALYTICAL INVESTIGATION OF CONGESTION-AVOIDANCE STRATEGIES IN CLOSED-TYPE QUEUING MODELS OF COMPUTER NETWORKS WITH PRIORITY SCHEDULING |
| title_sort | analytical investigation of congestion avoidance strategies in closed type queuing models of computer networks with priority scheduling |
| topic | pre-emptive-resume queuing model mean value analysis (MVA) congestion problem call admission control (CAC) hidden Markov models (HMM’s) |
| url | https://journal.mostwiedzy.pl/TASKQuarterly/article/view/2069 |
| work_keys_str_mv | AT walentyoniszczuk analyticalinvestigationofcongestionavoidancestrategiesinclosedtypequeuingmodelsofcomputernetworkswithpriorityscheduling |