4,085 Hits in 7.2 sec

Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline

Arnaud Devos, Joris Walraevens, Dieter Fiems, Herwig Bruneel
2020 Annals of Operations Research  
We consider a discrete-time queueing system with two queues and one server. The server is allocated in each slot to the first queue with probability α and to the second queue with probability 1−α.  ...  As the joint stochastic process of the system contents is not amenable for exact analysis, we focus on an efficient approximation of the joint probability generating function.  ...  Acknowledgements The authors would like to thank the anonymous referees for their helpful comments and suggestions, which improved the content and the structure of this paper.  ... 
doi:10.1007/s10479-020-03776-5 fatcat:f7rywznvvfae7hjvfnbgc3d3pu

Queueing analysis for operations modeling in port logistics

Pasquale Legato, Rina Mary Mazza
2019 Maritime Business Review  
Purpose The use of queueing network models was stimulated by the appearance (1975) of the exact product form solution of a class of open, closed and mixed queueing networks obeying the local balance principle  ...  Findings Numerical experiments show the extent to which a decomposition-based approximation, under fixed or state-dependent arrival rates, may be suitable for the approximate analysis of the queueing network  ...  As for service times at the Yard Row stations, an exponential shape is chosen with average value (2 min) corresponding to the average time spent by any given SC when driving through a yard row and performing  ... 
doi:10.1108/mabr-09-2019-0035 fatcat:nzgm7mvhtjebhl3m43ny7fwdva

Product Form Queueing Networks [chapter]

Simonetta Balsamo
2000 Lecture Notes in Computer Science  
for system performance evaluation and prediction.  ...  Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorithms to evaluate average performance measures.  ...  Another research issue is the integration and/or the relation between queueing networks and other classes of models with different characteristics, such as for example stochastic Petri nets or stochastic  ... 
doi:10.1007/3-540-46506-5_16 fatcat:t2l6atnzfzaldhlli4reywccqi

Two-Class Priority Queueing System with Time-Limited Schedule [chapter]

Tsuyoshi Katayama
1998 Performance and Management of Complex Communication Networks  
is also a limiting case of two queues with altemating service periods first studied by Coffman, Fayolle and Mitrani (1987) .  ...  For two-class (N = 2), Markovian priority queues WiUl timelimited schedule (Tp T 2 ), we determine a generating function of a steady-state, joint queue-length distribution.  ...  Yamada for performing numerical calculations for Tables I and 2 , and is also grateful to the anonymous referees of the paper for many valuable comments.  ... 
doi:10.1007/978-0-387-35360-9_12 fatcat:zlgjsor2enfkhpxr4eqsmhprp4

Page 1847 of Mathematical Reviews Vol. 55, Issue 6 [page]

1978 Mathematical Reviews  
Specific performance characteristics evaluated are the first two moments of queue length, virtual waiting time, and system utilization.  ...  Also, an alternative derivation of the formula for the average cost of a D-policy will be given.” Micha Yadin (Haifa) Henk 13610 A control policy for a priority queue with removable server.  ... 

Queuing analysis of polling models

Hideaki Takagi
1988 ACM Computing Surveys  
Applications to computer networks are illustrated, and future research topics are suggested. l continuous-time or discrete-time systems, l single or infinite buffers for each queue, l service disciplines  ...  Polling models provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems.  ...  An early version of this paper was presented at the Third International Conference on Data Communication Systems and Their Performance, Rio de Janeiro, June 22-25, 1987.  ... 
doi:10.1145/62058.62059 fatcat:bb24r2qyqjgwlc6rrib6gaizv4

Queueing-theoretic approaches for dynamic scheduling: A survey

Daria Terekhov, Douglas G. Down, J. Christopher Beck
2014 Surveys in Operations Research and Management Science  
This paper provides a context for investigating the integration of queueing theory and scheduling approaches with the goal of more effectively solving scheduling problems arising in dynamic environments  ...  Scheduling Queueing A survey of dynamic scheduling in manufacturing systems (Ouelhadj and Petrovic, 2009) Queueing theory in manufacturing: A survey (Govil and Fu, 1999) Scheduling and control of flexible  ...  Acknowledgements The authors would like to thank the reviewers for their comments, which helped improve the paper.  ... 
doi:10.1016/j.sorms.2014.09.001 fatcat:q3qodawkwnawneatlnzm4depcm

Approximate Methods for Analyzing Queueing Network Models of Computing Systems

K. Mani Chandy, Charles H. Sauer
1978 ACM Computing Surveys  
It is the contention of this paper that queueing network models with credible assumptions can be solved approximately to provide credible performance estimates at low cost This contention is supported  ...  The two primary issues in choosing a computing system model are credibility of the model and cost of developing and solving the model Credibility is determined by 1) the experience and biases of the persons  ...  For example, the CPU queue may violate product form by having a FCFS queueing discipline with different service time distributions for the classes of the different chains.  ... 
doi:10.1145/356733.356737 fatcat:wqv4cgjvcfhkbdruuhcqwjymd4

Service differentiation for delay-sensitive applications: an optimisation-based approach

Peter Key, Laurent Massoulié, Jonathan K. Shapiro
2002 Performance evaluation (Print)  
This paper deals with the performance of delaysensitive applications running over a network that offers multiple classes of service.  ...  We first discuss the gain in utilisation allowed by the introduction of several classes of service by comparing schedulable regions for different schedulers.  ...  As an approximation, we charge the length of low priority queue at the time the high priority packet enters service, multiplied by a factor 1 α 2. 2 As in the single class case, alternative schemes which  ... 
doi:10.1016/s0166-5316(02)00118-9 fatcat:2bwjagz43fhujmg5mpq6ocpihy


Gabriel R. Bitran, Reinaldo Morabito
2009 Production and operations management  
The survey is divided in two parts: in the first we review exact and approximate decomposition methods for performance evaluation models for single and multiple product class networks.  ...  The second part reviews optimization models of three categories of problems: the first minimizes capital investment subject to attaining a performance measure (WIP or lead time), the second seeks to optimize  ...  The survey is divided in two parts: in the first we review exact and approximate decomposition methods for performance evaluation models for single and multiple product class networks.  ... 
doi:10.1111/j.1937-5956.1996.tb00392.x fatcat:peeurfkvfzdv3ljudh536vfyhe

Performance evaluation and capacity planning in a metallurgical job-shop system using open queueing network models

Claudio Rogerio Negri da Silva, Reinaldo Morabito
2009 International Journal of Production Research  
In this paper, we apply performance evaluation and capacity allocation models to support decisions in the design (or redesign) and planning of a job-shop queueing network of a metallurgical plant.  ...  Approximate parametric decomposition methods are used to evaluate system performance measures, such as the expected work-in-process (WIP) and production leadtimes.  ...  Acknowledgements: The authors would like to thank Nelson Marrara for the collaboration with this study. This research was partially supported by FAPESP and CNPq (grants 00/00973-9 and 522973/95-4).  ... 
doi:10.1080/00207540802350732 fatcat:35wfieydlvbslb3vsnu7ko2fui

Performance Evaluation at the Software Architecture Level [chapter]

Simonetta Balsamo, Marco Bernardo, Marta Simeoni
2003 Lecture Notes in Computer Science  
If some of the alternatives with a true guard start with an  ...  If all the alternatives with a true guard start with an exponentially timed action, then the race policy applies: each involved action is selected with a probability proportional to its rate.  ...  -The two classes of programs are merged into a single class, whose hyperexponential service time is approximated with an exponential service time with rate µ seq such that µ −1 seq = (λ seq,1 /λ seq )  ... 
doi:10.1007/978-3-540-39800-4_10 fatcat:425u3wwxtraafo6o7bvunor3n4

Reflections on queue modelling from the last 50 years

D Worthington
2009 Journal of the Operational Research Society  
A new discipline of 'queue modelling' is proposed, drawing upon the combined strengths of analytic and simulation approaches with the responsibility to derive meaningful insights for managers.  ...  The phrase 'queue modelling' is used in the title to indicate a more practical emphasis.  ...  Each service node is analysed as a standard GI/G/S queue, and performance measures for the whole network are approximated by assuming that the nodes are stochastically independent and are evaluated numerically  ... 
doi:10.1057/jors.2008.178 fatcat:iw7orw4tmjclnoxazotj6bcffq

Fluid approximation and perturbation analysis of a dynamic priority call center

Min Chen, Jian-Qiang Hu, M.C. Fu
2004 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)  
Based on a fluid approximation of the system, we apply infinitesimal perturbation analysis (IPA) to derive estimators for the derivative of the queue lengths with respect to the threshold parameter.  ...  For each priority queue, the service discipline is first come, first served.  ...  As an alternative to the traditional modeling approach using discrete queueing models, fluid models provide a simpler and more efficient approach for performance evaluation.  ... 
doi:10.1109/cdc.2004.1428734 fatcat:gm55w5fet5b3rojykg5scf2niy

Rejoinder on: Queueing models for the analysis of communication systems

Herwig Bruneel, Dieter Fiems, Joris Walraevens, Sabine Wittevrongel
2014 TOP - An Official Journal of the Spanish Society of Statistics and Operations Research  
Harry Perros emphasizes the practical applications of discrete-time queueing models in the performance evaluation of various subsystems of modern telecommunication networks.  ...  analysis of the two-class priority queue with train arrivals. * SMACS: Stochastic Modeling and Analysis of Communication Systems  ...  This research has been funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office.  ... 
doi:10.1007/s11750-014-0331-2 fatcat:mtqfvsedurgmzi6pfzec46lyee
« Previous Showing results 1 — 15 out of 4,085 results