10 research outputs found
Queuing systems with heterogeneous servers and state-dependent jump priorities informatics and programming
ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ Π΄Π²Π΅ ΠΌΠ°ΡΠΊΠΎΠ²ΡΠΊΠΈΠ΅ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΡΠΈΡΡΠ΅ΠΌ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Ρ Π³Π΅ΡΠ΅ΡΠΎΠ³Π΅Π½Π½ΡΠΌΠΈ ΡΠ΅ΡΠ²Π΅ΡΠ°ΠΌΠΈ, Π·Π°-ΡΠ²ΠΊΠ°ΠΌΠΈ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ
ΡΠΈΠΏΠΎΠ² ΠΈ ΡΠΊΠ°ΡΠΊΠΎΠΎΠ±ΡΠ°Π·Π½ΡΠΌΠΈ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ°ΠΌΠΈ. ΠΠ΅ΡΠ²Π°Ρ ΠΌΠΎΠ΄Π΅Π»Ρ ΠΏΡΠ΅Π΄ΠΏΠΎΠ»Π°Π³Π°Π΅Ρ Π½Π°Π»ΠΈΡΠΈΠ΅ ΠΊΠΎΠ½Π΅ΡΠ½ΡΡ
ΡΠ΅ΠΏΠ°ΡΠ°ΡΠ½ΡΡ
Π±ΡΡΠ΅ΡΠΎΠ² Π΄Π»Ρ ΡΠ°Π·Π½ΠΎΡΠΈΠΏΠ½ΡΡ
Π·Π°ΡΠ²ΠΎΠΊ, Π° Π²ΠΎ Π²ΡΠΎΡΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΈΠΌΠ΅Π΅ΡΡΡ ΠΎΠ±ΡΠΈΠΉ Π±Π΅ΡΠΊΠΎΠ½Π΅ΡΠ½ΡΠΉ Π±ΡΡΠ΅Ρ. ΠΠ°ΡΠ²ΠΊΠΈ Π²ΡΡΠΎΠΊΠΎΠ³ΠΎ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ° Π²ΡΠ΅Π³Π΄Π° ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°ΡΡΡΡ ΡΠ΅ΡΠ²Π΅ΡΠΎΠΌ Ρ Π²ΡΡΠΎΠΊΠΎΠΉ ΡΠΊΠΎΡΠΎΡΡΡΡ, Π² ΡΠΎ Π²ΡΠ΅ΠΌΡ ΠΊΠ°ΠΊ Π·Π°ΡΠ²ΠΊΠΈ Π½ΠΈΠ·ΠΊΠΎΠ³ΠΎ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ° ΠΌΠΎΠ³ΡΡ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°ΡΡΡΡ Π² ΠΎΠ±ΠΎΠΈΡ
ΡΠ΅ΡΠ²Π΅ΡΠ°Ρ
. ΠΡΠΈ ΡΡΠΎΠΌ ΡΠΊΠ°ΡΠΊΠΎΠΎΠ±ΡΠ°Π·Π½ΡΠ΅ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΡ Π² Π·Π°Π²ΠΈΡΠΈΠΌΠΎΡΡΠΈ ΠΎΡ ΡΠΎΡΡΠΎΡΠ½ΠΈΡ ΠΎΡΠ΅ΡΠ΅Π΄Π΅ΠΉ ΡΠ°Π·Π½ΠΎΡΠΈΠΏΠ½ΡΡ
Π·Π°ΡΠ²ΠΎΠΊ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΡΡΡΡ ΠΏΡΠ°Π²ΠΈΠ»Π°ΠΌΠΈ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄Π° Π·Π°ΡΠ²ΠΊΠΈ Π½ΠΈΠ·ΠΊΠΎΠ³ΠΎ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ° Π² ΠΎΡΠ΅ΡΠ΅Π΄Ρ Π·Π°ΡΠ²ΠΎΠΊ Π²ΡΡΠΎΠΊΠΎΠ³ΠΎ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ°. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠΌΠΈ ΠΌΠΎΠ΄Π΅Π»ΡΠΌΠΈ ΠΈΠ·ΡΡΠ°Π΅ΠΌΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ²Π»ΡΡΡΡΡ Π΄Π²ΡΠΌΠ΅ΡΠ½ΡΠ΅ ΡΠ΅ΠΏΠΈ ΠΠ°ΡΠΊΠΎΠ²Π° Ρ ΠΊΠΎΠ½Π΅ΡΠ½ΡΠΌΠΈ ΠΈΠ»ΠΈ Π±Π΅ΡΠΊΠΎΠ½Π΅ΡΠ½ΡΠΌΠΈ ΠΏΡΠΎΡΡΡΠ°Π½ΡΡΠ²Π°ΠΌΠΈ ΡΠΎΡΡΠΎΡΠ½ΠΈΠΉ. Π Π°Π·ΡΠ°Π±ΠΎΡΠ°Π½Ρ ΡΠΎΡΠ½ΡΠΉ ΠΈ ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄Ρ Π½Π°Ρ
ΠΎΠΆΠ΄Π΅Π½ΠΈΡ ΠΈΡ
ΡΡΠ°ΡΠΈΠΎΠ½Π°ΡΠ½ΡΡ
ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠΉ ΠΈ ΡΠ΅ΡΠ΅Π½Ρ Π·Π°Π΄Π°ΡΠΈ ΡΠ°ΡΡΠ΅ΡΠ° ΠΈ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΎΡΠ½ΠΎΠ²Π½ΡΡ
Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊ ΠΈΠ·ΡΡΠ°Π΅ΠΌΡΡ
ΡΠΈΡΡΠ΅ΠΌ
Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state and also for some performance measures such as the mean value of the system contents and the packet delay. The behavior of the priority queues with priority jumps will be illustrated by using these results and is compared to the FIFO scheme
ΠΠ½Π°Π»ΠΈΠ· ΠΌΠΎΠ΄Π΅Π»ΠΈ Π΄Π²ΡΡ ΠΏΠΎΡΠΎΠΊΠΎΠ²ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Ρ ΠΎΠ±ΡΠ΅ΠΉ ΠΎΡΠ΅ΡΠ΅Π΄ΡΡ ΠΈ ΡΠΊΠ°ΡΠΊΠΎΠΎΠ±ΡΠ°Π·Π½ΡΠΌΠΈ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΠ°ΠΌΠΈ
Π ΡΡΠ°ΡΡΠ΅ ΠΈΠ·ΡΡΠ°Π΅ΡΡΡ ΠΌΠΎΠ΄Π΅Π»Ρ ΠΎΠ΄Π½ΠΎΠΊΠ°Π½Π°Π»ΡΠ½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Ρ Π΄Π²ΡΠΌΡ ΡΠΈΠΏΠ°ΠΌΠΈ
Π²ΡΠ·ΠΎΠ²ΠΎΠ² ΠΈ ΠΎΠ±ΡΠ΅ΠΉ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½Π½ΠΎΠΉ ΠΎΡΠ΅ΡΠ΅Π΄ΡΡ ΡΠ°Π·Π½ΠΎΡΠΈΠΏΠ½ΡΡ
Π²ΡΠ·ΠΎΠ²ΠΎΠ². Π ΡΠΈΡΡΠ΅ΠΌΠ΅ ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΡΡΡΡ ΡΠΊΠ°ΡΠΊΠΎΠΎΠ±ΡΠ°Π·Π½ΡΠ΅ ΠΏΡΠΈΠΎΡΠΈΡΠ΅ΡΡ. Π Π°Π·ΡΠ°Π±ΠΎΡΠ°Π½ Π½ΠΎΠ²ΡΠΉ ΠΈ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄ ΡΠ°ΡΡΠ΅ΡΠ° ΠΏΠΎΠΊΠ°Π·Π°ΡΠ΅Π»Π΅ΠΉ ΠΊΠ°ΡΠ΅ΡΡΠ²Π° ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ Π΄Π°Π½Π½ΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ
Analysis of a Two-Class FCFS Queueing System with Interclass Correlation
This paper considers a discrete-time queueing system with one server and two classes of customers. All arriving customers are accommodated in one queue, and are served in a First-Come-First-Served order, regardless of their classes. The total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. The classes of consecutively arriving customers, however, are correlated in a Markovian way, i.e., the probability that a customer belongs to a class depends on the class of the previously arrived customer. Service-time distributions are assumed to be general but class-dependent. We use probability generating functions to study the system analytically. The major aim of the paper is to estimate the impact of the interclass correlation in the arrival stream on the queueing performance of the system, in terms of the (average) number of customers in the system and the (average) customer delay and customer waiting time
Methods to analysis of queueing models with state-dependent jump priorities
In this paper, exact and approximate approaches for studying queuing
models with state-dependent jump priorities are developed. Both models
with ο¬nite separate buο¬ers and ο¬nite common buο¬er for heterogeneous calls
are investigated. It is shown that both models might be described by twodimensional
Markov Chains (2-D MC). Exact approach based on solution of
appropriate system of balance equations (SBE) for state probabilities faced
with big computational challenges for large scale models. To overcome the indicated
diο¬culties an approximate approach based on the state space merging
algorithms is developed. This approach allows to construct simple algorithms
to calculate the Quality of Service (QoS) metrics of the examined models. The
results of numerical experiments are demonstrated