10 research outputs found

    Queuing systems with heterogeneous servers and state-dependent jump priorities informatics and programming

    Get PDF
    ΠŸΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ‹ Π΄Π²Π΅ марковскиС ΠΌΠΎΠ΄Π΅Π»ΠΈ систСм обслуТивания с Π³Π΅Ρ‚Π΅Ρ€ΠΎΠ³Π΅Π½Π½Ρ‹ΠΌΠΈ сСрвСрами, Π·Π°-явками Ρ€Π°Π·Π»ΠΈΡ‡Π½Ρ‹Ρ… Ρ‚ΠΈΠΏΠΎΠ² ΠΈ скачкообразными ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π°ΠΌΠΈ. ΠŸΠ΅Ρ€Π²Π°Ρ модСль ΠΏΡ€Π΅Π΄ΠΏΠΎΠ»Π°Π³Π°Π΅Ρ‚ Π½Π°Π»ΠΈΡ‡ΠΈΠ΅ ΠΊΠΎΠ½Π΅Ρ‡Π½Ρ‹Ρ… сСпаратных Π±ΡƒΡ„Π΅Ρ€ΠΎΠ² для Ρ€Π°Π·Π½ΠΎΡ‚ΠΈΠΏΠ½Ρ‹Ρ… заявок, Π° Π²ΠΎ Π²Ρ‚ΠΎΡ€ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ имССтся ΠΎΠ±Ρ‰ΠΈΠΉ бСсконСчный Π±ΡƒΡ„Π΅Ρ€. Заявки высокого ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π° всСгда ΠΎΠ±ΡΠ»ΡƒΠΆΠΈΠ²Π°ΡŽΡ‚ΡΡ сСрвСром с высокой ΡΠΊΠΎΡ€ΠΎΡΡ‚ΡŒΡŽ, Π² Ρ‚ΠΎ врСмя ΠΊΠ°ΠΊ заявки Π½ΠΈΠ·ΠΊΠΎΠ³ΠΎ ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π° ΠΌΠΎΠ³ΡƒΡ‚ ΠΎΠ±ΡΠ»ΡƒΠΆΠΈΠ²Π°Ρ‚ΡŒΡΡ Π² ΠΎΠ±ΠΎΠΈΡ… сСрвСрах. ΠŸΡ€ΠΈ этом скачкообразныС ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Ρ‹ Π² зависимости ΠΎΡ‚ состояния ΠΎΡ‡Π΅Ρ€Π΅Π΄Π΅ΠΉ Ρ€Π°Π·Π½ΠΎΡ‚ΠΈΠΏΠ½Ρ‹Ρ… заявок ΠΎΠΏΡ€Π΅Π΄Π΅Π»ΡΡŽΡ‚ΡΡ ΠΏΡ€Π°Π²ΠΈΠ»Π°ΠΌΠΈ ΠΏΠ΅Ρ€Π΅Ρ…ΠΎΠ΄Π° заявки Π½ΠΈΠ·ΠΊΠΎΠ³ΠΎ ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π° Π² ΠΎΡ‡Π΅Ρ€Π΅Π΄ΡŒ заявок высокого ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π°. Показано, Ρ‡Ρ‚ΠΎ матСматичСскими модСлями ΠΈΠ·ΡƒΡ‡Π°Π΅ΠΌΡ‹Ρ… систСм ΡΠ²Π»ΡΡŽΡ‚ΡΡ Π΄Π²ΡƒΠΌΠ΅Ρ€Π½Ρ‹Π΅ Ρ†Π΅ΠΏΠΈ ΠœΠ°Ρ€ΠΊΠΎΠ²Π° с ΠΊΠΎΠ½Π΅Ρ‡Π½Ρ‹ΠΌΠΈ ΠΈΠ»ΠΈ бСсконСчными пространствами состояний. Π Π°Π·Ρ€Π°Π±ΠΎΡ‚Π°Π½Ρ‹ Ρ‚ΠΎΡ‡Π½Ρ‹ΠΉ ΠΈ ΠΏΡ€ΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½Ρ‹ΠΉ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρ‹ нахоТдСния ΠΈΡ… стационарных распрСдСлСний ΠΈ Ρ€Π΅ΡˆΠ΅Π½Ρ‹ Π·Π°Π΄Π°Ρ‡ΠΈ расчСта ΠΈ ΠΎΠΏΡ‚ΠΈΠΌΠΈΠ·Π°Ρ†ΠΈΠΈ основных характСристик ΠΈΠ·ΡƒΡ‡Π°Π΅ΠΌΡ‹Ρ… систСм

    Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps

    Get PDF
    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

    Анализ ΠΌΠΎΠ΄Π΅Π»ΠΈ Π΄Π²ΡƒΡ…ΠΏΠΎΡ‚ΠΎΠΊΠΎΠ²ΠΎΠΉ систСмы обслуТивания с ΠΎΠ±Ρ‰Π΅ΠΉ ΠΎΡ‡Π΅Ρ€Π΅Π΄ΡŒΡŽ ΠΈ скачкообразными ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π°ΠΌΠΈ

    Get PDF
    Π’ ΡΡ‚Π°Ρ‚ΡŒΠ΅ изучаСтся модСль одноканальной систСмы обслуТивания с двумя Ρ‚ΠΈΠΏΠ°ΠΌΠΈ Π²Ρ‹Π·ΠΎΠ²ΠΎΠ² ΠΈ ΠΎΠ±Ρ‰Π΅ΠΉ ΠΎΠ³Ρ€Π°Π½ΠΈΡ‡Π΅Π½Π½ΠΎΠΉ ΠΎΡ‡Π΅Ρ€Π΅Π΄ΡŒΡŽ Ρ€Π°Π·Π½ΠΎΡ‚ΠΈΠΏΠ½Ρ‹Ρ… Π²Ρ‹Π·ΠΎΠ²ΠΎΠ². Π’ систСмС ΠΈΡΠΏΠΎΠ»ΡŒΠ·ΡƒΡŽΡ‚ΡΡ скачкообразныС ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Ρ‹. Π Π°Π·Ρ€Π°Π±ΠΎΡ‚Π°Π½ Π½ΠΎΠ²Ρ‹ΠΉ ΠΈ эффСктивный ΠΌΠ΅Ρ‚ΠΎΠ΄ расчСта ΠΏΠΎΠΊΠ°Π·Π°Ρ‚Π΅Π»Π΅ΠΉ качСства обслуТивания Π΄Π°Π½Π½ΠΎΠΉ систСмы

    Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

    Get PDF
    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

    Get PDF
    In this paper, exact and approximate approaches for studying queuing models with state-dependent jump priorities are developed. Both models with finite separate buffers and finite common buffer 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 difficulties 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

    Analysis of limited-priority scheduling rules in discrete-time queues

    Get PDF

    Annales Mathematicae et Informaticae (46.)

    Get PDF
    corecore