Software for Queueing Analysis

2018 ◽  
pp. 255-291
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Network ◽  
Queueing Analysis ◽  
Discrete Events ◽  
Technical Literature ◽  
Event Simulation ◽  
Statistical Program ◽  
Service Times ◽  
Waiting Lines

Chapter 8 gives a brief discussion of computer simulation for discrete events. The chapter lists software programs in the technical literature that outline programs for the simulation of discrete events, both of commercial origin and free programs. In addition to the lists submitted, the authors present specialized packages for analysis and simulation of waiting lines in the R language. Statistical considerations are presented, which must be taken into account when obtaining data from simulations in situations of waiting lines. Chapter 8 presents three packages of the statistical program R: the “queueing” analysis package provides versatile tools for analysis of birth- and death-based Markovian queueing models and single and multiclass product-form queueing networks; “simmer” package is a process-oriented and trajectory-based discrete-event simulation (DES) package for R; and, the purpose of the “queuecomputer” package is to calculate, deterministically, the outputs of a queueing network, given the arrival and service times of all the customers. It also uses simulation for the implementation of a method for the calculation of queues with arbitrary arrival and service times. For each theme, the authors show the use of the packages in R.

Concavity of queueing systems with NBU service times

1998 ◽  
Vol 30 (2) ◽  
pp. 551-567 ◽  
Author(s):  
Rajendran Rajan ◽  
Rajeev Agrawal
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Systems ◽  
Queueing Network ◽  
Search Space ◽  
System Parameters ◽  
Wide Range ◽  
Service Times ◽  
And Control ◽  
Better Than

This paper establishes structural properties for the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks, including tandems, cycles and fork-join networks with general blocking and starvation (as well as certain networks with splitting and merging of traffic streams), to deduce the concavity of their throughput as a function of system parameters, such as buffer and initial job configurations, and blocking and starvation parameters. These results have important implications for the optimal design and control of such queueing networks by providing exact solutions, reducing the search space over which optimization need be performed, or establishing the convergence of optimization algorithms. In order to obtain results for such disparate networks in a unified manner, we introduce the framework of constrained discrete event systems (CDES), which enables us to characterize any permutable and non-interruptive queueing network through its constraint set. The main result of this paper establishes comparison properties of the event occurrence processes of CDES as a function of the constraint sets, which are then translated into the above-mentioned concavity of the throughput as a function of system parameters in the context of queueing networks.

Concavity of queueing systems with NBU service times

1998 ◽  
Vol 30 (02) ◽  
pp. 551-567
Author(s):  
Rajendran Rajan ◽  
Rajeev Agrawal
Keyword(s):  
Queueing Networks ◽  
Discrete Event ◽  
Queueing Systems ◽  
Queueing Network ◽  
Search Space ◽  
System Parameters ◽  
Wide Range ◽  
Service Times ◽  
And Control ◽  
Better Than

This paper establishes structural properties for the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks, including tandems, cycles and fork-join networks with general blocking and starvation (as well as certain networks with splitting and merging of traffic streams), to deduce the concavity of their throughput as a function of system parameters, such as buffer and initial job configurations, and blocking and starvation parameters. These results have important implications for the optimal design and control of such queueing networks by providing exact solutions, reducing the search space over which optimization need be performed, or establishing the convergence of optimization algorithms. In order to obtain results for such disparate networks in a unified manner, we introduce the framework of constrained discrete event systems (CDES), which enables us to characterize any permutable and non-interruptive queueing network through its constraint set. The main result of this paper establishes comparison properties of the event occurrence processes of CDES as a function of the constraint sets, which are then translated into the above-mentioned concavity of the throughput as a function of system parameters in the context of queueing networks.

Realization probability in closed Jackson queueing networks and its application

1987 ◽  
Vol 19 (03) ◽  
pp. 708-738 ◽  
Author(s):  
X. R. Cao
Keyword(s):  
Steady State ◽  
Perturbation Analysis ◽  
Queueing Networks ◽  
Sample Path ◽  
Queueing Network ◽  
Jackson Network ◽  
The Mean ◽  
Service Times ◽  
A New Technique ◽  
Number Of Customers

Perturbation analysis is a new technique which yields the sensitivities of system performance measures with respect to parameters based on one sample path of a system. This paper provides some theoretical analysis for this method. A new notion, the realization probability of a perturbation in a closed queueing network, is studied. The elasticity of the expected throughput in a closed Jackson network with respect to the mean service times can be expressed in terms of the steady-state probabilities and realization probabilities in a very simple way. The elasticity of the throughput with respect to the mean service times when the service distributions are perturbed to non-exponential distributions can also be obtained using these realization probabilities. It is proved that the sample elasticity of the throughput obtained by perturbation analysis converges to the elasticity of the expected throughput in steady-state both in mean and with probability 1 as the number of customers served goes to This justifies the existing algorithms based on perturbation analysis which efficiently provide the estimates of elasticities in practice.

scholarly journals Cyclic queueing networks with subexponential service times

2004 ◽  
Vol 41 (03) ◽  
pp. 791-801
Author(s):  
H. Ayhan ◽  
Z. Palmowski ◽  
S. Schlegel
Keyword(s):  
Queueing Networks ◽  
Time Distribution ◽  
Waiting Times ◽  
Queueing Network ◽  
Service Time Distribution ◽  
Tail Behavior ◽  
Cycle Times ◽  
General Service Times ◽  
Service Times ◽  
General Service

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

Methodologies and Approaches in Discrete Event Simulation

2008 ◽  
pp. 1-35
Author(s):  
Evon M. O. Abu-Taieh ◽  
Asim Abdel Rahman El Sheikh
Keyword(s):  
Discrete Event ◽  
Activity Cycle ◽  
Scale Model ◽  
Discrete Events ◽  
Web Based ◽  
Event Simulation ◽  
Modeling Approaches ◽  
Continuous Models ◽  
Systems Simulation ◽  
Cycle Diagram

This chapter aims to give a comprehensive explanatory platform of simulation background. As this chapter comprises of four sections, it reviews simulation definitions, forms of models, the need for simulation, simulation approaches and modeling notations. Simulation definition is essential in order to set research boundaries. Moreover, the chapter discusses forms of models: scale model of the real system, or discrete and continuous models. Subsequently, the chapter states documentation of several reasons by different authors pertaining to the question of “why simulate?,” followed by a thorough discussion of modeling approaches in respect to general considerations. Simulation modeling approaches are discussed with special emphasis on the discrete events type only: process-interaction, event scheduling, and activity scanning, yet, a slight comparison is made between the different approaches. Furthermore, the chapter discusses modeling notations activity cycle diagram (ACD) with different versions of the ACD. Furthermore, the chapter discusses petri nets, which handle concurrent discrete events dynamic systems simulation. In addition, Monte Carlo simulation is discussed due to its important applications. Finally, the fourth section of this chapter reviews Web-based simulation, along with all three different types of object-oriented simulation and modeling.

Improvement for Channels With Multipath Fading (MF) Through the Methodology CBEDE

2020 ◽  
pp. 25-43 ◽  
Author(s):  
Reinaldo Padilha França ◽  
Yuzo Iano ◽  
Ana Carolina Borges Monteiro ◽  
Rangel Arthur
Keyword(s):  
Discrete Event ◽  
Multipath Fading ◽  
Discrete Events ◽  
Telecommunication System ◽  
Modulation Format ◽  
Event Simulation ◽  
Telecommunication Systems ◽  
Wireless Telecommunication ◽  
Memory Utilization ◽  
Discrete Domain

The present study aims to implement a discrete event simulation (DES)-based model. This model is called coding of bits for entities by means of discrete events (CBEDE) and aims to improve the transmission of content in wireless telecommunication systems. This is done by applying advanced modulation format DQPSK in a simulation environment, the Simulink of the MATLAB software, through a pre-coding process of bits applying discrete events in the signal before of the modulation process, occurring in the discrete domain with the implementation of discrete entities in the process of bit generation applied at a low level of abstraction in a wireless telecommunication system. The results show improvements of 89.08% in memory utilization, related to information compression, in the context of the research. Therefore, the presented results of the proposed methodology show an enormous potential for the non-orthogonal multiple access (NOMA) contexts, credited as the future 5G, and can compensate for the additional complexity brought by the techniques to the telecommunications channel.

scholarly journals Discrete Event Simulation Applying Lean methodologies: Case study. Wooden Sector

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Raiza Reyes Mejia ◽  
Blass Troncoso Mendoza ◽  
Alexander Troncoso Palacio
Keyword(s):  
Discrete Event Simulation ◽  
Discrete Event ◽  
Great Variability ◽  
Delivery Time ◽  
Discrete Events ◽  
Assembly Time ◽  
Event Simulation ◽  
New Time

In productive processes where parts are assembled, the assembly time is one of the most important problems that should be solved. Due to this, a case study was carried out in one company in the wooden sector, in which the Lean methodologies and the Discrete Events Simulation are integrated, to evaluate and improve the assembly processes of four-input wooden stowage. This study began by validating the process, then it was simulated in the Arena software, where great variability is observed in the assembly time of the four-input pallets, obtaining an average result of 25+/- 2 minutes. Due to this reason, the use of this methodology was proposed, applying the DMAIC cycle and carrying out controls in the process, it was possible to reduce it to 19 +/- 1 minute per stowage unit assembled, which meant a 24% reduction in the time spent manufacturing. All of this positively influenced the final delivery time of the product, so, with this new time, the company could satisfy the demand of its customers, and will be able to place its product on the market in less time.

scholarly journals Discrete event simulation applied to single queue management: a case study at a bank agency

2021 ◽  
Vol 12 (9) ◽  
pp. s831-s842
Author(s):  
Marcos Aurélio da Rocha Nascimento ◽  
Lilian Mendes dos Santos ◽  
Adriano Maniçoba da Silva ◽  
Regis Cortez Bueno ◽  
Sivanilza Teixeira Machado ◽  
...  
Keyword(s):  
Discrete Event Simulation ◽  
Discrete Event ◽  
Real Life ◽  
Service Rate ◽  
Queue Management ◽  
Discrete Events ◽  
Services Research ◽  
Event Simulation ◽  
Labor Requirements

Capacity and queue management are currently used in financial institutions. With decreasing bank units due to internet services, research in this field has focused on improving to utilize their employees efficiently and achieve service excellence. In developing countries like Brazil, the customer has become more bank-accounted due to government and labor requirements, such as the wage credit became mandatory in the wage account. The paper's aim is motivated by a real-life case study to simulate discrete events to improve queue management at a Brazilian bank branch with the Arena software simulation environment. The simulation model was designed, tested, and applied considering the Discrete Event Simulation (DES) replication for queuing strategies on a real-world banking scenario. The arrival and service times were collected from 115 customers in Ferraz de Vasconcelos/SP city. It was performed in version 15.10 (2018) of the Arena software, with processor Intel core i3 CPU dual-core 3.07 GHz and 8GB of RAM. The results indicate that the bank agency should consider providing 9 to 11 operators to attend customers considering the arrival and service rate.

Sign in / Sign up

Export Citation Format

Share Document