Log in

Relevant bibliographies by topics / Simulation of queues / Journal articles

To see the other types of publications on this topic, follow the link: Simulation of queues.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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 customer

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 co

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

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 d

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 pre

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 pa

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 le

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

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

11

Indrajaya, Drajat, and Riri Cornellia. "Analisis Model Antrian Loket Transaksi pada PT. POS Indonesia (persero) Kantor Cabang Sawangan dengan Menggunakan Software Promodel." STRING (Satuan Tulisan Riset dan Inovasi Teknologi) 3, no. 2 (2018): 170. http://dx.doi.org/10.30998/string.v3i2.2828.

Full text

Abstract:

Simulation is a process of imitation of a tangible thing and its surroundings. The problem found in this study is a long queue at the payment counter resulting from numerous customers who come to POS Company. It is also caused by some factors such as a small number of cash registers, with only 2 counters functioned irregularly and less extensive queue lines. Considering that, an analysis of the queues at the payment counters using pro model software application is made to anticipate the long queues. This simulation is run for 6 hours with 10-time replication, verified and is then validated. Th

APA, Harvard, Vancouver, ISO, and other styles

12

Pereira Junior, Jefferson Vasconcelos, Adriano Maniçoba da Silva, and Diego Galileu de Moraes. "Discrete simulation applied to queue management in a supermarket." Independent Journal of Management & Production 11, no. 5 (2020): 1667. http://dx.doi.org/10.14807/ijmp.v11i5.1296.

Full text

Abstract:

This research presents a case study related to the management of queues in a supermarket and the problems found in the organization of this process. In order to reduce the time that customers remain in the checkout lines, an analysis of the environment (supermarket) was carried out virtually through the discrete simulation technique, linked to the Arena software. This technique is classified as quantitative because it makes it possible to measure entities and predict the action of the environment in a way that mimics the reality of the queues at the site. Through the simulated scenario, it was

APA, Harvard, Vancouver, ISO, and other styles

13

Du, Li Fang, Bing Li, and Hua Xuan. "Simulation of Goods Unloading Process Based on Queueing Network." Applied Mechanics and Materials 65 (June 2011): 557–61. http://dx.doi.org/10.4028/www.scientific.net/amm.65.557.

Full text

Abstract:

This paper uses stochastic, transient networks to simulate queueing network when cargos arrive at the terminals, which can estimate the queue length distribution over the run time. Because of the transient nature of the vehicles arrival, two propositions have been used in the model. The model can derive the state of the unloading queues, which looks forwards to improving in efficiency and service level.

APA, Harvard, Vancouver, ISO, and other styles

14

Elahi, Maryam, Andrea Marin, Sabina Rossi, and Carey Williamson. "Frequency scaling in multilevel queues." ACM SIGMETRICS Performance Evaluation Review 48, no. 3 (2021): 97–98. http://dx.doi.org/10.1145/3453953.3453975.

Full text

Abstract:

In this paper, we study a variant of PS+PS multilevel scheduling, which we call the PS+IS queue. Specifically, we use Processor Sharing (PS) at both queues, but with linear frequency scaling on the second queue, so that the latter behaves like an Infinite Server (IS) queue. The goals of the system are low response times for small jobs in the first queue, and reduced power consumption for large jobs in the second queue. The novelty of our model includes the frequency scaling at the second queue, and the batch arrival process at the second queue induced by the busy period structure of the first

APA, Harvard, Vancouver, ISO, and other styles

15

Lee, Ho Woo, Se Won Lee, and Jongwoo Jeon. "Using factorization in analyzing D-BMAP/G/1 queues." Journal of Applied Mathematics and Stochastic Analysis 2005, no. 2 (2005): 119–32. http://dx.doi.org/10.1155/jamsa.2005.119.

Full text

Abstract:

We demonstrate how one can use the factorization property to derive the queue-length distributions of the discrete-time BMAP/G/1 queues with complex operational behavior during the idle period. The procedure demonstrated in this paper can be applied to the analysis of many other discrete-time BMAP/G/1 queues with more behavioral complexities.

APA, Harvard, Vancouver, ISO, and other styles

16

Yuniawan, Dani, P. P. Aang Fajar, Samsudin Hariyanto, and Romi Setiawan. "Traffic queue modeling using arena simulation software (a case study of Mergan 4-Way intersection in Malang City)." MATEC Web of Conferences 204 (2018): 02009. http://dx.doi.org/10.1051/matecconf/201820402009.

Full text

Abstract:

Currently Mergan 4-way intersection is one of intersection that have most traffic dense in Malang City, East Java - Indonesia. This research implement simulation method in order to give several solution option to manage the traffic queue in Mergan 4-way intersection. Simulation method is conducted with several phase, from problem identification up to verification and validation also scenario simulation. Arena Simulation software v.14 is chosen as the tool to modeling the traffic queue line. The research outcome give several solution through Traffic Light 2 simulation scenario. With this simula

APA, Harvard, Vancouver, ISO, and other styles

17

Bakouch, Hassan S. "Probability, Markov chains, queues, and simulation." Journal of Applied Statistics 38, no. 8 (2011): 1746. http://dx.doi.org/10.1080/02664763.2010.484891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Blanchet, Jose, and Michel Mandjes. "Editorial: rare-event simulation for queues." Queueing Systems 57, no. 2-3 (2007): 57–59. http://dx.doi.org/10.1007/s11134-007-9053-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Negi, D. S., and E. S. Lee. "Analysis and simulation of fuzzy queues." Fuzzy Sets and Systems 46, no. 3 (1992): 321–30. http://dx.doi.org/10.1016/0165-0114(92)90370-j.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Glynn, Peter W., and Donald L. Iglehart. "Simulation methods for queues: An overview." Queueing Systems 3, no. 3 (1988): 221–55. http://dx.doi.org/10.1007/bf01161216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Mohd Ali, Darmawaty, and Kaharudin Dimyati. "On the Modelling of the Mobile WiMAX (IEEE 802.16e) Uplink Scheduler." Modelling and Simulation in Engineering 2010 (2010): 1–7. http://dx.doi.org/10.1155/2010/804939.

Full text

Abstract:

Packet scheduling has drawn a great deal of attention in the field of wireless networks as it plays an important role in distributing shared resources in a network. The process involves allocating the bandwidth among users and determining their transmission order. In this paper an uplink (UL) scheduling algorithm for the Mobile Worldwide Interoperability for Microwave Access (WiMAX) network based on the cyclic polling model is proposed. The model in this study consists of five queues (UGS, ertPS, rtPS, nrtPS, and BE) visited by a single server. A threshold policy is imposed to the nrtPS queue

APA, Harvard, Vancouver, ISO, and other styles

22

Gall, Pierre Le. "Single server queueing networks with varying service times and renewal input." Journal of Applied Mathematics and Stochastic Analysis 13, no. 4 (2000): 429–50. http://dx.doi.org/10.1155/s1048953300000368.

Full text

Abstract:

Using recent results in tandem queues and queueing networks with renewal input, when successive service times of the same customer are varying (and when the busy periods are frequently not broken up in large networks), the local queueing delay of a single server queueing network is evaluated utilizing new concepts of virtual and actual delays (respectively). It appears that because of an important property, due to the underlying tandem queue effect, the usual queueing standards (related to long queues) cannot protect against significant overloads in the buffers due to some possible agglutinat

APA, Harvard, Vancouver, ISO, and other styles

23

Rabehasaina, Landy, and Bruno Sericola. "Transient Analysis of Averaged Queue Length in Markovian Queues." Stochastic Models 21, no. 2-3 (2005): 599–613. http://dx.doi.org/10.1081/stm-200056225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Leong, Thin-Yin. "Simpler Spreadsheet Simulation of Multi-Server Queues." INFORMS Transactions on Education 7, no. 2 (2007): 172–77. http://dx.doi.org/10.1287/ited.7.2.172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Chia-Li, and Ronald W. Wolff. "Efficient simulation of queues in heavy traffic." ACM Transactions on Modeling and Computer Simulation 13, no. 1 (2003): 62–81. http://dx.doi.org/10.1145/778553.778556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

Full text

Abstract:

In this paper we describe a perfect simulation algorithm for the stable M/G/cqueue. Sigman (2011) showed how to build a dominated coupling-from-the-past algorithm for perfect simulation of the super-stable M/G/cqueue 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 dis

APA, Harvard, Vancouver, ISO, and other styles

27

Blanchet, Jose, and Henry Lam. "Rare-Event Simulation for Many-Server Queues." Mathematics of Operations Research 39, no. 4 (2014): 1142–78. http://dx.doi.org/10.1287/moor.2014.0654.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Connor, Stephen. "Omnithermal Perfect Simulation for Multi-server Queues." ACM Transactions on Modeling and Computer Simulation 30, no. 1 (2020): 1–15. http://dx.doi.org/10.1145/3361743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Suresh, S., and W. Whitt. "Arranging Queues in Series: A Simulation Experiment." Management Science 36, no. 9 (1990): 1080–91. http://dx.doi.org/10.1287/mnsc.36.9.1080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Asmussen, Søren, Reuven Y. Rubinstein, and Chia-Li Wang. "Regenerative rare events simulation via likelihood ratios." Journal of Applied Probability 31, no. 3 (1994): 797–815. http://dx.doi.org/10.2307/3215157.

Full text

Abstract:

In this paper we obtain some new theoretical and numerial results on estimation of small steady-state probabilities in regenerative queueing models by using the likelihood ratio (score function) method, which is based on a change of the probability measure. For simple GI/G/1 queues, this amounts to simulating the regenerative cycles by a suitable change of the interarrival and service time distribution, typically corresponding to a reference traffic intensity ρ0 which is < 1 but larger than the given one ρ. For the M/M/1 queue, the resulting gain of efficiency is calculated explicitly and s

APA, Harvard, Vancouver, ISO, and other styles

31

Asmussen, Søren, Reuven Y. Rubinstein, and Chia-Li Wang. "Regenerative rare events simulation via likelihood ratios." Journal of Applied Probability 31, no. 03 (1994): 797–815. http://dx.doi.org/10.1017/s0021900200045356.

Full text

Abstract:

In this paper we obtain some new theoretical and numerial results on estimation of small steady-state probabilities in regenerative queueing models by using the likelihood ratio (score function) method, which is based on a change of the probability measure. For simple GI/G/1 queues, this amounts to simulating the regenerative cycles by a suitable change of the interarrival and service time distribution, typically corresponding to a reference traffic intensity ρ 0 which is &lt; 1 but larger than the given one ρ. For the M/M/1 queue, the resulting gain of efficiency is calculated explicitly

APA, Harvard, Vancouver, ISO, and other styles

32

Sagredo-Olivenza, Ismael, Marlon Cárdenas-Bonett, Jorge Gómez-Sanz, and Juan Pavón. "Using Graphs of Queues and Genetic Algorithms to Fast Approximate Crowd Simulations." Proceedings 2, no. 19 (2018): 1216. http://dx.doi.org/10.3390/proceedings2191216.

Full text

Abstract:

The use of Crowd Simulation for re-enacting different real life scenarios has been studied in the literature. In this field of research, the interplay between ambient assisted living solutions and the behavior of pedestrians in large installations is highly relevant. However, when designing these simulations, the necessary simplifications may result in different ranges of accuracy. The more realistic the simulation task is, the more complex and computational expensive it becomes. We present an approach towards a reasonable trade-off: given a complex and computational expensive crowd simulation

APA, Harvard, Vancouver, ISO, and other styles

33

Wang, Yanyan, Lin Wang, Ruijuan Zheng, Xuhui Zhao, and Muhua Liu. "Latency-Optimal Computational Offloading Strategy for Sensitive Tasks in Smart Homes." Sensors 21, no. 7 (2021): 2347. http://dx.doi.org/10.3390/s21072347.

Full text

Abstract:

In smart homes, the computational offloading technology of edge cloud computing (ECC) can effectively deal with the large amount of computation generated by smart devices. In this paper, we propose a computational offloading strategy for minimizing delay based on the back-pressure algorithm (BMDCO) to get the offloading decision and the number of tasks that can be offloaded. Specifically, we first construct a system with multiple local smart device task queues and multiple edge processor task queues. Then, we formulate an offloading strategy to minimize the queue length of tasks in each time s

APA, Harvard, Vancouver, ISO, and other styles

34

Tang, Stanley C. "The queue length distribution for multiserver discrete time queues with batch markovian arrivals." Communications in Statistics. Stochastic Models 8, no. 4 (1992): 665–83. http://dx.doi.org/10.1080/15326349208807246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Doldo, Philip, Jamol Pender, and Richard Rand. "Breaking the Symmetry in Queues with Delayed Information." International Journal of Bifurcation and Chaos 31, no. 09 (2021): 2130027. http://dx.doi.org/10.1142/s0218127421300275.

Full text

Abstract:

Giving customers queue length information about a service system has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze a two-dimensional deterministic fluid model that incorporates customer choice behavior based on delayed queue length information. Reports in the existing literature always assume that all queues have identical parameters and the underlying dynamical system is symmetric.

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Chia-Li, and Ronald W. Wolff. "NEW ESTIMATORS FOR EFFICIENT GI/G/1 SIMULATION." Probability in the Engineering and Informational Sciences 19, no. 2 (2005): 219–39. http://dx.doi.org/10.1017/s0269964805050126.

Full text

Abstract:

For simulating GI/G/1 queues, we investigate estimators of stationary delay-in-queue moments that were suggested but not investigated in our recent article and we develop new ones that are even more efficient. Among them are direct spread estimators that are functions of a generated sequence of spread idle periods and are combinations of estimators. We also develop corresponding conditional estimators of equilibrium idle-period moments and delay moments. We show that conditional estimators are the most efficient; in fact, for Poisson arrivals, they are exact. In simulation runs with both Erlan

APA, Harvard, Vancouver, ISO, and other styles

37

Shirakawa, Hiroshi, Masao Mori, and Masaaki Kijima. "Evaluation of regular splitting queues." Communications in Statistics. Stochastic Models 5, no. 2 (1989): 219–34. http://dx.doi.org/10.1080/15326348908807106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Takine, Tetsuya, Bhaskar Sengupta, and Toshiharu Hasegawa. "A conformance measure for queues." Communications in Statistics. Stochastic Models 11, no. 4 (1995): 645–70. http://dx.doi.org/10.1080/15326349508807365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Walraevens, Joris, Dieter Claeys, and Tuan Phung-Duc. "Asymptotics of queue length distributions in priority retrial queues." Performance Evaluation 127-128 (November 2018): 235–52. http://dx.doi.org/10.1016/j.peva.2018.10.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Avrachenkov, K., and U. Yechiali. "On tandem blocking queues with a common retrial queue." Computers & Operations Research 37, no. 7 (2010): 1174–80. http://dx.doi.org/10.1016/j.cor.2009.10.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Alves, F. S. Q., H. C. Yehia, L. A. C. Pedrosa, F. R. B. Cruz, and Laoucine Kerbache. "Upper Bounds on Performance Measures of Heterogeneous Queues." Mathematical Problems in Engineering 2011 (2011): 1–18. http://dx.doi.org/10.1155/2011/702834.

Full text

Abstract:

In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion of the state space that is followed by an approximate reduction of the state space, only considering the most probable states. In most cases tested, we were able to approximate the actual behavior of the

APA, Harvard, Vancouver, ISO, and other styles

42

Alfa, Attahiru Sule. "Approximating queue lengths in M(t)/D/1 queues." European Journal of Operational Research 44, no. 1 (1990): 60–66. http://dx.doi.org/10.1016/0377-2217(90)90314-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Blanchet, Jose, Yanan Pei, and Karl Sigman. "Exact sampling for some multi-dimensional queueing models with renewal input." Advances in Applied Probability 51, no. 4 (2019): 1179–208. http://dx.doi.org/10.1017/apr.2019.45.

Full text

Abstract:

AbstractUsing a result of Blanchet and Wallwater (2015) for exactly simulating the maximum of a negative drift random walk queue endowed with independent and identically distributed (i.i.d.) increments, we extend it to a multi-dimensional setting and then we give a new algorithm for simulating exactly the stationary distribution of a first-in–first-out (FIFO) multi-server queue in which the arrival process is a general renewal process and the service times are i.i.d.: the FIFO GI/GI/c queue with $ 2 \leq c \lt \infty$ . Our method utilizes dominated coupling from the past (DCFP) as well as the

APA, Harvard, Vancouver, ISO, and other styles

44

Schöf, Stefan. "Efficient data structures for Time Warp simulation queues." Journal of Systems Architecture 44, no. 6-7 (1998): 497–517. http://dx.doi.org/10.1016/s1383-7621(97)00060-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Kelton, W. David. "Transient exponential-Erlang queues and steady-state simulation." Communications of the ACM 28, no. 7 (1985): 741–49. http://dx.doi.org/10.1145/3894.3900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Minkevičius, Saulius. "Simulation of the idle time in multiphase queues." Journal of Interdisciplinary Mathematics 12, no. 3 (2009): 431–37. http://dx.doi.org/10.1080/09720502.2009.10700635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Lee, Ji-Yeon, and Kyung-Soon Bae. "Fast Simulation of Overflow Probabilities in Multiclass Queues." Communications for Statistical Applications and Methods 14, no. 2 (2007): 287–99. http://dx.doi.org/10.5351/ckss.2007.14.2.287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Grammatikakis, M. D., and S. Liesche. "Priority queues and sorting methods for parallel simulation." IEEE Transactions on Software Engineering 26, no. 5 (2000): 401–22. http://dx.doi.org/10.1109/32.846298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Le Gall, Pierre. "The theory of networks of single server queues and the tandem queue model." Journal of Applied Mathematics and Stochastic Analysis 10, no. 4 (1997): 363–81. http://dx.doi.org/10.1155/s1048953397000427.

Full text

Abstract:

We consider the stochastic behavior of networks of single server queues when successive service times of a given customer are highly correlated. The study is conducted in two particular cases: 1) networks in heavy traffic, and 2) networks in which all successive service times have the same value (for a given customer), in order to avoid the possibility of breaking up the busy periods. We then show how the local queueing delay (for an arbitrary customer) can be derived through an equivalent tandem queue on the condition that one other local queueing delay is added: the jitter delay due to the i

APA, Harvard, Vancouver, ISO, and other styles

50

Ascione, Giacomo, Nikolai Leonenko, and Enrica Pirozzi. "Fractional Erlang queues." Stochastic Processes and their Applications 130, no. 6 (2020): 3249–76. http://dx.doi.org/10.1016/j.spa.2019.09.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!