The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Moshe (IL-TECH-E) Discrete-time priority queues with two-state Markov modulated arrivals. ... Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. ...
“We analyze a priority service system with the relative priority discipline and an arbitrary number of customer arrival sources. The parameters of the arrival streams depend on the queue length. ... The arrival and service rates depend on the queue length of customers of this class. La- place transforms are obtained for the queue length, customer-free period, and busy period distributions.” ...
In this paper, we investigate the advantages of adopting a multi-priority selective discard mechanisms over traditional two-priority mechanisms under a long range dependent process. ... Neste artigo, investigam-se as vantagens de se adotar mecanismo de descarte seletivo com rmiltiplas classes quando comparado com mecanismo com dois nfveis de prioridade. Abstract . ... A D-BMAP is a short-range dependent process with batch arrivals in which the distribution of the arriving batch depends on the state of an underlying Markov Chain. ...doi:10.14209/jcis.1999.2 fatcat:bmr4qj5tsrayddyesnaw2dgzlq
Variation of Wp with p for P=5. 950 K. C. Sharma and G. C. Sharma— Delay Dependent Queue Without Pre-emption TABLE 1. Variation in waiting time Wp with traffic intensity p for two priority classes. ... Key words: delay dependent priority, FCFS rule, waiting time INTRODUCTION The delay dependent queue discipline is such that whenever a customer from the pth priority class enters the system at time 7,, ...doi:10.1057/jors.1994.147 fatcat:zwpuwbvklbf6hp2gbma7fddzoe
We consider three different classes of self-similar traffic fed into a G/M/1 queueing system and construct analytical models on the basis of non-preemptive priority, low-latency queueing and custom queueing ... In this paper, we advance the knowledge of queueing systems by example of traffic engineering of different UMTS service classes. ... There are two possibilities: I i ≥ This is the case where many possibilities can occur depending on the arrival of QUEUE 2 (here class 2 and class 3 both) packets during the waiting time of the type ...doi:10.1007/s11235-009-9178-5 fatcat:2xsv6xgnfvdjbmsshafevamyo4
Multi-server preemptive priority queue with general arrivals and service times. Performance Evaluation, Elsevier, 2017, <10. ... In our solution, priority levels are solved one at a time in the order of decreasing priorities. Each priority level is solved approximately using a reduced state description. ... by approximating the L -priority system with a two-class priority system. ...doi:10.1016/j.peva.2017.08.003 fatcat:oxoimgu4pra3ldac6vbxur4rsi
4), a job in class k requires service from i servers with probability ck(i), 1 < i < s, independent of the state of the system. In the more general model of ? ... With probability pk the call belongs to priority class k, 1 < k < n. ... 4 can now be applied to this state-dependent dispatch system. ...doi:10.1287/mnsc.30.6.653 fatcat:qc3x7o4nezcyxnilkbvaljekie
Experimental results indicate that proposed model is able to support a great number of arrival requests providing short response time related to priority classes. ... Performance is measured in terms of the number of requests, waiting time, response time, and requests drop rate for each priority class defined. ... Acknowledgements This work was supported by the Romanian National Research Programme PNII, project: Cloud Architecture for an open Library of Complex re-Usable Logical function blocks for Optimized Systems ...doi:10.24846/v26i1y201711 fatcat:76z2corrtfd5jp6ji5zx47iyga
with blocking and class-dependent priorities. ... class-based priorities. ... We would also like to thank Tony Field for the use of his JINQS Java queueing network simulation library. ...doi:10.4108/valuetools.2007.1775 dblp:conf/valuetools/Au-YeungHK07 fatcat:oxqelmdh5nchbganani3xsmvze
We construct the Markov chain for G/M/1 queuing system and present the closed form expressions of packet latencies for related traffic classes. ... We build an analytical framework considering multiple classes of self-similar traffic and analyze their behavior on the basis of G/M/1 queuing system. ... Due to non-preemptive priority service policy for the first two queues, the next state arrival of type 2 can see a type 2 packet in service only if all type 1 packets including the one that arrived in ...doi:10.1016/j.procs.2013.06.032 fatcat:bekrgeyhkzbjxlqjoklij3vhfq
2012 Ninth International Conference on Computer Science and Software Engineering (JCSSE)
Our proposed model is substantiated on G/M/1 queuing system that considers multiple classes of traffic exhibiting longrange dependence and self-similar characteristics. ... We present closed form expressions of expected waiting times for multiple traffic classes. We develop a finite queue Markov chain for the proposed scheduling scheme. ... We assumed two factors (the impact of high priority queue and the effect of round-robin service) to find out the expected waiting time of a packet (class 2, 3 and class 4) arriving to non-priority queues ...doi:10.1109/jcsse.2012.6261935 fatcat:uhfjdsuqcbcy7lvnzyimbwonbe
Lecture Notes in Computer Science
Exact analysis of tandem priority queues is a difficult problem. In this paper, we model the output process of the first stage as a three-state Markov chain and analyze the second stage. ... We calculate the joint probability generating function of the number of high-and low-priority packets in the second stage and show that two implicit functions appear in this expression. ... Khamisy and Sidi  study a priority queue with a correlated arrival process according to a two-state Markovian batch arrival process. ...doi:10.1007/978-3-319-43904-4_12 fatcat:lc5hnhngrjhzpgsnzqvbde3nga
of two-class queueing networks with priority service nodes. ... The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. ... In case of two-class queueing systems we need to consider similar cases with respect to both traffic classes. ...doi:10.1016/j.comnet.2009.02.016 fatcat:iq7zat2j5nh7fnnqhvpwzeevze
In this paper we analyze an M/M/1 queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. ... We conclude by briefly indicating how the method can be extended to an M/M/1 queueing system with non-preemptive priorities between customer classes. ... Two-class system The transition rate diagram of the two-class system depicted in Fig. 1a shows the twoclass system is a QBD process with class-2 levels q 2 defined as the set of states with q 2 high-priority ...doi:10.1007/s11134-015-9460-z fatcat:ds6oqyp2l5d5zp42x6oqd6utli
This paper studies a two-class priority queue in order to model a DiffServ router with Expedited Forwarding Per-Hop Behavior for high priority traffic. ... Analytical formulas for system content and packet delay of each traffic class are determined. ... This paper studies a queueing system with a single server serving two queues, one per priority class, and a pri-ority scheduling algorithm, in order to minimize the delay of the high-priority (real-time ...doi:10.1016/j.aeue.2010.02.018 fatcat:ovto523lrndzzf5ahmvepbetrm
« Previous Showing results 1 — 15 out of 23,340 results