Relevant bibliographies by topics / Simulation of queues

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Simulation of queues'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Simulation of queues.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Simulation of queues"

1

Greenberg, Albert G., Otmar Schlunk, and Ward Whitt. "Using Distributed-Event Parallel Simulation to Study Departures from Many Queues in Series." Probability in the Engineering and Informational Sciences 7, no. 2 (1993): 159–86. http://dx.doi.org/10.1017/s0269964800002850.

Full text
Abstract:
In this paper we describe an application of distributed-event parallel simulation to study the transient behavior of a large non-Markovian network of queues. In particular, we implemented the parallel-prefix-based algorithm of Greenberg, Lubachevsky, and Mitrani [13,14] on the 8,192-processor CM-2 Connection machine and the 16,384-processor MasPar computer to simulate the departure times D(k, n) of the kth customer from the nth queue in a long series of single-server queues. Each queue has unlimited waiting space and uses the first-in first-out discipline. The service times of all the customers at all the queues are i.i.d. with a general distribution, and the system starts out with k customers in the first queue and all other queues empty. Glynn and Whitt [11] established limit theorems for this model, but very little could be said about the limits themselves. The simulation results presented here describe the limits and the quality of the approximations resulting from using the limits for finite k and n. Indeed, the simulations suggest interesting conjectures. For this model speeding up a single long run is far superior to independent replications, because very long runs are required to obtain unbiased estimates of the desired quantities and the variance of the estimator at the end of the run is small. The achieved simulation rate was about 17 billion service completions per hour, which is a speedup by about a factor of 100 compared to simulation on a conventional single-processor machine. This speedup contributed greatly to performing the desired experiments.
APA, Harvard, Vancouver, ISO, and other styles
2

Amouzegar, Mahyar, and Khosrow Moshirvaziri. "A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain." Journal of Applied Mathematics and Decision Sciences 2006 (September 18, 2006): 1–13. http://dx.doi.org/10.1155/jamds/2006/87514.

Full text
Abstract:
Some limited analytical derivation for networked queue models has been proposed in the literature, but their solutions are often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general networked queue topology must be developed. Despite certain limitations, simulation algorithms provide a mechanism to obtain insight and good numerical approximation to parameters of networked queues. This paper presents a closed stochastic simulation network model and several approximation and bounding schemes for G/G/c systems. The analysis was originally conducted to verify the integrity of simulation models used to develop alternative policy options conducted on behalf of the US Air Force. We showed that the theoretical bounds could be used to approximate mean capacities at various queues. In this paper, we present results for a G/G/8 system though similar results have been obtained for other networks of queues as well.
APA, Harvard, Vancouver, ISO, and other styles
3

Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.

Full text
Abstract:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
APA, Harvard, Vancouver, ISO, and other styles
4

Connor, Stephen B., and Wilfrid S. Kendall. "Perfect simulation of M/G/c queues." Advances in Applied Probability 47, no. 4 (2015): 1039–63. http://dx.doi.org/10.1239/aap/1449859799.

Full text
Abstract:
In this paper we describe a perfect simulation algorithm for the stable M/G/c queue. Sigman (2011) showed how to build a dominated coupling-from-the-past algorithm for perfect simulation of the super-stable M/G/c queue operating under first-come-first-served discipline. Sigman's method used a dominating process provided by the corresponding M/G/1 queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service). The method exploited the fact that the workload process for the M/G/1 queue remains the same under different queueing disciplines, in particular under the processor sharing discipline, for which a dynamic reversibility property holds. We generalise Sigman's construction to the stable case by comparing the M/G/c queue to a copy run under random assignment. This allows us to produce a naïve perfect simulation algorithm based on running the dominating process back to the time it first empties. We also construct a more efficient algorithm that uses sandwiching by lower and upper processes constructed as coupled M/G/c queues started respectively from the empty state and the state of the M/G/c queue under random assignment. A careful analysis shows that appropriate ordering relationships can still be maintained, so long as service durations continue to be coupled in order of initiation of service. We summarise statistical checks of simulation output, and demonstrate that the mean run-time is finite so long as the second moment of the service duration distribution is finite.
APA, Harvard, Vancouver, ISO, and other styles
5

Wong, Chi-kwong, and Yiu-yin Lee. "Lane-Based Traffic Signal Simulation and Optimization for Preventing Overflow." Mathematics 8, no. 8 (2020): 1368. http://dx.doi.org/10.3390/math8081368.

Full text
Abstract:
In the lane-based signal optimization model, permitted turn directions in the form of lane markings that guide road users to turn at an intersection are optimized with traffic signal settings. The spatial queue requirements of approach lanes should be considered to avoid the overdesigning of the cycle, effective red, and effective green durations. The point-queue system employed in the conventional modeling approach is unrealistic in many practical situations. Overflow conditions cannot be modeled accurately, while vehicle queues are accumulated that block back upstream intersections. In a previous study, a method was developed to manually refine the traffic signal settings by using the results of lane-based optimization. However, the method was inefficient. In the present study, new design constraint sets are proposed to control the effective red and effective green durations, such that traffic enters the road lanes without overflow. The reduced cycle times discharge the accumulated vehicles more frequently. Moreover, queue spillback and residual queues can be avoided. One of the most complicated four-arm intersections in Hong Kong is considered as a case study for demonstration. The existing traffic signal settings are ineffective for controlling the observed traffic demand, and overflow occurs in short lanes. The optimized traffic signal settings applied to the proposed optimization algorithm effectively avoided traffic overflow. The resultant queuing dynamics are simulated using TRANSYT 15 Cell Transmission Model (CTM) to verify the proposed model. The model application is extended to handle the difficult residual queue scenario. It is found that the proposed model can optimize the traffic signal settings in cases where there are short initial residual queues.
APA, Harvard, Vancouver, ISO, and other styles
6

Ingolfsson, Armann, and Thomas A. Grossman. "Graphical Spreadsheet Simulation of Queues." INFORMS Transactions on Education 2, no. 2 (2002): 27–39. http://dx.doi.org/10.1287/ited.2.2.27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ismail, Azhar, Muhammad Latif, and Mian Awai. "Exploiting witness for traffic simulation." Journal of Management and Science 1, no. 1 (2014): 12–24. http://dx.doi.org/10.26524/jms.2014.2.

Full text
Abstract:
Traffic congestion in urban cities is an increasing problem. Not only does it lead to an increase in pollution, but the time spent waiting in traffic queues wastes valuable time in addition to causing frustration. A system that can control and manage traffic efficiently is one way that this issue can be reduced.A specific road traffic intersection in South Manchester, UK, was selected for investigation as it experiences high levels of traffic flow through it during the evening peak time. This has led to large queues and long waiting times due to the fixed timings of the traffic lights. This paper explores strategies to better control the traffic flow through it. A model of the selected traffic junction has been built using Witness simulation software. Data for this junction has been obtained partially from observations and mostly from traffic surveys enabling a simulation of the traffic flow. Analysing the results allowed two alternative scenarios to be developed and simulated. Results from one of the scenarios showed noticeable reductions in the average queue waiting times at the traffic junction.
APA, Harvard, Vancouver, ISO, and other styles
8

Knessl, Charles. "A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics." Journal of Applied Mathematics and Stochastic Analysis 12, no. 4 (1999): 311–38. http://dx.doi.org/10.1155/s1048953399000295.

Full text
Abstract:
We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of rate λ and have service rates equal to μ. When both queues are non-empty, the two systems behave independently of each other. However, when one of the queues becomes empty, the corresponding server helps in the other queue. This is called head-of-the-line processor sharing. We study this model in the heavy traffic limit, where ρ=λ/μ→1. We formulate the heavy traffic diffusion approximation and explicitly compute the time-dependent probability of the diffusion approximation to the joint queue length process. We then evaluate the solution asymptotically for large values of space and/or time. This leads to simple expressions that show how the process achieves its stead state and other transient aspects.
APA, Harvard, Vancouver, ISO, and other styles
9

Raheja, Supriya, Reena Dadhich, and Smita Rajpal. "2-Layered Architecture of Vague Logic Based Multilevel Queue Scheduler." Applied Computational Intelligence and Soft Computing 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/341957.

Full text
Abstract:
In operating system the decisions which CPU scheduler makes regarding the sequence and length of time the task may run are not easy ones, as the scheduler has only a limited amount of information about the tasks. A good scheduler should be fair, maximizes throughput, and minimizes response time of system. A scheduler with multilevel queue scheduling partitions the ready queue into multiple queues. While assigning priorities, higher level queues always get more priorities over lower level queues. Unfortunately, sometimes lower priority tasks get starved, as the scheduler assures that the lower priority tasks may be scheduled only after the higher priority tasks. While making decisions scheduler is concerned only with one factor, that is, priority, but ignores other factors which may affect the performance of the system. With this concern, we propose a 2-layered architecture of multilevel queue scheduler based on vague set theory (VMLQ). The VMLQ scheduler handles the impreciseness of data as well as improving the starvation problem of lower priority tasks. This work also optimizes the performance metrics and improves the response time of system. The performance is evaluated through simulation using MatLab. Simulation results prove that the VMLQ scheduler performs better than the classical multilevel queue scheduler and fuzzy based multilevel queue scheduler.
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Ya Wei, Hong Wei Ding, Jia Guo, Yong Wang, and Qian Lin Liu. "The Analysis of the Loss Rate of Information Packet of Multi-Queue Single Server Polling System in Bi-Directional Cable TV Network." Applied Mechanics and Materials 543-547 (March 2014): 3013–16. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3013.

Full text
Abstract:
In this paper, the authors employ the multi-queue single-server system for information packets to calculate the theoretical value and computer simulation in the Bi-directional cable TV network. 3-queues single server polling system is used for example in the paper. And the simulation results show that the theoretical analysis and computer simulation are consistent.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Simulation of queues"

1

Xu, Ling. "Planning simulation run length in packet queues in communications networks." Thesis, Queen Mary, University of London, 2013. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8712.

Full text
Abstract:
Simulation is a technique of growing importance and is becoming an indispensable tool applied in various academic industries, including packet networks. Simulation provides an alternative research approach to implementing a real environment, owing to its features of scalability, exibility and ease of setup. However, simulating large-scale networks can be very time and resource consuming. It can take several days to run one long simulation experiment, which may be expensive or even unaffordable. Therefore, planning simulation is important. This research proposes to plan simulation run length through predicting the required shortest run length that approximates steady-state, in the form of mathematical and logical expressions, i.e. building an analytical model. Previously related research always focused on classical models, such as the M/M/1 queue model, M/G/1 queue model, and so on. This research expands the research base to include a packet multiplexing model of homogenous sources which is widely accepted and used. This thesis investigates different traffic types (Markovian/Pareto) and different QoS parameter (delay/losses), as well as applying them to end-to-end networks. These scenarios are analysed and expressed, in terms of different desired precision level. Final results show that run length time is well predicted using the developed analytical model, which can be a guide for simulation planning in packet networks of the present and the future. This can be of great significance for performance evaluation studies.
APA, Harvard, Vancouver, ISO, and other styles
2

Savatovic, Anita, and Mejra Cakic. "Estimating Optimal Checkpoint Intervals Using GPSS Simulation." Thesis, Linköping University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8558.

Full text
Abstract:
<p>In this project we illustrate how queueing simulation may be used to find the optimal interval for checkpointing problems and compare results with theoretical computations for simple systems that may be treated analytically.</p><p>We consider a relatively simple model for an internet banking facility. From time to time, the application server breaks down. The information at the time of the breakdown has to be passed onto the back up server before service may be resumed. To make the change over as efficient as possible, information of the state of user’s accounts is saved at regular intervals. This is known as checkpointing.</p><p>Firstly, we use GPSS (a queueing simulation tool) to find, by simulation, an optimal checkpointing interval, which maximises the efficiency of the server. Two measures of efficiency are considered; the availability of the server and the average time a customer spends in the system. Secondly, we investigate how far the queueing theory can go to providing an analytic solution to the problem and see whether or not this is in line with the results obtained through simulation.</p><p>The analysis shows that checkpointing is not necessary if breakdowns occur frequently and log reading after failure does not take much time. Otherwise, checkpointing is necessary and the analysis shows how GPSS may be used to obtain the optimal checkpointing interval. Relatively complicated systems may be simulated, where there are no analytic tools available. In simple cases, where theoretical methods may be used, the results from our simulations correspond with the theoretical calculations.</p>
APA, Harvard, Vancouver, ISO, and other styles
3

Abdel-Jaber, Hussein F. "Performance Modelling and Evaluation of Active Queue Management Techniques in Communication Networks. The development and performance evaluation of some new active queue management methods for internet congestion control based on fuzzy logic and random early detection using discrete-time queueing analysis and simulation." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4261.

Full text
Abstract:
Since the field of computer networks has rapidly grown in the last two decades, congestion control of traffic loads within networks has become a high priority. Congestion occurs in network routers when the number of incoming packets exceeds the available network resources, such as buffer space and bandwidth allocation. This may result in a poor network performance with reference to average packet queueing delay, packet loss rate and throughput. To enhance the performance when the network becomes congested, several different active queue management (AQM) methods have been proposed and some of these are discussed in this thesis. Specifically, these AQM methods are surveyed in detail and their strengths and limitations are highlighted. A comparison is conducted between five known AQM methods, Random Early Detection (RED), Gentle Random Early Detection (GRED), Adaptive Random Early Detection (ARED), Dynamic Random Early Drop (DRED) and BLUE, based on several performance measures, including mean queue length, throughput, average queueing delay, overflow packet loss probability, packet dropping probability and the total of overflow loss and dropping probabilities for packets, with the aim of identifying which AQM method gives the most satisfactory results of the performance measures. This thesis presents a new AQM approach based on the RED algorithm that determines and controls the congested router buffers in an early stage. This approach is called Dynamic RED (REDD), which stabilises the average queue length between minimum and maximum threshold positions at a certain level called the target level to prevent building up the queues in the router buffers. A comparison is made between the proposed REDD, RED and ARED approaches regarding the above performance measures. Moreover, three methods based on RED and fuzzy logic are proposed to control the congested router buffers incipiently. These methods are named REDD1, REDD2, and REDD3 and their performances are also compared with RED using the above performance measures to identify which method achieves the most satisfactory results. Furthermore, a set of discrete-time queue analytical models are developed based on the following approaches: RED, GRED, DRED and BLUE, to detect the congestion at router buffers in an early stage. The proposed analytical models use the instantaneous queue length as a congestion measure to capture short term changes in the input and prevent packet loss due to overflow. The proposed analytical models are experimentally compared with their corresponding AQM simulations with reference to the above performance measures to identify which approach gives the most satisfactory results. The simulations for RED, GRED, ARED, DRED, BLUE, REDD, REDD1, REDD2 and REDD3 are run ten times, each time with a change of seed and the results of each run are used to obtain mean values, variance, standard deviation and 95% confidence intervals. The performance measures are calculated based on data collected only after the system has reached a steady state. After extensive experimentation, the results show that the proposed REDD, REDD1, REDD2 and REDD3 algorithms and some of the proposed analytical models such as DRED-Alpha, RED and GRED models offer somewhat better results of mean queue length and average queueing delay than these achieved by RED and its variants when the values of packet arrival probability are greater than the value of packet departure probability, i.e. in a congestion situation. This suggests that when traffic is largely of a non bursty nature, instantaneous queue length might be a better congestion measure to use rather than the average queue length as in the more traditional models.
APA, Harvard, Vancouver, ISO, and other styles
4

Garrido, Myriam. "Modélisation des évènements rares et estimation des quantiles extrêmes , méthodes de sélection de modèles pour les queues de distribution." Phd thesis, Université Joseph Fourier (Grenoble), 2002. http://tel.archives-ouvertes.fr/tel-00004666.

Full text
Abstract:
Cette thèse étudie la modélisation d'événements rares et l'estimation de quantiles extrêmes, à travers différents types de modèles et le choix de ces modèles. La théorie des valeurs extrêmes, et en particulier la méthode des excès (POT, Peaks Over Threshold), permettent une estimation non paramétrique, mais biaisée, des queues de distribution. Nous souhaitons donc utiliser des modèles paramétriques classiques. Cependant, ces modèles étant estimés et sélectionnés par des tests usuels à partir de l'échantillon complet, les résultats sont surtout influencés par les valeurs les plus probables de la variable. Nous proposons deux tests d'adéquation pour la queue de distribution, le test ET (Exponential Tail) et le test GPD (Generalised Pareto Distribution), pour sélectionner, par comparaison avec la méthode POT, les modèles produisant de bonnes estimations de la queue de distribution. Lorsqu'on souhaite reconstituer la loi dont sont issues les observations aussi bien dans la région centrale que dans la région extrême, on applique d'abord à un ensemble de modèles un test usuel (d'adéquation aux valeurs les plus probables), puis un test d'adéquation de la queue de distribution. Si aucune loi n'est acceptée par les deux types de tests, nous proposons une procédure de régularisation bayésienne qui, à partir d'un modèle adapté aux valeurs les plus probables, permet d'améliorer l'adéquation extrême grâce à un avis d'expert sur la queue de distribution. Enfin, si on revient à la méthode POT, il faut en réduire le biais d'estimation, notamment pour l'estimation des quantiles extrêmes. Cette méthode étant fondée sur l'approximation de la loi des excès au-delà d'un seuil par une loi GPD, nous cherchons à mieux en estimer les paramètres. L'inférence bayésienne sur les paramètres de la loi GPD permet de réduire le biais d'estimation des quantiles extrêmes par la méthode POT, en particulier quand on introduit un avis d'expert sur la queue de distribution.
APA, Harvard, Vancouver, ISO, and other styles
5

Shorey, Rajeev. "Modelling And Analysis Of Event Message Flows In Distributed Discrete Event Simulators Of Queueing Networks." Thesis, Indian Institute of Science, 1995. http://hdl.handle.net/2005/148.

Full text
Abstract:
Distributed Discrete Event Simulation (DDES) has received much attention in recent years, owing to the fact that uniprocessor based serial simulations may require excessive amount of simulation time and computational resources. It is therefore natural to attempt to use multiple processors to exploit the inherent parallelism in discrete event simulations in order to speed up the simulation process. In this dissertation we study the performance of distributed simulation of queueing networks, by analysing queueing models of message flows in distributed discrete event simulators. Most of the prior work in distributed discrete event simulation can be catego­rized as either empirical studies or analytic (or formal) models. In the empirical studies, specific experiments are run on both conservative and optimistic simulators to see which strategy results in a faster simulation. There has also been increasing activity in analytic models either to better understand a single strategy or to compare two strategies. Little attention seems to have been paid to the behaviour of the interprocessor message queues in distributed discrete event simulators. To begin with, we study how to model distributed simulators of queueing networks. We view each logical process in a distributed simulation as comprising a message sequencer with associated message queues, followed by an event processor. A major contribution in this dissertation is the introduction of the maximum lookahead sequencing protocol. In maximum lookahead sequencing, the sequencer knows the time-stamp of the next message to arrive in the empty queue. Maximum lookahead is an unachievable algorithm, but is expected to yield the best throughput compared to any realisable sequencing technique. The analysis of maximum lookahead, therefore, should lead to fundamental limits on the performance of any sequencing algorithm We show that, for feed forward type simulators, with standard stochastic assump-tions for message arrival and time-stamp processes, the message queues are unstable for conservative sequencing, and for conservative sequencing with maximum lookahead and hence for optimistic resequencing, and for any resequencing algorithm that does not employ interprocessor "flow control". It follows that the resequencing problem is fundamentally unstable and some form of interprocessor flow control is necessary in order to make the message queues stable (without message loss). We obtain some generalizations of the insta­bility results to time-stamped message arrival processes with certain ergodicity properties. For feedforward type distributed simulators, we study the throughput of the event sequencer without any interprocessor flow control. We then incorporate flow control and study the throughput of the event sequencer. We analyse various flow control mechanisms. For example, we can bound the buffers of the message queues, or various logical processes can be prevented from getting too far apart in virtual time by means of a mechanism like Moving Time Windows or Bounded Lag. While such mechanisms will serve to stabilize buffers, our approach, of modelling and analysing the message flow processes in the simulator, points towards certain fundamental limits of efficiency of distributed simulation, imposed by the synchronization mechanism. Next we turn to the distributed simulation of more general queueing networks. We find an upper bound to the throughput of distributed simulators of open and closed queueing networks. The upper bound is derived by using flow balance relations in the queueing network and in the simulator, processing speed constraints, and synchronization constraints in the simulator. The upper bound is in terms of parameters of the queueing network, the simulator processor speeds, and the way the queueing network is partitioned or mapped over the simulator processors. We consider the problem of choosing a mapping that maximizes the upper bound. We then study good solutions o! this problem as possible heuristics for the problem of partitioning the queueing network over the simulator processors. We also derive a lower bound to the throughput of the distributed simulator for a simple queueing network with feedback. We then study various properties of the maximum lookahead algorithm. We show that the maximum lookahead algorithm does not deadlock. Further, since there are no syn­chronization overheads, maximum lookahead is a simple algorithm to study. We prove that maximum lookahead sequencing (though unrealisable) yields the best throughput compared to any realisable sequencing technique. These properties make maximum lookahead a very useful algorithm in the study of distributed simulators of queueing networks. To investigate the efficacy of the partitioning heuristic, we perform a study of queue­ing network simulators. Since it is important to study the benefits of distributed simula­tion, we characterise the speedup in distributed simulation, and find an upper bound to the speedup for a given mapping of the queues to the simulator processors. We simulate distributed simulation with maximum lookahead sequencing, with various mappings of the queues to the processors. We also present throughput results foT the same mappings but using a distributed simulation with the optimistic sequencing algorithm. We present a num­ber of sufficiently complex examples of queueing networks, and compare the throughputs obtained from simulations with the upper bounds obtained analytically. Finally, we study message flow processes in distributed simulators of open queueing networks with feedback. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the "external" arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain "natural" modelling construct for the arrival process is exactly correct, whereas an "obvious" model for the feedback process is wrong; we then show how to develop the correct model. Our analysis throws light on the stability of distributed simulators of queueing networks with feedback. We show how the stability of such simulators depends on the parameters of the queueing network.
APA, Harvard, Vancouver, ISO, and other styles
6

Encarnação, Alan Ferreira da. "APLICAÇÃO DE SIMULAÇÃO DISCRETA PARA A GESTÃO DE FILAS NO SETOR DE SERVIÇOS: ESTUDO DE UM RESTAURANTE SELF-SERVICE." Pontifícia Universidade Católica de Goiás, 2015. http://localhost:8080/tede/handle/tede/2476.

Full text
Abstract:
Made available in DSpace on 2016-08-10T10:40:33Z (GMT). No. of bitstreams: 1 ALAN FERREIRA DA ENCARNACAO.pdf: 2933331 bytes, checksum: c35f4b9fb1427d754df19f35454d444e (MD5) Previous issue date: 2015-08-18<br>This paper discusses the application of discrete simulation for the management of queues in the service sector. Some service providers do not correctly dimensioning its service capacity generating queues. The efficient management of queues assists managers in making decisions. The characteristics of services and their important activities are addressed, aiming to demonstrate the Computational Simulation utility to find a balance that satisfies the customer and is economically viable for the service manager. The study object is a self-service restaurant. Through the Software ARENA was developed a model of discrete type and stochastic to play everyday restaurant setting. It concludes that the discrete simulation software has modeling elements that meets the application requirements. The studied restaurant has different characteristics from traditional self-service with layout in series, and it was necessary to provide the model a route for the flow of customers. The study concluded that the queues occur in the mass preparation process, special meat preparation and boxes, with average waiting times of up to 5 minutes. In the other processes, which are trim service, salad - dessert, scale and location of a table - chair is available, the queues have a very agile flow. The operating model obtained allowed the evaluation of some scenarios aiming to reduce the queue time.<br>Este trabalho discute a aplicação da simulação discreta para a gestão de filas no setor de serviços. Alguns prestadores de serviços não dimensionam corretamente sua capacidade de atendimento gerando assim as filas. A gestão eficiente das filas auxilia os gestores na tomada de decisões. São abordadas as características das atividades de serviços e sua importância, tendo como objetivo demonstrar a utilidade da Simulação Computacional para se encontrar um ponto de equilíbrio que satisfaça o cliente e seja viável economicamente para o gestor do serviço. O objeto de estudo é um restaurante selfservice. Através do Software ARENA foi desenvolvido um modelo do tipo discreto e estocástico para reproduzir o ambiente diário do Restaurante. Conclui-se que o software de simulação discreta possui elementos de modelagem que atende as necessidades da aplicação. O restaurante estudado possui características diferentes do tradicional selfservice com layout em série, e foi necessário prever no modelo um roteamento para o fluxo de clientes. O estudo concluiu que as filas ocorrem nos processos de preparo de massas, preparo de carnes especiais e caixas, com tempos médios de espera de até 5min. Nos demais processos, que são serviço de guarnição, salada-sobremesa, balança e localização de uma mesa-com cadeira disponível, as filas possuem um fluxo bem ágil. O modelo operacional obtido permitiu a avaliação de alguns cenários visando diminuição do tempo de fila.
APA, Harvard, Vancouver, ISO, and other styles
7

Ribeiro, Hugo Alves Silva. "Modelo de simulação para análise de processos de aeroporto de médio porte." Universidade Federal de São Carlos, 2015. https://repositorio.ufscar.br/handle/ufscar/3779.

Full text
Abstract:
Made available in DSpace on 2016-06-02T19:52:09Z (GMT). No. of bitstreams: 1 6571.pdf: 4032074 bytes, checksum: e0d2561f673f9fff989f2b9d7c179d5e (MD5) Previous issue date: 2015-02-20<br>Financiadora de Estudos e Projetos<br>This paper aims to diagnose the passenger boarding and landing processes of the Uberlândia airport using the mapping process and computer simulation. The paper presents a review of literature about the airport sector, techniques of mapping process, data collection, queue management and computer simulation. The objective is to analyze each subsystem used by the passenger during their boarding and landing, from the vehicle access areas and check- in counters until the departure lounge and the receipt of baggage. In conclusion, alternatives are proposals to reduce the total time of the passengers in queues, contributing to a possible improvement project for the airport.<br>O presente trabalho tem como proposta diagnosticar os processos de embarque e desembarque de passageiros no aeroporto de Uberlândia por meio do uso do mapeamento de processo e da simulação computacional. O trabalho apresenta uma revisão da literatura acerca do setor aeroportuário, técnicas de mapeamento de processos, coleta de dados, gestão de filas e simulação computacional. O objetivo é analisar cada subsistema utilizado pelo passageiro durante seu embarque e desembarque, desde as áreas de acesso de veículos e de balcões de check-in até as áreas de embarque e de recebimento de bagagens. Como conclusão são propostas alternativas capazes de reduzir o tempo total dos passageiros em filas, contribuindo para um possível projeto de melhoria para o aeroporto.
APA, Harvard, Vancouver, ISO, and other styles
8

Bedford, Anthony, and Anthony bedford@rmit edu au. "Single and dual queueing schemes with prioritised traffic scheduling and finite waiting room." RMIT University. Mathematical and Geospacial Sciences, 2003. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20091002.141051.

Full text
Abstract:
Analysis of new schemes aimed at improving congestion in communications systems is vital for todays service providers. Many techniques are used to evaluate such schemes be it precisely via mathematics or approximately using simulation. This thesis introduces a new scheme, the multi priority dual queue (MPDQ). The MPDQ is the combination of two concepts, the dual queue introduced by [Hayes et. al., 1999] and prioritised traffic. The MPDQ is a system with finite waiting room with two queues where traffic upon arrival if finding the first queue full wait in the second queue if there is room. When a space becomes vacant in the first queue, a customer at the front of the second queue enters the back of the first, which is the queue that has the service centre at the front of it. The traffic can be of two or more classes. The analysis of such a system is complex, both analytically using queueing theory and approximately using simulation analysis. Both approaches are taken in this thesis. To begin, the new algorithmic approach used for the MPDQ is applied for the single buffer model. The steady state and waiting time distributions are obtained and later compared to the MPDQ. Next the performance characteristics are obtained by solving the steady state and waiting time distributions of a two class MPDQ. Preemptive and non-preemptive service disciplines are investigated. Maple is also used to solve the algorithm. To broaden the application of the MPDQ scheme, computer simulations using Arena are undertaken to extend the application of the scheme (and existing finite queueing models) to situations with more than two priorities, something that is extremely difficult to solve analytically. Using simulation, comparisons are undertaken for the single and dual queue schemes for more than two priorities with a variety of queueing disciplines used including First In First Out (FIFO), Last In First Out (LIFO), High Class First (HCF), and Low Class First (LCF). Network scenarios are also modelled to determine the performance of the MPDQ in this environment.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaur, Parneet. "MsSpark: Implementation of Molecular Simulation Queries Using Apache Spark." Scholar Commons, 2016. http://scholarcommons.usf.edu/etd/6272.

Full text
Abstract:
Huge amount of data is being generated in almost every field and it cannot be avoided, rather is essential for the advancement of the field. Analysis of this data requires intensive computing power. Molecular Simulation is a powerful tool for understanding the behavior of natural systems. The simulation generates large amount data while observing the spatial and temporal relationships. The challenge is to handle the analytical queries that are often compute intensive. Although various tools exist to tackle this problem, but in this paper we have tried an alternate approach that uses Apache Spark- a modern big data platform – to parallelize the computation of analytical queries. MsSpark consists of three layers: Apache Spark layer, MS RDD layer and MS Query Processing layer. MS RDD layers supports data that is specific to Molecular Simulation. MS Query Processing layer provides functionality of executing analytical queries. Caching is used to improve the performance. The system can be further extended to cover more analytical queries.
APA, Harvard, Vancouver, ISO, and other styles
10

Bahr, Hubert. "DATA BANDWIDTH REDUCTION TECHNIQUES FOR DISTRIBUTED EMBEDDED SIMULATIO." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2778.

Full text
Abstract:
Maintaining coherence between the independent views of multiple participants at distributed locations is essential in an Embedded Simulation environment. Currently, the Distributed Interactive Simulation (DIS) protocol maintains coherence by broadcasting the entity state streams from each simulation station. In this dissertation, a novel alternative to DIS that replaces the transmitting sources with local sources is developed, validated, and assessed by analytical and experimental means. The proposed Concurrent Model approach reduces the communication burden to transmission of only synchronization and model-update messages. Necessary and sufficient conditions for the correctness of Concurrent Models in a discrete event simulation environment are established by developing Behavioral Congruence &uml;B(EL, ER) and Temporal Congruence &uml;T(t, ER) functions. They indicate model discrepancies with respect to the simulation time t, and the local and remote entity state streams EL and ER, respectively. Performance benefits were quantified in terms of the bandwidth reduction ratio BR=N/I obtained from the comparison of the OneSAF Testbed Semi-Automated Forces (OTBSAF) simulator under DIS requiring a total of N bits and a testbed modified for the Concurrent Model approach which required I bits. In the experiments conducted, a range of 100 d BR d 294 was obtained representing two orders of magnitude reduction in simulation traffic. Investigation showed that the models rely heavily on the priority data structure of the discrete event simulation and that performance of the overall simulation can be enhanced by an additional 6% by improving the queue management. A low run-time overhead, self-adapting storage policy called the Smart Priority Queue (SPQ) was developed and evaluated within the Concurrent Model. The proposed SPQ policies employ a lowcomplexity linear queue for near head activities and a rapid-indexing variable binwidth calendar queue for distant events. The SPQ configuration is determined by monitoring queue access behavior using cost scoring factors and then applying heuristics to adjust the organization of the underlying data structures. Results indicate that optimizing storage to the spatial distribution of queue access can decrease HOLD operation cost between 25% and 250% over existing algorithms such as calendar queues. Taken together, these techniques provide an entity state generation mechanism capable of overcoming the challenges of Embedded Simulation in harsh mobile communications environments with restricted bandwidth, increased message latency, and extended message drop-outs.<br>Ph.D.<br>Department of Electrical and Computer Engineering<br>Engineering and Computer Science<br>Computer Engineering
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Simulation of queues"

1

Brémaud, Pierre. Markov chains: Gibbs fields, Monte Carlo simulation, and queues. Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Probability, Markov chains, queues and simulation: The mathematical basis of performance modeling. Princeton University Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dunne, Noel P. F. Simulation of distributed queue dual bus metropolitan area network (DQDB MAN). University of Manchester, Department of Computer Science, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Summer, Computer Simulation Conference (19th 1987 Montreal Quebec Canada). Proceedings of the 1987 Summer Computer Simulation Conference: July 27-30, 1987, the Queen Elizabeth Hotel, Montreal, Quebec, Canada. The Society, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

International Symposium on Modelling, Simulation, and Control of Hydrometallurgical Processes (1993 Québec, Québec). Modelling, simulation, and control of hydrometallurgical processes: Proceedings of the International Symposium on Modelling, Simulation, and Control of Hydrometallurgical Processes, Quebec City, Quebec, Canada, August 24-September 2, 1993. Edited by Papangelakis V. G. 1958-, Demopoulos G. P, and Hydrometallurgical Meeting (23rd : 1993 : Québec, Québec) ). Metallurgical Society of the Canadian Institue of Mining, Metallurgy, and Petroleum, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Misut, Paul E. Simulation of ground-water flow and pumpage in Kings and Queens counties, Long Island, New York. U.S. Dept. of the Interior, U.S. Geological Survey, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Misut, Paul E. Simulation of ground-water flow and pumpage in Kings and Queens counties, Long Island, New York. U.S. Dept. of the Interior, U.S. Geological Survey, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Misut, Paul E. Simulation of ground-water flow and pumpage in Kings and Queens counties, Long Island, New York. U.S. Dept. of the Interior, U.S. Geological Survey, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Misut, Paul E. Simulation of ground-water flow and pumpage in Kings and Queens counties, Long Island, New York. U.S. Dept. of the Interior, U.S. Geological Survey, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Misut, Paul E. Simulation of ground-water flow and pumpage in Kings and Queens counties, Long Island, New York. U.S. Dept. of the Interior, U.S. Geological Survey, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Simulation of queues"

1

Zadorozhnyi, Vladimir. "Fractal Queues Simulation Peculiarities." In Communications in Computer and Information Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25861-4_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shedler, Gerald S. "Regenerative Simulation." In Regeneration and Networks of Queues. Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4612-1050-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shedler, Gerald S. "Discrete Event Simulation." In Regeneration and Networks of Queues. Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4612-1050-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Allen, Theodore T. "Theory of Queues." In Introduction to Discrete Event Simulation and Agent-based Modeling. Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-139-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Blanchet, José, and Michel Mandjes. "Rare Event Simulation for Queues." In Rare Event Simulation using Monte Carlo Methods. John Wiley & Sons, Ltd, 2009. http://dx.doi.org/10.1002/9780470745403.ch5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dębicki, Krzysztof, and Michel Mandjes. "Simulation of Lévy-Driven Queues." In Universitext. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20693-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Ken. "TheM/G/1 Queues." In Performance Evaluation by Simulation and Analysis with Applications to Computer Networks. John Wiley & Sons, Inc., 2015. http://dx.doi.org/10.1002/9781119006190.ch10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bose, Sanjay K. "Simulation Techniques for Queues and Queueing Networks." In An Introduction to Queueing Systems. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-0001-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lukashenko, Oleg, Evsey Morozov, Ruslana Nekrasova, and Michele Pagano. "Performance Evaluation of Finite Buffer Queues through Regenerative Simulation." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35980-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Parekh, Shyam, and Jean Walrand. "Quick Simulation of Excessive Backlogs in Networks of Queues." In The IMA Volumes in Mathematics and Its Applications. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4613-8762-6_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Simulation of queues"

1

Zadorozhnyi, V. N. "Simulation modeling of fractal queues." In 2014 Dynamics of Systems, Mechanisms and Machines (Dynamics). IEEE, 2014. http://dx.doi.org/10.1109/dynamics.2014.7005703.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Caraccio, Ilaria, Alexander V. Pechinkin, and Rostislav V. Razumchik. "Joint Stationary Distribution Of Queues In Homogenous M|M|3 Queue With Resequencing." In 28th Conference on Modelling and Simulation. ECMS, 2014. http://dx.doi.org/10.7148/2014-0558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nirenberg, Samantha, Andrew Daw, and Jamol Pender. "THE IMPACT OF QUEUE LENGTH ROUNDING AND DELAYED APP INFORMATION ON DISNEY WORLD QUEUES." In 2018 Winter Simulation Conference (WSC). IEEE, 2018. http://dx.doi.org/10.1109/wsc.2018.8632436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Muer, Michael J. Fry, and W. David Kelton. "Are all voting queues created equal?" In 2009 Winter Simulation Conference - (WSC 2009). IEEE, 2009. http://dx.doi.org/10.1109/wsc.2009.5429279.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chan, Wai Kin, and Lee W. Schruben. "Mathematical programming representations for state-dependent queues." In 2008 Winter Simulation Conference (WSC). IEEE, 2008. http://dx.doi.org/10.1109/wsc.2008.4736105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kim, Yun Bae, and Jinsoo Park. "New approaches for inference of unobservable queues." In 2008 Winter Simulation Conference (WSC). IEEE, 2008. http://dx.doi.org/10.1109/wsc.2008.4736402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nicola, Victor, and Tatiana Zaburnenko. "Efficient Simulation of Population Overflow in Parallel Queues." In 2006 Winter Simulation Conference. IEEE, 2006. http://dx.doi.org/10.1109/wsc.2006.323108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Qian, Pengfei, Lufeng Qiao, Qinghua Chen, and Xu Huang. "A Queue Manager Support Independent Management of Multicast Queues for CIOQ Switches." In 2018 IEEE 2nd International Conference on Circuits, System and Simulation (ICCSS). IEEE, 2018. http://dx.doi.org/10.1109/cirsyssim.2018.8525981.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zeifman, Alexander, Anna Korotysheva, Yacov Satin, Ksenia Kiseleva, Victor Korolev, and Sergey Shorgin. "Bounds For Markovian Queues With Possible Catastrophes." In 31st Conference on Modelling and Simulation. ECMS, 2017. http://dx.doi.org/10.7148/2017-0628.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Heegaard, Poul E., and Werner Sandmann. "Importance sampling simulations of phase-type queues." In 2009 Winter Simulation Conference - (WSC 2009). IEEE, 2009. http://dx.doi.org/10.1109/wsc.2009.5429308.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Simulation of queues"

1

Glynn, Peter W., and Donald L. Iglehart. Simulation Methods for Queues: An Overview. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada197084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

L'Ecuyer, Pierre, Nataly Girous, and Peter W. Glynn. Stochastic Optimization by Simulation: Some Experiments with a Simple Steady-State Queue. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada210762.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kodupuganti, Swapneel R., Sonu Mathew, and Srinivas S. Pulugurtha. Modeling Operational Performance of Urban Roads with Heterogeneous Traffic Conditions. Mineta Transportation Institute, 2021. http://dx.doi.org/10.31979/mti.2021.1802.

Full text
Abstract:
The rapid growth in population and related demand for travel during the past few decades has had a catalytic effect on traffic congestion, air quality, and safety in many urban areas. Transportation managers and planners have planned for new facilities to cater to the needs of users of alternative modes of transportation (e.g., public transportation, walking, and bicycling) over the next decade. However, there are no widely accepted methods, nor there is enough evidence to justify whether such plans are instrumental in improving mobility of the transportation system. Therefore, this project researches the operational performance of urban roads with heterogeneous traffic conditions to improve the mobility and reliability of people and goods. A 4-mile stretch of the Blue Line light rail transit (LRT) extension, which connects Old Concord Rd and the University of North Carolina at Charlotte’s main campus on N Tryon St in Charlotte, North Carolina, was considered for travel time reliability analysis. The influence of crosswalks, sidewalks, trails, greenways, on-street bicycle lanes, bus/LRT routes and stops/stations, and street network characteristics on travel time reliability were comprehensively considered from a multimodal perspective. Likewise, a 2.5-mile-long section of the Blue Line LRT extension, which connects University City Blvd and Mallard Creek Church Rd on N Tryon St in Charlotte, North Carolina, was considered for simulation-based operational analysis. Vissim traffic simulation software was used to compute and compare delay, queue length, and maximum queue length at nine intersections to evaluate the influence of vehicles, LRT, pedestrians, and bicyclists, individually and/or combined. The statistical significance of variations in travel time reliability were particularly less in the case of links on N Tryon St with the Blue Line LRT extension. However, a decrease in travel time reliability on some links was observed on the parallel route (I-85) and cross-streets. While a decrease in vehicle delay on northbound and southbound approaches of N Tryon St was observed in most cases after the LRT is in operation, the cross-streets of N Tryon St incurred a relatively higher increase in delay after the LRT is in operation. The current pedestrian and bicycling activity levels seemed insignificant to have an influence on vehicle delay at intersections. The methodological approaches from this research can be used to assess the performance of a transportation facility and identify remedial solutions from a multimodal perspective.
APA, Harvard, Vancouver, ISO, and other styles
4

Glynn, Peter W., Nataly Giroux, and Pierre L'Ecuyer. Stochastic Optimization by Simulation: Numerical Experiments with M/M/1 Queue in Steady-State. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada271143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Simulation of freshwater-saltwater interfaces in the Brooklyn-Queens aquifer system, Long Island, New York. US Geological Survey, 1999. http://dx.doi.org/10.3133/wri984067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Simulation of ground-water flow and pumpage in Kings and Queens Counties, Long Island, New York. US Geological Survey, 1999. http://dx.doi.org/10.3133/wri984071.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hydrogeology, water quality, and simulation of ground-water-development alternatives in the Usquepaug-Queen ground-water reservoir, southern Rhode Island. US Geological Survey, 1997. http://dx.doi.org/10.3133/wri974126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Simulation of queues' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography