A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. ... While the probability generating function for the occupancy distribution of each traffic classes can be readily obtained, the occupancy distributions have been obtainable only rarely. ... INTRODUCTION The bottleneck in telecommunication systems has often been modeled by an M/G/1 queueing system having non-preemptive priority service, where the probability generating function (PGF) for the ...doi:10.1109/infcom.1999.751450 dblp:conf/infocom/DaigleR99 fatcat:olezs4fy6fak3nzg47ffnprxsy
Summary: “We consider a non-preemptive head-of-the-line multi- server multi-queueing priority model with finite buffer capacity for each priority class. ... systems: (a) 2G//G/1 queue under FIFO, (b) 2G//G/1 queue with priorities, and (c) polling systems with general arrival distributions. ...
Assuming that the arrival process of batches is renewal for eacli priority class aiid using the point process approach, we express the individual class queue-Iength distribution in terms of the waiting ... We consider a single-server priority queue with batch arrivals. We treat the head-ofthe-line (HL) or preemptiveresume (PR) priority rule. ... Acknowledgements The authors wish to thank the first referee for his critical and constructive comments. ...doi:10.15807/jorsj.37.48 fatcat:phyi53q6brfe7lzbctjcc5wpku
To solve the problem of the priorities of network traffic and improve the applicability of multi-access for communication systems, a twolevel asymmetric polling control system was proposed, in which the ... Through the accurate mathematical analysis of the system model, the mathematical analytical formulas of important system performance parameters, such as the mean queue length of nodes and the mean delay ... This scheme ensures that the center node has higher priority and receives more services. The asymmetrical system is more suitable and flexible for multi-access and guarantees system fairness. ...doi:10.23940/ijpe.19.10.p25.27832793 fatcat:kmcn6uswavfc5moseal65g4ssa
This paper references the job scheduling algorithm in computer operator system and presents a multi-level feeder queue optimization charging model with comprehensive consideration of the grid-side power ... The implementation of multi-level feeder queue optimization charging model of electric vehicles in regional grid requires the fusion of power grid, cars networking, charging station networking and other ... Acknowledgments This paper is supported by the State Grid Corporation headquarters' science and technology project Research and application of wisdom city oriented multi energy sources interconnection ...doi:10.14257/ijunesst.2016.9.3.20 fatcat:xh4nsyqykvg5dplgkqzrmxy6na
) Asymptotic distributions of maximum queue lengths for //G/1 and GI/M/\ systems. ... For an ergodic M/G/1 (or GI/M/1) queueing system, the maxi- mum queue length up to time ¢ does not converge in distribution to a nondegenerate limit under a linear normalization. ...
V. 87k:60237 Asymptotic distribution of queue length in a queueing system. (Russian. English summary) Avtomat. i Telemekh. 1986, no. 2, 92-99. ... In order to save available servers for higher priority customers, the system deliberately queues arriving lower priority customers whenever the number of busy servers equals or exceeds a given priority-dependent ...
Further, utilizing the relationship between the time-average queue length distribution and the customer-average queue length distribution at departures, we obtain a numerically feasible formula for the ... (English summary) Queueing Systems Theory Appl. 34 (2000), no. 1-4, 215-236. Consider a single-server queue with two non-preemptive classes of sources, a high priority and a low priority source. ...
Information recorded by systems during the operation of these processes provide an angle for operational process analysis, commonly referred to as process mining. ... We present predictors that treat queues as first-class citizens and either enhance existing regression-based techniques for process mining or are directly grounded in queueing theory. ... ., q 1 (queue-length of top-priority customers). ...doi:10.1016/j.is.2015.03.010 fatcat:w2k3cla7mvfyvnufs3tb7io73q
In particular, we derive an exact expression for the expected length of the renewal cycle, and present closed matrix forms for the mean and variance of the queue length. ... We first investigate the performance measures of the system, including the queue length and the overall cost. ... The incoming calls need to be answered quickly, Introduction This paper studies a priority queueing system with multi-types of customers subject to transferring from lower priority queues to higher priority ...doi:10.1109/tac.2013.2287111 fatcat:2pyb6wmt6zebligvhcgl3chdla
Explicit expressions are derived for joint qUeue-length generating functions and the mean total sojourn time spent by a call (task) in the tandem queueing system. ... This paper analyzes a special slngle-server tandem queueing system with feedback, which appears in call processing for multi-class calls (tasks) in telecommunication systems. ... We consider priority assignment problems on the call processing with multi-class tasks in switching systems. ...doi:10.1016/0898-1221(92)90224-6 fatcat:nrvjur3obbaihmaxmhcn2xz7gu
, CCAMP reserves queue buffer for the high-priority packets by dropping the low-priority packets in a certain probability. ... To ensure the Quality of Service (QoS) of the high-priority requests, the paper proposes a Congestion Control Algorithm of Multi-Priority (CCAMP) which differentiates the QoS according to the priorities ... Currently, the master-slave structure is used in most of the cloud computing systems such as Hadoop Distribute File System (HDFS)  . ...doi:10.14257/ijfgcn.2014.7.4.08 fatcat:c3l4xamcbjg6lo23qjw3tqm2xi
The authors note that the stationary distribution of each queue length can be calculated by solving linear equations, and that the joint queue length distribution can be solved for the two-server case. ... This paper considers a multi-class non-preemptive priority queue with exhaustive and multiple server vacations. ...
On the other hand, a priority policy can guarantee the finiteness of an expected queue length for the light queue, but the system is not throughput optimal any longer. ... It is further shown that no benefit can be provided by the max-weight scheduling policy to the light queue for the queue length behavior in a steady-state, though the system is always throughput optimal ... Regarding the light queue, we show that the queue-length distribution is light-tailed under the priority-for-L policy, but throughput optimal does not exist any more. ...doi:10.1109/access.2020.2973282 fatcat:aaot7xisfjacxlha43a4j4mhq4
This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. ... Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. ... They developed a multi-server queueing system with two priority classes, in which high priority customers have non-preemptive priority over low priority customers. ...doaj:36e6d28abf4247b6a4363774a57ff3ea fatcat:65mbinszmff47gnpayeleia2w4
« Previous Showing results 1 — 15 out of 24,784 results