Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: hidden Markov models theory

Sortuj według:

Ogranicz wyniki do:

Computer network queuing models with intelligent call admission control mechanisms

Oniszczuk W.

Systems Science

2005

Vol. 31, no 1

73-87

A new idea of intelligent call admission control mechanism embedded into a priority closed computer network is proposed. Here, the investigated closed network was reduced to two service centers. Such reduction allows for decomposition of a bigger network into a chain of individual queues, where each queue can be studied in isolation. At the beginning, a new algorithm to analyze two-node closed priority queuing network is presented. In this model, there exists one node containing several priority sources designated as an infinite server (IS), which generates task streams. There is also another node, a service center, which collects the arriving tasks and consumes them according to head-of-line (HOL) strategy. Such types of networks are described in the queuing theory as a finite-source, non-preemptive priority M/G/l/N queues. Later on, an idea of the intelligent admission control mechanism based on the Hidden Markov Models (HMMs) theory is described. This kind of mechanism is embedded into computer network with HOL scheduling discipline to regulate the input stream intensities.