The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
D. (1-GAIT-I) Analysis of a three-node queueing network. Queueing Systems Theory Appl. 3 (1988), no. 1, 53-72. ... A two-stage exponential network with exponentially distributed in- terarrival times of the system and exponentially distributed service times in both stages is considered. ...
Although this behaviour can be easily reproduced experimentally, existing analytical models of queues with abandonments are not able to do so. ... We use this model to compare the performance of the LIFO and FIFO queueing disciplines during overload and show that LIFO goodput and response time are better than those of FIFO. ... Many Web servers (e.g. Sun Java Web System, IBM WebSphere) are based on a variant of this design. ...doi:10.1016/j.jss.2008.03.068 fatcat:62gg3tkhcvdpxlfgxe6fpiwhzm
Virchenko (Kharkov) 91h:60100 60K25 90B22 Altiok, Tayfur (1-RTG4) Approximate analysis of queues in series with phase-type service times and blocking. Oper. Res. 37 (1989), no. 4, 601-610. ... R. (6-IITM) On the distribution of a busy period for the many server Poisson queue. Opsearch 26 (1989), no. 2, 125-132. ...
Journal of the ACM
The total service of a customer is comp leted in three stages provided by two servers at three counters. ... This paper deals with a Markovian queueing system having a mu lti-task service counters and finite queue in front of each counter. ... ACKNOWLEDGEMENTS The authors would like to thank the anonymous referees and the Editor-in-Ch ief of the Journal for their valuable suggestions and critical co mments which help a lot in ...doi:10.1145/321941.321952 fatcat:tfn2urxlpvcqhhjmm5m2xrglwe
In many applications servers, like Web servers file servers, database servers, a huge amount of transaction has to be handled properly in a specified time limit. ... Queueing network has widely applied to signify and investigate the resource sharing the system such as computer system, communication network. ... In Processor sharing (PS) queue discipline , the problem of blocking in the exponential server could not exist. ...doi:10.15373/2249555x/july2013/115 fatcat:tgpj2fuqnjfifdxdpoxnvat27u
In this study a two stage queueing model is analyzed. At first stage there is a single server having exponential service time with parameter and no waiting is allowed in front of this server. ... There are two parallel phase-type servers at second stage and these parallel servers have exponential service time with parameter . Arrivals to this system is Poisson with parameter . ... Conclusion In this paper we have analyzed a two stage, consists of three servers, phase-type stochastic queueing model. ...doi:10.11648/j.sjams.20150302.12 fatcat:pcudnbpztzhovbj7vzq2jtv4a4
Although this behaviour can be easily reproduced experimentally, existing analytical models of queues with abandonments are not able to do so. ... We use this model to compare the performance of the LIFO and FIFO queueing disciplines during overload and show that LIFO goodput and response time are better than those of FIFO. ... Many Web servers (e.g. Sun Java Web System, IBM WebSphere) are based on a variant of this design. ...doi:10.1145/1216993.1216999 dblp:conf/wosp/MathurA07 fatcat:5zzh6zqm6zhpvneyx5igmxpsyi
2008 IEEE Instrumentation and Measurement Technology Conference
In this paper we propose the performance measurement and queueing analysis for the low blocking probability of serial connection networks with which we can estimate the system response time of serial Web ... Hence we learn that the system response time of a serial connection network has an approximate linear relation with respect to the number of stages of the queues when the utilization of the system or the ... When the Web service loading that we offer grows multiple times in proportion to a single system, no matter how many serial queues, with a low blocking probability, we can estimate the error of the system ...doi:10.1109/imtc.2008.4547416 fatcat:avcxh3njsncu5jf2ppvihmby74
Queueing network modeling of manufacturing systems has been addressed by a large number of researchers. ... The purpose of this paper is to provide a bibliography of material concerned with modeling of production and transfer lines using queueing networks. ... Recently, Yannopoulos and Alfa [ 2.501 presented a three-node decomposition algorithm for the analysis of queues in series with exponential servers, Poisson arrivals and blocking. ...doi:10.1016/0377-2217(95)00378-9 fatcat:uvpoa2iiunbt3brs3sk4wdoojq
Although the developmental tools and techniques for the grid have been extensively studied, grid reliability analysis is not easy because of its complexity. ... The hierarchical modeling is mapped to the physical and logical architecture of the grid service system and makes the evaluation and calculation tractable by identifying the independence among layers. ... ACKNOWLEDGMENTS The authors appreciate the constructive comments from Professor Dhiraj Pradhan and three anonymous reviewers who helped to significantly improve the paper. ...doi:10.1109/tc.2007.1034 fatcat:3d5wbsk77jclha74m75626hrqq
Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. ... We investigate the use of queueing networks with blocking as performance models of SAs with concurrent components and synchronous communication. ... Examples of interarrival and service distributions are exponential (M), phase-type with n exponential stages (PH n ), general (G) and generalized exponential distribution (GE). ...doi:10.1016/s0166-5316(02)00099-8 fatcat:zl5i6doozbdepdhy76eisj74mq
When limitations are imposed on the queue sizes (i.e., finite queues), a phenomenon called blocking occurs. Queueing networks with blocking are, in general, difficult to treat. ... Hence, most of the techniques that are used to analyze such queueing networks are in the form of approximations, numerical analysis, and simulation. ... Perros for introducing the concept of blocking to me. During my studies, he not only motivated and encouraged my work but also created the environment that made it possible. ...doi:10.1145/78919.78920 fatcat:7aach7ikprbp3hpncnemosh37e
We consider a new queuing model with sequential two stations (stages), single server at each station, where no queue is allowed at station 2 and with no restriction at station 1. ... The service time of any customer at server () is exponential with parameter . The state probabilities and loss probability of this model are given. ... The tandem queues with one server in the first queue, and ≥ 1 servers in the second queue, where the arrivals to the system with Poisson process having parameter and there is no waiting room between the ...doi:10.1155/2013/679369 fatcat:5yevld2sjveljldjhqujkgnqzu
with network-system co-design. ... The core of RackSched is a two-layer scheduling framework that integrates inter-server scheduling in the top-of-rack (ToR) switch with intra-server scheduling in each server. ... to many tens of servers. ...arXiv:2010.05969v2 fatcat:7lzwuq35ivcipia7dlzwo673eq
The results of the analytical approach are compared against measurements of Informix XPS performance on a parallel system. ... Resource usage profiles are mapped to open multi-class queueing networks. Queue waiting times are estimated using a heuristic rule, which labels resources as M/M/1 or M/G/1 queues. ... They also wish to thank Arthur Fitzjohn and Monique Mitchell of ICL. ...doi:10.1016/j.parco.2003.11.003 fatcat:oqfpeo56fbfanpgygwmvd6d53e
« Previous Showing results 1 — 15 out of 5,748 results