WorldWideScience

Sample records for queues

  1. Group-Server Queues

    OpenAIRE

    Li, Quan-Lin; Ma, Jing-Yu; Xie, Mingzhou; Xia, Li

    2017-01-01

    By analyzing energy-efficient management of data centers, this paper proposes and develops a class of interesting {\\it Group-Server Queues}, and establishes two representative group-server queues through loss networks and impatient customers, respectively. Furthermore, such two group-server queues are given model descriptions and necessary interpretation. Also, simple mathematical discussion is provided, and simulations are made to study the expected queue lengths, the expected sojourn times ...

  2. discouraged by queue length

    Directory of Open Access Journals (Sweden)

    P. R. Parthasarathy

    2001-01-01

    Full Text Available The transient solution is obtained analytically using continued fractions for a state-dependent birth-death queue in which potential customers are discouraged by the queue length. This queueing system is then compared with the well-known infinite server queueing system which has the same steady state solution as the model under consideration, whereas their transient solutions are different. A natural measure of speed of convergence of the mean number in the system to its stationarity is also computed.

  3. Fast meldable priority queues

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting

    1995-01-01

    We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations wh...

  4. An asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1989-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

  5. Concurrent array-based queue

    Science.gov (United States)

    Heidelberger, Philip; Steinmacher-Burow, Burkhard

    2015-01-06

    According to one embodiment, a method for implementing an array-based queue in memory of a memory system that includes a controller includes configuring, in the memory, metadata of the array-based queue. The configuring comprises defining, in metadata, an array start location in the memory for the array-based queue, defining, in the metadata, an array size for the array-based queue, defining, in the metadata, a queue top for the array-based queue and defining, in the metadata, a queue bottom for the array-based queue. The method also includes the controller serving a request for an operation on the queue, the request providing the location in the memory of the metadata of the queue.

  6. Fundamentals of queueing theory

    CERN Document Server

    Gross, Donald; Thompson, James M; Harris, Carl M

    2013-01-01

    Praise for the Third Edition ""This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented.""-IIE Transactions on Operations Engineering Thoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than pre

  7. Implementation of shared queues

    OpenAIRE

    Motte, Nicolas

    2012-01-01

    The transactional framework used to develop Amadeus C++ applications is based on a mechanism of queues to manage the message exchanges between components. These structures are protected from concurrent access thanks to synchronization services provided by Linux. But theses services have a cost in term of performance and they bound the volume of messages transmitted by these queues. In a first step, I have to investigate on the state-of-the-art in term of management algorithms o...

  8. The queue-length in GI/G/s queues

    Directory of Open Access Journals (Sweden)

    Le Gall Pierre

    2000-01-01

    Full Text Available The distribution of the queue-length in the stationary symmetrical GI/G/s queue is given with an application to the M/G/s queue, particularly in the case of the combination of several packet traffics, with various constant service times, to dimension the buffer capacity.

  9. Queueing for healthcare.

    Science.gov (United States)

    Palvannan, R Kannapiran; Teow, Kiok Liang

    2012-04-01

    Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones. This established theory helps us to quantify the appropriate service capacity to meet the patient demand, balancing system utilization and the patient's wait time. It considers four key factors that affect the patient's wait time: average patient demand, average service rate and the variation in both. We illustrate four basic insights that will be useful for managers and doctors who manage healthcare delivery systems, at hospital or department level. Two examples from local hospitals are shown where we have used queueing models to estimate the service capacity and analyze the impact of capacity configurations, while considering the inherent variation in healthcare.

  10. Interacting queues in heavy traffic

    NARCIS (Netherlands)

    J.A. Morrison; S.C. Borst (Sem)

    2010-01-01

    htmlabstractWe consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction. Specifically, the system consists of one primary queue and several

  11. The symmetric longest queue system

    NARCIS (Netherlands)

    van Houtum, Geert-Jan; Adan, Ivo; van der Wal, Jan

    1997-01-01

    We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue

  12. Bad Luck When Joining the Shortest Queue

    NARCIS (Netherlands)

    Blanc, J.P.C.

    2008-01-01

    A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was

  13. A Survey on Priority Queues

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting

    2013-01-01

    Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority qu...

  14. Lévy-driven queues

    NARCIS (Netherlands)

    Debicki, K.G.; Mandjes, M.R.H.

    2012-01-01

    This survey addresses the class of queues with Lévy input, which covers the classical M/G/1 queue and the reflected Brownian motion as special cases. First the stationary behavior is treated, with special attention to the case of the input process having one-sided jumps (i.e., spectrally one-sided

  15. Optimal purely functional priority queues

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Okasaki, Chris

    1996-01-01

    Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt...... Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three steps......: first, we reduce the running time of insert to O(1) by eliminating the possibility of cascading links; second, we reduce the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain...

  16. Applied discrete-time queues

    CERN Document Server

    Alfa, Attahiru S

    2016-01-01

    This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

  17. The MX/G/1 queue with queue length dependent service times

    Directory of Open Access Journals (Sweden)

    Bong Dae Choi

    2001-01-01

    Full Text Available We deal with the MX/G/1 queue where service times depend on the queue length at the service initiation. By using Markov renewal theory, we derive the queue length distribution at departure epochs. We also obtain the transient queue length distribution at time t and its limiting distribution and the virtual waiting time distribution. The numerical results for transient mean queue length and queue length distributions are given.

  18. Equilibrium Arrival Times to Queues

    DEFF Research Database (Denmark)

    Breinbjerg, Jesper; Østerdal, Lars Peter

    We consider a non-cooperative queueing environment where a finite number of customers independently choose when to arrive at a queueing system that opens at a given point in time and serves customers on a last-come first-serve preemptive-resume (LCFS-PR) basis. Each customer has a service time...... requirement which is identically and independently distributed according to some general probability distribution, and they want to complete service as early as possible while minimizing the time spent in the queue. In this setting, we establish the existence of an arrival time strategy that constitutes...... a symmetric (mixed) Nash equilibrium, and show that there is at most one symmetric equilibrium. We provide a numerical method to compute this equilibrium and demonstrate by a numerical example that the social effciency can be lower than the effciency induced by a similar queueing system that serves customers...

  19. Optimal control of two queues in series

    International Nuclear Information System (INIS)

    Moustafa, M.S.; Mohammed, R.M.

    1994-08-01

    In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/1 queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the chosen rates and the queue lengths. At the second queue, the arrival and the service rates are fixed. Our objective is to find a policy for dynamically choosing rates, based on the current rates and queues lengths that minimizes the expected total discounted cost over a finite horizon, numerical results are given. (author). 8 refs, 1 fig

  20. Queue-length balance equations in multiclass multiserver queues and their generalizations

    NARCIS (Netherlands)

    Boon, M.A.A.; Boxma, O.J.; Kella, O.; Miyazawa, M.

    2017-01-01

    A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

  1. Queue-length balance equations in multiclass multiserver queues and their generalizations

    NARCIS (Netherlands)

    Boon, M.; Boxma, O.J.; Kella, O.; Miyazawa, M.

    2017-01-01

    A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

  2. Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues

    NARCIS (Netherlands)

    Cheung, S.K.; van den Berg, Hans Leo; Boucherie, Richardus J.

    2005-01-01

    We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with $K$ customer classes, we show that the marginal queue length distribution for class $k$ factorizes over the number of other

  3. Queueing networks a fundamental approach

    CERN Document Server

    Dijk, Nico

    2011-01-01

    This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner.  The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow subnetworks to be aggregated into single nodes to reduce computational burden. Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov r...

  4. Random queues and risk averse users

    DEFF Research Database (Denmark)

    de Palma, André; Fosgerau, Mogens

    2013-01-01

    We analyze Nash equilibrium in time of use of a congested facility. Users are risk averse with general concave utility. Queues are subject to varying degrees of random sorting, ranging from strict queue priority to a completely random queue. We define the key “no residual queue” property, which...

  5. Optimal dispatching in a tandem queue

    NARCIS (Netherlands)

    van Leeuwen, D.; Núñez Queija, R.

    2017-01-01

    We investigate a Markovian tandem queueing model in which service to the first queue is provided in batches. The main goal is to choose the batch sizes so as to minimize a linear cost function of the mean queue lengths. This model can be formulated as a Markov Decision Process (MDP) for which the

  6. Analysis of the shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1989-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

  7. Analysis of the symmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

  8. Analysis of the symmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

  9. A course on queueing models

    CERN Document Server

    Jain, Joti Lal; Böhm, Walter

    2006-01-01

    The application of engineering principles in divergent fields such as management science and communications as well as the advancement of several approaches in theory and computation have led to growing interest in queueing models, creating the need for a comprehensive text. Emphasizing Markovian structures and the techniques that occur in different models, A Course on Queueing Models discusses recent developments in the field, different methodological tools - some of which are not available elsewhere - and computational techniques.While most books essentially address the classical methods of

  10. Probability, statistics, and queueing theory

    CERN Document Server

    Allen, Arnold O

    1990-01-01

    This is a textbook on applied probability and statistics with computer science applications for students at the upper undergraduate level. It may also be used as a self study book for the practicing computer science professional. The successful first edition of this book proved extremely useful to students who need to use probability, statistics and queueing theory to solve problems in other fields, such as engineering, physics, operations research, and management science. The book has also been successfully used for courses in queueing theory for operations research students. This second edit

  11. Fluid queues and regular variation

    NARCIS (Netherlands)

    Boxma, O.J.

    1996-01-01

    This paper considers a fluid queueing system, fed by N independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index ¿. We show that its fat tail gives rise to an even

  12. Fluid queues and regular variation

    NARCIS (Netherlands)

    O.J. Boxma (Onno)

    1996-01-01

    textabstractThis paper considers a fluid queueing system, fed by $N$ independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index $zeta$. We show that its fat tail

  13. Research into Queueing Network Theory.

    Science.gov (United States)

    1977-09-01

    and Zeigler, B. (1975) "Equilibrium properties of arbitrarily interconnected queueing netowrks ," Tech. Report 75-4, Computer and Communication...Associate. The project was extremely fortunate to secure the services of Dr. Wendel. Dr. Wendel was a project member for one month in the summer of

  14. Vacation queueing models theory and applications

    CERN Document Server

    Tian, Naishuo

    2006-01-01

    A classical queueing model consists of three parts - arrival process, service process, and queue discipline. However, a vacation queueing model has an additional part - the vacation process which is governed by a vacation policy - that can be characterized by three aspects: 1) vacation start-up rule; 2) vacation termination rule, and 3) vacation duration distribution. Hence, vacation queueing models are an extension of classical queueing theory. Vacation Queueing Models: Theory and Applications discusses systematically and in detail the many variations of vacation policy. By allowing servers to take vacations makes the queueing models more realistic and flexible in studying real-world waiting line systems. Integrated in the book's discussion are a variety of typical vacation model applications that include call centers with multi-task employees, customized manufacturing, telecommunication networks, maintenance activities, etc. Finally, contents are presented in a "theorem and proof" format and it is invaluabl...

  15. Dynamic server assignment in a two-queue model

    NARCIS (Netherlands)

    O.J. Boxma (Onno); D.G. Down

    1995-01-01

    textabstractWe consider a polling model of two $M/G/1$ queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level $T$ during a service at queue 2;

  16. Dynamic server assignment in a two-queue model

    NARCIS (Netherlands)

    Boxma, O.J.; Down, D.G.

    1997-01-01

    We consider a polling model of two M/G/1 queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level T during a service at queue 2; in the latter

  17. Adaptive Mean Queue Size and Its Rate of Change: Queue Management with Random Dropping

    OpenAIRE

    Karmeshu; Patel, Sanjeev; Bhatnagar, Shalabh

    2016-01-01

    The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed which incorporates information not just about the average queue size but also the rate of change of th...

  18. Analysis of queues methods and applications

    CERN Document Server

    Gautam, Natarajan

    2012-01-01

    Introduction Analysis of Queues: Where, What, and How?Systems Analysis: Key ResultsQueueing Fundamentals and Notations Psychology in Queueing Reference Notes Exercises Exponential Interarrival and Service Times: Closed-Form Expressions Solving Balance Equations via Arc CutsSolving Balance Equations Using Generating Functions Solving Balance Equations Using Reversibility Reference Notes ExercisesExponential Interarrival and Service Times: Numerical Techniques and Approximations Multidimensional Birth and Death ChainsMultidimensional Markov Chains Finite-State Markov ChainsReference Notes Exerci

  19. Delay in a tandem queueing model with mobile queues: An analytical approximation

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

    In this paper, we analyze the end-to-end delay performance of a tandem queueing system with mobile queues. Due to state-space explosion, there is no hope for a numerical exact analysis for the joint-queue-length distribution. For this reason, we present an analytical approximation that is based on

  20. Priority Queues Resilient to Memory Faults

    DEFF Research Database (Denmark)

    Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

    2007-01-01

    In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n...... queues storing only structural information in the uncorruptible registers between operations....

  1. GPS queues with heterogeneous traffic classes

    NARCIS (Netherlands)

    Borst, Sem; Mandjes, M.R.H.; van Uitert, Miranda

    2002-01-01

    We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic classes are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for

  2. A tandem queue with delayed server release

    NARCIS (Netherlands)

    Nawijn, W.M.

    1997-01-01

    We consider a tandem queue with two stations. The rst station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the rst station, a customer enters the second station to require service at an exponential single server, while in the meantime he

  3. Analysis of the asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

    1991-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  4. The WIYN Queue: Theory Meets Reality

    Science.gov (United States)

    Boroson, T. A.; Harmer, D. L.; Saha, A.; Smith, P. S.; Willmarth, D. W.; Silva, D. R.

    1998-07-01

    During the past two years NOAO has conducted a queue observing experiment with the 3.5 m WIYN telescope on Kitt Peak, Arizona. The WIYN telescope is ideally suited to queue-scheduled operation in terms of its performance and its instrument complement. The queue scheduling experiment on WIYN was designed to test a number of beliefs and hypotheses about gains in efficiency and scientific effectiveness due to queue scheduling. In addition, the experiment was a test of our implementation strategy and management of community expectations. The queue is run according, to a set of rules that guide decisions about which observation to do next. In practice, scientific rank, suitability of current conditions, and the desire to complete programs all enter into these decisions. As predicted by Monte Carlo simulations, the queue increases the overall efficiency of the telescope, particularly for observations requiring, rare conditions. Together with this improvement for typical programs, the queue enables synoptic, target-of-opportunity, and short programs that could not be scheduled classically. Despite this success, a number of sociological issues determine the community's perception of the WIYN queue.

  5. Tandem queue with server slow-down

    NARCIS (Netherlands)

    Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

    2007-01-01

    We study how rare events happen in the standard two-node tandem Jackson queue and in a generalization, the socalled slow-down network, see [2]. In the latter model the service rate of the first server depends on the number of jobs in the second queue: the first server slows down if the amount of

  6. Analysis of the asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  7. On the dependence structure of Gaussian queues

    NARCIS (Netherlands)

    Es-Saghouani, A.; Mandjes, M.R.H.

    2009-01-01

    In this article we study Gaussian queues (that is, queues fed by Gaussian processes, such as fractional Brownian motion (fBm) and the integrated Ornstein-Uhlenbeck (iOU) process), with a focus on the dependence structure of the workload process. The main question is to what extent does the workload

  8. Queues and Lévy Fluctuation Theory

    NARCIS (Netherlands)

    Dębicki, K.; Mandjes, M.

    2015-01-01

    The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades,

  9. Survey on queueing models with standbys support

    Directory of Open Access Journals (Sweden)

    Kolledath Sreekanth

    2018-01-01

    Full Text Available This paper is a survey article on queueing models with standbys support. Due to many real life applications of queueing models, it has become an interesting area for researchers and a lot of research work has been exerted so far. It is worthwhile to examine the performance based analysis for queueing modelling system as it provides a valuable insight to the tractability of the system and accelerates its efficiency. The provision of standbys to the queueing modelling of a real system is needed for smooth functioning in the presence of its unavoidable failures. The present survey provides a dig into the research work done, and emphasis the sequential developments on queueing models with standbys support.

  10. Priority Queues Resilient to Memory Faults

    DEFF Research Database (Denmark)

    Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

    2007-01-01

    In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n......+\\delta)$ time amortized, where $\\delta$ is the maximum amount of corruptions tolerated. Our priority queue matches the performance of classical optimal priority queues in the RAM model when the number of corruptions tolerated is $O(\\log n)$. We prove matching worst case lower bounds for resilient priority...

  11. On the single-server retrial queue

    Directory of Open Access Journals (Sweden)

    Djellab Natalia V.

    2006-01-01

    Full Text Available In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential case, we consider an approximate solution for the steady-state queue size distribution.

  12. Queues and Lévy fluctuation theory

    CERN Document Server

    Dębicki, Krzysztof

    2015-01-01

    The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades, including transform-based techniques, martingales, rate-conservation arguments, change-of-measure, importance sampling, and large deviations. On the application side, it demonstrates how Lévy traffic models arise when modelling current queueing-type systems (as communication networks) and includes applications to finance. Queues and Lévy Fluctuation Theory will appeal to graduate/postgraduate students and researchers in mathematics, computer science, and electrical engineering. Basic prerequisites are probability theory and stochastic processes.

  13. Preventing messaging queue deadlocks in a DMA environment

    Science.gov (United States)

    Blocksome, Michael A; Chen, Dong; Gooding, Thomas; Heidelberger, Philip; Parker, Jeff

    2014-01-14

    Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate and interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

  14. The WorkQueue project - a task queue for the CMS workload management system

    Science.gov (United States)

    Ryu, S.; Wakefield, S.

    2012-12-01

    We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

  15. The WorkQueue project - a task queue for the CMS workload management system

    International Nuclear Information System (INIS)

    Ryu, S; Wakefield, S

    2012-01-01

    We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

  16. The WorkQueue project: A task queue for the CMS workload management system

    Energy Technology Data Exchange (ETDEWEB)

    Ryu, S. [Fermilab; Wakefield, Stuart [Imperial Coll., London

    2012-01-01

    We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

  17. E-Queue Mobile Application

    Directory of Open Access Journals (Sweden)

    Khong Yeen Lai

    2017-01-01

    Full Text Available Waiting in line is a common experience in daily life, whether for a table at a popular restaurant or for the service at a bank. This experience is not always pleasant for most of people because they always have to wait for a long time to be serviced. The ability to interact with waiting customers is highly desirable because it allows businesses the opportunity to optimize their existing services and offer new services to waiting customers. However, interacting with individuals waiting in a queue has been inefficient and costly because employees must either talk with each waiting customer on an ongoing basis or the business must provide high tech devices that interact with each waiting customer. Agile methodology which will be used to develop this application, it incorporates the SDLC phases starting from the Planning phase up to the Maintenance phase. End of the research, we found that majority of respondents are prefer to use the proposed system compared with current method.

  18. Performance optimization of queueing systems with perturbation realization

    KAUST Repository

    Xia, Li; Cao, Xiren

    2012-01-01

    After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance

  19. Computing moving and intermittent queue propagation in highway work zones.

    Science.gov (United States)

    2012-07-01

    Drivers may experience intermittent congestion and moving queue conditions in work zones due to several reasons such as presence of lane closure, roadway geometric changes, higher demand, lower speed, and reduced capacity. The congestion and queue ha...

  20. Australia: a matter of Queues and As

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2007-05-15

    Australia has been very much in the news recently, with ship queues at port terminals and storms hitting the Hunter Valley, flooding coal yards and rail links. In December 2006 a 'capacity balancing system' (CBS) introduced by Port Waratah Coal Services to solve queuing problems in Newcastle ports in mid-2004 was discontinued but then the queues started to grow again. A new CBS was introduced and was beginning to take effect when storms struck New South Wales. Port Dalrymple Coal Services has a queue management system but nevertheless there were 58 ships waiting in Dalrymple Bay and Hay Point in late June. A number of coal terminals are undergoing expansion in an attempt to solve the situation. 4 photos.

  1. Near-optimal switching strategies for a tandem queue

    NARCIS (Netherlands)

    van Leeuwen, D.; Núñez-Queija, R.; Boucherie, R.J.; van Dijk, N.M.

    2017-01-01

    Motivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible,

  2. Near-optimal switching strategies for a tandem queue

    NARCIS (Netherlands)

    D. van Leeuwen (Daphne); R. Núñez Queija (Rudesindo)

    2017-01-01

    textabstractMotivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as

  3. State-dependent importance sampling for a slowdown tandem queue

    NARCIS (Netherlands)

    Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

    2011-01-01

    In this paper we investigate an advanced variant of the classical (Jackson) tandem queue, viz. a two-node system with server slowdown. By this mechanism, the service speed of the upstream queue is reduced as soon as the number of jobs in the downstream queue reaches some pre-specified threshold. We

  4. Discovering queues from event logs with varying levels of information

    NARCIS (Netherlands)

    Senderovich, A.; Leemans, S,J.J.; Harel, S.; Gal, A.; Mandelbaum, A.; van der Aalst, W.M.P.; Reichert, M.; Reijers, H.A.

    2016-01-01

    Detecting and measuring resource queues is central to business process optimization. Queue mining techniques allow for the identification of bottlenecks and other process inefficiencies, based on event data. This work focuses on the discovery of resource queues. In particular, we investigate the

  5. Difference and differential equations with applications in queueing theory

    CERN Document Server

    Haghighi, Aliakbar Montazer

    2013-01-01

      A Useful Guide to the Interrelated Areas of Differential Equations, Difference Equations, and Queueing Models Difference and Differential Equations with Applications in Queueing Theory presents the unique connections between the methods and applications of differential equations, difference equations, and Markovian queues. Featuring a comprehensive collection of

  6. A tandem queue with delayed server release

    OpenAIRE

    Nawijn, W.M.

    1997-01-01

    We consider a tandem queue with two stations. The rst station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the rst station, a customer enters the second station to require service at an exponential single server, while in the meantime he is blocking his server in station 1 until he completes service in station 2, whereupon the server in station 1 is released. An analysis of the generating function of the simultaneous probability di...

  7. Adaptive Filtering Queueing for Improving Fairness

    Directory of Open Access Journals (Sweden)

    Jui-Pin Yang

    2015-06-01

    Full Text Available In this paper, we propose a scalable and efficient Active Queue Management (AQM scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ. First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ’s feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ, Core-Stateless Fair Queueing (CSFQ, CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe and First-In First-Out (FIFO schemes under a variety of traffic conditions.

  8. Dobrushin's approach to queueing network theory

    Directory of Open Access Journals (Sweden)

    F. I. Karpelevich

    1996-01-01

    Full Text Available R.L. Dobrushin (1929-1995 made substantial contributions to Queueing Network Theory (QNT. A review of results from QNT which arose from his ideas or were connected to him in other ways is given. We also comment on various related open problems.

  9. An Evaluation of Concurrent Priority Queue Algorithms

    Science.gov (United States)

    1991-02-01

    path pronlem are testedi A! -S7 ?o An Evaluation of Concurrent Priority Queue Algorithms bv Qin Huang BS. Uiversity - of Science andi Technology of China...who have always supported me through my entire career and made my life more enjoyable. This research was supported in part by the Advanced Research

  10. Buffer Overflow Period in a MAP Queue

    Directory of Open Access Journals (Sweden)

    Andrzej Chydzinski

    2007-01-01

    Full Text Available The buffer overflow period in a queue with Markovian arrival process (MAP and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

  11. Open problems in Gaussian fluid queueing theory

    NARCIS (Netherlands)

    Dȩbicki, K.; Mandjes, M.

    2011-01-01

    We present three challenging open problems that originate from the analysis of the asymptotic behavior of Gaussian fluid queueing models. In particular, we address the problem of characterizing the correlation structure of the stationary buffer content process, the speed of convergence to

  12. QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX

    Directory of Open Access Journals (Sweden)

    Taufik I. Aliev

    2014-11-01

    Full Text Available The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the priority type (preemptive priority, not preemptive priority or no priority between any two demands classes. Having an intuitive and simple way of priority assignment, such description gives mathematical dependencies of system operation characteristics on its parameters. Requirements for priority matrix construction are formulated and the notion of canonical priority matrix is given. It is shown that not every matrix, constructed in accordance with such requirements, is correct. The notion of incorrect priority matrix is illustrated by an example, and it is shown that such matrixes do not ensure any unambiguousness and determinacy in design of algorithm, which realizes corresponding queueing discipline. Rules governing construction of correct matrixes are given for canonical priority matrixes. Residence time for demands of different classes in system, which is the sum of waiting time and service time, is considered as one of the most important characteristics. By introducing extra event method Laplace transforms for these characteristics are obtained, and mathematical dependencies are derived on their basis for calculation of two first moments for corresponding characteristics of demands queueing

  13. Labour costs and queueing theory in retailing

    NARCIS (Netherlands)

    J.B.G. Frenk (Hans); A.R. Thurik (Roy); C.A. Bout

    1991-01-01

    textabstractIn this paper approximation results for the M/G/s queueing model are used to derive an empirically verified shop type dependent non-homogeneous relation between labour volume and sales in retail trade. Moreover, we formulate the retailer's labour management as a formal minimization

  14. Markov-modulated and feedback fluid queues

    NARCIS (Netherlands)

    Scheinhardt, Willem R.W.

    1998-01-01

    In the last twenty years the field of Markov-modulated fluid queues has received considerable attention. In these models a fluid reservoir receives and/or releases fluid at rates which depend on the actual state of a background Markov chain. In the first chapter of this thesis we give a short

  15. Adaptive Importance Sampling Simulation of Queueing Networks

    NARCIS (Netherlands)

    de Boer, Pieter-Tjerk; Nicola, V.F.; Rubinstein, N.; Rubinstein, Reuven Y.

    2000-01-01

    In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a

  16. Designing of vague logic based multilevel feedback queue scheduler

    Directory of Open Access Journals (Sweden)

    Supriya Raheja

    2016-03-01

    Full Text Available Multilevel feedback queue scheduler suffers from major issues of scheduling such as starvation for long tasks, fixed number of queues, and static length of time quantum in each queue. These factors directly affect the performance of the scheduler. At many times impreciseness exists in attributes of tasks which make the performance even worse. In this paper, our intent is to improve the performance by providing a solution to these issues. We design a multilevel feedback queue scheduler using a vague set which we call as VMLFQ scheduler. VMLFQ scheduler intelligently handles the impreciseness and defines the optimum number of queues as well as the optimal size of time quantum for each queue. It also resolves the problem of starvation. This paper simulates and analyzes the performance of VMLFQ scheduler with the other multilevel feedback queue techniques using MatLab.

  17. Optimal control of arrival and service rates in tandem queues

    International Nuclear Information System (INIS)

    Moustafa, M.S.

    1995-08-01

    We consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue L (L=1,2,...,n-1) must go on to queue L+1 after finishing service at server L. Customers arriving to queue n leave the system after finishing service at the last server. At queues 2 to n arrival and service rates are fixed. The objective is to minimize the expected discounted cost of the system over finite and infinite horizons. We show that the optimal policy is of threshold type. In order to establish the result, we formulate the optimal control problem as a Linear Programming. (author). 9 refs

  18. Mathematical Analysis of Queue with Phase Service: An Overview

    Directory of Open Access Journals (Sweden)

    Richa Sharma

    2014-01-01

    Full Text Available We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent.

  19. A two-queue model with alternating limited service and state-dependent setups

    NARCIS (Netherlands)

    Winands, E.M.M.; Adan, I.J.B.F.; Houtum, van G.J.J.A.N.; Papadopoulos, C.T.

    2005-01-01

    We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. We obtain the transforms of the queue length and

  20. Simple and efficient importance sampling scheme for a tandem queue with server slow-down

    NARCIS (Netherlands)

    Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

    2008-01-01

    This paper considers importance sampling as a tool for rare-event simulation. The system at hand is a so-called tandem queue with slow-down, which essentially means that the server of the first queue (or: upstream queue) switches to a lower speed when the second queue (downstream queue) exceeds some

  1. Self-Interested Routing in Queueing Networks

    OpenAIRE

    Ali K. Parlaktürk; Sunil Kumar

    2004-01-01

    We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

  2. The ×-BMAP/G/1 Queueing Model: Queue Contents and Delay Analysis

    Directory of Open Access Journals (Sweden)

    Bart Steyaert

    2011-01-01

    Full Text Available We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum.

  3. An Approach to Active Queue Management in Computer Network

    OpenAIRE

    Asimkiran Dandapat

    2016-01-01

    Active queue management is a key technique for reducing the packet drop rate in the internet. This packet dropping mechanism is used in a router to minimize congestion when the packets are dropped before queue gets full. In this paper a new framework of Active queue management namely MYRED is proposed. The goal of this new scheme is to improve the performance of AQM by keeping router queue length optimized. In RED packets are marked or dropped with a statistical probability before packet buff...

  4. Influence of queue propagation and dissipation on route travel times

    DEFF Research Database (Denmark)

    Raovic, Nevena

    into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

  5. The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta

    Science.gov (United States)

    Helmi Manggala Putri, Arum; Subekti, Retno; Binatari, Nikenasih

    2017-06-01

    Dr Yap Eye Hospital Yogyakarta is one of the most popular reference eye hospitals in Yogyakarta. There are so many patients coming from other cities and many of them are BPJS (Badan Penyelenggara Jaminan Sosial, Social Security Administrative Bodies) patients. Therefore, it causes numerous BPJS patients were in long queue at counter C of the registration section so that it needs to be analysed using queue system. Queue system analysis aims to give queue model overview and determine its effectiveness measure. The data collecting technique used in this research are by interview and observation. After getting the arrival data and the service data of BPJS patients per 5 minutes, the next steps are investigating steady-state condition, examining the Poisson distribution, determining queue models, and counting the effectiveness measure. Based on the result of data observation on Tuesday, February 16th, 2016, it shows that the queue system at counter C has (M/M/1):(GD/∞/∞) queue model. The analysis result in counter C shows that the queue system is a non-steady-state condition. Three ways to cope a non-steady-state problem on queue system are proposed in this research such as bounding the capacity of queue system, adding the servers, and doing Monte Carlo simulation. The queue system in counter C will reach steady-state if the capacity of patients is not more than 52 BPJS patients or adding one more server. By using Monte Carlo simulation, it shows that the effectiveness measure of the average waiting time for BPJS patients in counter C is 36 minutes 65 seconds. In addition, the average queue length of BPJS patients is 11 patients.

  6. Note on a tandem queue with delayed server release

    NARCIS (Netherlands)

    Nawijn, W.M.

    2000-01-01

    We consider a tandem queue with two stations. The first station is an $s$-server queue with Poisson arrivals and exponential service times. After terminating his service in the first station, a customer enters the second station to require service at a single server, while in the meantime he is

  7. Quasi-stationary analysis for queues with temporary overload

    NARCIS (Netherlands)

    Cheung, S.K.; Boucherie, Richardus J.; Núñez-Queija, R.

    2010-01-01

    Motivated by the high variation in transmission rates for document transfer in the Internet and file down loads from web servers, we study the buffer content in a queue with a fluctuating service rate. The fluctuations are assumed to be driven by an independent stochastic process. We allow the queue

  8. The M/G/1 queue with permanent customers

    NARCIS (Netherlands)

    Boxma, O.J.; Cohen, J.W.

    1991-01-01

    The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent

  9. Analysis of the asymmetrical shortest two-server queueing model

    NARCIS (Netherlands)

    J.W. Cohen

    1995-01-01

    textabstractThis study presents the analytic solution for the asymmetrical two-server queueing model with arriving customers joining the shorter queue for the case with Poisson arrivals and negative exponentially distributed service times. The bivariate generating function of the stationary joint

  10. Adaptive optimization for active queue management supporting TCP flows

    NARCIS (Netherlands)

    Baldi, S.; Kosmatopoulos, Elias B.; Pitsillides, Andreas; Lestas, Marios; Ioannou, Petros A.; Wan, Y.; Chiu, George; Johnson, Katie; Abramovitch, Danny

    2016-01-01

    An adaptive decentralized strategy for active queue management of TCP flows over communication networks is presented. The proposed strategy solves locally, at each link, an optimal control problem, minimizing a cost composed of residual capacity and buffer queue size. The solution of the optimal

  11. A tandem queue with server slow-down and blocking

    NARCIS (Netherlands)

    van Foreest, N.D.; van Ommeren, Jan C.W.; Mandjes, M.R.H.; Scheinhardt, Willem R.W.

    2005-01-01

    We consider two variants of a two-station tandem network with blocking. In both variants the first server ceases to work when the queue length at the second station hits a 'blocking threshold.' In addition, in variant 2 the first server decreases its service rate when the second queue exceeds a

  12. A tandem queue with server slow-down and blocking.

    NARCIS (Netherlands)

    van Foreest, N.; van Ommeren, J.C.; Mandjes, M.R.H.; Scheinhardt, W.

    2005-01-01

    We consider two variants of a two-station tandem network with blocking. In both variants the first server ceases to work when the queue length at the second station hits a 'blocking threshold.' In addition, in variant 2 the first server decreases its service rate when the second queue exceeds a

  13. A fixed-size batch service queue with vacations

    Directory of Open Access Journals (Sweden)

    Ho Woo Lee

    1996-01-01

    Full Text Available The paper deals with batch service queues with vacations in which customers arrive according to a Poisson process. Decomposition method is used to derive the queue length distributions both for single and multiple vacation cases. The authors look at other decomposition techniques and discuss some related open problems.

  14. The impact of reneging in processor sharing queues

    NARCIS (Netherlands)

    Gromoll, H.C.; Robert, Ph.; Zwart, B.; Bakker, R.F.

    2006-01-01

    We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Impatient customers may abandon the queue, or renege, before completing service. The random time representing a customer’s patience has a general distribution and may be dependent on

  15. Performance analysis of tandem queues with small buffers

    NARCIS (Netherlands)

    Vuuren, van M.; Adan, I.J.B.F.; Papadopoulos, C.T.

    2005-01-01

    In this paper we present an approximation for the performance analysis of single-server tandem queues with small buffers and generally distributed service times. The approximation is based on decomposition of the tandem queue in subsystems, the parameters of which are determined by an iterative

  16. Decomposability queueing and computer system applications

    CERN Document Server

    Courtois, P J

    1977-01-01

    Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based.The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in

  17. Transient queue-size distribution in a finite-capacity queueing system with server breakdowns and Bernoulli feedback

    Science.gov (United States)

    Kempa, Wojciech M.

    2017-12-01

    A finite-capacity queueing system with server breakdowns is investigated, in which successive exponentially distributed failure-free times are followed by repair periods. After the processing a customer may either rejoin the queue (feedback) with probability q, or definitely leave the system with probability 1 - q. The system of integral equations for transient queue-size distribution, conditioned by the initial level of buffer saturation, is build. The solution of the corresponding system written for Laplace transforms is found using the linear algebraic approach. The considered queueing system can be successfully used in modelling production lines with machine failures, in which the parameter q may be considered as a typical fraction of items demanding corrections. Morever, this queueing model can be applied in the analysis of real TCP/IP performance, where q stands for the fraction of packets requiring retransmission.

  18. A spectral theory approach for extreme value analysis in a tandem of fluid queues

    NARCIS (Netherlands)

    J.W. Bosman (Joost); R. Núñez Queija (Rudesindo)

    2014-01-01

    htmlabstractWe consider a model to evaluate performance of streaming media over an unreliable network. Our model consists of a tandem of two fluid queues. The first fluid queue is a Markov modulated fluid queue that models the network congestion, and the second queue represents the play-out buffer.

  19. Performance optimization of queueing systems with perturbation realization

    KAUST Repository

    Xia, Li

    2012-04-01

    After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance optimization still seems to be a territory not very well cultivated. Recent progresses of perturbation analysis (PA) and sensitivity-based optimization provide a new perspective of performance optimization of queueing systems. PA utilizes the structural information of queueing systems to efficiently extract the performance sensitivity information from a sample path of system. This paper gives a brief review of PA and performance optimization of queueing systems, focusing on a fundamental concept called perturbation realization factors, which captures the special dynamic feature of a queueing system. With the perturbation realization factors as building blocks, the performance derivative formula and performance difference formula can be obtained. With performance derivatives, gradient-based optimization can be derived, while with performance difference, policy iteration and optimality equations can be derived. These two fundamental formulas provide a foundation for performance optimization of queueing systems from a sensitivity-based point of view. We hope this survey may provide some inspirations on this promising research topic. © 2011 Elsevier B.V. All rights reserved.

  20. Manajemen Bandwidth Simple Queue dan Queue Tree pada PT. Endorsindo Makmur Selaras

    OpenAIRE

    Budiman, Arif

    2015-01-01

      The purpose of this study is to analyze and optimize the bandwidth management at PT. Endorsindo Makmur Selaras, with the expectation that the distribution of bandwidth can be evenly distributed to each employee so that the employee can improve performance and quality of the company. Research methods used include analysis methods (survey and interview system that runs directly on the user) and to optimize bandwidth management method to configure the proxy using the Queue Tree. The re...

  1. On finite capacity queueing systems with a general vacation policy

    Directory of Open Access Journals (Sweden)

    Jacqueline Loris-Teghem

    2000-01-01

    Full Text Available We consider a Poisson arrival queueing system with finite capacity and a general vacation policy as described in Loris-Teghem [Queueing Systems 3 (1988, 41-52]. From our previous results regarding the stationary queue length distributions immediately after a departure and at an arbitrary epoch, we derive a relation between both distributions which extends a result given in Frey and Takahashi [Operations Research Letters 21 (1997, 95-100] for the particular case of an exhaustive service multiple vacation policy.

  2. Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue

    Directory of Open Access Journals (Sweden)

    Alexandra Koshman-Kaz

    2015-02-01

    Full Text Available This article deals with strategic control of information in a single-server model. It considers an M/M/1 system with identical customers. There is a single cut-off number, and the level of congestion is said to be low (high if the queue length is less than (at least this value. The firm can dynamically change the admission fee according to the level of congestion. Arriving customers cannot observe the queue length, but they are informed about the current level of congestion and the admission fee. The article deals with finding the profit maximizing admission fee, using analytical and numerical methods. We observe that such a pricing regime can be used to increase the profit and the proportion of the increase relative to the single price unobservable queue is unbounded. We observe that the profit maximizing threshold is usually quite small and therefore raise a question whether there is a significant difference in profit when rather than being informed about the congestion level, customers only join the system when the server is idle. We also investigate this question considering the classical observable model.

  3. Queues with waiting time dependent service

    DEFF Research Database (Denmark)

    Bekker, R.; Koole, G. M.; Nielsen, Bo Friis

    2011-01-01

    Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based...... derive steady-state waiting-time distributions for both models. The results are illustrated with numerical examples....... on the waiting time of the first customer in line. In the second model, one queue is served by a primary server which is supplemented by a secondary server when the waiting of the first customer in line exceeds a threshold. Using level crossings for the waiting-time process of the first customer in line, we...

  4. Transient analysis of a queue with queue-length dependent MAP and its application to SS7 network

    Directory of Open Access Journals (Sweden)

    Bong Dae Choi

    1999-01-01

    Full Text Available We analyze the transient behavior of a Markovian arrival queue with congestion control based on a double of thresholds, where the arrival process is a queue-length dependent Markovian arrival process. We consider Markov chain embedded at arrival epochs and derive the one-step transition probabilities. From these results, we obtain the mean delay and the loss probability of the nth arrival packet. Before we study this complex model, first we give a transient analysis of an MAP/M/1 queueing system without congestion control at arrival epochs. We apply our result to a signaling system No. 7 network with a congestion control based on thresholds.

  5. Semigroup Method on a MX/G/1 Queueing Model

    Directory of Open Access Journals (Sweden)

    Alim Mijit

    2013-01-01

    Full Text Available By using the Hille-Yosida theorem, Phillips theorem, and Fattorini theorem in functional analysis we prove that the MX/G/1 queueing model with vacation times has a unique nonnegative time-dependent solution.

  6. A unifying property for distribution-sensitive priority queues

    DEFF Research Database (Denmark)

    Elmasry, Amr Ahmed Abd Elmoneim; Farzan, Arash; Iacono, John

    2011-01-01

    , before) the last access of x and are still in the priority queue at the time when the corresponding operation is performed. Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense. We also argue...... that these bounds are the best possible with respect to the considered measures. Moreover, we modify our priority queue to satisfy a new unifying property - the time-finger property - which encapsulates both the working-set and the queueish properties. In addition, we prove that the working-set bound......We present a priority queue that supports the operations: insert in worst-case constant time, and delete, delete-min, find-min and decrease-key on an element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively, qx) is the number of elements that were accessed after (respectively...

  7. Report on dynamic speed harmonization and queue warning algorithm design.

    Science.gov (United States)

    2014-02-01

    This report provides a detailed description of the algorithms that will be used to generate harmonized recommended speeds : and queue warning information in the proposed Intelligent Network Flow Optimization (INFLO) prototype. This document : describ...

  8. Age Replacement and Service Rate Control of Stochastically Degrading Queues

    National Research Council Canada - National Science Library

    Chapin, Patrick

    2004-01-01

    This thesis considers the problem of optimally selecting a periodic replacement time for a multiserver queueing system in which each server is subject to degradation as a function of the mean service...

  9. A single-server queue with random accumulation level

    Directory of Open Access Journals (Sweden)

    Jewgeni H. Dshalalow

    1991-01-01

    The author establishes an ergodicity criterion for both the queueing process with continuous time parameter and the imbedded process. Under this criterion, the author obtains explicit formulas for the stationary distributions of both processes by using semi-regenerative techniques.

  10. An asymptotic analysis of closed queueing networks with branching populations

    OpenAIRE

    Bayer, N.; Coffman, E.G.; Kogan, Y.A.

    1995-01-01

    textabstractClosed queueing networks have proven to be valuable tools for system performance analysis. In this paper, we broaden the applications of such networks by incorporating populations of {em branching customers: whenever a customer completes service at some node of the network, it is replaced by N>=0 customers, each routed independently to a next node, where N has a given, possibly node-dependent branching distribution. Applications of these branching and queueing networks focus on {e...

  11. A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles

    Science.gov (United States)

    2013-09-01

    Autonomous Vehicles Joseph DiVita, PhD Robert L. Morris Maria Olinda Rodas SSC Pacific Approved...298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 09–2013 Final A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles Joseph...Mission Area: Command and Control, Queueing Model; Supervisory Control; Unmanned Autonomous Vehicles M. O. Rodas U U U U 38 (619)

  12. Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

    Science.gov (United States)

    Blocksome, Michael A [Rochester, MN; Chen, Dong [Croton On Hudson, NY; Gooding, Thomas [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Parker, Jeff [Rochester, MN

    2012-02-07

    Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

  13. Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues

    OpenAIRE

    Lloret-Batlle, Roger; Jayakrishnan, R.

    2018-01-01

    This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure ...

  14. Perbandingan Metode Simple Queues Dan Queues Tree Untuk Optimasi Manajemen Bandwidth Jaringan Komputer Di STMIK PPKIA Pradnya Paramita Malang

    OpenAIRE

    Syaifuddin, Aris; Yunus, Mahmud; Sundari, Retno

    2013-01-01

    This research resulted in a comparison between the Simple Queues method and Queues Tree using Mikrotik router that takes a case study in STMIK PPKIA PRADNYA PARAMITA MALANG has been tested to determine which method is the most optimal deal of bandwidth sharing on computer networks. After finding out where the most optimal method will be applied in STMIK PPKIA PRADNYA PARAMITA MALANG to maximize network performance and bandwidth sharing in place, the results of the study lead to the conclusion...

  15. Ethics in radiology: wait lists queue jumping.

    Science.gov (United States)

    Cunningham, Natalie; Reid, Lynette; MacSwain, Sarah; Clarke, James R

    2013-08-01

    Education in ethics is a requirement for all Royal College residency training programs as laid out in the General Standards of Accreditation for residency programs in Canada. The ethical challenges that face radiologists in clinical practice are often different from those that face other physicians, because the nature of the physician-patient interaction is unlike that of many other specialties. Ethics education for radiologists and radiology residents will benefit from the development of teaching materials and resources that focus on the issues that are specific to the specialty. This article is intended to serve as an educational resource for radiology training programs to facilitate teaching ethics to residents and also as a continuing medical education resource for practicing radiologists. In an environment of limited health care resources, radiologists are frequently asked to expedite imaging studies for patients and, in some respects, act as gatekeepers for specialty care. The issues of wait lists, queue jumping, and balancing the needs of individuals and society are explored from the perspective of a radiologist. Copyright © 2013 Canadian Association of Radiologists. Published by Elsevier Inc. All rights reserved.

  16. Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case

    Directory of Open Access Journals (Sweden)

    Charles Knessl

    2011-01-01

    Full Text Available We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, of the same order as the ratio of the arrival rates. We assume that the primary queue is heavily loaded and that the secondary queue is critically loaded. If we let the small arrival rate to the secondary queue be O(ε, where 0≤ε≪1, then in this asymptotic limit the number of customers in the first queue will be large, of order O(ε-1, while that in the second queue will be somewhat smaller, of order O(ε-1/2. We obtain a two-dimensional diffusion approximation for this model and explicitly solve for the joint steady state probability distribution of the numbers of customers in the two queues. This work complements that in (Morrison, 2010, which the second queue was assumed to be heavily or lightly loaded, leading to mean queue lengths that were O(ε-1 or O(1, respectively.

  17. Upper Bounds on Performance Measures of Heterogeneous // Queues

    Directory of Open Access Journals (Sweden)

    F. S. Q. Alves

    2011-01-01

    Full Text Available 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 system with smaller errors than those obtained from traditional homogeneous multiserver Markovian queues, as shown by GPSS simulations. In addition, we have correlated the quality of the approximation with the degree of heterogeneity of the system, which was evaluated using its Gini index. Finally, we have shown that the bounds are robust and still useful, even considering quite different allocation strategies. A large number of simulation results show the accuracy of the proposed method that is better than that of classical homogeneous multiserver Markovian formulae in many situations.

  18. Modelling M/G/1 queueing systems with server vacations using ...

    African Journals Online (AJOL)

    Simple numerical examples are also provided to illustrate the func- ... M/G/1/N queueing systems with server vacations under a limited service discipline ...... system contents in a discrete-time non-preemptive priority queue with general service.

  19. Single server queueing networks with varying service times and renewal input

    Directory of Open Access Journals (Sweden)

    Pierre Le Gall

    2000-01-01

    Full Text Available 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 “agglutination phenomenon” (related to short queues. Usual network management methods and traffic simulation methods should be revised, and should monitor the partial traffic streams loads (and not only the server load.

  20. Large Deviation Bounds for a Polling System with Two Queues and Multiple Servers

    OpenAIRE

    Wei, Fen

    2004-01-01

    In this paper, we present large deviation bounds for a discrete-time polling system consisting of two-par-allel queues and m servers. The arrival process in each queue is an arbitrary, and possibly correlated, stochastic process. Each server (serves) independently serves the two queues according to a Bernoulli service schedule. Using large deviation techniques, we analyze the tail behavior of the stationary distribution of the queue length processes, and derive upper and lower bounds of the b...

  1. Bulk input queues with quorum and multiple vacations

    Directory of Open Access Journals (Sweden)

    Dshalalow Jewgeni H.

    1996-01-01

    Full Text Available The authors study a single-server queueing system with bulk arrivals and batch service in accordance to the general quorum discipline: a batch taken for service is not less than r and not greater than R ( ≥ r . The server takes vacations each time the queue level falls below r ( ≥ 1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process. The analysis of the system is based on the theory of first excess processes developed by the first author. A preliminary analysis of such processes enabled the authors to obtain all major characteristics for the queueing process in an analytically tractable form. Some examples and applications are given.

  2. Queue and stack sorting algorithm optimization and performance analysis

    Science.gov (United States)

    Qian, Mingzhu; Wang, Xiaobao

    2018-04-01

    Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

  3. An introduction to queueing theory modeling and analysis in applications

    CERN Document Server

    Bhat, U Narayan

    2015-01-01

    This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a wide interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models. • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • Applications in manufacturing and, computer and communication systems. • A chapter on ...

  4. Parallel discrete-event simulation of FCFS stochastic queueing networks

    Science.gov (United States)

    Nicol, David M.

    1988-01-01

    Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

  5. Algorithm for queueing networks with multi-rate traffic

    DEFF Research Database (Denmark)

    Iversen, Villy Bæk; Ko, King-Tim

    2011-01-01

    the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolution algorithm to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general, presumes that we have product form between the nodes. Otherwise, we have the state space explosion. Even so, the detailed state space of each node may become very large because there is no product form between chains inside a node. A prerequisite for product form...

  6. Algorithm for queueing networks with multi-rate traffic

    DEFF Research Database (Denmark)

    Iversen, Villy Bæk; King-Tim, Ko

    2011-01-01

    the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form...

  7. Strategic behavior and social outcomes in a bottleneck queue

    DEFF Research Database (Denmark)

    Breinbjerg, J.; Sebald, Alexander; Østerdal, L. P.

    2016-01-01

    the first-in-first-out (FIFO), last-in-first-out (LIFO), and service-in-random-order (SIRO) queue disciplines and compare these predictions to outcomes from a laboratory experiment. In line with our theoretical predictions, we find that people arrive with greater dispersion when participating under the LIFO......We theoretically and experimentally study the differential incentive effects of three well known queue disciplines in a strategic environment in which a bottleneck facility opens and impatient players decide when to arrive. For a class of three-player games, we derive equilibrium arrivals under...... discipline, whereas they tend to arrive immediately under FIFO and SIRO. As a consequence, shorter waiting times are obtained under LIFO as compared to FIFO and SIRO. However, while our theoretical predictions admit higher welfare under LIFO, this is not recovered experimentally as the queue disciplines...

  8. On response time and cycle time distributions in a two-stage cyclic queue

    NARCIS (Netherlands)

    Boxma, O.J.; Donk, P.

    1982-01-01

    We consider a two-stage closed cyclic queueing model. For the case of an exponential server at each queue we derive the joint distribution of the successive response times of a custumer at both queues, using a reversibility argument. This joint distribution turns out to have a product form. The

  9. Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

    NARCIS (Netherlands)

    van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

    In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

  10. DecreaseKeys are Expensive for External Memory Priority Queues

    OpenAIRE

    Eenberg, Kasper; Larsen, Kasper Green; Yu, Huacheng

    2016-01-01

    One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be supported, one can design a comparison-based priority queue performing $O((N/B)\\lg_{M/B} N)$ I/Os over a sequence of $N$ operations, where $B$ is the disk block size in number of words and $M$ is the main memory size in number of words. This matches the lower bound for comparison-based sorting and is hence optimal fo...

  11. Study on the Queue-Length Distribution in Geo/G(MWV/1/N Queue with Working Vacations

    Directory of Open Access Journals (Sweden)

    Chuanyi Luo

    2015-01-01

    Full Text Available This paper analyzes a finite buffer size discrete-time Geo/G/1/N queue with multiple working vacations and different input rate. Using supplementary variable technique and embedded Markov chain method, the queue-length distribution solution in the form of formula at arbitrary epoch is obtained. Some performance measures associated with operating cost are also discussed based on the obtained queue-length distribution. Then, several numerical experiments follow to demonstrate the effectiveness of the obtained formulae. Finally, a state-dependent operating cost function is constructed to model an express logistics service center. Regarding the service rate during working vacation as a control variable, the optimization analysis on the cost function is carried out by using parabolic method.

  12. Pricing in M/M/1 queues when cost of waiting in queue differs from cost of waiting in service

    Directory of Open Access Journals (Sweden)

    Görkem Sarıyer

    2016-11-01

    Full Text Available Service providers can adjust the entrance price to the state of the demand in real life service systems where the customers' decision to receive the service, is based on this price, state of demand and other system parameters. We analyzed service provider's short and long term pricing problems in unobservable M/M/1 queues having the rational customers, where, for customers, the unit cost of waiting in the queue is higher than unit cost of waiting in the service. We showed that waiting in the queue has a clear negative effect on customers’ utilities, hence the service provider's price values. We also showed that, in the short term, monopolistic pricing is optimal for congested systems with high server utilization levels, whereas in the long term, market capturing pricing is more profitable.

  13. A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks

    Directory of Open Access Journals (Sweden)

    Doo Il Choi

    1999-01-01

    Full Text Available A queueing system (M/G1,G2/1/K is considered in which the service time of a customer entering service depends on whether the queue length, N(t, is above or below a threshold L. The arrival process is Poisson, and the general service times S1 and S2 depend on whether the queue length at the time service is initiated is

  14. The curse of the first-in-first-out queue discipline

    DEFF Research Database (Denmark)

    Platz, Trine Tornøe; Østerdal, Lars Peter Raahave

    2017-01-01

    We consider a game in which a large number of identical agents choose when to queue up at a single server after it opens. Agents are impatient for service and also incur a cost proportional to time spent in the queue. We show that the first-in–first-out queue discipline and the last......-in–first-out queue discipline both lead to a unique equilibrium arrival distribution. However, among all work-conserving queue disciplines, the first-in–first-out performs the worst in terms of equilibrium utility and welfare, while the last-in–first-out performs the best....

  15. Buffer Management of Multi-Queue QoS Switches with Class Segregation

    OpenAIRE

    Itoh, Toshiya; Yoshimoto, Seiji

    2013-01-01

    In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

  16. Markovian inventory model with two parallel queues, jockeying and impatient customers

    Directory of Open Access Journals (Sweden)

    Jeganathan K.

    2016-01-01

    Full Text Available This article presents a perishable stochastic inventory system under continuous review at a service facility consisting of two parallel queues with jockeying. Each server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is of finite size L. The inventory is replenished according to an (s; S inventory policy and the replenishing times are assumed to be exponentially distributed. The individual customer is issued a demanded item after a random service time, which is distributed as negative exponential. The life time of each item is assumed to be exponential. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if the inventory level is more than one and one queue is empty while in the other queue, more than one customer are waiting, then the customer who has to be received after the customer being served in that queue is transferred to the empty queue. This will prevent one server from being idle while the customers are waiting in the other queue. The waiting customer independently reneges the system after an exponentially distributed amount of time. The joint probability distribution of the inventory level, the number of customers in both queues, and the status of the server are obtained in the steady state. Some important system performance measures in the steady state are derived, so as the long-run total expected cost rate.

  17. On the control of queueing systems with aging state information

    NARCIS (Netherlands)

    Onderwater, M.; Bhulai, S.; van der Mei, R.D.

    2015-01-01

    We investigate control of a queueing system in which a component of the state space is subject to aging. The controller can choose to forward incoming queries to the system (where it needs time for processing), or respond with a previously generated response (incurring a penalty for not providing a

  18. A cooperative approach to queue allocation of indivisible objects

    NARCIS (Netherlands)

    Hamers, H.J.M.; Klijn, F.; Slikker, M.; Velzen, van B.

    2009-01-01

    We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining stable

  19. A queueing model with randomized depletion of inventory

    NARCIS (Netherlands)

    Albrecher, H.-J.; Boxma, O.J.; Essifi, R.; Kuijstermans, A.C.M.

    2015-01-01

    In this paper we study an M/M/1 queue, where the server continues to work during idle periods and builds up inventory. This inventory is used for new arriving service requirements, but it is completely emptied at random epochs of a Poisson process, whose rate depends on the current level of the

  20. Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

    Science.gov (United States)

    Zelinski, Shannon; Windhorst, Robert

    2016-01-01

    A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

  1. An adversarial queueing model for online server routing

    NARCIS (Netherlands)

    Bonifaci, V.

    2007-01-01

    In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

  2. Single-server queues with spatially distributed arrivals

    NARCIS (Netherlands)

    Kroese, Dirk; Schmidt, Volker

    1994-01-01

    Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion

  3. Sojourn-time approximations in queueing networks with feedback

    NARCIS (Netherlands)

    Gijsen, B.M.M.; van der Mei, R.D.; Engelberts, P.; van den Berg, J.L.; van Wingerden, K.M.C.

    2006-01-01

    This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

  4. Sojourn time approximations in queueing networks with feedback

    NARCIS (Netherlands)

    Gijsen, B.M.M.; Mei, R.D. van der; Engelberts, P.; Berg, J.L. van den; Wingerden, K.M.C. van

    2006-01-01

    This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

  5. Sojourn-time approximations in queueing networks with feedback

    NARCIS (Netherlands)

    Gijsen, B.M.M.; van der Mei, R.D.; van den Berg, Hans Leo; van Wingerden, K.M.C.

    This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

  6. Customer-oriented finite perturbation analysis for queueing networks

    NARCIS (Netherlands)

    Heidergott, B.F.

    2000-01-01

    We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which can be a service time parameter or a buffer size, and we are interested in sensitivity analysis of J ( ) with respect to . We introduce a new method, called customer-oriented finite perturbation

  7. Arrival first queueing networks with applications in kanban production systems

    NARCIS (Netherlands)

    Boucherie, R.J.; Chao, X.; Miyazawa, M.

    2001-01-01

    In this paper we introduce a new class of queueing networks called {\\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

  8. Arrival first queueing networks with applications in kanban production systems

    NARCIS (Netherlands)

    Boucherie, Richardus J.; Chao, X.; Miyazawa, M.

    2003-01-01

    In this paper, we introduce a new class of queueing networks called arrival first networks. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

  9. Empirical Analysis of Priority on a FCFS Queue Discipline In ...

    African Journals Online (AJOL)

    Queues are virtually unavoidable phenomenon in Nigerian banking system. While banks stride to meet customers services' satisfaction, customers who do not go immediately into service must wait in line (if any). The queuing discipline in banks has been first-come-first-served (FCFS). What happen to the waiting time ...

  10. Transient error approximation in a Lévy queue

    NARCIS (Netherlands)

    Mathijsen, B.; Zwart, A.P.

    2017-01-01

    Motivated by a capacity allocation problem within a finite planning period, we conduct a transient analysis of a single-server queue with Lévy input. From a cost minimization perspective, we investigate the error induced by using stationary congestion measures as opposed to time-dependent measures.

  11. Performance analysis of manufacturing systems : queueing approximations and algorithms

    NARCIS (Netherlands)

    Vuuren, van M.

    2007-01-01

    Performance Analysis of Manufacturing Systems Queueing Approximations and Algorithms This thesis is concerned with the performance analysis of manufacturing systems. Manufacturing is the application of tools and a processing medium to the transformation of raw materials into finished goods for sale.

  12. The Supermarket Model with Bounded Queue Lengths in Equilibrium

    Science.gov (United States)

    Brightwell, Graham; Fairthorne, Marianne; Luczak, Malwina J.

    2018-04-01

    In the supermarket model, there are n queues, each with a single server. Customers arrive in a Poisson process with arrival rate λ n , where λ = λ (n) \\in (0,1) . Upon arrival, a customer selects d=d(n) servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean 1. In this paper, we analyse the behaviour of the supermarket model in the regime where λ (n) = 1 - n^{-α } and d(n) = \\lfloor n^β \\rfloor , where α and β are fixed numbers in (0, 1]. For suitable pairs (α , β ) , our results imply that, in equilibrium, with probability tending to 1 as n → ∞, the proportion of queues with length equal to k = \\lceil α /β \\rceil is at least 1-2n^{-α + (k-1)β } , and there are no longer queues. We further show that the process is rapidly mixing when started in a good state, and give bounds on the speed of mixing for more general initial conditions.

  13. Estimation of the workload correlation in a Markov fluid queue

    NARCIS (Netherlands)

    Kaynar, B.; Mandjes, M.R.H.

    2013-01-01

    This paper considers a Markov fluid queue, focusing on the correlation function of the stationary workload process. A simulation-based computation technique is proposed, which relies on a coupling idea. Then an upper bound on the variance of the resulting estimator is given, which reveals how the

  14. A scheme for evaluating a local queue warning system.

    NARCIS (Netherlands)

    Botma, H. & Oei, H.-L.

    2018-01-01

    This article outlines a method of evaluating a 'local queue warning system', in principle intended only to warn drivers of unexpected congestion at known discontinuities of the road geomctry (bottleneck) and give them advisory speed indications. A prerequisite for installing this system is therefore

  15. 7. Data Structures: Lists, Queues, Stacks and Arrays

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 6. Algorithms - Data Structures: Lists, Queues, Stacks and Arrays. R K Shyamasundar. Series Article Volume 2 Issue 6 June 1997 pp 39-46. Fulltext. Click here to view fulltext PDF. Permanent link:

  16. Integrated service resource reservation using queueing networks theory

    DEFF Research Database (Denmark)

    Brewka, Lukasz Jerzy; Iversen, Villy Bæk; Kardaras, Georgios

    2014-01-01

    This study analyses multi-server multi-service queueing networks with service protection. To guarantee each service a certain quality-of-service and at the same time ensure high utilisation of servers, a minimum capacity is reserved each service. In addition, all services share the remaining non...

  17. Sojourn time asymptotics in processor-sharing queues

    NARCIS (Netherlands)

    Borst, S.C.; Núñez Queija, R.; Zwart, B.

    2006-01-01

    Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of attention in the queueing literature. While the PS paradigm emerged in the sixties as an idealization of round-robin scheduling in time-shared computer systems, it has recently captured renewed interest as

  18. Analysis of a multi-server queueing model of ABR

    NARCIS (Netherlands)

    R. Núñez Queija (Rudesindo); O.J. Boxma (Onno)

    1996-01-01

    textabstractIn this paper we present a queueing model for the performance a-na-ly-sis of ABR traffic in ATM networks. We consider a multi-channel service station with two types of customers, the first having preemptive priority over the second. The arrivals occur according to two independent Poisson

  19. Waiting time distribution in M/D/1 queueing systems

    DEFF Research Database (Denmark)

    Iversen, Villy Bæk; Staalhagen, Lars

    1999-01-01

    The well-known formula for the waiting time distribution of M/D/1 queueing systems is numerically unsuitable when the load is close to 1.0 and/or the results for a large waiting time are required. An algorithm for any load and waiting time is presented, based on the state probabilities of M/D/1...

  20. Efficient Simulation of Population Overflow in Parallel Queues

    NARCIS (Netherlands)

    Nicola, V.F.; Zaburnenko, T.S.

    2006-01-01

    In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal��? state-dependent change of measure without the need for dif��?cult mathematical analysis or costly

  1. Moving toward queue operations at the Large Binocular Telescope Observatory

    Science.gov (United States)

    Edwards, Michelle L.; Summers, Doug; Astier, Joseph; Suarez Sola, Igor; Veillet, Christian; Power, Jennifer; Cardwell, Andrew; Walsh, Shane

    2016-07-01

    The Large Binocular Telescope Observatory (LBTO), a joint scientific venture between the Instituto Nazionale di Astrofisica (INAF), LBT Beteiligungsgesellschaft (LBTB), University of Arizona, Ohio State University (OSU), and the Research Corporation, is one of the newest additions to the world's collection of large optical/infrared ground-based telescopes. With its unique, twin 8.4m mirror design providing a 22.8 meter interferometric baseline and the collecting area of an 11.8m telescope, LBT has a window of opportunity to exploit its singular status as the "first" of the next generation of Extremely Large Telescopes (ELTs). Prompted by urgency to maximize scientific output during this favorable interval, LBTO recently re-evaluated its operations model and developed a new strategy that augments classical observing with queue. Aided by trained observatory staff, queue mode will allow for flexible, multi-instrument observing responsive to site conditions. Our plan is to implement a staged rollout that will provide many of the benefits of queue observing sooner rather than later - with more bells and whistles coming in future stages. In this paper, we outline LBTO's new scientific model, focusing specifically on our "lean" resourcing and development, reuse and adaptation of existing software, challenges presented from our one-of-a-kind binocular operations, and lessons learned. We also outline further stages of development and our ultimate goals for queue.

  2. Python for Scientific Computing Education: Modeling of Queueing Systems

    Directory of Open Access Journals (Sweden)

    Vladimiras Dolgopolovas

    2014-01-01

    Full Text Available In this paper, we present the methodology for the introduction to scientific computing based on model-centered learning. We propose multiphase queueing systems as a basis for learning objects. We use Python and parallel programming for implementing the models and present the computer code and results of stochastic simulations.

  3. Approximations for Markovian multi-class queues with preemptive priorities

    NARCIS (Netherlands)

    van der Heijden, Matthijs C.; van Harten, Aart; Sleptchenko, Andrei

    2004-01-01

    We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach

  4. Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity

    NARCIS (Netherlands)

    Boxma, O.J.

    1984-01-01

    For the M/G/1 queue we study the joint distribution of the number of customers x present immediately before an arrival epoch and of the residual service time ¿ of the customer in service at this epoch. The correlation coefficient (x, ¿) is shown to be positive (negative) when the service time

  5. Competing for jobs: labor queues and gender sorting in the hiring process.

    Science.gov (United States)

    Fernandez, Roberto M; Mors, Marie Louise

    2008-12-01

    While much research has documented the pattern and extent of sex segregation of workers once they are employed, few studies have addressed the pre-hire mechanisms that are posited to produce sex segregation in employment. While the notion of a labor queue-the rank order of the set of people that employers choose among-plays a prominent role in pre-hire accounts of job sex sorting mechanisms, few studies have examined the ways in which job candidates are sorted into labor queues. In this paper, we explore the mechanisms by which labor queues contribute to the gendering of jobs by studying the hiring process for all jobs at a call center. Being placed in a queue has a clear gendering effect on the hiring process: the sex distribution of applicants who are matched to queues and those who are rejected at this phase diverge, and among those assigned to queues, women are prevalent in queues for low pay, low status jobs. The screening process also contributes to the gendering of the population of hires at this firm. Females are more prevalent among hires than they are among candidates at initial queue assignment. Among high status jobs, however, males are more prevalent than females. Moreover, there are important wage implications associated with matching to queues. While there are large between-queue sex differences in the paid wages associated with allocation to queues, once allocated to queues the wage differences between male and female candidates are nil. Consequently, the roots of gender wage inequality in this setting lie in the initial sorting of candidates to labor queues.

  6. The Effect of Queueing Strategy on Network Traffic

    International Nuclear Information System (INIS)

    Zhang Xue-Jun; Guan Xiang-Min; Sun Deng-Feng; Tang Shao-Ting

    2013-01-01

    In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based (DIB) queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out (FIFO) queueing strategy, DIB can effectively balance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems. (condensed matter: structural, mechanical, and thermal properties)

  7. Adaptive Queue Management with Restraint on Non-Responsive Flows

    Directory of Open Access Journals (Sweden)

    Lan Li

    2003-12-01

    Full Text Available This paper proposes an adaptive queue management scheme (adaptive RED to improve Random Early Detection (RED on restraining non-responsive flows. Due to a lack of flow control mechanism, non-responsive flows can starve responsive flows for buffer and bandwidth at the gateway. In order to solve the disproportionate resource problem, RED framework is modified in this way: on detecting when the non-responsive flows starve the queue, packet-drop intensity (Max_p in RED can be adaptively adjusted to curb non-responsive flows for resource fair-sharing, such as buffer and bandwidth fair-sharing. Based on detection of traffic behaviors, intentionally restraining nonresponsive flows is to increase the throughput and decrease the drop rate of responsive flows. Our experimental results based on adaptive RED shows that the enhancement of responsive traffic and the better sharing of buffer and bandwidth can be achieved under a variety of traffic scenarios.

  8. SAM: Support Vector Machine Based Active Queue Management

    International Nuclear Information System (INIS)

    Shah, M.S.

    2014-01-01

    Recent years have seen an increasing interest in the design of AQM (Active Queue Management) controllers. The purpose of these controllers is to manage the network congestion under varying loads, link delays and bandwidth. In this paper, a new AQM controller is proposed which is trained by using the SVM (Support Vector Machine) with the RBF (Radial Basis Function) kernal. The proposed controller is called the support vector based AQM (SAM) controller. The performance of the proposed controller has been compared with three conventional AQM controllers, namely the Random Early Detection, Blue and Proportional Plus Integral Controller. The preliminary simulation studies show that the performance of the proposed controller is comparable to the conventional controllers. However, the proposed controller is more efficient in controlling the queue size than the conventional controllers. (author)

  9. Pricing Analysis in Geo/Geo/1 Queueing System

    Directory of Open Access Journals (Sweden)

    Yan Ma

    2015-01-01

    Full Text Available This paper studies the equilibrium behavior of customers and optimal pricing strategies of servers in a Geo/Geo/1 queueing system. Two common pricing mechanisms are considered. The first one is called ex-post payment (EPP scheme where the server collects tolls proportional to queue times, and the second one is called ex-ante payment (EAP scheme where the server charges a flat fee for the total service. The server sets the toll price to maximize its own profit. It is found that, under a customer’s choice equilibrium, the two toll mechanisms are equivalent from the economic point of view. Finally, we present several numerical experiments to investigate the effects of system parameters on the equilibrium customer joining rate and servers’ profits.

  10. Elements of queueing theory palm martingale calculus and stochastic recurrences

    CERN Document Server

    Baccelli, François

    2003-01-01

    The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationary queuing systems, contains a thorough treatment of both of these. This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law. The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable. Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences. This thoroughly revised second edition contains substantial addition...

  11. The queue as a social statement / Maria-Kristiina Soomre

    Index Scriptorium Estoniae

    Soomre, Maria-Kristiina, 1978-

    2010-01-01

    Tallinna Lauluväljakul veebruaris 2010 olnud töötute järjekorrast, kus 5000-st said alternatiivse töö reisisaatjatena 400. Keskerakonna kampaaniatest, mida võib vaadata sotsiaalse kunsti kontekstis. Sügisel 2010 Tallinna Kunstihoone juures korraldatud kunstiprojektist "Art Queue 100x100 EEK", millega sooviti tõmmata tähelepanu kunstiinstitutsioonile. Seoses kunstiga tekkinud järjekordadest, masside valmidusest kampaania korras rünnata kunsti

  12. Large deviations and queueing networks: Methods for rate function identification

    OpenAIRE

    Atar, Rami; Dupuis, Paul

    1999-01-01

    This paper considers the problem of rate function identification for multidimensional queueing models with feedback. A set of techniques are introduced which allow this identification when the model possesses certain structural properties. The main tools used are representation formulas for exponential integrals, weak convergence methods, and the regularity properties of associated Skorokhod Problems. Two examples are treated as special cases of the general theory: the classical Jackson netwo...

  13. The asymptotic variance of departures in critically loaded queues

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Mandjes, M.R.H.; Nazarathy, Y.; Whitt, W.

    2011-01-01

    We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals 1, and prove that the asymptotic variance rate satisfies limt→∞varD(t) / t = λ(1 - 2 / π)(ca2 +

  14. A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics

    Directory of Open Access Journals (Sweden)

    Charles Knessl

    1999-01-01

    Full Text Available 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.

  15. Exclusive queueing model including the choice of service windows

    Science.gov (United States)

    Tanaka, Masahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

    2018-01-01

    In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates. The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

  16. Queueing models for token and slotted ring networks. Thesis

    Science.gov (United States)

    Peden, Jeffery H.

    1990-01-01

    Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

  17. Queueing network model for obstetric patient flow in a hospital.

    Science.gov (United States)

    Takagi, Hideaki; Kanai, Yuta; Misue, Kazuo

    2016-03-03

    A queueing network is used to model the flow of patients in a hospital using the observed admission rate of patients and the histogram for the length of stay for patients in each ward. A complete log of orders for every movement of all patients from room to room covering two years was provided to us by the Medical Information Department of the University of Tsukuba Hospital in Japan. We focused on obstetric patients, who are generally hospitalized at random times throughout the year, and we analyzed the patient flow probabilistically. On admission, each obstetric patient is assigned to a bed in one of the two wards: one for normal delivery and the other for high-risk delivery. Then, the patient may be transferred between the two wards before discharge. We confirm Little's law of queueing theory for the patient flow in each ward. Next, we propose a new network model of M/G/ ∞ and M/M/ m queues to represent the flow of these patients, which is used to predict the probability distribution for the number of patients staying in each ward at the nightly census time. Although our model is a very rough and simplistic approximation of the real patient flow, the predicted probability distribution shows good agreement with the observed data. The proposed method can be used for capacity planning of hospital wards to predict future patient load in each ward.

  18. Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

    OpenAIRE

    Kim, Ku-Hwan; To, Hoang-Linh; Hwang, Won-Joo; Lee, Jung-Tae

    2016-01-01

    Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long) queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal...

  19. On the busy period of discretized GI/GI/infinity queue

    International Nuclear Information System (INIS)

    Dvurecenskij, A.; Ososkov, G.A.

    1982-01-01

    The problem of determining the distribution of the busy period, i. e., of the time when at least one customer is served, of the discretized queueing system with infinitely many servers is investigated. Moreover, the idle period and the cycle of a queue are studied. The recurrent formulae are determined and in particular case of a queue with the geometric input the simpler recurrent formulae are given. Those problems arise in the discrete blob length determination in track chambers in high energy physics

  20. Time Is Not on Our Side: How Radiology Practices Should Manage Customer Queues.

    Science.gov (United States)

    Loving, Vilert A; Ellis, Richard L; Rippee, Robert; Steele, Joseph R; Schomer, Donald F; Shoemaker, Stowe

    2017-11-01

    As health care shifts toward patient-centered care, wait times have received increasing scrutiny as an important metric for patient satisfaction. Long queues form when radiology practices inefficiently service their customers, leading to customer dissatisfaction and a lower perception of value. This article describes a four-step framework for radiology practices to resolve problematic queues: (1) analyze factors contributing to queue formation; (2) improve processes to reduce service times; (3) reduce variability; (4) address the psychology of queues. Copyright © 2017 American College of Radiology. Published by Elsevier Inc. All rights reserved.

  1. Apparatus and method for managing digital resources by passing digital resource tokens between queues

    Science.gov (United States)

    Crawford, H.J.; Lindenstruth, V.

    1999-06-29

    A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue. 6 figs.

  2. Markov-modulated infinite-server queues driven by a common background process

    OpenAIRE

    Mandjes , Michel; De Turck , Koen

    2016-01-01

    International audience; This paper studies a system with multiple infinite-server queues which are modulated by a common background process. If this background process, being modeled as a finite-state continuous-time Markov chain, is in state j, then the arrival rate into the i-th queue is λi,j, whereas the service times of customers present in this queue are exponentially distributed with mean µ −1 i,j ; at each of the individual queues all customers present are served in parallel (thus refl...

  3. Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service

    Directory of Open Access Journals (Sweden)

    U. C. Gupta

    2015-01-01

    Full Text Available We analyze an infinite-buffer batch-size-dependent batch-service queue with Poisson arrival and arbitrarily distributed service time. Using supplementary variable technique, we derive a bivariate probability generating function from which the joint distribution of queue and server content at departure epoch of a batch is extracted and presented in terms of roots of the characteristic equation. We also obtain the joint distribution of queue and server content at arbitrary epoch. Finally, the utility of analytical results is demonstrated by the inclusion of some numerical examples which also includes the investigation of multiple zeros.

  4. Convergence of a Queueing System in Heavy Traffic with General Abandonment Distributions

    Science.gov (United States)

    2010-10-08

    331–391, 2005. [4] R. Atar . Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann. Appl. Probab., 15...4):2606–2650, 2005. 37 [5] R. Atar , A. Mandelbaum, and M. I. Reiman. Scheduling a multi class queue with many exponential servers: asymptotic

  5. An M/G/1 queue with multiple types of feedback and gated vacations

    NARCIS (Netherlands)

    O.J. Boxma (Onno); U. Yechiali

    1995-01-01

    textabstractThis paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He

  6. Matrix-geometric analysis of the shortest queue problem with threshold jockeying

    NARCIS (Netherlands)

    Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

    1993-01-01

    In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

  7. A single-server queue with batch arrivals and semi-Markov services

    NARCIS (Netherlands)

    Abhishek,; Boon, M.A.A.; Boxma, O.J.; Núñez-Queija, R.

    2017-01-01

    We investigate the transient and stationary queue length distributions of a class of service systems with correlated service times. The classical (Formula presented.) queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The

  8. Performance study of Active Queue Management methods: Adaptive GRED, REDD, and GRED-Linear analytical model

    Directory of Open Access Journals (Sweden)

    Hussein Abdel-jaber

    2015-10-01

    Full Text Available Congestion control is one of the hot research topics that helps maintain the performance of computer networks. This paper compares three Active Queue Management (AQM methods, namely, Adaptive Gentle Random Early Detection (Adaptive GRED, Random Early Dynamic Detection (REDD, and GRED Linear analytical model with respect to different performance measures. Adaptive GRED and REDD are implemented based on simulation, whereas GRED Linear is implemented as a discrete-time analytical model. Several performance measures are used to evaluate the effectiveness of the compared methods mainly mean queue length, throughput, average queueing delay, overflow packet loss probability, and packet dropping probability. The ultimate aim is to identify the method that offers the highest satisfactory performance in non-congestion or congestion scenarios. The first comparison results that are based on different packet arrival probability values show that GRED Linear provides better mean queue length; average queueing delay and packet overflow probability than Adaptive GRED and REDD methods in the presence of congestion. Further and using the same evaluation measures, Adaptive GRED offers a more satisfactory performance than REDD when heavy congestion is present. When the finite capacity of queue values varies the GRED Linear model provides the highest satisfactory performance with reference to mean queue length and average queueing delay and all the compared methods provide similar throughput performance. However, when the finite capacity value is large, the compared methods have similar results in regard to probabilities of both packet overflowing and packet dropping.

  9. Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process

    NARCIS (Netherlands)

    Boxma, O.J.; Prabhu, B.J.

    2009-01-01

    We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue length. For the

  10. The evaluation of a formalized queue management system for coronary angiography waiting lists.

    Science.gov (United States)

    Alter, D A; Newman, Alice M; Cohen, Eric A; Sykora, Kathy; Tu, Jack V

    2005-11-01

    Lengthy waiting lists for coronary angiography have been described in many health care systems worldwide. The extent to which formal queue management systems may improve the prioritization and survival of patients in the angiography queue is unknown. To prospectively evaluate the performance of a formal queue management system for patients awaiting coronary angiography in Ontario. The coronary angiography urgency scale, a formal queue management system developed in 1993 using a modified Delphi panel, allocates recommended maximum waiting times (RMWTs) in accordance with clinical necessity. By using a provincial clinical registry, 35,617 consecutive patients referred into the coronary angiography queue between April 1, 2001, and March 31, 2002, were prospectively tracked. Cox proportional hazards models were used to examined mortality risk across urgency after adjusting for additional clinical and comorbid factors. Good agreement was determined in urgency ratings between scores from the coronary angiography urgency scale and implicit physician judgement, which was obtained independently at the time of the index referral (weighted kappa = 0.49). The overall mortality in the queue was 0.3% (0.47%, 0.26% and 0.13% for urgent, semiurgent and elective patients, respectively). Urgency, as specified by the coronary angiography urgency scale, was the strongest predictor of death in the queue (Pqueue management system may decrease mortality in the coronary angiography queue. The authors recommend its implementation in health care systems where patients experience excessive waiting time delays for coronary angiography.

  11. Slowdown in the $M/M/1$ discriminatory processor-sharing queue

    NARCIS (Netherlands)

    Cheung, S.K.; Kim, Bara; Kim, Jeongsim

    2008-01-01

    We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the first and second moments of the slowdown, which

  12. Sojourn time tails in the single server queue with heavy-tailed service times

    NARCIS (Netherlands)

    Boxma, O.J.; Denisov, D.E.

    2009-01-01

    We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 - a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution

  13. Routing policies for a partially observable two-server queueing system

    NARCIS (Netherlands)

    Ellens, W.; Kovács, P.; Núñez-Queija, R.; Berg, H. van den

    2015-01-01

    We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent

  14. Routing policies for a partially observable two-server queueing system

    NARCIS (Netherlands)

    W. Ellens; P. Kovacs; J.L. van den Berg (Hans); R. Núñez Queija (Rudesindo); A. Busic; M. Gribaudo; P. Reinecke

    2015-01-01

    htmlabstractWe consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues

  15. Waiting-time approximations in multi-queue systems with cyclic service

    NARCIS (Netherlands)

    Boxma, O.J.; Meister, B.W.

    1987-01-01

    This study is devoted to mean waiting-time approximations in a single-server multi-queue model with cyclic service and zero switching times of the server between consecutive queues. Two different service disciplines are considered: exhaustive service and (ordinary cyclic) nonexhaustive service. For

  16. Global and local asymptotics for the busy period of an M/G/1 queue

    NARCIS (Netherlands)

    Denisov, D.E.; Shneer, V.

    2010-01-01

    We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. Our analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of an M/G/1 queue.

  17. Sojourn time tails in the single server queue with heavy-tailed service times

    NARCIS (Netherlands)

    Boxma, O.J.; Denisov, D.E.

    2011-01-01

    We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1-a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is

  18. Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  19. Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

  20. Approximations for the waiting time distribution in an M/G/c priority queue

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

    2013-01-01

    We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the

  1. Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks

    NARCIS (Netherlands)

    Nicola, V.F.; Zaburnenko, T.S.

    2006-01-01

    In this paper we propose state-dependent importance sampling heuristics to estimate the probability of population overflow in Markovian networks of series and parallel queues. These heuristics capture state-dependence along the boundaries (when one or more queues are empty) which is critical for

  2. Queue balancing of load and expedition service in a cement industry in Brazil

    Directory of Open Access Journals (Sweden)

    David Custódio de Sena

    2013-11-01

    Full Text Available The load and weight process in a cement industry is one of logistic step that shows the biggest time of occurrence, increasing the queues. This study aims to do a scenarios to solve this queue problem. This way, it pretends to find an better resources distribuition.

  3. A Parallel Priority Queue with Constant Time Operations

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos D.

    1998-01-01

    We present a parallel priority queue that supports the following operations in constant time:parallel insertionof a sequence of elements ordered according to key,parallel decrease keyfor a sequence of elements ordered according to key,deletion of the minimum key element, anddeletion of an arbitrary...... application is a parallel implementation of Dijkstra's algorithm for the single-source shortest path problem, which runs inO(n) time andO(mlogn) work on a CREW PRAM on graphs withnvertices andmedges. This is a logarithmic factor improvement in the running time compared with previous approaches....

  4. Stochastic network optimization with application to communication and queueing systems

    CERN Document Server

    Neely, Michael

    2010-01-01

    This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are prov

  5. Two coupled Lévy queues with independent input

    OpenAIRE

    Jevgenijs Ivanovs; Onno Boxma

    2014-01-01

    We consider a pair of coupled queues driven by independent spectrally-positive Lévy processes. With respect to the bi-variate workload process this framework includes both the coupled processor model and the two-server fluid network with independent Lévy inputs. We identify the joint transform of the stationary workload distribution in terms of Wiener-Hopf factors corresponding to two auxiliary Lévy processes with explicit Laplace exponents. We reinterpret and extend the ideas of Cohen and Bo...

  6. Correlations in Output and Overflow Traffic Processes in Simple Queues

    Directory of Open Access Journals (Sweden)

    Don McNickle

    2007-01-01

    Full Text Available We consider some simple Markov and Erlang queues with limited storage space. Although the departure processes from some such systems are known to be Poisson, they actually consist of the superposition of two complex correlated processes, the overflow process and the output process. We measure the cross-correlation between the counting processes for these two processes. It turns out that this can be positive, negative, or even zero (without implying independence. The models suggest some general principles on how big these correlations are, and when they are important. This may suggest when renewal or moment approximations to similar processes will be successful, and when they will not.

  7. On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

    Directory of Open Access Journals (Sweden)

    Charles Knessl

    2013-01-01

    Full Text Available We consider two parallel queues, each with independent Poisson arrival rates, that are tended by a single server. The exponential server devotes all of its capacity to the longer of the queues. If both queues are of equal length, the server devotes ν of its capacity to the first queue and the remaining 1−ν to the second. We obtain exact integral representations for the joint probability distribution of the number of customers in this two-node network. Then we evaluate this distribution in various asymptotic limits, such as large numbers of customers in either/both of the queues, light traffic where arrivals are infrequent, and heavy traffic where the system is nearly unstable.

  8. Request queues for interactive clients in a shared file system of a parallel computing system

    Science.gov (United States)

    Bent, John M.; Faibish, Sorin

    2015-08-18

    Interactive requests are processed from users of log-in nodes. A metadata server node is provided for use in a file system shared by one or more interactive nodes and one or more batch nodes. The interactive nodes comprise interactive clients to execute interactive tasks and the batch nodes execute batch jobs for one or more batch clients. The metadata server node comprises a virtual machine monitor; an interactive client proxy to store metadata requests from the interactive clients in an interactive client queue; a batch client proxy to store metadata requests from the batch clients in a batch client queue; and a metadata server to store the metadata requests from the interactive client queue and the batch client queue in a metadata queue based on an allocation of resources by the virtual machine monitor. The metadata requests can be prioritized, for example, based on one or more of a predefined policy and predefined rules.

  9. Convolution Model of a Queueing System with the cFIFO Service Discipline

    Directory of Open Access Journals (Sweden)

    Sławomir Hanczewski

    2016-01-01

    Full Text Available This article presents an approximate convolution model of a multiservice queueing system with the continuous FIFO (cFIFO service discipline. The model makes it possible to service calls sequentially with variable bit rate, determined by unoccupied (free resources of the multiservice server. As compared to the FIFO discipline, the cFIFO queue utilizes the resources of a multiservice server more effectively. The assumption in the model is that the queueing system is offered a mixture of independent multiservice Bernoulli-Poisson-Pascal (BPP call streams. The article also discusses the results of modelling a number of queueing systems to which different, non-Poissonian, call streams are offered. To verify the accuracy of the model, the results of the analytical calculations are compared with the results of simulation experiments for a number of selected queueing systems. The study has confirmed the accuracy of all adopted theoretical assumptions for the proposed analytical model.

  10. New Approach for Finding Basic Performance Measures of Single Server Queue

    Directory of Open Access Journals (Sweden)

    Siew Khew Koh

    2014-01-01

    Full Text Available Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density function f(t and the cumulative distribution function F(t of the interarrival time are such that the rate f(t/1-F(t tends to a constant as t→∞, and the rate computed from the distribution of the service time tends to another constant. When the queue is in a stationary state, we derive a set of equations for the probabilities of the queue length and the states of the arrival and service processes. Solving the equations, we obtain approximate results for the stationary probabilities which can be used to obtain the stationary queue length distribution and waiting time distribution of a customer who arrives when the queue is in the stationary state.

  11. A survey on queues in machining system: Progress from 2010 to 2017

    Directory of Open Access Journals (Sweden)

    Shekhar C.

    2017-01-01

    Full Text Available The aim of the present article is to give a historical survey of some important research works related to queues in machining system since 2010. Queues of failed machines in machine repairing problem occur due to the failure of machines at random in the manufacturing industries, where different jobs are performed on machining stations. Machines are subject to failure what may result in significant loss of production, revenue, or goodwill. In addition to the references on queues in machining system, which is also called `Machine Repair Problem' (MRP or `Machine Interference Problem' (MIP, a meticulous list of books and survey papers is also prepared so as to provide a detailed catalog for understanding the research in queueing domain. We have classified the relevant literature according to a year of publishing, methodological, and modeling aspects. The author(s hope that this survey paper could be of help to learners contemplating research on queueing domain.

  12. Worst-case efficient external-memory priority queues

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Katajainen, Jyrki

    1998-01-01

    A priority queue Q is a data structure that maintains a collection of elements, each element having an associated priority drawn from a totally ordered universe, under the operations Insert, which inserts an element into Q, and DeleteMin, which deletes an element with the minimum priority from Q....... In this paper a priority-queue implementation is given which is efficient with respect to the number of block transfers or I/Os performed between the internal and external memories of a computer. Let B and M denote the respective capacity of a block and the internal memory measured in elements. The developed...... data structure handles any intermixed sequence of Insert and DeleteMin operations such that in every disjoint interval of B consecutive priorityqueue operations at most clogM/B N/M I/Os are performed, for some positive constant c. These I/Os are divided evenly among the operations: if B ≥ clogM/B N...

  13. Multiserver Queue with Guard Channel for Priority and Retrial Customers

    Directory of Open Access Journals (Sweden)

    Kazuki Kajiwara

    2016-01-01

    Full Text Available This paper considers a retrial queueing model where a group of guard channels is reserved for priority and retrial customers. Priority and normal customers arrive at the system according to two distinct Poisson processes. Priority customers are accepted if there is an idle channel upon arrival while normal customers are accepted if and only if the number of idle channels is larger than the number of guard channels. Blocked customers (priority or normal join a virtual orbit and repeat their attempts in a later time. Customers from the orbit (retrial customers are accepted if there is an idle channel available upon arrival. We formulate the queueing system using a level dependent quasi-birth-and-death (QBD process. We obtain a Taylor series expansion for the nonzero elements of the rate matrices of the level dependent QBD process. Using the expansion results, we obtain an asymptotic upper bound for the joint stationary distribution of the number of busy channels and that of customers in the orbit. Furthermore, we develop an efficient numerical algorithm to calculate the joint stationary distribution.

  14. Chimpanzee females queue but males compete for social status

    Science.gov (United States)

    Foerster, Steffen; Franz, Mathias; Murray, Carson M.; Gilby, Ian C.; Feldblum, Joseph T.; Walker, Kara K.; Pusey, Anne E.

    2016-01-01

    Dominance hierarchies are widespread in animal social groups and often have measureable effects on individual health and reproductive success. Dominance ranks are not static individual attributes, however, but instead are influenced by two independent processes: 1) changes in hierarchy membership and 2) successful challenges of higher-ranking individuals. Understanding which of these processes dominates the dynamics of rank trajectories can provide insights into fitness benefits of within-sex competition. This question has yet to be examined systematically in a wide range of taxa due to the scarcity of long-term data and a lack of appropriate methodologies for distinguishing between alternative causes of rank changes over time. Here, we expand on recent work and develop a new likelihood-based Elo rating method that facilitates the systematic assessment of rank dynamics in animal social groups, even when interaction data are sparse. We apply this method to characterize long-term rank trajectories in wild eastern chimpanzees (Pan troglodytes schweinfurthii) and find remarkable sex differences in rank dynamics, indicating that females queue for social status while males actively challenge each other to rise in rank. Further, our results suggest that natal females obtain a head start in the rank queue if they avoid dispersal, with potential fitness benefits. PMID:27739527

  15. Proposal for optimal placement platform of bikes using queueing networks.

    Science.gov (United States)

    Mizuno, Shinya; Iwamoto, Shogo; Seki, Mutsumi; Yamaki, Naokazu

    2016-01-01

    In recent social experiments, rental motorbikes and rental bicycles have been arranged at nodes, and environments where users can ride these bikes have been improved. When people borrow bikes, they return them to nearby nodes. Some experiments have been conducted using the models of Hamachari of Yokohama, the Niigata Rental Cycle, and Bicing. However, from these experiments, the effectiveness of distributing bikes was unclear, and many models were discontinued midway. Thus, we need to consider whether these models are effectively designed to represent the distribution system. Therefore, we construct a model to arrange the nodes for distributing bikes using a queueing network. To adopt realistic values for our model, we use the Google Maps application program interface. Thus, we can easily obtain values of distance and transit time between nodes in various places in the world. Moreover, we apply the distribution of a population to a gravity model and we compute the effective transition probability for this queueing network. If the arrangement of the nodes and number of bikes at each node is known, we can precisely design the system. We illustrate our system using convenience stores as nodes and optimize the node configuration. As a result, we can optimize simultaneously the number of nodes, node places, and number of bikes for each node, and we can construct a base for a rental cycle business to use our system.

  16. Upper Bound for Queue length in Regulated Burst Service Scheduling

    Directory of Open Access Journals (Sweden)

    Mahmood Daneshvar Farzanegan

    2016-01-01

    Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.

  17. Queueing-Based Synchronization and Entrainment for Synthetic Gene Oscillators

    Science.gov (United States)

    Mather, William; Butzin, Nicholas; Hochendoner, Philip; Ogle, Curtis

    Synthetic gene oscillators have been a major focus of synthetic biology research since the beginning of the field 15 years ago. They have proven to be useful both for biotechnological applications as well as a testing ground to significantly develop our understanding of the design principles behind synthetic and native gene oscillators. In particular, the principles governing synchronization and entrainment of biological oscillators have been explored using a synthetic biology approach. Our work combines experimental and theoretical approaches to specifically investigate how a bottleneck for protein degradation, which is present in most if not all existing synthetic oscillators, can be leveraged to robustly synchronize and entrain biological oscillators. We use both the terminology and mathematical tools of queueing theory to intuitively explain the role of this bottleneck in both synchronization and entrainment, which extends prior work demonstrating the usefulness of queueing theory in synthetic and native gene circuits. We conclude with an investigation of how synchronization and entrainment may be sensitive to the presence of multiple proteolytic pathways in a cell that couple weakly through crosstalk. This work was supported by NSF Grant #1330180.

  18. Two parallel finite queues with simultaneous services and Markovian arrivals

    Directory of Open Access Journals (Sweden)

    S. R. Chakravarthy

    1997-01-01

    Full Text Available In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B has a message and buffer B(A is empty, then one message from A(B is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A and one from B, are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed.

  19. A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

    Directory of Open Access Journals (Sweden)

    Ekaterina Evdokimova

    2017-01-01

    Full Text Available This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i overloaded and (ii under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

  20. Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

    Directory of Open Access Journals (Sweden)

    Ku-Hwan Kim

    2016-01-01

    Full Text Available Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal point of performance between queue length and drop rate is limited. In this paper, we study the problem of managing a long queue of industrial router at substation under heterogeneous smart grid networks. Specifically, we propose an enqueue-dequeue dropping cascade control using a two-loop design method to control both window size and queue length. Moreover, our proposal can be easily implemented into router firmware with provided discrete expressions. Finally, our simulation results are presented to validate the possible benefits that can be gained from cascade control and compare the existing queue management methods as well.

  1. Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal

    Directory of Open Access Journals (Sweden)

    Yang Woo Shin

    1999-01-01

    Full Text Available We consider a single server Markovian queue with two types of customers; positive and negative, where positive customers arrive in batches and arrivals of negative customers remove positive customers in batches. Only positive customers form a queue and negative customers just reduce the system congestion by removing positive ones upon their arrivals. We derive the LSTs of sojourn time distributions for a single server Markovian queue with positive customers and negative customers by using the first passage time arguments for Markov chains.

  2. Application of queueing models to multiprogrammed computer systems operating in a time-critical environment

    Science.gov (United States)

    Eckhardt, D. E., Jr.

    1979-01-01

    A model of a central processor (CPU) which services background applications in the presence of time critical activity is presented. The CPU is viewed as an M/M/1 queueing system subject to periodic interrupts by deterministic, time critical process. The Laplace transform of the distribution of service times for the background applications is developed. The use of state of the art queueing models for studying the background processing capability of time critical computer systems is discussed and the results of a model validation study which support this application of queueing models are presented.

  3. Strategies for a centralized single product multiclass M/G/1 make-to-stock queue

    OpenAIRE

    Abouee-Mehrizi, Hossein; Balcıoğlu, Ahmet Barış; Balcioglu, Ahmet Baris; Baron, Opher

    2012-01-01

    Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practic...

  4. Efficient priority queueing routing strategy on networks of mobile agents

    Science.gov (United States)

    Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

    2018-03-01

    As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

  5. Film traffic queueing model for the DUMC radiology department

    International Nuclear Information System (INIS)

    Humphrey, L.M.; Ravin, C.E.

    1988-01-01

    This paper discusses the radiology department traffic model for Duke University Medical Center (DUMC) which simulates the flow of film through the department, and then incorporates the effect of introducing a PACS-type system into present operations. Each Radiology Section is considered separately for queuing of two types of film: old film (from previous exams) and new film (from the present exam). The amount of film in each queue at any time is controlled by controlling hours of operation, service times, delay, and arrival rates. The model also takes into account the use of film in each major radiology area. This gives some idea of the load on a device in that area as well as the amount of storage needed to adequately handle its daily load is local storage at the display device is desired

  6. Ultrasound waiting lists: rational queue or extended capacity?

    Science.gov (United States)

    Brasted, Christopher

    2008-06-01

    The features and issues regarding clinical waiting lists in general and general ultrasound waiting lists in particular are reviewed, and operational aspects of providing a general ultrasound service are also discussed. A case study is presented describing a service improvement intervention in a UK NHS hospital's ultrasound department, from which arises requirements for a predictive planning model for an ultrasound waiting list. In the course of this, it becomes apparent that a booking system is a more appropriate way of describing the waiting list than a conventional queue. Distinctive features are identified from the literature and the case study as the basis for a predictive model, and a discrete event simulation model is presented which incorporates the distinctive features.

  7. Analysis of a multi-server queueing model of ABR

    Directory of Open Access Journals (Sweden)

    R. Núñez-Queija

    1998-01-01

    Full Text Available In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR traffic in Asynchronous Transfer Mode (ATM networks. We consider a multi-channel service station with two types of customers, denoted by high priority and low priority customers. In principle, high priority customers have preemptive priority over low priority customers, except on a fixed number of channels that are reserved for low priority traffic. The arrivals occur according to two independent Poisson processes, and service times are assumed to be exponentially distributed. Each high priority customer requires a single server, whereas low priority customers are served in processor sharing fashion. We derive the joint distribution of the numbers of customers (of both types in the system in steady state. Numerical results illustrate the effect of high priority traffic on the service performance of low priority traffic.

  8. On applications of excess level processes to (N,D-policy bulk queueing systems

    Directory of Open Access Journals (Sweden)

    Jewgeni H. Dshalalow

    1996-01-01

    Full Text Available The paper deals with queueing systems in which N- and D-policies are combined into one. This means that an idle or vacationing server will resume his service if the queueing or workload process crosses some specified fixed level N or D, respectively. For the proposed (N,D-policy we study the queueing processes in models with and without server vacations, with compound Poisson input, and with generally distributed service and vacation periods. The analysis of the models is essentially based on fluctuation techniques for two-dimensional marked counting processes newly developed by the author. The results enable us to arrive at stationary distributions for the embedded and continuous time parameter queueing processes in closed analytic forms, enhancing the well-known Kendall formulas and their modifications.

  9. Asymptotic inference for waiting times and patiences in queues with abandonment

    DEFF Research Database (Denmark)

    Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

    Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about the waiting time and patience distribution in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

  10. Asymptotic inference for waiting times and patiences in queues with abandonment

    DEFF Research Database (Denmark)

    Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

    2009-01-01

    Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about waiting time and patience distributions in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

  11. Fast distributed strategic learning for global optima in queueing access games

    KAUST Repository

    Tembine, Hamidou

    2014-01-01

    In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic

  12. Technical report on prototype intelligent network flow optimization (INFLO) dynamic speed harmonization and queue warning.

    Science.gov (United States)

    2015-06-01

    This Technical Report on Prototype Intelligent Network Flow Optimization (INFLO) Dynamic Speed Harmonization and : Queue Warning is the final report for the project. It describes the prototyping, acceptance testing and small-scale : demonstration of ...

  13. Mean time for the development of large workloads and large queue lengths in the GI/G/1 queue

    Directory of Open Access Journals (Sweden)

    Charles Knessl

    1996-01-01

    Full Text Available We consider the GI/G/1 queue described by either the workload U(t (unfinished work or the number of customers N(t in the system. We compute the mean time until U(t reaches excess of the level K, and also the mean time until N(t reaches N0. For the M/G/1 and GI/M/1 models, we obtain exact contour integral representations for these mean first passage times. We then compute the mean times asymptotically, as K and N0→∞, by evaluating these contour integrals. For the general GI/G/1 model, we obtain asymptotic results by a singular perturbation analysis of the appropriate backward Kolmogorov equation(s. Numerical comparisons show that the asymptotic formulas are very accurate even for moderate values of K and N0.

  14. Fluid queues driven by a birth and death process with alternating flow rates

    OpenAIRE

    P. R. Parthasarathy; K. V. Vijayashree; R. B. Lenin

    2004-01-01

    Fluid queue driven by a birth and death process (BDP) with only one negative effective input rate has been considered in the literature. As an alternative, here we consider a fluid queue in which the input is characterized by a BDP with alternating positive and negative flow rates on a finite state space. Also, the BDP has two alternating arrival rates and two alternating service rates. Explicit expression for the distribution function of the buffer occupancy is obtained. The case where the s...

  15. Performance Analysis and Optimal Allocation of Layered Defense M/M/N Queueing Systems

    Directory of Open Access Journals (Sweden)

    Longyue Li

    2016-01-01

    Full Text Available One important mission of strategic defense is to develop an integrated layered Ballistic Missile Defense System (BMDS. Motivated by the queueing theory, we presented a work for the representation, modeling, performance simulation, and channels optimal allocation of the layered BMDS M/M/N queueing systems. Firstly, in order to simulate the process of defense and to study the Defense Effectiveness (DE, we modeled and simulated the M/M/N queueing system of layered BMDS. Specifically, we proposed the M/M/N/N and M/M/N/C queueing model for short defense depth and long defense depth, respectively; single target channel and multiple target channels were distinguished in each model. Secondly, we considered the problem of assigning limited target channels to incoming targets, we illustrated how to allocate channels for achieving the best DE, and we also proposed a novel and robust search algorithm for obtaining the minimum channel requirements across a set of neighborhoods. Simultaneously, we presented examples of optimal allocation problems under different constraints. Thirdly, several simulation examples verified the effectiveness of the proposed queueing models. This work may help to understand the rules of queueing process and to provide optimal configuration suggestions for defense decision-making.

  16. A novel fair active queue management algorithm based on traffic delay jitter

    Science.gov (United States)

    Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

    2009-11-01

    In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

  17. Optimal Control for Bufferbloat Queue Management Using Indirect Method with Parametric Optimization

    Directory of Open Access Journals (Sweden)

    Amr Radwan

    2016-01-01

    Full Text Available Because memory buffers become larger and cheaper, they have been put into network devices to reduce the number of loss packets and improve network performance. However, the consequences of large buffers are long queues at network bottlenecks and throughput saturation, which has been recently noticed in research community as bufferbloat phenomenon. To address such issues, in this article, we design a forward-backward optimal control queue algorithm based on an indirect approach with parametric optimization. The cost function which we want to minimize represents a trade-off between queue length and packet loss rate performance. Through the integration of an indirect approach with parametric optimization, our proposal has advantages of scalability and accuracy compared to direct approaches, while still maintaining good throughput and shorter queue length than several existing queue management algorithms. All numerical analysis, simulation in ns-2, and experiment results are provided to solidify the efficiency of our proposal. In detailed comparisons to other conventional algorithms, the proposed procedure can run much faster than direct collocation methods while maintaining a desired short queue (≈40 packets in simulation and 80 (ms in experiment test.

  18. On the Discrete-Time GeoX/G/1 Queues under N-Policy with Single and Multiple Vacations

    Directory of Open Access Journals (Sweden)

    Sung J. Kim

    2013-01-01

    Full Text Available We consider the discrete-time GeoX/G/1 queue under N-policy with single and multiple vacations. In this queueing system, the server takes multiple vacations and a single vacation whenever the system becomes empty and begins to serve customers only if the queue length is at least a predetermined threshold value N. Using the well-known property of stochastic decomposition, we derive the stationary queue-length distributions for both vacation models in a simple and unified manner. In addition, we derive their busy as well as idle-period distributions. Some classical vacation models are considered as special cases.

  19. A bulk queueing system under N-policy with bilevel service delay discipline and start-up time

    Directory of Open Access Journals (Sweden)

    David C. R. Muh

    1993-01-01

    Full Text Available The author studies the queueing process in a single-server, bulk arrival and batch service queueing system with a compound Poisson input, bilevel service delay discipline, start-up time, and a fixed accumulation level with control operating policy. It is assumed that when the queue length falls below a predefined level r(≥1, the system, with server capacity R, immediately stops service until the queue length reaches or exceeds the second predefined accumulation level N(≥r. Two cases, with N≤R and N≥R, are studied.

  20. Queueing in a spent fuel transportation system - preliminary analysis of implications for system design

    International Nuclear Information System (INIS)

    Cashwell, J.W.; Wood, T.W.

    1985-01-01

    Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input rates and cask fleet size and characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish shadow prices for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies

  1. The Effectiveness Analysis of Waiting Processes in the Different Branches of a Bank by Queue Model

    Directory of Open Access Journals (Sweden)

    Abdullah ÖZÇİL

    2015-06-01

    Full Text Available Despite the appreciable increase in the number of bank branches every year, nowadays queues for services don’t decrease and even become parts of our daily lives. By minimizing waiting processes the least, increasing customer satisfaction should be one of branch managers’ main goals. A quick and also customer oriented service with high quality is the most important factor for customer loyalty. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in six different branches of two banks operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by six branches of two banks called as A1, A2, A3, B1, B2 and B3. At the end of study it is presented to the company some advices that can bring benefits to the staff and customers. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in three different branches of a bank operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by three branches of the bank called A1, A2 and A3. At last it is presented to the company some advices that can bring more benefits to the staff and clients.

  2. Queueing in a spent fuel transportation system: a preliminary analysis of implications for system design

    International Nuclear Information System (INIS)

    Cashwell, J.W.; Wood, T.W.

    1985-03-01

    Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (Either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input and cask fleet size characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish ''shadow prices'' for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies. 5 refs., 5 figs., 2 tabs

  3. Folding Proteins at 500 ns/hour with Work Queue.

    Science.gov (United States)

    Abdul-Wahid, Badi'; Yu, Li; Rajan, Dinesh; Feng, Haoyun; Darve, Eric; Thain, Douglas; Izaguirre, Jesús A

    2012-10-01

    Molecular modeling is a field that traditionally has large computational costs. Until recently, most simulation techniques relied on long trajectories, which inherently have poor scalability. A new class of methods is proposed that requires only a large number of short calculations, and for which minimal communication between computer nodes is required. We considered one of the more accurate variants called Accelerated Weighted Ensemble Dynamics (AWE) and for which distributed computing can be made efficient. We implemented AWE using the Work Queue framework for task management and applied it to an all atom protein model (Fip35 WW domain). We can run with excellent scalability by simultaneously utilizing heterogeneous resources from multiple computing platforms such as clouds (Amazon EC2, Microsoft Azure), dedicated clusters, grids, on multiple architectures (CPU/GPU, 32/64bit), and in a dynamic environment in which processes are regularly added or removed from the pool. This has allowed us to achieve an aggregate sampling rate of over 500 ns/hour. As a comparison, a single process typically achieves 0.1 ns/hour.

  4. The congestion control algorithm based on queue management of each node in mobile ad hoc networks

    Science.gov (United States)

    Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

    2016-12-01

    This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

  5. Transient probabilities for queues with applications to hospital waiting list management.

    Science.gov (United States)

    Joy, Mark; Jones, Simon

    2005-08-01

    In this paper we study queuing systems within the NHS. Recently imposed government performance targets lead NHS executives to investigate and instigate alternative management strategies, thereby imposing structural changes on the queues. Under such circumstances, it is most unlikely that such systems are in equilibrium. It is crucial, in our opinion, to recognise this state of affairs in order to make a balanced assessment of the role of queue management in the modern NHS. From a mathematical perspective it should be emphasised that measures of the state of a queue based upon the assumption of statistical equilibrium (a pervasive methodology in the study of queues) are simply wrong in the above scenario. To base strategic decisions around such ideas is therefore highly questionable and it is one of the purposes of this paper to offer alternatives: we present some (recent) research whose results generate performance measures and measures of risk, for example, of waiting-times growing unacceptably large; we emphasise that these results concern the transient behaviour of the queueing model-there is no asssumption of statistical equilibrium. We also demonstrate that our results are computationally tractable.

  6. A robust and high-performance queue management controller for large round trip time networks

    Science.gov (United States)

    Khoshnevisan, Ladan; Salmasi, Farzad R.

    2016-05-01

    Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

  7. Priority Queues with Fractional Service for Tiered Delay QoS

    Directory of Open Access Journals (Sweden)

    Gary Chang

    2015-12-01

    Full Text Available Packet scheduling is key to quality of service (QoS capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.

  8. BioQueue: a novel pipeline framework to accelerate bioinformatics analysis.

    Science.gov (United States)

    Yao, Li; Wang, Heming; Song, Yuanyuan; Sui, Guangchao

    2017-10-15

    With the rapid development of Next-Generation Sequencing, a large amount of data is now available for bioinformatics research. Meanwhile, the presence of many pipeline frameworks makes it possible to analyse these data. However, these tools concentrate mainly on their syntax and design paradigms, and dispatch jobs based on users' experience about the resources needed by the execution of a certain step in a protocol. As a result, it is difficult for these tools to maximize the potential of computing resources, and avoid errors caused by overload, such as memory overflow. Here, we have developed BioQueue, a web-based framework that contains a checkpoint before each step to automatically estimate the system resources (CPU, memory and disk) needed by the step and then dispatch jobs accordingly. BioQueue possesses a shell command-like syntax instead of implementing a new script language, which means most biologists without computer programming background can access the efficient queue system with ease. BioQueue is freely available at https://github.com/liyao001/BioQueue. The extensive documentation can be found at http://bioqueue.readthedocs.io. li_yao@outlook.com or gcsui@nefu.edu.cn. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

  9. Queue Management Practices of Quick ServiceRestaurants (QSR in Lipa City, Philippines

    Directory of Open Access Journals (Sweden)

    Leoven A. Austria

    2015-12-01

    Full Text Available –Problems regarding waiting line in quick service restaurants (QSR has been one of the main concerns of industries and scholars nowadays. It is because people today demand not only for qualityfood but also for speed. Quick service restaurant players explore on the approaches to optimize the efficiency of restaurant management. One important area that defines how well and efficient a fast food restaurant delivers its product and services to customers is its waiting line (queue management practices. The study was conducted at Lipa City, involving five popular quick service restaurants named by the researcher as QSR A, B, C, D, and E. It made used of 363customer respondents proportionally obtained from five restaurants.It intended to assess the extent of implementation of the queue management practices of the restaurants and the level of satisfaction of the customers in such practices in terms of customer arrival, waiting line and service facility. The findings revealed the queuing system used and the waiting line structured utilized by the restaurants. The extent of implementation of the queue management practices in the three areas mentioned of the five QSR’s was presented comparatively. Likewise, the level of customer’s satisfaction on the queue management practices was also determined. Significant difference in the extent of implementation and in the level of customer satisfaction were determined if the respondents were grouped according to restaurant’s profile. Recommendations in the improvement of queue were given based on the findings.

  10. NPS and the methadone queue: Spillages of space and time.

    Science.gov (United States)

    Alexandrescu, Liviu

    2017-02-01

    Between 2008 and 2013, powder-stimulants sold by 'head shops' as novel psychoactive substances (NPS) or 'legal highs' have displaced heroin among groups of injecting substance users in Bucharest, Romania. Rising HIV-infection rates and other medical or social harms have been reported to follow this trend. The study builds on two sets of original (N=30) and existing (N=20) interview data and on observations collected mainly at the site of a methadone substitution treatment facility. By disentangling the space-time continuum of the methadone queue, this paper argues that injecting drug users' (IDUs) passage from opiates to amphetamine-type stimulants (ATS) can be understood as 'spillages' of space and time. IDUs thus 'spill' out of the disciplinary flows of methadone treatment in two ways. The first is that of space and materiality. Drawing on actor-network theory (ANT), ATS/NPS appear embedded in reconfigured practices and rituals of injecting use. Such spillages see the pleasure-seeking self being fluidised in forming connections with, or spilling into, nonhuman actants such as substances, settings or objects. The second dimension of spilling is that of time. In this sense, heroin use is a 'cryogenic strategy' of inhabiting history and facing the transition to the market society that Romanian opiate injectors spill out of, not able to appropriate choice and legitimate consumption. The phenomenological qualities of stimulants that seem to accelerate lived time and generalise desire thus present them with an opportunity to alleviate a form of what a post-communist moral imaginary of transition frames as debilitating nostalgia. ATS/NPS are revealed as fluid entities that do not only shape risk conditions but also alter shared meanings and contextual configurations of bodies, substances and disciplinary regimes in unpredictable ways. Copyright © 2016 Elsevier B.V. All rights reserved.

  11. Approximations for the waiting-time distribution in an M/P H/c priority queue

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

    2015-01-01

    We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/PH/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate

  12. Terminal Appointment System Design by Non-stationary M(t)/Ek/c(t) Queueing Model and Genetic Algorithm

    DEFF Research Database (Denmark)

    Chen, Gang; Govindan, Kannan; Yang, Zhong-Zhen

    2013-01-01

    Long truck queue is a common problem at big marine container terminals, where the resources and equipment are usually scheduled to serve ships prior to trucks. To reduce truck queues, some container terminals adopt terminal appointment system (TAS) to manage truck arrivals. This paper addresses two...

  13. Scaling and comparison of fluid limits of queues applied to call centers with time-varying parameters

    NARCIS (Netherlands)

    Jiménez, T.; Koole, G.M.

    2004-01-01

    Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier results on the comparison of multi-server tandem systems with their fluid limits. At the same time we give conditions under which economies of scale hold. We apply the results to call centers. ©

  14. On a first passage problem in general queueing systems with multiple vacations

    Directory of Open Access Journals (Sweden)

    Jewgeni H. Dshalalow

    1992-01-01

    Full Text Available The author studies a generalized single-server queueing system with bulk arrivals and batch service, where the server takes vacations each time the queue level falls below r(≥1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process modulated by the system and the service is assumed to be state dependent. One of the essential part in the analysis of the system is the employment of new techniques related to the first excess level processes. A preliminary analysis of such processes and recent results of the author on modulated processes enabled the author to obtain all major characteristics for the queueing process explicitly. Various examples and applications are discussed.

  15. On the optimal use of a slow server in two-stage queueing systems

    Science.gov (United States)

    Papachristos, Ioannis; Pandelis, Dimitrios G.

    2017-07-01

    We consider two-stage tandem queueing systems with a dedicated server in each queue and a slower flexible server that can attend both queues. We assume Poisson arrivals and exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming that two servers cannot collaborate to work on the same job and preemptions are not allowed. We formulate the problem as a Markov decision process and derive properties of the optimal allocation for the dedicated (fast) servers. Specifically, we show that the one downstream should not idle, and the same is true for the one upstream when holding costs are larger there. The optimal allocation of the slow server is investigated through extensive numerical experiments that lead to conjectures on the structure of the optimal policy.

  16. A GA-based PID active queue management control design for TCP/IP networks

    Energy Technology Data Exchange (ETDEWEB)

    Kuo, H-H; Chen, C-K; Liao, T-L [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China); Yan, J-J [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)], E-mail: tlliao@mail.ncku.edu.tw

    2008-02-15

    In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes.

  17. Active Queue Management in TCP Networks Based on Fuzzy-Pid Controller

    Directory of Open Access Journals (Sweden)

    Hossein ASHTIANI

    2012-01-01

    Full Text Available We introduce a novel and robust active queue management (AQM scheme based on a fuzzy controller, called hybrid fuzzy-PID controller. In the TCP network, AQM is important to regulate the queue length by passing or dropping the packets at the intermediate routers. RED, PI, and PID algorithms have been used for AQM. But these algorithms show weaknesses in the detection and control of congestion under dynamically changing network situations. In this paper a novel Fuzzy-based proportional-integral derivative (PID controller, which acts as an active queue manager (AQM for Internet routers, is proposed. These controllers are used to reduce packet loss and improve network utilization in TCP/IP networks. A new hybrid controller is proposed and compared with traditional RED based controller. Simulations are carried out to demonstrate the effectiveness of the proposed method and show that, the new hybrid fuzzy PID controller provides better performance than random early detection (RED and PID controllers

  18. A GA-based PID active queue management control design for TCP/IP networks

    International Nuclear Information System (INIS)

    Kuo, H-H; Chen, C-K; Liao, T-L; Yan, J-J

    2008-01-01

    In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes

  19. Design and analysis of a model predictive controller for active queue management.

    Science.gov (United States)

    Wang, Ping; Chen, Hong; Yang, Xiaoping; Ma, Yan

    2012-01-01

    Model predictive (MP) control as a novel active queue management (AQM) algorithm in dynamic computer networks is proposed. According to the predicted future queue length in the data buffer, early packets at the router are dropped reasonably by the MPAQM controller so that the queue length reaches the desired value with minimal tracking error. The drop probability is obtained by optimizing the network performance. Further, randomized algorithms are applied to analyze the robustness of MPAQM successfully, and also to provide the stability domain of systems with uncertain network parameters. The performances of MPAQM are evaluated through a series of simulations in NS2. The simulation results show that the MPAQM algorithm outperforms RED, PI, and REM algorithms in terms of stability, disturbance rejection, and robustness. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

  20. Model Integrating Fuzzy Argument with Neural Network Enhancing the Performance of Active Queue Management

    Directory of Open Access Journals (Sweden)

    Nguyen Kim Quoc

    2015-08-01

    Full Text Available The bottleneck control by active queue management mechanisms at network nodes is essential. In recent years, some researchers have used fuzzy argument to improve the active queue management mechanisms to enhance the network performance. However, the projects using the fuzzy controller depend heavily on professionals and their parameters cannot be updated according to changes in the network, so the effectiveness of this mechanism is not high. Therefore, we propose a model combining the fuzzy controller with neural network (FNN to overcome the limitations above. Results of the training of the neural networks will find the optimal parameters for the adaptive fuzzy controller well to changes of the network. This improves the operational efficiency of the active queue management mechanisms at network nodes.

  1. MX/G/1 unreliable retrial queue with option of additional service and Bernoulli vacation

    Directory of Open Access Journals (Sweden)

    Charan Jeet Singh

    2016-03-01

    Full Text Available In this paper, retrial queue with unreliable server and bulk arrivals is investigated. The server is capable of providing m-optional services and any one of these available services, may be rendered to the customer after the first essential service if the customer opts for the same. It is assumed that the server may fail while rendering any phase of service and undergoes for the immediate repair. After the completion of the service of a customer, the server may either take a vacation for a random period or may continue to provide the service to the other customers waiting in the queue. The supplementary variables corresponding to service time, repair time and retrial time are incorporated to determine the queue size distribution. To examine the effect of different parameters on the performance measures of the system, the numerical illustration is given which is supported by numerical simulation and sensitivity analysis.

  2. Some reflections on the Renewal-theory paradox in queueing theory

    Directory of Open Access Journals (Sweden)

    Robert B. Cooper

    1998-01-01

    Full Text Available The classical renewal-theory (waiting time, or inspection paradox states that the length of the renewal interval that covers a randomly-selected time epoch tends to be longer than an ordinary renewal interval. This paradox manifests itself in numerous interesting ways in queueing theory, a prime example being the celebrated Pollaczek-Khintchine formula for the mean waiting time in the M/G/1 queue. In this expository paper, we give intuitive arguments that “explain” why the renewal-theory paradox is ubiquitous in queueing theory, and why it sometimes produces anomalous results. In particular, we use these intuitive arguments to explain decomposition in vacation models, and to derive formulas that describe some recently-discovered counterintuitive results for polling models, such as the reduction of waiting times as a consequence of forcing the server to set up even when no work is waiting.

  3. Maintenance in Single-Server Queues: A Game-Theoretic Approach

    Directory of Open Access Journals (Sweden)

    Najeeb Al-Matar

    2009-01-01

    examine a single-server queue with bulk input and secondary work during server's multiple vacations. When the buffer contents become exhausted the server leaves the system to perform some diagnostic service of a minimum of L jobs clustered in packets of random sizes (event A. The server is not supposed to stay longer than T units of time (event B. The server returns to the system when A or B occurs, whichever comes first. On the other hand, he may not break service of a packet in a middle even if A or B occurs. Furthermore, the server waits for batches of customers to arrive if upon his return the queue is still empty. We obtain a compact and explicit form functional for the queueing process in equilibrium.

  4. A discrete single server queue with Markovian arrivals and phase type group services

    Directory of Open Access Journals (Sweden)

    Attahiru Sule Alfa

    1995-01-01

    Full Text Available We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.

  5. ANALYSIS OF FUZZY QUEUES: PARAMETRIC PROGRAMMING APPROACH BASED ON RANDOMNESS - FUZZINESS CONSISTENCY PRINCIPLE

    Directory of Open Access Journals (Sweden)

    Dhruba Das

    2015-04-01

    Full Text Available In this article, based on Zadeh’s extension principle we have apply the parametric programming approach to construct the membership functions of the performance measures when the interarrival time and the service time are fuzzy numbers based on the Baruah’s Randomness- Fuzziness Consistency Principle. The Randomness-Fuzziness Consistency Principle leads to defining a normal law of fuzziness using two different laws of randomness. In this article, two fuzzy queues FM/M/1 and M/FM/1 has been studied and constructed their membership functions of the system characteristics based on the aforesaid principle. The former represents a queue with fuzzy exponential arrivals and exponential service rate while the latter represents a queue with exponential arrival rate and fuzzy exponential service rate.

  6. Optimal Service Capacities in a Competitive Multiple-Server Queueing Environment

    Science.gov (United States)

    Ching, Wai-Ki; Choi, Sin-Man; Huang, Min

    The study of economic behavior of service providers in a competition environment is an important and interesting research issue. A two-server queueing model has been proposed in Kalai et al. [11] for this purpose. Their model aims at studying the role and impact of service capacity in capturing larger market share so as to maximize the long-run expected profit. They formulate the problem as a two-person strategic game and analyze the equilibrium solutions. The main aim of this paper is to extend the results of the two-server queueing model in [11] to the case of multiple servers. We will only focus on the case when the queueing system is stable.

  7. General bulk service queueing system with N-policy, multiplevacations, setup time and server breakdown without interruption

    Science.gov (United States)

    Sasikala, S.; Indhira, K.; Chandrasekaran, V. M.

    2017-11-01

    In this paper, we have considered an MX / (a,b) / 1 queueing system with server breakdown without interruption, multiple vacations, setup times and N-policy. After a batch of service, if the size of the queue is ξ (customers in the queue. After a vacation, if the server finds at least N customers waiting for service, then the server needs a setup time to start the service. After a batch of service, if the amount of waiting customers in the queue is ξ (≥ a) then the server serves a batch of min(ξ,b) customers, where b ≥ a. We derived the probability generating function of queue length at arbitrary time epoch. Further, we obtained some important performance measures.

  8. A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

    Directory of Open Access Journals (Sweden)

    Woźniak Marcin

    2014-12-01

    Full Text Available In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

  9. An M/M/2 Queueing System with Heterogeneous Servers Including One with Working Vacation

    Directory of Open Access Journals (Sweden)

    A. Krishnamoorthy

    2012-01-01

    Full Text Available This paper analyzes an M/M/2 queueing system with two heterogeneous servers, one of which is always available but the other goes on vacation in the absence of customers waiting for service. The vacationing server, however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady state using matrix geometric method. Busy period of the system is analyzed and mean waiting time in the stationary regime computed. Conditional stochastic decomposition of stationary queue length is obtained. An illustrative example is also provided.

  10. An MX/GI/1/N queue with close-down and vacation times

    Directory of Open Access Journals (Sweden)

    Andreas Frey

    1999-01-01

    Full Text Available An MX/GI/1/N finite capacity queue with close-down time, vacation time and exhaustive service discipline is considered under the partial batch acceptance strategy as well as under the whole batch acceptance strategy. Applying the supplementary variable technique the queue length distribution at an arbitrary instant and at a departure epoch is obtained under both strategies, where no assumption on the batch size distribution is made. The loss probabilities and the Laplace-Stieltjes transforms of the waiting time distribution of the first customer and of an arbitrary customer of a batch are also given. Numerical examples give some insight into the behavior of the system.

  11. A Novel Analytic Technique for the Service Station Reliability in a Discrete-Time Repairable Queue

    Directory of Open Access Journals (Sweden)

    Renbin Liu

    2013-01-01

    Full Text Available This paper presents a decomposition technique for the service station reliability in a discrete-time repairable GeomX/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the structures of the service station indices are also found. Finally, special cases and numerical examples validate the derived results and show that our analytic technique is applicable to reliability analysis of some complex discrete-time repairable bulk arrival queueing systems.

  12. Comparison of TEAR and TFRC throughput for Drop tail and RED Queue Management Techniques

    Directory of Open Access Journals (Sweden)

    Parminderjeet Singh

    2014-12-01

    Full Text Available The comparison of throughput for TEAR (TCP emulation at receivers and TFRC TCP friendly rate control in MANETs is done with varying Active queue Management Techniques. The analysis reveals that for bandwidth constraint links, TEAR and TFRC perform far better than normal traffic propagation through TCP. In case of TEAR, the processing and route congestion algorithm load is shared by the receiver resulting in lesser load at the transmitters. In TFRC the TCP traffic is propagated via an algorithm to curb acknowledgement congestions. The effect of these two techniques is monitored on Droptail and RED, two of the most common Active Queue Management Techniques.

  13. The Geo/Geo/1+1 Queueing System with Negative Customers

    OpenAIRE

    Ma, Zhanyou; Guo, Yalin; Wang, Pengcheng; Hou, Yumei

    2013-01-01

    We study a Geo/Geo/1+1 queueing system with geometrical arrivals of both positive and negative customers in which killing strategies considered are removal of customers at the head (RCH) and removal of customers at the end (RCE). Using quasi-birth-death (QBD) process and matrix-geometric solution method, we obtain the stationary distribution of the queue length, the average waiting time of a new arrival customer, and the probabilities of servers in busy or idle period, respectively. Finally, ...

  14. The Jackson Queueing Network Model Built Using Poisson Measures. Application To A Bank Model

    Directory of Open Access Journals (Sweden)

    Ciuiu Daniel

    2014-07-01

    Full Text Available In this paper we will build a bank model using Poisson measures and Jackson queueing networks. We take into account the relationship between the Poisson and the exponential distributions, and we consider for each credit/deposit type a node where shocks are modeled as the compound Poisson processes. The transmissions of the shocks are modeled as moving between nodes in Jackson queueing networks, the external shocks are modeled as external arrivals, and the absorption of shocks as departures from the network.

  15. Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

    Directory of Open Access Journals (Sweden)

    Florin-Catalin ENACHE

    2015-10-01

    Full Text Available The growing character of the cloud business has manifested exponentially in the last 5 years. The capacity managers need to concentrate on a practical way to simulate the random demands a cloud infrastructure could face, even if there are not too many mathematical tools to simulate such demands.This paper presents an introduction into the most important stochastic processes and queueing theory concepts used for modeling computer performance. Moreover, it shows the cases where such concepts are applicable and when not, using clear programming examples on how to simulate a queue, and how to use and validate a simulation, when there are no mathematical concepts to back it up.

  16. A queueing model for error control of partial buffer sharing in ATM

    Directory of Open Access Journals (Sweden)

    Ahn Boo Yong

    1999-01-01

    Full Text Available We model the error control of the partial buffer sharing of ATM by a queueing system M 1 , M 2 / G / 1 / K + 1 with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

  17. The Application of The Double Queue Asymmetric Gated Service Polling Control Theory in Intelligent Traffic System

    Directory of Open Access Journals (Sweden)

    Zhao Yi Fan

    2016-01-01

    Full Text Available paper presents a new use of double queues asymmetric gated service polling system in the intelligent traffic light control system.Usually there are more vehicles in main road than minor road,so there are more green light time be needed in the main road.From the computer simulation and theory analysis,we can find that the application of double queues asymmetric gated service polling theory in intelligent traffic system can balance intersections load and set suitable passing time for vehicles to assure the roads open.

  18. The M/M/1 queue with inventory, lost sale and general lead times

    DEFF Research Database (Denmark)

    Saffari, Mohammad; Asmussen, Søren; Haji, Rasoul

    We consider an M/M/1 queueing system with inventory under the (r,Q) policy and with lost sales, in which demands occur according to a Poisson process and service times are exponentially distributed. All arriving customers during stockout are lost. We derive the stationary distributions of the joint...... queue length (number of customers in the system) and on-hand inventory when lead times are random variables and can take various distributions. The derived stationary distributions are used to formulate long-run average performance measures and cost functions in some numerical examples....

  19. Chaotic queue-based genetic algorithm for design of a self-tuning fuzzy logic controller

    Science.gov (United States)

    Saini, Sanju; Saini, J. S.

    2012-11-01

    This paper employs a chaotic queue-based method using logistic equation in a non-canonical genetic algorithm for optimizing the performance of a self-tuning Fuzzy Logic Controller, used for controlling a nonlinear double-coupled system. A comparison has been made with a standard canonical genetic algorithm implemented on the same plant. It has been shown that chaotic queue-method brings an improvement in the performance of the FLC for wide range of set point changes by a more profound initial population spread in the search space.

  20. Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

    Science.gov (United States)

    Chen, Dong; Gara, Alana; Heidelberger, Philip; Kumar, Sameer; Ohmacht, Martin; Steinmacher-Burow, Burkhard; Wisniewski, Robert

    2014-09-16

    Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.

  1. On the Control of a Queueing System with Aging State Information

    NARCIS (Netherlands)

    M. Onderwater (Martijn); S. Bhulai (Sandjai); R.D. van der Mei (Rob)

    2015-01-01

    htmlabstractWe investigate control of a queueing system in which a component of the state space is subject to aging. The controller can choose to forward incoming queries to the system (where it needs time for processing), or respond with a previously generated response (incurring a penalty for not

  2. Queue-based modelling and detection of parameters involved in stroke outcome

    DEFF Research Database (Denmark)

    Vilic, Adnan; Petersen, John Asger; Wienecke, Troels

    2017-01-01

    We designed a queue-based model, and investigated which parameters are of importance when predicting stroke outcome. Medical record forms have been collected for 57 ischemic stroke patients, including medical history and vital sign measurement along with neurological scores for the first twenty...

  3. Sojourn times in the M/G/1 FB queue with light-tailed service times

    NARCIS (Netherlands)

    M.R.H. Mandjes (Michel); M. Nuyens

    2004-01-01

    textabstractThe asymptotic decay rate of the sojourn time of a customer in the stationary M/G/1 queue under the Foreground-Background (FB) service discipline is studied. The FB discipline gives service to those customers that have received the least service so far. We prove that for light-tailed

  4. The priority queue as an example of hardware/software codesign

    DEFF Research Database (Denmark)

    Høeg, Flemming; Mellergaard, Niels; Staunstrup, Jørgen

    1994-01-01

    The paper identifies a number of issues that are believed to be important for hardware/software codesign. The issues are illustrated by a small comprehensible example: a priority queue. Based on simulations of a real application, we suggest a combined hardware/software realization of the priority...

  5. Transient analysis of an M/M/1 queue with multiple vacations

    Directory of Open Access Journals (Sweden)

    Kaliappan Kalidass

    2014-05-01

    Full Text Available In this paper, we have obtained explicit expressions for the time dependent probabilities of the M/M/1  queue with server vacations under a multiple vacation scheme. The corresponding steady state probabilities have been obtained. We also obtain the time dependent performance measures of the systems

  6. On the correlation structure of a Lévy-driven queue

    NARCIS (Netherlands)

    A. Es-Saghouani; M.R.H. Mandjes (Michel)

    2007-01-01

    textabstractIn this paper we consider a single-server queue with Lévy input, and in particular its workload process (Q(t)), for t > 0, with a focus on the correlation structure. With the correlation function defined as r(t) := Cov(Q(0),Q(t))/Var Q(0) (assuming that the workload process is in

  7. The Remaining Service Time Upon Reaching a High Level in M/G/1 Queues

    NARCIS (Netherlands)

    de Boer, Pieter-Tjerk; Nicola, V.F.; van Ommeren, Jan C.W.

    The distribution of the remaining service time upon reaching some target level in an M/G/1 queue is of theoretical as well as practical interest. In general, this distribution depends on the initial level as well as on the target level, say, B. Two initial levels are of particular interest, namely,

  8. Response times in a two-node queueing network with feedback

    NARCIS (Netherlands)

    van der Mei, R.D.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, J.L.

    2002-01-01

    The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

  9. Response times in a two-node queueing network with feedback

    NARCIS (Netherlands)

    van der Mei, R.D.; Gijsen, B.M.M.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, Hans Leo

    The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

  10. A Busy period analysis of the level dependent PH/PH/1/K queue

    NARCIS (Netherlands)

    Al Hanbali, Ahmad

    2011-01-01

    In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number

  11. A Busy period analysis for the state dependent M/M/1/K queue

    NARCIS (Netherlands)

    Al Hanbali, Ahmad; Boxma, Onno

    2010-01-01

    In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two

  12. Sojourn time asymptotics in Processor Sharing queues with varying service rate

    NARCIS (Netherlands)

    Egorova, R.; Mandjes, M.R.H.; Zwart, B.

    2007-01-01

    Abstract This paper addresses the sojourn time asymptotics for a GI/GI/⋅ queue operating under the Processor Sharing (PS) discipline with stochastically varying service rate. Our focus is on the logarithmic estimates of the tail of sojourn-time distribution, under the assumption that the job-size

  13. DROP TAIL AND RED QUEUE MANAGEMENT WITH SMALL BUFFERS:STABILITY AND HOPF BIFURCATION

    Directory of Open Access Journals (Sweden)

    Ganesh Patil

    2011-06-01

    Full Text Available There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD TCP, in a small buffer regime, we argue that stability should also be a desirable feature for network performance. The queue management schemes we study are Drop Tail and Random Early Detection (RED. For Drop Tail, the analytical arguments are based on local stability and bifurcation theory. As the buffer size acts as a bifurcation parameter, variations in it can readily lead to the emergence of limit cycles. We then present NS2 simulations to study the effect of changing buffer size on queue dynamics, utilization, window size and packet loss for three different flow scenarios. The simulations corroborate the analysis which highlights that performance is coupled with the notion of stability. Our work suggests that, in a small buffer regime, a simple Drop Tail queue management serves to enhance stability and appears preferable to the much studied RED scheme.

  14. Proposition of delay model for signalized intersections with queueing theory analytical models usage

    Directory of Open Access Journals (Sweden)

    Grzegorz SIERPIŃSKI

    2007-01-01

    Full Text Available Time delay on intersections is a very important transport problem. Thearticle includes a proposition of time delay model. Variance of service times is considered by used average waiting time in queue for queuing system with compressed queuing processes usage as a part of proposed time delays model.

  15. A queueing model of pilot decision making in a multi-task flight management situation

    Science.gov (United States)

    Walden, R. S.; Rouse, W. B.

    1977-01-01

    Allocation of decision making responsibility between pilot and computer is considered and a flight management task, designed for the study of pilot-computer interaction, is discussed. A queueing theory model of pilot decision making in this multi-task, control and monitoring situation is presented. An experimental investigation of pilot decision making and the resulting model parameters are discussed.

  16. The M/G/1 queue with quasi-restricted accessibility

    NARCIS (Netherlands)

    Boxma, O.J.; Perry, D.; Stadje, W.; Zacks, S.

    2009-01-01

    We consider single-server queues of the M/G/1 kind with a special kind of partial customer rejection called quasi-restricted accessibility (QRA). Under QRA, the actual service time assigned to an arriving customer depends on his service requirement, say x, the current workload, say w, and a

  17. Simple product-form bounds for queueing networks with finite clusters

    NARCIS (Netherlands)

    van Dijk, N.M.; van der Sluis, E.

    2001-01-01

    Queueing networks are studied with finite capacity constraints for clusters of stations. First, by an instructive tandem cluster example it is shown how a product-form modification method for networks with finite stations can be extended to networks with finite clusters. Next, a general result is

  18. Simulation-based computation of the workload correlation function in a Lévy-driven queue

    NARCIS (Netherlands)

    Glynn, P.W.; Mandjes, M.

    2011-01-01

    In this paper we consider a single-server queue with Lévy input, and, in particular, its workload process (Qt)t≥0, focusing on its correlation structure. With the correlation function defined as r(t):= cov(Q0, Qt) / varQ0 (assuming that the workload process is in stationarity at time 0), we first

  19. Simulation-based computation of the workload correlation function in a Levy-driven queue

    NARCIS (Netherlands)

    P. Glynn; M.R.H. Mandjes (Michel)

    2009-01-01

    htmlabstractIn this paper we consider a single-server queue with Levy input, and in particular its workload process (Q_t), focusing on its correlation structure. With the correlation function defined as r(t) := Cov(Q_0, Q_t)/Var Q_0 (assuming the workload process is in stationarity at time 0), we

  20. Simulation-based computation of the workload correlation function in a Lévy-driven queue

    NARCIS (Netherlands)

    P. Glynn; M.R.H. Mandjes (Michel)

    2010-01-01

    htmlabstractIn this paper we consider a single-server queue with Levy input, and in particular its workload process (Q_t), focusing on its correlation structure. With the correlation function defined as r(t) := Cov(Q_0,Q_t)/Var(Q_0) (assuming the workload process is in stationarity at time 0), we

  1. Research on elastic resource management for multi-queue under cloud computing environment

    Science.gov (United States)

    CHENG, Zhenjing; LI, Haibo; HUANG, Qiulan; Cheng, Yaodong; CHEN, Gang

    2017-10-01

    As a new approach to manage computing resource, virtualization technology is more and more widely applied in the high-energy physics field. A virtual computing cluster based on Openstack was built at IHEP, using HTCondor as the job queue management system. In a traditional static cluster, a fixed number of virtual machines are pre-allocated to the job queue of different experiments. However this method cannot be well adapted to the volatility of computing resource requirements. To solve this problem, an elastic computing resource management system under cloud computing environment has been designed. This system performs unified management of virtual computing nodes on the basis of job queue in HTCondor based on dual resource thresholds as well as the quota service. A two-stage pool is designed to improve the efficiency of resource pool expansion. This paper will present several use cases of the elastic resource management system in IHEPCloud. The practical run shows virtual computing resource dynamically expanded or shrunk while computing requirements change. Additionally, the CPU utilization ratio of computing resource was significantly increased when compared with traditional resource management. The system also has good performance when there are multiple condor schedulers and multiple job queues.

  2. Waiting as Part of the Fun: Interactive Gaming in Theme Park Queues

    NARCIS (Netherlands)

    Heger, Chris; Offermans, S.A.M.; Frens, J.W.; Wouters, I.H.C.; Kimman, F.P.F.; Tieben, R.; Offermans, S.A.M.; Nagtzaam, H.A.H.

    2009-01-01

    People visiting theme parks intend to have a day of fun. Yet a larger part of the time is spent queuing for rides rather than in the actual rides, which does not contribute to the intended fun experience. Current efforts therefore either make the queue as bearable as possible or try to get rid of it

  3. A computational approach for fluid queues driven by truncated birth-death processes.

    NARCIS (Netherlands)

    Lenin, R.B.; Parthasarathy, P.R.

    2000-01-01

    In this paper, we analyze fluid queues driven by truncated birth-death processes with general birth and death rates. We compute the equilibrium distribution of the content of the fluid buffer by providing efficient numerical procedures to compute the eigenvalues and the eigenvectors of the

  4. Self-organization of critical behavior in controlled general queueing models

    International Nuclear Information System (INIS)

    Blanchard, Ph.; Hongler, M.-O.

    2004-01-01

    We consider general queueing models of the (G/G/1) type with service times controlled by the busy period. For feedback control mechanisms driving the system to very high traffic load, it is shown the busy period probability density exhibits a generic -((3)/(2)) power law which is a typical mean field behavior of SOC models

  5. A two-station queue with dependent preparation and service times

    NARCIS (Netherlands)

    Vlasiou, M.; Adan, I.J.B.F.; Boxma, O.J.

    2009-01-01

    We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the

  6. On first-come first-served versus random service discipline in multiclass closed queueing networks

    NARCIS (Netherlands)

    Buitenhek, R.; van Houtum, Geert-Jan; van Ommeren, Jan C.W.

    1997-01-01

    We consider multiclass closed queueing networks. For these networks, a lot of work has been devoted to characterizing and weakening the conditions under which a product-form solution is obtained for the steady-state distribution. From this work, it is known that, under certain conditions, all

  7. Fokker-Planck description for the queue dynamics of large tick stocks

    Science.gov (United States)

    Garèche, A.; Disdier, G.; Kockelkoren, J.; Bouchaud, J.-P.

    2013-09-01

    Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation. Our description explicitly includes state dependence, i.e., the fact that the drift and diffusion depend on the volume present on both sides of the spread. “Jump” events, corresponding to sudden changes of the best limit price, must also be included as birth-death terms in the Fokker-Planck equation. All quantities involved in the equation can be calibrated using high-frequency data on the best quotes. One of our central findings is that the dynamical process is approximately scale invariant, i.e., the only relevant variable is the ratio of the current volume in the queue to its average value. While the latter shows intraday seasonalities and strong variability across stocks and time periods, the dynamics of the rescaled volumes is universal. In terms of rescaled volumes, we found that the drift has a complex two-dimensional structure, which is a sum of a gradient contribution and a rotational contribution, both stable across stocks and time. This drift term is entirely responsible for the dynamical correlations between the ask queue and the bid queue.

  8. A numerical solution for the multi-server queue with hyper-exponential service times

    NARCIS (Netherlands)

    de Smit, J.H.A.

    1983-01-01

    In this paper we present a numerical method for the queue GI/H2/s, which is based on general results for GI/Hm/s. We give a complete description of the algorithm which yields exact results for the steady distributions of the actual waiting time, the virtual waiting time and the number of customers

  9. Sojourn times in the M/G/1 FB queue with light-tailed service times.

    NARCIS (Netherlands)

    Mandjes, M.R.H.; Nuijens, M.F.M.

    2005-01-01

    ABSTRACT The asymptotic decay rate of the sojourn time of a customer in the stationary M/G/1 queue under the Foreground-Background (FB) service discipline is studied. The FB discipline gives service to those customers that have received the least service so far. We prove that for lighttailed service

  10. Optimal hysteretic control for a BMAP/SM/1/N queue with two operation modes

    Directory of Open Access Journals (Sweden)

    Alexander N. Dudin

    2000-01-01

    Full Text Available We consider BMAP/SM/1 type queueing system with finite buffer of size N. The system has two operation modes, which are characterized by the matrix generating function of BMAP-input, the kernel of the semi-Markovian service process, and utilization cost. An algorithm for determining the optimal hysteresis strategy is presented.

  11. Simple approximations for the batch-arrival MX/G/1 queue

    NARCIS (Netherlands)

    van Ommeren, Jan C.W.

    1990-01-01

    In this paper we consider the MX/G/I queueing system with batch arrivals. We give simple approximations for the waiting-time probabilities of individual customers. These approximations are checked numerically and they are found to perform very well for a wide variety of batch-size and service-timed

  12. Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions

    NARCIS (Netherlands)

    O.J. Boxma (Onno); J.W. Cohen

    1997-01-01

    textabstractWe consider a $GI/G/1$ queue in which the service time distribution and/or the interarrival time distribution has a heavy tail, i.e., a tail behaviour like $t^{-nu$ with $1

  13. The M/G/1 queue with heavy-tailed service time distribution

    NARCIS (Netherlands)

    Boxma, O.J.; Cohen, J.W.

    1998-01-01

    In modern teletraffic applications of queueing theory, service time distributions B(t) with a heavy tail occur, i.e., 1-B(t)~Ct-v for t¿8 with v>1. For such service time distributions, not much explicit information is available concerning the tail probabilities of the corresponding waiting time

  14. Sojourn time asymptotics in the M/G/1 processor sharing queue

    NARCIS (Netherlands)

    A.P. Zwart (Bert); O.J. Boxma (Onno)

    1998-01-01

    textabstractWe show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index $-nu$, $nu$ non-integer, iff the sojourn time distribution is regularly varying of index $-nu $. This result is derived from a new expression for the Laplace-Stieltjes transform

  15. Positive Harris recurrence and diffusion scale analysis of a push pull queueing network

    NARCIS (Netherlands)

    Nazarathy, J.; Weiss, G.

    2010-01-01

    We consider a push pull queueing network with two servers and two types of job which are processed by the two servers in opposite order, with stochastic generally distributed processing times. This push pull network was introduced by Kopzon and Weiss, who assumed exponential processing times. It is

  16. Transient analysis of one-sided Lévy-driven queues

    NARCIS (Netherlands)

    Starreveld, N.J.; Bekker, R.; Mandjes, M.

    2016-01-01

    In this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally

  17. Transient analysis of one-sided Lévy-driven queues

    NARCIS (Netherlands)

    Starreveld, N.J.; R. Bekker (Rene); M.R.H. Mandjes (Michel)

    2016-01-01

    textabstractIn this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of

  18. Transient analysis of one-sided Lévy-driven queues

    NARCIS (Netherlands)

    Starreveld, N.; Bekker, R.; Mandjes, M.R.H.

    2015-01-01

    In this paper we analyze the transient behavior of the workload process in a Lévy input queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally one-sided

  19. A computational approach for a fluid queue driven by a truncated birth-death process

    NARCIS (Netherlands)

    Lenin, R.B.; Parthasarathy, P.R.

    1999-01-01

    In this paper, we consider a fluid queue driven by a truncated birth-death process with general birth and death rates. We find the equilibrium distribution of the content of the fluid buffer by computing the eigenvalues and eigenvectors of an associated real tridiagonal matrix. We provide efficient

  20. Equilibrium arrival times to queues with general service times and non-linear utility functions

    DEFF Research Database (Denmark)

    Breinbjerg, Jesper

    2017-01-01

    by a general utility function which is decreasing in the waiting time and service completion time of each customer. Applications of such queueing games range from people choosing when to arrive at a grand opening sale to travellers choosing when to line up at the gate when boarding an airplane. We develop...

  1. Self-organization of critical behavior in controlled general queueing models

    Science.gov (United States)

    Blanchard, Ph.; Hongler, M.-O.

    2004-03-01

    We consider general queueing models of the (G/G/1) type with service times controlled by the busy period. For feedback control mechanisms driving the system to very high traffic load, it is shown the busy period probability density exhibits a generic - {3}/{2} power law which is a typical mean field behavior of SOC models.

  2. Optimal control for an M^X/G/1/N+1 queue with two service modes

    NARCIS (Netherlands)

    Ridder, A.A.N.; Nobel, R.D.; Krishnan, G.S.S.; Anita, R.; Lakshmi, R.S.; Kumar, M.S.; Bonato, A.; Grana, M.

    2014-01-01

    A finite-buffer queueing model is considered with batch Poisson input and controllable service rate. A batch that upon arrival does not fit in the unoccupied places of the buffer is partially rejected. A decision to change the service mode can be made at service completion epochs only, and vacation

  3. Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

    Science.gov (United States)

    Li, Lian-Hui; Mo, Rong

    2015-01-01

    The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

  4. Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

    Directory of Open Access Journals (Sweden)

    Lian-Hui Li

    Full Text Available The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

  5. Networks of ·/G/∞ queues with shot-noise-driven arrival intensities

    NARCIS (Netherlands)

    Koops, D.T.; Boxma, O.J.; Mandjes, M.R.H.

    2017-01-01

    We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by a shot-noise process. A shot-noise rate emerges naturally in cases where the arrival rate tends to exhibit sudden increases (or shots) at random

  6. Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South AfricaExperiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

    Directory of Open Access Journals (Sweden)

    Dudu G. Sokhela

    2013-07-01

    Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans.Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service.Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed.Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

  7. A spectral approach to compute the mean performance measures of the queue with low-order BMAP input

    Directory of Open Access Journals (Sweden)

    Ho Woo Lee

    2003-01-01

    Full Text Available This paper targets engineers and practitioners who want a simple procedure to compute the mean performance measures of the Batch Markovian Arrival process (BMAP/G/1 queueing system when the parameter matrices order is very low. We develop a set of system equations and derive the vector generating function of the queue length. Starting from the generating function, we propose a spectral approach that can be understandable to those who have basic knowledge of M/G/1 queues and eigenvalue algebra.

  8. Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa.

    Science.gov (United States)

    Sokhela, Dudu G; Makhanya, Nonhlanhla J; Sibiya, Nokuthula M; Nokes, Kathleen M

    2013-07-05

    Comprehensive Primary Health Care (PHC), based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients' experiences led to satisfaction or dissatisfaction with the Fast Queue service. A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources. Effective health communication strategies contribute to positive

  9. Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

    Directory of Open Access Journals (Sweden)

    Dudu G. Sokhela

    2013-07-01

    Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service. Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

  10. The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

    Directory of Open Access Journals (Sweden)

    Shawky A.I.

    2008-01-01

    Full Text Available The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I units arrive according to a hyper-Poisson distribution with k independent branches, (II the queue discipline is FIFO; and (III the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

  11. Optimization of Signal Timing of Intersections by Internal Metering of Queue Time Ratio of Vehicles in Network Scale

    Directory of Open Access Journals (Sweden)

    Mina Ghanbarikarekani

    2016-06-01

    Full Text Available Optimization of signal timing in urban network is usually done by minimizing the delay times or queue lengths. Sincethe effect of each intersection on the whole network is not considered in the mentioned methods, traffic congestion may occur in network links. Therefore, this paper has aimed to provide a timing optimization algorithm for traffic signals using internal timing policy based on balancing queue time ratio of vehicles in network links. In the proposed algorithm, the difference between the real queue time ratio and the optimum one for each link of intersection was minimized. To evaluate the efficiency of the proposed algorithm on traffic performance, the proposed algorithm was applied in a hypothetical network. By comparing the simulating software outputs, before and after implementing the algorithm, it was concluded that the queue time ratio algorithm has improved the traffic parameters by increasing the flow as well as reducing the delay time and density of the network.

  12. Matrix-Geometric Method for Queueing Model with State-Dependent Arrival of an Unreliable Server and PH Service

    Directory of Open Access Journals (Sweden)

    M.ReniSagaya Raj

    2016-03-01

    Full Text Available In this paper, we consider a state-dependent queueing system in which the system is subject to random breakdowns. Customer arrive at the system randomly following a Poisson process with state-dependent rates. Service times follows PH distribution and repair times are exponentially distributed. The server may fail to service with probability depending on the number of customer completed since the last repair. The main result of this paper is the matrix-geometric solution of the steady-state queue length from which many performance measurements of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period, system utilization are obtained. Numerical examples are presented for both cases.

  13. Cost Comparison of B-1B Non-Mission-Capable Drivers Using Finite Source Queueing with Spares

    Science.gov (United States)

    2012-09-06

    COMPARISON OF B-1B NON-MISSION-CAPABLE DRIVERS USING FINITE SOURCE QUEUEING WITH SPARES GRADUATE RESEARCH PAPER Presented to the Faculty...step into the lineup making large-number approximations unusable. Instead, a finite source queueing model including spares is incorporated...were reported as flying time accrued since last occurrence. Service time was given in both start-stop format and MX man-hours utilized. Service time was

  14. Application of Queueing Theory to the Analysis of Changes in Outpatients' Waiting Times in Hospitals Introducing EMR.

    Science.gov (United States)

    Cho, Kyoung Won; Kim, Seong Min; Chae, Young Moon; Song, Yong Uk

    2017-01-01

    This research used queueing theory to analyze changes in outpatients' waiting times before and after the introduction of Electronic Medical Record (EMR) systems. We focused on the exact drawing of two fundamental parameters for queueing analysis, arrival rate (λ) and service rate (µ), from digital data to apply queueing theory to the analysis of outpatients' waiting times. We used outpatients' reception times and consultation finish times to calculate the arrival and service rates, respectively. Using queueing theory, we could calculate waiting time excluding distorted values from the digital data and distortion factors, such as arrival before the hospital open time, which occurs frequently in the initial stage of a queueing system. We analyzed changes in outpatients' waiting times before and after the introduction of EMR using the methodology proposed in this paper, and found that the outpatients' waiting time decreases after the introduction of EMR. More specifically, the outpatients' waiting times in the target public hospitals have decreased by rates in the range between 44% and 78%. It is possible to analyze waiting times while minimizing input errors and limitations influencing consultation procedures if we use digital data and apply the queueing theory. Our results verify that the introduction of EMR contributes to the improvement of patient services by decreasing outpatients' waiting time, or by increasing efficiency. It is also expected that our methodology or its expansion could contribute to the improvement of hospital service by assisting the identification and resolution of bottlenecks in the outpatient consultation process.

  15. Analysis of queueing system with discrete autoregressive arrivals having DML as marginal distribution

    Directory of Open Access Journals (Sweden)

    Bindu Abraham

    2014-05-01

    Full Text Available In this paper we analyze DAR(1/D/s Queue with Discrete Mittag-Leffler [DML(α] as marginal distribution. Simulation study of the sample path of the arrival process is conducted. For this queueing system, the stationary distribution of the system size and the waiting time distribution of an arbitrary packet is obtained with the help of matrix analytic methods and Markov regenerative theory. The quantitative effect of the stationary distribution on system size, waiting time and  the autocorrelation function as well as the parameters of the input traffic is illustrated empirically. The model is applied to a real data on the passenger arrivals at a subway bus terminal in Santiago de Chile and is established that the model well suits this data.

  16. On buffer overflow duration in a finite-capacity queueing system with multiple vacation policy

    Science.gov (United States)

    Kempa, Wojciech M.

    2017-12-01

    A finite-buffer queueing system with Poisson arrivals and generally distributed processing times, operating under multiple vacation policy, is considered. Each time when the system becomes empty, the service station takes successive independent and identically distributed vacation periods, until, at the completion epoch of one of them, at least one job waiting for service is detected in the buffer. Applying analytical approach based on the idea of embedded Markov chain, integral equations and linear algebra, the compact-form representation for the cumulative distribution function (CDF for short) of the first buffer overflow duration is found. Hence, the formula for the CDF of next such periods is obtained. Moreover, probability distributions of the number of job losses in successive buffer overflow periods are found. The considered queueing system can be efficienly applied in modelling energy saving mechanisms in wireless network communication.

  17. A discrete-time queueing system with changes in the vacation times

    Directory of Open Access Journals (Sweden)

    Atencia Ivan

    2016-06-01

    Full Text Available This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

  18. A Discrete-Time Geo/G/1 Retrial Queue with Two Different Types of Vacations

    Directory of Open Access Journals (Sweden)

    Feng Zhang

    2015-01-01

    Full Text Available We analyze a discrete-time Geo/G/1 retrial queue with two different types of vacations and general retrial times. Two different types of vacation policies are investigated in this model, one of which is nonexhaustive urgent vacation during serving and the other is normal exhaustive vacation. For this model, we give the steady-state analysis for the considered queueing system. Firstly, we obtain the generating functions of the number of customers in our model. Then, we obtain the closed-form expressions of some performance measures and also give a stochastic decomposition result for the system size. Moreover, the relationship between this discrete-time model and the corresponding continuous-time model is also investigated. Finally, some numerical results are provided to illustrate the effect of nonexhaustive urgent vacation on some performance characteristics of the system.

  19. A Discrete-Time Queue with Balking, Reneging, and Working Vacations

    Directory of Open Access Journals (Sweden)

    Veena Goswami

    2014-01-01

    Full Text Available This paper presents an analysis of balking and reneging in finite-buffer discrete-time single server queue with single and multiple working vacations. An arriving customer may balk with a probability or renege after joining according to a geometric distribution. The server works with different service rates rather than completely stopping the service during a vacation period. The service times during a busy period, vacation period, and vacation times are assumed to be geometrically distributed. We find the explicit expressions for the stationary state probabilities. Various system performance measures and a cost model to determine the optimal service rates are presented. Moreover, some queueing models presented in the literature are derived as special cases of our model. Finally, the influence of various parameters on the performance characteristics is shown numerically.

  20. Freeway Traffic Density and On-Ramp Queue Control via ILC Approach

    Directory of Open Access Journals (Sweden)

    Ronghu Chi

    2014-01-01

    Full Text Available A new queue length information fused iterative learning control approach (QLIF-ILC is presented for freeway traffic ramp metering to achieve a better performance by utilizing the error information of the on-ramp queue length. The QLIF-ILC consists of two parts, where the iterative feedforward part updates the control input signal by learning from the past control data in previous trials, and the current feedback part utilizes the tracking error of the current learning iteration to stabilize the controlled plant. These two parts are combined in a complementary manner to enhance the robustness of the proposed QLIF-ILC. A systematic approach is developed to analyze the convergence and robustness of the proposed learning scheme. The simulation results are further given to demonstrate the effectiveness of the proposed QLIF-ILC.

  1. Active queue management controller design for TCP communication networks: Variable structure control approach

    International Nuclear Information System (INIS)

    Chen, C.-K.; Liao, T.-L.; Yan, J.-J.

    2009-01-01

    On the basis of variable structure control (VSC), an active queue management (AQM) controller is presented for a class of TCP communication networks. In the TCP/IP networks, the packet drop probability is limited between 0 and 1. Therefore, we modeled TCP/AQM as a rate-based non-linear system with a saturated input. The objective of the VSC-based AQM controller is to achieve the desired queue size and to guarantee the asymptotic stability of the closed-loop TCP non-linear system with saturated input. The performance and effectiveness of the proposed control law are then validated for different network scenarios through numerical simulations in both MATLAB and Network Simulator-2 (NS-2). Both sets of simulation results have confirmed that the proposed scheme outperforms other AQM schemes.

  2. Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Diwakar Shukla

    2010-01-01

    Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

  3. Active queue management controller design for TCP communication networks: Variable structure control approach

    Energy Technology Data Exchange (ETDEWEB)

    Chen, C.-K. [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China); Liao, T.-L. [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China)], E-mail: tlliao@mail.ncku.edu; Yan, J.-J. [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)

    2009-04-15

    On the basis of variable structure control (VSC), an active queue management (AQM) controller is presented for a class of TCP communication networks. In the TCP/IP networks, the packet drop probability is limited between 0 and 1. Therefore, we modeled TCP/AQM as a rate-based non-linear system with a saturated input. The objective of the VSC-based AQM controller is to achieve the desired queue size and to guarantee the asymptotic stability of the closed-loop TCP non-linear system with saturated input. The performance and effectiveness of the proposed control law are then validated for different network scenarios through numerical simulations in both MATLAB and Network Simulator-2 (NS-2). Both sets of simulation results have confirmed that the proposed scheme outperforms other AQM schemes.

  4. Multicast Services of QoS-Aware Active Queue Management over IP Multimedia Applications

    Science.gov (United States)

    Hwang, I.-Shyan; Hwang, Bor-Jiunn; Chang, Pen-Ming

    2010-10-01

    Recently, the multimedia services such as IPTV, video conference emerges to be the main traffic source. When UDP coexists with TCP, it induces not only congestion collapse but also unfairness problem. In this paper, a new Active Queue Management (AQM) algorithm, called Traffic Sensitive Active Queue Management (TSAQM), is proposed for providing multimedia services. The TSAQM comprise Dynamic Weight Allocate Scheme (DWAS) and Service Guarantee Scheme (SGS), the purpose of DWAS is to allocate resource with fairness and high end-user utility, and the purpose of SGS is to determine the satisfactory threshold (TH) and threshold region (TR). Several objectives of this proposed scheme include achieving high end-user utility for video service, considering the multicast as well as unicast proprieties to meet inter-class fairness and achieving the QoS requirement by adjusting the thresholds adaptively based on traffic situations.

  5. Fast distributed strategic learning for global optima in queueing access games

    KAUST Repository

    Tembine, Hamidou

    2014-08-24

    In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic approximation tool to derive steady states and invariant sets of the underlying learning process. Here, the stochastic approximation framework does not apply due to non-vanishing learning rate. We propose a direct proof of convergence of the process. Interestingly, the convergence time to one of the global optima is almost surely finite and we explicitly characterize the convergence time. We show that pursuit-based CODIPAS learning is much faster than the classical learning algorithms in games. We extend the methodology to coalitional learning and proves a very fast formation of coalitions for queue-aware access games where the action space is dynamically changing depending on the location of the user over a graph.

  6. Impact of sensing errors on the queueing delay and transmit power in cognitive radio access

    KAUST Repository

    Hamza, Doha R.; Aissa, Sonia

    2011-01-01

    We study a multiple-access system with a primary user (PU) and a secondary user (SU) utilizing the same frequency band and communicating with a common receiver. Both users transmit with a fixed transmission rate by employing a channel inversion power control scheme. The SU transmits with a certain probability that depends on the sensing outcome, its queue length and whether it has a new packet arrival. We consider the case of erroneous sensing. The goal of the SU is to find the optimal transmission scheduling policy so as to minimize its queueing delay under constraints on its average transmit power and the maximum tolerable primary outage probability caused by miss-detection. The access probabilities are obtained efficiently using linear programming. © 2011 IEEE.

  7. The queueing perspective of asynchronous network coding in two-way relay network

    Science.gov (United States)

    Liang, Yaping; Chang, Qing; Li, Xianxu

    2018-04-01

    Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

  8. A finite capacity queue with Markovian arrivals and two servers with group services

    Directory of Open Access Journals (Sweden)

    S. Chakravarthy

    1994-01-01

    Full Text Available In this paper we consider a finite capacity queuing system in which arrivals are governed by a Markovian arrival process. The system is attended by two exponential servers, who offer services in groups of varying sizes. The service rates may depend on the number of customers in service. Using Markov theory, we study this finite capacity queuing model in detail by obtaining numerically stable expressions for (a the steady-state queue length densities at arrivals and at arbitrary time points; (b the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. The stationary waiting time distribution is shown to be of phase type when the interarrival times are of phase type. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures are discussed. A conjecture on the nature of the mean waiting time is proposed. Some illustrative numerical examples are presented.

  9. The MAP, M/G1,G2/1 queue with preemptive priority

    Directory of Open Access Journals (Sweden)

    Bong Dae Choi

    1997-01-01

    Full Text Available We consider the MAP, M/G1,G2/1 queue with preemptive resume priority, where low priority customers arrive to the system according to a Markovian arrival process (MAP and high priority customers according to a Poisson process. The service time density function of low (respectively: high priority customers is g1(x (respectively: g2(x. We use the supplementary variable method with Extended Laplace Transforms to obtain the joint transform of the number of customers in each priority queue, as well as the remaining service time for the customer in service in the steady state. We also derive the probability generating function for the number of customers of low (respectively, high priority in the system just after the service completion epochs for customers of low (respectively, high priority.

  10. Impact of sensing errors on the queueing delay and transmit power in cognitive radio access

    KAUST Repository

    Hamza, Doha R.

    2011-03-01

    We study a multiple-access system with a primary user (PU) and a secondary user (SU) utilizing the same frequency band and communicating with a common receiver. Both users transmit with a fixed transmission rate by employing a channel inversion power control scheme. The SU transmits with a certain probability that depends on the sensing outcome, its queue length and whether it has a new packet arrival. We consider the case of erroneous sensing. The goal of the SU is to find the optimal transmission scheduling policy so as to minimize its queueing delay under constraints on its average transmit power and the maximum tolerable primary outage probability caused by miss-detection. The access probabilities are obtained efficiently using linear programming. © 2011 IEEE.

  11. Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

    Science.gov (United States)

    Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan

    2017-06-01

    In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.

  12. A Two-Stage Queue Model to Optimize Layout of Urban Drainage System considering Extreme Rainstorms

    OpenAIRE

    He, Xinhua; Hu, Wenfa

    2017-01-01

    Extreme rainstorm is a main factor to cause urban floods when urban drainage system cannot discharge stormwater successfully. This paper investigates distribution feature of rainstorms and draining process of urban drainage systems and uses a two-stage single-counter queue method M/M/1→M/D/1 to model urban drainage system. The model emphasizes randomness of extreme rainstorms, fuzziness of draining process, and construction and operation cost of drainage system. Its two objectives are total c...

  13. Analysis of MAP/PH(1, PH(2/2 Queue with Bernoulli Vacations

    Directory of Open Access Journals (Sweden)

    V. Thangaraj

    2008-12-01

    Full Text Available We consider a two-heterogeneous-server queueing system with Bernoulli vacation in which customers arrive according to a Markovian arrival process (MAP. Servers returning from vacation immediately take another vacation if no customer is waiting. Using matrix-geometric method, the steady-state probability of the number of customers in the system is investigated. Some important performance measures are obtained. The waiting time distribution and the mean waiting time are also discussed. Finally, some numerical illustrations are provided.

  14. Tool supported modeling of sensor communication networks by using finite-source priority retrial queues

    Directory of Open Access Journals (Sweden)

    Tamas Berczes

    2012-06-01

    Full Text Available The main aim of the present paper is to draw the attention of the readers of this special issue to the modeling issues of sensor networks. The novelty of this investigation is the introduction of servers vacation combined with priority customers for finite-source retrial queues and its application to wireless sensor networks. In this paper we analyze a priority finite-source retrial queue with repeated vacations. Two types of priority customers are defined, customers with priority 1 (P1 go directly to an ordinary FIFO queue. However, if customers with priority 2 (P2 find the server in busy or unavailable state go to the orbit. These customers stay in the orbit and retry their request until find the server in idle and available state. We assume that P1 customers have non-preemptive priority over P2 customers. The server starts with a listening period and if no customer arrive during this period it will enter in the vacation mode. When the vacation period is terminated, then the node wakes up. If there is a P1 customer in the queue the server begin to serve it, and when there is no any P1 customer, the node will remain awake for exponentially distributed time period. If that period expires without arrivals the node will enter in the next sleeping period. All random variables involved in model construction are supposed to be independent and exponentially distributed ones. Our main interest is to give the main steady-state performance measures of the system computed by the help of the MOSEL tool. Several Figures illustrate the effect of input parameters on the mean response time.

  15. On one problem of the busy period determination in queues with infinitely many servers

    International Nuclear Information System (INIS)

    Dvurecenskij, A.; Kuljukina, L.A.; Ososkov, G.A.

    1982-01-01

    In the paper the problem of the discretized cluster length probability determination based on the scanning in the track chambers is considered. This problem is solved in the frame of the queueing system with infinitely many servers as a discretized busy period probability determination of this system. The precise formulae of a probability are given and it is proved that those probabilities converge weakly to the probability distribution of the nondiscretized cluster when the discretization steps are diminished

  16. An Active Queue Management for QoS Guarantee of the High Priority Service Class

    Science.gov (United States)

    Kim, Hyun Jong; Shim, Jae Chan; Kim, Hwa-Suk; Cho, Kee Seong; Choi, Seong Gon

    In this paper, we propose the active queue management mechanism (Active-WRED) for guaranteeing the quality of the high priority service class (VoIP or IPTV) in the multi-class traffic service environment. In the congestion situation, this mechanism increases the drop probability of the low priority traffic and reduces the drop probability of the high priority traffic; therefore it can guarantee the quality of the high priority service class from the poor quality by the packet loss.

  17. ANALYSIS OF FUZZY QUEUES: PARAMETRIC PROGRAMMING APPROACH BASED ON RANDOMNESS - FUZZINESS CONSISTENCY PRINCIPLE

    OpenAIRE

    Dhruba Das; Hemanta K. Baruah

    2015-01-01

    In this article, based on Zadeh’s extension principle we have apply the parametric programming approach to construct the membership functions of the performance measures when the interarrival time and the service time are fuzzy numbers based on the Baruah’s Randomness- Fuzziness Consistency Principle. The Randomness-Fuzziness Consistency Principle leads to defining a normal law of fuzziness using two different laws of randomness. In this article, two fuzzy queues FM...

  18. The busy period of order n in the GI/D/infinity queue

    International Nuclear Information System (INIS)

    Dvurecenskij, A.

    1982-01-01

    The problem of determination of the distribution function, integral equation and all moments of the busy period of order n, that is, the period when at least n servers are busy from infinitely many servers of the GI/D/infinity queueing system are investigated. The idle period of order n, i. e., the period between two neighbouring busy periods of order n is also studied. Those problems arise in the blob length determination in track chambers in high energy physics

  19. Stochastic Analysis of a Queue Length Model Using a Graphics Processing Unit

    Czech Academy of Sciences Publication Activity Database

    Přikryl, Jan; Kocijan, J.

    2012-01-01

    Roč. 5, č. 2 (2012), s. 55-62 ISSN 1802-971X R&D Projects: GA MŠk(CZ) MEB091015 Institutional support: RVO:67985556 Keywords : graphics processing unit * GPU * Monte Carlo simulation * computer simulation * modeling Subject RIV: BC - Control Systems Theory http://library.utia.cas.cz/separaty/2012/AS/prikryl-stochastic analysis of a queue length model using a graphics processing unit.pdf

  20. What money can't buy: allocations with priority lists, lotteries and queues

    OpenAIRE

    Daniele Condorelli

    2009-01-01

    I study the welfare optimal allocation of a number of identical and indivisible objects to a set of heterogeneous risk-neutral agents under the hypothesis that money is not available. Agents have independent private values, which represent the maximum time that they are will- ing to wait in line to obtain a good. A priority list, which ranks agents according to their expected values, is optimal when hazard rates of the distributions of values are increasing. Queues, which allocates the ob- je...

  1. Modeling Message Queueing Services with Reliability Guarantee in Cloud Computing Environment Using Colored Petri Nets

    Directory of Open Access Journals (Sweden)

    Jing Li

    2015-01-01

    Full Text Available Motivated by the need for loosely coupled and asynchronous dissemination of information, message queues are widely used in large-scale application areas. With the advent of virtualization technology, cloud-based message queueing services (CMQSs with distributed computing and storage are widely adopted to improve availability, scalability, and reliability; however, a critical issue is its performance and the quality of service (QoS. While numerous approaches evaluating system performance are available, there is no modeling approach for estimating and analyzing the performance of CMQSs. In this paper, we employ both the analytical and simulation modeling to address the performance of CMQSs with reliability guarantee. We present a visibility-based modeling approach (VMA for simulation model using colored Petri nets (CPN. Our model incorporates the important features of message queueing services in the cloud such as replication, message consistency, resource virtualization, and especially the mechanism named visibility timeout which is adopted in the services to guarantee system reliability. Finally, we evaluate our model through different experiments under varied scenarios to obtain important performance metrics such as total message delivery time, waiting number, and components utilization. Our results reveal considerable insights into resource scheduling and system configuration for service providers to estimate and gain performance optimization.

  2. State dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations and threshold

    Science.gov (United States)

    Niranjan, S. P.; Chandrasekaran, V. M.; Indhira, K.

    2017-11-01

    The objective of this paper is to analyse state dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations, threshold and constant retrial policy. Primary customers are arriving into the system in bulk with different arrival rates λ a and λ b . If arriving customers find the server is busy then the entire batch will join to orbit. Customer from orbit request service one by one with constant retrial rate γ. On the other hand if an arrival of customers finds the server is idle then customers will be served in batches according to general bulk service rule. After service completion, customers may request service again with probability δ as feedback or leave from the system with probability 1 - δ. In the service completion epoch, if the orbit size is zero then the server leaves for multiple vacations. The server continues the vacation until the orbit size reaches the value ‘N’ (N > b). At the vacation completion, if the orbit size is ‘N’ then the server becomes ready to provide service for customers from the main pool or from the orbit. For the designed queueing model, probability generating function of the queue size at an arbitrary time will be obtained by using supplementary variable technique. Various performance measures will be derived with suitable numerical illustrations.

  3. Predictive functional control for active queue management in congested TCP/IP networks.

    Science.gov (United States)

    Bigdeli, N; Haeri, M

    2009-01-01

    Predictive functional control (PFC) as a new active queue management (AQM) method in dynamic TCP networks supporting explicit congestion notification (ECN) is proposed. The ability of the controller in handling system delay along with its simplicity and low computational load makes PFC a privileged AQM method in the high speed networks. Besides, considering the disturbance term (which represents model/process mismatches, external disturbances, and existing noise) in the control formulation adds some level of robustness into the PFC-AQM controller. This is an important and desired property in the control of dynamically-varying computer networks. In this paper, the controller is designed based on a small signal linearized fluid-flow model of the TCP/AQM networks. Then, closed-loop transfer function representation of the system is derived to analyze the robustness with respect to the network and controller parameters. The analytical as well as the packet-level ns-2 simulation results show the out-performance of the developed controller for both queue regulation and resource utilization. Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.

  4. A robust fractional-order PID controller design based on active queue management for TCP network

    Science.gov (United States)

    Hamidian, Hamideh; Beheshti, Mohammad T. H.

    2018-01-01

    In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

  5. Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

    Directory of Open Access Journals (Sweden)

    Qaisar Ayub

    Full Text Available Delay Tolerant Network (DTN multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

  6. BOB-RED queue management for IEEE 802.15.4 wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Wu Jean-Lien

    2011-01-01

    Full Text Available Abstract Multimedia services over resource constrained wireless sensor networks (WSNs face a performance bottleneck issue from the gateway node to the sink node. Therefore, the queue management at the gateway node is crucial for diversified messages conveyed from the front nodes to the sink node. In this article, beacon order-based random early detection (BOB-RED queue management is proposed. BOB-RED is a dynamic adaptation scheme based on adjusting beacon interval and superframe duration in the IEEE 802.15.4 MAC superframe accompanied with RED queue management scheme to increase the transmission efficiency of multimedia over WSNs. We focus on the performance improvement upon different traffic loads over WSNs. Evaluation metrics include end-to-end delay, packet delivery ratio, and energy consumption in IEEE 802.15.4 beacon enabled mode. Simulation results show that BOB-RED can effectively decrease end-to-end delay and energy consumption compared to the DropTail scheme.

  7. Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

    Science.gov (United States)

    Ayub, Qaisar; Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

    2018-01-01

    Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

  8. ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT

    Directory of Open Access Journals (Sweden)

    M. Usha

    2014-09-01

    Full Text Available Design of an Active Queue Management scheme at the Access Point to address the problem of congestion control, packet delay variation and packet loss rate is discussed. The proposed mechanism calculates and adjusts redundancy rate adaptively at the access point by considering both network traffic load and wireless channel condition. Real-time applications such as Mobile learning and smart learning need the special treatment and require differentiated QoS to satisfy the client who is ready to pay more than others. Maintaining the jitter value of the multimedia packets below the threshold is essential to guarantee the desirable quality of the video at the receiver. The work initially concentrates on minimizing the packet loss of such priority flows and they have to be given place in the queue even at the time of buffer overflow. Thus the proposed work uses push-out policy to provide differentiated services to the multimedia flow which achieves considerable improvement in the video quality at the receiver. The considerable decrease in packet loss rate and special treatment in the queue of the access point lowers the packet delay variation of the multimedia flow. The results show that the AQM used at the access point effectively achieves low packet loss, low jitter using differentiated FEC rate calculation without generating congestion in the wireless network.

  9. Dynamic Performance Optimization for Cloud Computing Using M/M/m Queueing System

    Directory of Open Access Journals (Sweden)

    Lizheng Guo

    2014-01-01

    Full Text Available Successful development of cloud computing has attracted more and more people and enterprises to use it. On one hand, using cloud computing reduces the cost; on the other hand, using cloud computing improves the efficiency. As the users are largely concerned about the Quality of Services (QoS, performance optimization of the cloud computing has become critical to its successful application. In order to optimize the performance of multiple requesters and services in cloud computing, by means of queueing theory, we analyze and conduct the equation of each parameter of the services in the data center. Then, through analyzing the performance parameters of the queueing system, we propose the synthesis optimization mode, function, and strategy. Lastly, we set up the simulation based on the synthesis optimization mode; we also compare and analyze the simulation results to the classical optimization methods (short service time first and first in, first out method, which show that the proposed model can optimize the average wait time, average queue length, and the number of customer.

  10. A spatiotemporal model for the LTE uplink: Spatially interacting tandem queues approach

    KAUST Repository

    Gharbieh, Mohammad

    2017-07-31

    With the proliferation of the Internet-of-things (IoT), there is an undeniable consensus that cellular LTE networks will have to support a dramatically larger number of uplink connections. This is true since most of the devices to be added incur machine-type communications which is dominantly upstream. Can current LTE network withstand this challenge? To answer this question, the joint performance of random access process and the uplink data transmission should be investigated. These two problems have been classically treated in the literature in a disjoint fashion. In this paper, they are jointly analyzed as an inseparable couple. To do that, a tandem queuing model is adopted whereby devices are represented as spatially interacting queues. The interaction between queues is governed by the mutual inter-cell and intra-cell interference. To that end, a joint stochastic geometry and queueing theory model is exploited to study this problem and a spatiotemporal analytical model is developed accordingly. Network stability and scalability are two prime performance criteria for performance assessment. In light of these two criteria, the developed model is poised to offer valuable insights into efficient access and resource allocation strategies.

  11. A queueing theory description of fat-tailed price returns in imperfect financial markets

    Science.gov (United States)

    Lamba, H.

    2010-09-01

    In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of price thresholds to simulate agent behavior over much longer timescales than are currently used in models of order-books. We show that many phenomena, routinely ignored in efficient market theory, can be systematically introduced into an otherwise efficient market, resulting in models that robustly replicate the most important stylized facts. We then demonstrate a close link between such threshold models and queueing theory, with large price changes corresponding to the busy periods of a single-server queue. The distribution of the busy periods is known to have excess kurtosis and non-exponential decay under various assumptions on the queue parameters. Such an approach may prove useful in the development of mathematical models for rapid deleveraging and panics in financial markets, and the stress-testing of financial institutions.

  12. A queueing network model to analyze the impact of parallelization of care on patient cycle time.

    Science.gov (United States)

    Jiang, Lixiang; Giachetti, Ronald E

    2008-09-01

    The total time a patient spends in an outpatient facility, called the patient cycle time, is a major contributor to overall patient satisfaction. A frequently recommended strategy to reduce the total time is to perform some activities in parallel thereby shortening patient cycle time. To analyze patient cycle time this paper extends and improves upon existing multi-class open queueing network model (MOQN) so that the patient flow in an urgent care center can be modeled. Results of the model are analyzed using data from an urgent care center contemplating greater parallelization of patient care activities. The results indicate that parallelization can reduce the cycle time for those patient classes which require more than one diagnostic and/ or treatment intervention. However, for many patient classes there would be little if any improvement, indicating the importance of tools to analyze business process reengineering rules. The paper makes contributions by implementing an approximation for fork/join queues in the network and by improving the approximation for multiple server queues in both low traffic and high traffic conditions. We demonstrate the accuracy of the MOQN results through comparisons to simulation results.

  13. Operational behavior of the MAP/G/1 queue under N-policy with a single vacation and set-up

    Directory of Open Access Journals (Sweden)

    Ho Woo Lee

    2002-01-01

    Full Text Available This paper considers the MAP/G/1 queue under N-policy with a single vacation and set-up. We derive the vector generating functions of the queue length at an arbitrary time and at departures in decomposed forms. We also derive the Laplace-Stieltjes transform of the waiting time. Computation algorithms for mean performance measures are provided.

  14. Design of Active Queue Management for Robust Control on Access Router for Heterogeneous Networks

    Directory of Open Access Journals (Sweden)

    Åhlund Christer

    2011-01-01

    Full Text Available The Internet architecture is a packet switching technology that allows dynamic sharing of bandwidth among different flows with in an IP network. Packets are stored and forwarded from one node to the next until reaching their destination. Major issues in this integration are congestion control and how to meet different quality of service requirements associated with various services. In other words streaming media quality degrades with increased packet delay and jitter caused by network congestion. To mitigate the impact of network congestion, various techniques have been used to improve multimedia quality and one of those techniques is Active Queue Management (AQM. Access routers require a buffer to hold packets during times of congestion. A large buffer can absorb the bursty arrivals, and this tends to increase the link utilizations but results in higher queuing delays. Traffic burstiness has a considerable negative impact on network performance. AQM is now considered an effective congestion control mechanism for enhancing transport protocol performance over wireless links. In order to have good link utilization, it is necessary for queues to adapt to varying traffic loads. This paper considers a particular scheme which is called Adaptive AQM (AAQM and studies its performance in the presence of feedback delays and its ability to maintain a small queue length as well as its robustness in the presence of traffic burstiness. The paper also presents a method based on the well-known Markov Modulated Poisson Process (MPP to capture traffic burstiness and buffer occupancy. To demonstrate the generality of the presented method, an analytic model is described and verified by extensive simulations of different adaptive AQM algorithms. The analysis and simulations show that AAQM outperforms the other AQMs with respect to responsiveness and robustness.

  15. Complete analysis of MAP/G/1/N queue with single (multiple vacation(s under limited service discipline

    Directory of Open Access Journals (Sweden)

    U. C. Gupta

    2005-01-01

    Full Text Available We consider a finite-buffer single-server queue with Markovian arrival process (MAP where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both single- and multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parameters on some important performance measures, like probability of loss, mean queue lengths, mean waiting time, is discussed. The model can be applied in computer communication and networking, for example, performance analysis of token passing ring of LAN and SVC (switched virtual connection of ATM.

  16. GEOM/GEOM[a]/1/ queue with late arrival system with delayed access and delayed multiple working vacations

    Directory of Open Access Journals (Sweden)

    Cheng Jiang

    2014-01-01

    Full Text Available This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD, it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed. The server does not take a vacation immediately at service complete epoch but keeps idle period. According to a bulk-service rule, at least one customer is needed to start a service with a maximum serving capacity 'a'. Using probability analysis method and displacement operator method, the queue length and the probability generating function of waiting time at pre-arrival epochs are obtained. Furthermore, the outside observer’s observation epoch queue length distributions are given. Finally, computational examples with numerical results in the form of graphs and tables are discussed.

  17. An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

    Science.gov (United States)

    Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

    2011-01-01

    Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

  18. On the calculation of steady-state loss probabilities in the GI/G/2/0 queue

    Directory of Open Access Journals (Sweden)

    Igor N. Kovalenko

    1994-01-01

    Full Text Available This paper considers methods for calculating the steady-state loss probability in the GI/G/2/0 queue. A previous study analyzed this queue in discrete time and this led to an efficient, numerical approximation scheme for continuous-time systems. The primary aim of the present work is to provide an alternative approach by analyzing the GI/ME/2/0 queue; i.e., assuming that the service time can be represented by a matrix-exponential distribution. An efficient computational scheme based on this method is developed and some numerical examples are studied. Some comparisons are made with the discrete-time approach, and the two methods are seen to be complementary.

  19. Beyond clinical priority: what matters when making operational decisions about emergency surgical queues?

    Science.gov (United States)

    Fitzgerald, Anneke; Wu, Yong

    2017-08-01

    Objective This paper describes the perceptions of operating theatre staff in Australia and The Netherlands regarding the influence of logistical or operational reasons that may affect the scheduling of unplanned surgical cases. It is proposed that logistical or operational issues can influence the priority determination of queue position of surgical cases on the emergency waiting list. Methods A questionnaire was developed and conducted in 15 hospitals across The Netherlands and Australia, targeting anaesthetists, managers, nurses and surgeons. Statistical analyses revolved around these four professional groups. Six hypotheses were then developed and tested based on the responses collected from the participants. Results There were significant differences in perceptions of logistics delay factors across different professional groups when patients were waiting for unplanned surgery. There were also significant differences among different groups when setting logistical priority factors for planning and scheduling unplanned cases. The hypotheses tests confirm these differences, and the findings concur with the paradigmatic differences mentioned in the literature. These paradigmatic differences among the four professional groups may explain some of the tensions encountered when making decisions about scheduling emergency surgical queues, and therefore should be taken into consideration for management of operating theatres. Conclusions Queue positions of patients waiting for unplanned surgery, or emergency surgery, are determined by medical clinicians according to clinicians' indication of clinical priority. However, operating theatre managers are important in facilitating smooth operations when planning for emergency surgeries. It is necessary for surgeons to understand the logistical challenges faced by managers when requesting logistical priorities for their operations. What is known about the topic? Tensions exist about the efficient use of operating theatres and

  20. Queued Service Observing (QSO) at CFHT II. Queue Preparation and Observation Tools

    Science.gov (United States)

    Vermeulen, T.; Savalle, R.; Martin, P.; Shapiro, J.

    In order to maximize the scientific productivity of the CFH12K mosaic wide-field imager, a Queued Service Observing (QSO) mode of operations was implemented at CFHT . To support this new operational model, a two-tiered system consisting of a Swing-based Java client and a relational database was developed. The various software components were designed to handle selection, scheduling, execution, and validation of programs submitted by the investigators through the CFHT Phase 2 Tool (PH2). This paper will discuss the technical architecture, the reasons behind our choice of technology, and our experience implementing this system during the first two semesters of Queue observing.

  1. Method, apparatus and system for managing queue operations of a test bench environment

    Science.gov (United States)

    Ostler, Farrell Lynn

    2016-07-19

    Techniques and mechanisms for performing dequeue operations for agents of a test bench environment. In an embodiment, a first group of agents are each allocated a respective ripe reservation and a second set of agents are each allocated a respective unripe reservation. Over time, queue management logic allocates respective reservations to agents and variously changes one or more such reservations from unripe to ripe. In another embodiment, an order of servicing agents allocated unripe reservations is based on relative priorities of the unripe reservations with respect to one another. An order of servicing agents allocated ripe reservations is on a first come, first served basis.

  2. Modelling M/G/1 queueing systems with server vacations using stochastic Petri nets

    Directory of Open Access Journals (Sweden)

    K Ramanath

    2006-12-01

    Full Text Available The theory of non-Markovian stochastic Petri nets is employed in this paper to derive an alternative method for studying the steady state behaviour of the M/G/1 vacation queueing system with a limited service discipline. Three types of vacation schemes are considered, and sytems with both a finite population and those with an infinite population (but finite capacity are considered. Simple numerical examples are also provided to illustrate the functionality of the methods and some useful performance measures for the system are obtained.

  3. Comparing the Overhead of Lock-based and Lock-free Implementations of Priority Queues

    DEFF Research Database (Denmark)

    Passas, Stavros; Karlsson, Sven

    2011-01-01

    . In this paper, we compare a lock-free implementation of a priority queue with a lock-based implementation. We perform experiments with processors of different generations and observe large performance differences for lock-free data structures depending on the processor generation. The lock-free implementation...... performs much better on the most recent processor generation. We investigate this performance trend, using a set of micro-benchmarks and show a significant difference in the overhead of atomic operations between processor generations. The lock-free implementation executes approximately three times as many...

  4. Analysing patient queue system in an imaging department: a step toward total quality management

    International Nuclear Information System (INIS)

    Kumar, Pratik; Pandey, A.K.

    2008-01-01

    Medical imaging has become an inevitable part of any diagnosis and/or management of the disease. This has put tremendous work-load on the medical imaging machines. The crowd of waiting patients at any busy imaging centre or rooms has become a common scene. This is especially true for any Government hospital or medical college in India since they cater to bulk of patients. As a part of total quality management we attempted to record, investigate, analyse and suggest on the state of patients' queue system at radiological imaging rooms

  5. Modeling and Optimization of M/G/1-Type Queueing Networks: An Efficient Sensitivity Analysis Approach

    Directory of Open Access Journals (Sweden)

    Liang Tang

    2010-01-01

    Full Text Available A mathematical model for M/G/1-type queueing networks with multiple user applications and limited resources is established. The goal is to develop a dynamic distributed algorithm for this model, which supports all data traffic as efficiently as possible and makes optimally fair decisions about how to minimize the network performance cost. An online policy gradient optimization algorithm based on a single sample path is provided to avoid suffering from a “curse of dimensionality”. The asymptotic convergence properties of this algorithm are proved. Numerical examples provide valuable insights for bridging mathematical theory with engineering practice.

  6. Computational Approach to Profit Optimization of a Loss-Queueing System

    Directory of Open Access Journals (Sweden)

    Dinesh Kumar Yadav

    2010-01-01

    Full Text Available Objective of the paper is to deal with the profit optimization of a loss queueing system with the finite capacity. Here, we define and compute total expected cost (TEC, total expected revenue (TER and consequently we compute the total optimal profit (TOP of the system. In order to compute the total optimal profit of the system, a computing algorithm has been developed and a fast converging N-R method has been employed which requires least computing time and lesser memory space as compared to other methods. Sensitivity analysis and its observations based on graphics have added a significant value to this model.

  7. Efficient simulation of finite horizon problems in queueing and insurance risk

    DEFF Research Database (Denmark)

    Rojas-Nandayapa, Leonardo; Asmussen, Søren

    2007-01-01

    Let ψ(u,t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time tprobability in the classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ψ(u,t) are suggested....... A key idea behind the estimators is conditional Monte Carlo. Variance estimates are derived in the regularly varying case, the efficiencies are compared numerically and also the estimators are shown to have bounded relative error in some main cases. In part, also extensions to general Lévy processes...

  8. Analysis of Repairable Geo/G/1 Queues with Negative Customers

    Directory of Open Access Journals (Sweden)

    Doo Ho Lee

    2014-01-01

    Full Text Available We consider discrete-time Geo/G/1 queues with negative customers and a repairable server. The server is subject to failure due to a negative customer arrival. As soon as a negative customer arrives at a system, the server fails and one positive (ordinary customer is forced to leave. At a failure instant, the server is turned off and the repair process immediately begins. We construct the mathematical model and present the probability generating functions of the system size distribution and the FCFS sojourn time distribution. Finally, some numerical examples are given to show the influence of negative customer arrival on the performance measures of the system.

  9. Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers

    Directory of Open Access Journals (Sweden)

    Sherif I. Ammar

    2017-07-01

    Full Text Available Recently, Ammar [1] has discussed the transient behavior of a multiple vacations queue with impatient customers. In this paper, a similar technique is used to derive a new elegant explicit solution for an M/M/1 vacation queue with impatient customers and a waiting server, where the server is allowed to take a vacation whenever the system is empty after waiting for a random period of time. If the server does not return from the vacation before the expiry of the customer impatience time, the customer abandons the system forever. Moreover, the formulas of mean and variance expressed in terms of the obtained possibilities for this model.

  10. Waiting time analysis for MX/G/1 priority queues with/without vacations under random order of service discipline

    Directory of Open Access Journals (Sweden)

    Norikazu Kawasaki

    2000-01-01

    Full Text Available We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two moments. The relationship for the second moments under ROS and first-come first-served disciplines extends the one found previously by Takacs and Fuhrmann for non-priority single arrival queues.

  11. Queueing theoretic analysis of labor and delivery : Understanding management styles and C-section rates.

    Science.gov (United States)

    Gombolay, Matthew; Golen, Toni; Shah, Neel; Shah, Julie

    2017-09-04

    Childbirth is a complex clinical service requiring the coordinated support of highly trained healthcare professionals as well as management of a finite set of critical resources (such as staff and beds) to provide safe care. The mode of delivery (vaginal delivery or cesarean section) has a significant effect on labor and delivery resource needs. Further, resource management decisions may impact the amount of time a physician or nurse is able to spend with any given patient. In this work, we employ queueing theory to model one year of transactional patient information at a tertiary care center in Boston, Massachusetts. First, we observe that the M/G/∞ model effectively predicts patient flow in an obstetrics department. This model captures the dynamics of labor and delivery where patients arrive randomly during the day, the duration of their stay is based on their individual acuity, and their labor progresses at some rate irrespective of whether they are given a bed. Second, using our queueing theoretic model, we show that reducing the rate of cesarean section - a current quality improvement goal in American obstetrics - may have important consequences with regard to the resource needs of a hospital. We also estimate the potential financial impact of these resource needs from the hospital perspective. Third, we report that application of our model to an analysis of potential patient coverage strategies supports the adoption of team-based care, in which attending physicians share responsibilities for patients.

  12. Study on the Calculation Models of Bus Delay at Bays Using Queueing Theory and Markov Chain

    Directory of Open Access Journals (Sweden)

    Feng Sun

    2015-01-01

    Full Text Available Traffic congestion at bus bays has decreased the service efficiency of public transit seriously in China, so it is crucial to systematically study its theory and methods. However, the existing studies lack theoretical model on computing efficiency. Therefore, the calculation models of bus delay at bays are studied. Firstly, the process that buses are delayed at bays is analyzed, and it was found that the delay can be divided into entering delay and exiting delay. Secondly, the queueing models of bus bays are formed, and the equilibrium distribution functions are proposed by applying the embedded Markov chain to the traditional model of queuing theory in the steady state; then the calculation models of entering delay are derived at bays. Thirdly, the exiting delay is studied by using the queueing theory and the gap acceptance theory. Finally, the proposed models are validated using field-measured data, and then the influencing factors are discussed. With these models the delay is easily assessed knowing the characteristics of the dwell time distribution and traffic volume at the curb lane in different locations and different periods. It can provide basis for the efficiency evaluation of bus bays.

  13. Analysis of Multiserver Queueing System with Opportunistic Occupation and Reservation of Servers

    Directory of Open Access Journals (Sweden)

    Bin Sun

    2014-01-01

    Full Text Available We consider a multiserver queueing system with two input flows. Type-1 customers have preemptive priority and are lost during arrival only if all servers are occupied by type-1 customers. If all servers are occupied, but some provide service to type-2 customers, service of type-2 customer is terminated and type-1 customer occupies the server. If the number of busy servers is less than the threshold M during type-2 customer arrival epoch, this customer is accepted. Otherwise, it is lost or becomes a retrial customer. It will retry to obtain service. Type-2 customer whose service is terminated is lost or moves to the pool of retrial customers. The service time is exponentially distributed with the rate dependent on the customer’s type. Such queueing system is suitable for modeling cognitive radio. Type-1 customers are interpreted as requests generated by primary users. Type-2 customers are generated by secondary or cognitive users. The problem of optimal choice of the threshold M is the subject of this paper. Behavior of the system is described by the multidimensional Markov chain. Its generator, ergodicity condition, and stationary distribution are given. The system performance measures are obtained. The numerical results show the effectiveness of considered admission control.

  14. Discrete-time retrial queue with Bernoulli vacation, preemptive resume and feedback customers

    Directory of Open Access Journals (Sweden)

    Peishu Chen

    2015-09-01

    Full Text Available Purpose: We consider a discrete-time Geo/G/1 retrial queue where the retrial time follows a general distribution, the server subject to Bernoulli vacation policy and the customer has preemptive resume priority, Bernoulli feedback strategy. The main purpose of this paper is to derive the generating functions of the stationary distribution of the system state, the orbit size and some important performance measures. Design/methodology: Using probability generating function technique, some valuable and interesting performance measures of the system are obtained. We also investigate two stochastic decomposition laws and present some numerical results. Findings: We obtain the probability generating functions of the system state distribution as well as those of the orbit size and the system size distributions. We also obtain some analytical expressions for various performance measures such as idle and busy probabilities, mean orbit and system sizes. Originality/value: The analysis of discrete-time retrial queues with Bernoulli vacation, preemptive resume and feedback customers is interesting and to the best of our knowledge, no other scientific journal paper has dealt with this question. This fact gives the reason why efforts should be taken to plug this gap.

  15. Efficient simulation of finite horizon problems in queueing and insurance risk

    DEFF Research Database (Denmark)

    Rojas-Nandayapa, Leonardo; Asmussen, Søren

    Let ψ(u, t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time t < ∞, or, equivalently, the ruin probability in the classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ψ(u, t) are sugges......Let ψ(u, t) be the probability that the workload in an initially empty M/G/1 queue exceeds u at time t classical Crámer-Lundberg model. Assuming service times/claim sizes to be subexponential, various Monte Carlo estimators for ψ(u, t......) are suggested. A key idea behind the estimators is conditional Monte Carlo. Variance estimates are derived in the regularly varying case, the efficiencies are compared numerically and also one of the estimators is shown to have bounded relative error. In part, also extensions to general Lévy processes are treated....

  16. A QoS-Based Dynamic Queue Length Scheduling Algorithm in Multiantenna Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Verikoukis Christos

    2010-01-01

    Full Text Available The use of real-time delay-sensitive applications in wireless systems has significantly grown during the last years. Therefore the designers of wireless systems have faced a challenging issue to guarantee the required Quality of Service (QoS. On the other hand, the recent advances and the extensive use of multiple antennas have already been included in several commercial standards, where the multibeam opportunistic transmission beamforming strategies have been proposed to improve the performance of the wireless systems. A cross-layer-based dynamically tuned queue length scheduler is presented in this paper, for the Downlink of multiuser and multiantenna WLAN systems with heterogeneous traffic requirements. To align with modern wireless systems transmission strategies, an opportunistic scheduling algorithm is employed, while a priority to the different traffic classes is applied. A tradeoff between the maximization of the throughput of the system and the guarantee of the maximum allowed delay is obtained. Therefore, the length of the queue is dynamically adjusted to select the appropriate conditions based on the operator requirements.

  17. On a random area variable arising in discrete-time queues and compact directed percolation

    International Nuclear Information System (INIS)

    Kearney, Michael J

    2004-01-01

    A well-known discrete-time, single-server queueing system with mean arrival rate λ and mean departure rate μ is considered from the perspective of the area, A, swept out by the queue occupation process during a busy period. We determine the exact form of the tail of the distribution, Pr(A > x); in particular, we show that Pr(A > x) ∼ Cx -1/4 exp(-Dx 1/2 ) for all ρ ≠ 1, where ρ ≡ λ/μ, and expressions for C and D are given. For the critical case ρ = 1 we show that Pr(A > x) ∼ C'x -1/3 , with C' also given. A simple mapping, used in the derivation, establishes a connection with compact directed percolation on a square lattice. As a corollary, therefore, we are also able to specify the large-area asymptotic behaviour of this model at all points in the phase diagram. This extends previous scaling results, which are only valid close to the percolation threshold

  18. QoS-Aware Active Queue Management for Multimedia Services over the Internet

    Directory of Open Access Journals (Sweden)

    Hwang I-Shyan

    2011-01-01

    Full Text Available Recently, with multimedia services such as IPTV, video conferencing has emerged as a main traffic source. When UDP coexists with TCP, it induces not only congestion collapse but also an unfairness problem. In this paper, a new Active Queue Management algorithm, called Traffic Sensitive Active Queue Management (TSAQM, is proposed for providing multimedia services in routers. The TSAQM is comprised of Dynamic Weight Allocate Scheme (DWAS and Service Guarantee Scheme (SGS. The purpose of DWAS is to fairly allocate resources with high end-user utility, and the SGS is to determine the satisfactory threshold (TH and threshold region (TR. Besides, a multiqueue design for different priority traffic, and threshold TH and threshold region TR is proposed to achieve the different QoS requirements. Several objectives of this proposed scheme include achieving high end user utility for video services, considering the multicast as well as unicast proprieties to meet interclass fairness, and achieving the QoS requirement by adaptively adjusting the thresholds based on the traffic situations. Performance comparisons with the GRED-I are in terms of packet dropping rate and throughput to highlight the better behavior of the proposed schemes due to taking into account the fairness and different weights for video layers.

  19. Survival of the Fittest: An Active Queue Management Technique for Noisy Packet Flows

    Directory of Open Access Journals (Sweden)

    Shirish S. Karande

    2007-01-01

    Full Text Available We present a novel active queue management (AQM technique to demonstrate the efficacy of practically harnessing the predictive utility of SSR indications for improved video communication. We consider a network within which corrupted packets are relayed over multiple hops, but a certain percentage of packets needs to be dropped at an intermediate node due to congestion. We propose an AQM technique, survival of the fittest (SOTF, to be employed at the relay node, within which we use packet state information, available from SSR indications and checksums, to drop packets with the highest corruption levels. On the basis of actual 802.11b measurements we show that such a side information (SI aware processing within the network can provide significant performance benefits over an SI-unaware scheme, random queue management (RQM, which is forced to randomly discard packets. With trace-based simulations, we show the utility of the proposed AQM technique in improving the error recovery performance of cross-layer FEC schemes. Finally, with the help of H.264-based video simulations these improvements are shown to translate into a significant improvement in video quality.

  20. Management of demand in the NHS, including the effects of queues and pensioners.

    Science.gov (United States)

    Groocock, J

    1999-01-01

    Discusses the methods used in the NHS to bring demand into balance with supply. People with minor illnesses try self-treatments and alternative medicine. Systematic programs to identify ill people are applied to only a few illnesses. Waiting lists for elective surgery cause some richer people to take their demand to private hospitals. An analysis of such waiting lists shows that, other than this, queues are not a method of rationing but are just the effect of bad management of the actual methods, which are then discussed. The same methods are used to ration access to specialist physicians. Providing extra resources would eliminate queues only if another condition was satisfied. It is argued that providing fully adequate medical care for patients of working age, although expensive, might produce a net economic gain, whereas all care for pensioners, including medical care, gives a net economic loss. Therefore it may not be sensible for people to have inadequate medical care for the first 65 years of their lives just because it is economically impracticable for them to have fully adequate medical care when they are pensioners.

  1. An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities

    NARCIS (Netherlands)

    Sleptchenko, Andrei; van Harten, Aart; van der Heijden, Matthijs C.

    2005-01-01

    We consider a multi-class, multi-server queueing system with preemptive priorities. We distinguish two groups of priority classes that consist of multiple customer types, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times.

  2. Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

    NARCIS (Netherlands)

    Cheung, S.K.; Berg, J.L. van den; Boucherie, R.J.

    2006-01-01

    This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distribution conditioned on the initial job size. Although several expressions for the Laplace-Stieltjes transform (LST) are known, these expressions are not suitable for computational purposes. This paper

  3. Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

    NARCIS (Netherlands)

    Cheung, S.K.; van den Berg, Hans Leo; Boucherie, Richardus J.

    2005-01-01

    This paper studies the M/G/1 processor-sharing (PS) queue and the sojourn time distribution conditioned on the initial job size. Although several expressions for the Laplace-Stieltjes transform (LST) are known, these expressions are not applicable for computational purposes. This paper derives

  4. A heavy-traffic theorem for the GI/G/1 queue with a Pareto-type service time distribution

    NARCIS (Netherlands)

    J.W. Cohen

    1997-01-01

    textabstractFor the $GI/G/1$-queueing model with traffic load $a<1$, service time distribution $B(t)$ and interarrival time distribution $A(t)$ holds, whenever for $t rightarrow infty$: $$ quad 1-B(t) sim frac{c{(t/ beta)^nu + {rm O ( {rm e^{-delta t ), quad c>0, quad 1< nu < 2, quad delta >

  5. The transient M/G/1/0 queue: some bounds and approximations for light traffic with application to reliability

    Directory of Open Access Journals (Sweden)

    J. Ben Atkinson

    1995-01-01

    Full Text Available We consider the transient analysis of the M/G/1/0 queue, for which Pn(t denotes the probability that there are no customers in the system at time t, given that there are n(n=0,1 customers in the system at time 0. The analysis, which is based upon coupling theory, leads to simple bounds on Pn(t for the M/G/1/0 and M/PH/1/0 queues and improved bounds for the special case M/Er/1/0. Numerical results are presented for various values of the mean arrival rate λ to demonstrate the increasing accuracy of approximations based upon the above bounds in light traffic, i.e., as λ→0. An important area of application for the M/G/1/0 queue is as a reliability model for a single repairable component. Since most practical reliability problems have λ values that are small relative to the mean service rate, the approximations are potentially useful in that context. A duality relation between the M/G/1/0 and GI/M/1/0 queues is also described.

  6. A simple derivation of the waiting time distributions in a non-preemptive M/M/c queue with priorities

    NARCIS (Netherlands)

    van Vianen, Lars A.; Gabor, Adriana F.; van Ommeren, Jan C.W.

    2014-01-01

    In this article we give a new derivation for the waiting time distributions in an M=M=c queue with multiple priorities and a common service rate by using elementary lattice paths counting. An advantage of the approach is that it does not require inversion of the Laplace-Stieltjes transform.

  7. A simple derivation of the waiting time distributions in a non-preemptive M/M/c queue with priorities

    NARCIS (Netherlands)

    L.A. van Vianen (Lars); A.F. Gabor (Adriana); J.C.W. van Ommeren (Jan-Kees)

    2014-01-01

    textabstractIn this article we give a new derivation for the waiting time distributions in an M/M/c queue with multiple priorities and a common service rate by using elementary lattice paths counting. An advantage of the approach is that it does not require inversion of the Laplace-Stieltjes

  8. Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

    NARCIS (Netherlands)

    Cheung, S.K.; Cheung, S.K.; van den Berg, Hans Leo; Boucherie, Richardus J.

    This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distribution conditioned on the initial job size. Although several expressions for the Laplace-Stieltjes transform (LST) are known, these expressions are not suitable for computational purposes. This paper

  9. On the relation between the mean and variance of delay in dynamic queues with random capacity and demand

    DEFF Research Database (Denmark)

    Fosgerau, Mogens

    2010-01-01

    This paper investigates the distribution of delays during a repeatedly occurring demand peak in a congested facility with random capacity and demand, such as an airport or an urban road. Congestion is described in the form of a dynamic queue using the Vickrey bottleneck model and assuming Nash...

  10. Buffer and throughput trade-offs in M/G/1/K queueing networks : a bi-criteria approach

    NARCIS (Netherlands)

    Cruz, F.R.B.; Woensel, van T.; MacGregor Smith, J.

    2010-01-01

    The optimal design of real-life systems modeled as finite queueing networks is a difficult stochastic optimization problem. Besides being non-linear and including integer variables, different objectives often conflict with each other. For example, one conflicting pair of objectives includes first

  11. Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines

    NARCIS (Netherlands)

    H. Thorsdottir (Halldora); I.M. Verloop (Maaike)

    2016-01-01

    textabstractThis paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assuming generally distributed service requirements and any service discipline which does not depend on the

  12. Priority queues

    CERN Document Server

    Jaiswal, N.K

    1968-01-01

    In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat

  13. On the GI/M/1 Queue with Vacations and Multiple Service Phases

    Directory of Open Access Journals (Sweden)

    Jianjun Li

    2017-01-01

    Full Text Available This paper considers a GI/M/1 queue with vacations and multiple service phases. Whenever the system becomes empty, the server takes a vacation, causing the system to move to vacation phase 0. If the server returns from a vacation to find no customer waiting, another vacation begins. Otherwise, the system jumps from phase 0 to some service phase i with probability qi,  i=1,2,…,N. Using the matrix geometric solution method and semi-Markov process, we obtain the distributions of the stationary system size at both arrival and arbitrary epochs. The distribution of the stationary waiting time of an arbitrary customer is also derived. In addition, we present some performance measures such as mean waiting time of an arbitrary customer, mean length of the type-i cycle, and mean number of customers in the system at the end of phase 0. Finally, some numerical examples are presented.

  14. The optimal control in batch arrival queue with server vacations, startup and breakdowns

    Directory of Open Access Journals (Sweden)

    Ke Jau-Chuan

    2004-01-01

    Full Text Available This paper studies the N policy M[x]/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vacation. If the server returns from a vacation and finds at least N customers in the system, he is immediately turned on and requires a startup time before providing the service until the system is empty again. It is assumed that the server breaks down according to a Poisson process whose repair time has a general distribution. The system characteristics of such a model are analyzed and the total expected cost function per unit time is developed to determine the optimal threshold of N at a minimum cost.

  15. WQM: An Aggregation-aware Queue Management Scheme for IEEE 802.11n based Networks

    KAUST Repository

    Showail, Ahmad

    2014-08-17

    Choosing the right buffer size in Wi-Fi networks is challenging due to the dynamic nature of the wireless environment. Over buffering or \\'bufferbloat\\' may produce unacceptable end-to-end delays, while static small buffers may limit the performance gains that can be achieved with various 802.11n enhancements, such as frame aggregation. We propose WQM, a queue management scheme customized for wireless networks. WQM adapts the buffer size based on measured link characteristics and network load. Furthermore, it accounts for aggregate length when deciding about the optimal buffer size. We implement WQM on Linux and evaluate it on a wireless testbed. WQM reduces the end-to-end delay by up to 8x compared to Linux default buffer size, and 2x compared to CoDel, the state-of-the-art bufferbloat solution, while achieving comparable network goodput. Further, WQM improves fairness as it limits the ability of a single flow to saturate the buffer.

  16. Optimization of an M/M/1/N Feedback Queue with Retention of Reneged Customers

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar

    2014-01-01

    Full Text Available Customer impatience has become a threat to the business world. Firms employ various customer retention strategies to retain their impatient (or reneged customers. Customer retention mechanisms may help to retain some or all impatient customers. Further, due to unsatisfactory service, customers may rejoin a queue immediately after departure. Such cases are referred to as feedback customers. Kumar and Sharma take this situation into account and study an M/M/1/N feedback queuing system with retention of reneged customers. They obtain only a steady-state solution for this model. In this paper, we extend the work of Kumar and Sharma by performing an economic analysis of the model. We develop a model for the costs incurred and perform the appropriate optimization. The optimum system capacity and optimum service rate are obtained. (original abstract

  17. Simulation of queue length and vehicle delays on signal-controlled intersection

    Directory of Open Access Journals (Sweden)

    Leverents Evgeny

    2018-01-01

    Full Text Available The extensive use of information technology in the field of traffic control will increase the traffic capacity of intersection points and transports. To assess the efficacy of changing options for the road traffic organization or the reorganization of intersection points, you need to know the average delay in vehicles and the length of the queue. The adaptive traffic light control is one of such tools. Simulation modeling of traffic flows use for the definition of its work. The aim of this work is to create a simulation model of controlled intersection, which can evaluate the efficiency of the application the adaptive regulation in various traffic situations, including the availability or deficiency of pedestrian traffic through the intersection. The numerical experiment in in the model pass with using of the Monte Carlo method, which can to draw a conclusion about the calculated parameter on the basis of the result of the reproduction of the calculation model.

  18. ANALYSIS OF MULTI-SERVER QUEUEING SYSTEM WITH PREEMPTIVE PRIORITY AND REPEATED CALLS

    Directory of Open Access Journals (Sweden)

    S. A. Dudin

    2015-01-01

    Full Text Available Multi-server retrial queueing system with no buffer and two types of customers is analyzed as the model of cognitive radio system. Customers of type 1 have a preemptive priority. Customers of both types arrive according to Markovian Arrival Processes. Service times have exponential distribution with parameter depending on the customer type. Type 2 customers are admitted for service only if the number of busy servers is less than the predefined threshold. The rejected type 2 customers retry for the service. Existence condition of the stationary mode of system operation is derived. Formulas for computing key performance measures of the system are presented.

  19. Effect of information, uncertainty and parameter variability on profits in a queue with various pricing strategies

    Science.gov (United States)

    Sun, Wei; Li, Shiyong

    2014-08-01

    This paper presents an unobservable single-server queueing system with three types of uncertainty, where the service rate, or waiting cost or service quality is random variable that may obtain n(n > 2) values. The information about the realised values of parameters is only known to the server. We are concerned about the server's behaviour: revealing or concealing the information to customers. The n-value assumption and the server's behaviour enable us to consider various pricing strategies. In this paper, we analyse the effect of information and uncertainty on profits and make comparisons between the profits under different pricing strategies. Moreover, as for parameter variability reflected by the number of each parameter's possible choices n, we observe the effect of variable n on all types of profits and find that revealing the parameter information can much more benefit the server with the increase of n.

  20. STATIONARY DISTRIBUTION OF A TANDEM QUEUE WITH ADDITIONAL FLOWS ON THE STATIONS OF THE TANDEM

    Directory of Open Access Journals (Sweden)

    V. I. Klimenok

    2017-01-01

    Full Text Available A tandem queueing system consisting of a finite number of multi-server stations without buffers is analized. The input flow at the first station is a ???????????? (Markovian arrival process. The customers from this flow aim to be served at all stations of the tandem. For any station, besides transit customers proceeding from the previous station, an additional ???????????? flow of new customers arrives at this station directly. Customers from this flow aim to be served at this station and all subsequent stations of the tandem. The service times of customer at the stations are exponentially distributed with the service rate depending of number of the station. The algorithms for culculation of stationary distributions and the loss probabilities associated with the tandem are given.

  1. Mathematical adventures in performance analysis from storage systems, through airplane boarding, to express line queues

    CERN Document Server

    Bachmat, Eitan

    2014-01-01

    This monograph describes problems in the field of performance analysis, primarily the study of storage systems and the diverse mathematical techniques that are required for solving such problems. Topics covered include best practices for scheduling I/O requests to a disk drive, how this problem is related to airplane boarding, and how both problems can be modeled using space-time geometry. The author also explains how Riemann's proof of the analytic continuation and functional equation of the Riemann zeta function can be used to analyze express-line queues in a minimarket. Overall, the book reveals the surprising applicability of abstract mathematical ideas that are not usually associated with applied topics. Advanced undergraduate students or graduate students with an interest in the applications of mathematics will find this book a useful resource. It will also be of interest to professional mathematicians who want exposure to the surprising ways that theoretical mathematics may be applied to engineering pr...

  2. M/M/1 RETRIAL QUEUEING SYSTEM WITH VACATION INTERRUPTIONS UNDER PRE-EMPTIVE PRIORITY SERVICE

    Directory of Open Access Journals (Sweden)

    Muthu Ganapathi Subramanian Annasamy

    2010-10-01

    Full Text Available Consider a single server retrial queueing system with pre-emptive priority service and vacation interruptions in which customers arrive in a Poisson process with arrival rate λ1 for low priority customers and λ2 for high priority customers. Further it is assume that the service times follow an exponential distribution with parameters μ1 and μ2 for low and high priority customers respectively. The retrial is introduced for low priority customers only. The server goes for vacation after exhaustively completing the service to both types of customers.  The vacation rate follows an exponential distribution with parameter α. The concept of vacation interruption is used in this paper that is the server comes from the vacation into normal working condition without completing his vacation period subject to some conditions. Let k be the maximum number of waiting spaces for high priority customers in front of the service station. The high priority customers will be governed by the pre-emptive priority service. We assume that the access from orbit to the service facility is governed by the classical retrial policy. This model is solved by using Matrix geometric Technique. Numerical  study  have been done for Analysis of Mean number of low priority customers in the orbit (MNCO, Mean number of high priority customers in the queue(MPQL,Truncation level (OCUT,Probability of server free and Probabilities  of server busy with low and high priority customers and probability of server in vacation for various values of λ1 , λ2 , μ1 , μ2, α and σ  in elaborate manner and also various particular cases of  this model have been discussed.

  3. Transient Analysis of an M/M/1 queue with Multiple Exponential Vacation and N-Policy

    Directory of Open Access Journals (Sweden)

    Vijayashree KV

    2015-12-01

    Full Text Available A single server Markovian queueing model is considered.  The arrivals are allowed to join the queue according to a Poisson distribution and the service takes place according to an exponential distribution.  Whenever the system is empty, the server goes for a vacation and return back to the system after N or more customers are found in the system. If the number of customers in the system is less than ‘’ then the server takes another vacation.  In this paper, we obtain explicit expressions for the time dependent system size probabilities of such a model using Laplace transform and generating function techniques.  Numerical illustrations are added to support the theoretical results obtained.

  4. Performance analysis of preemptive priority retrial queue with immediate Bernoulli feedback under working vacations and vacation interruption

    Directory of Open Access Journals (Sweden)

    Pakkirisami Rajadurai

    2016-10-01

    Full Text Available The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After completion of regular service for ordinary customer, the customer is allowed to make an immediate feedback with probability r. When the orbit becomes empty at service completion instant for a priority customer or ordinary customer; the server goes for multiple working vacations. By using the supplementary variable technique, we obtained the steady state probability generating functions for the system/orbit. Some important system performance measures, the mean busy period and the mean busy cycle are discussed. Finally, some numerical examples are presented.

  5. Flow time analysis of load management late arrival discrete time queueing system with dual service rate using hypo geometrical distribution

    International Nuclear Information System (INIS)

    Shah, S.A.; Shah, W.; Shaikh, F.K.

    2012-01-01

    Flow time analysis is a powerful concept to analyze the flow time of any arriving customer in any system at any instant. A load management mechanism can be employed very effectively in any queueing system by utilizing a system which provides probability of dual service rate. In this paper, we develop and demonstrate the flow and service processes transition diagram to determine the flow time of a customer in a load management late arrival state dependent finite discrete time queueing system with dual service rate where customers are hypo geometrically distributed. We compute the probability mass function of each starting state and total probability mass function. The obtained analytical results are validated with simulation results for varying values of arrival and service probabilities. (author)

  6. On the number of observable customers, served during he busy period of GI/GI/infinity queue

    International Nuclear Information System (INIS)

    Dvurechenskij, A.

    1982-01-01

    It is proved that the number of observable customers, served during the busy period of the GI/GI infinity queue with infinitely many servers has a geometric distribution. The parameter of this distribution is determined, too. It is shown that the normalized distributions converge to the exponential distribution. As a particular result is obtained that the distribution of the number of nonabsorbing streamers in a streamer blob has a geometric distribution

  7. Statistical Inference for a two station tandem queue with atmost one customer to wait between the stations

    Directory of Open Access Journals (Sweden)

    Vaidya Nathan

    2012-03-01

    Full Text Available A maximum likelihood estimator (MLE, a consistent asymptotically normal (CAN estimator and asymptotic confidence limits for the expected number of customers in the system for a sequential two station, single server system with Poisson input and exponential service, where no queue is allowed in front of station 1 and atmost one customer is allowed to wait between the stations and with blocking are obtained.

  8. Applying a foil queue micro-electrode in micro-EDM to fabricate a 3D micro-structure

    Science.gov (United States)

    Xu, Bin; Guo, Kang; Wu, Xiao-yu; Lei, Jian-guo; Liang, Xiong; Guo, Deng-ji; Ma, Jiang; Cheng, Rong

    2018-05-01

    Applying a 3D micro-electrode in a micro electrical discharge machining (micro-EDM) can fabricate a 3D micro-structure with an up and down reciprocating method. However, this processing method has some shortcomings, such as a low success rate and a complex process for fabrication of 3D micro-electrodes. By focusing on these shortcomings, this paper proposed a novel 3D micro-EDM process based on the foil queue micro-electrode. Firstly, a 3D micro-electrode was discretized into several foil micro-electrodes and these foil micro-electrodes constituted a foil queue micro-electrode. Then, based on the planned process path, foil micro-electrodes were applied in micro-EDM sequentially and the micro-EDM results of each foil micro-electrode were able to superimpose the 3D micro-structure. However, the step effect will occur on the 3D micro-structure surface, which has an adverse effect on the 3D micro-structure. To tackle this problem, this paper proposes to reduce this adverse effect by rounded corner wear at the end of the foil micro-electrode and studies the impact of machining parameters on rounded corner wear and the step effect on the micro-structure surface. Finally, using a wire cutting voltage of 80 V, a current of 0.5 A and a pulse width modulation ratio of 1:4, the foil queue micro-electrode was fabricated by wire electrical discharge machining. Also, using a pulse width of 100 ns, a pulse interval of 200 ns, a voltage of 100 V and workpiece material of 304# stainless steel, the foil queue micro-electrode was applied in micro-EDM for processing of a 3D micro-structure with hemispherical features, which verified the feasibility of this process.

  9. An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yugui Qu

    2011-02-01

    Full Text Available Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

  10. Individual dispersal delays in a cooperative breeder: Ecological constraints, the benefits of philopatry and the social queue for dominance.

    Science.gov (United States)

    Nelson-Flower, Martha J; Wiley, Elizabeth M; Flower, Tom P; Ridley, Amanda R

    2018-03-20

    Delayed dispersal is a key step in the evolution of familial animal societies and cooperative breeding. However, no consensus has been reached on the ecological and social circumstances driving delayed dispersal. Here, we test predictions from the ecological constraints and benefits of philopatry hypotheses as well as the recently proposed dual benefits hypothesis to better understand the evolution of group-living and cooperative breeding. Furthermore, we consider how individual social circumstances within groups affect dispersal decisions. We examine 11 years of life-history information on a wild population of cooperatively breeding southern pied babblers Turdoides bicolor. We investigate the effects of ecological conditions, natal-group membership and individual social context on male and female dispersal delays, disperser survival and acquisition of dominance. Female dispersal decisions are generally unconstrained by ecological or social circumstances. In contrast, males disperse in response to relaxed ecological constraints, decreases in nepotistic tolerance or when low social rank in the queue for dominance decreases their likelihood of gaining a dominant breeding position. Early dispersal by end-of-queue males often leads to a head-of-queue subordinate position in a non-natal group, thereby increasing access to dominant breeding positions. However, males and females remaining in natal groups gain benefits of philopatry via increased survival and, for head-of-queue males, very high likelihood of acquisition of a breeding position. Overall, predictions from the dual benefits hypothesis best describe these results, while some predictions from each of the ecological constraints and benefits of philopatry hypotheses were supported. The benefits of living and working together (collective action benefits) in large stable groups are of central importance in shaping dispersal delays in southern pied babbler societies. In addition, position in the subordinate social

  11. A Two-Stage Queue Model to Optimize Layout of Urban Drainage System considering Extreme Rainstorms

    Directory of Open Access Journals (Sweden)

    Xinhua He

    2017-01-01

    Full Text Available Extreme rainstorm is a main factor to cause urban floods when urban drainage system cannot discharge stormwater successfully. This paper investigates distribution feature of rainstorms and draining process of urban drainage systems and uses a two-stage single-counter queue method M/M/1→M/D/1 to model urban drainage system. The model emphasizes randomness of extreme rainstorms, fuzziness of draining process, and construction and operation cost of drainage system. Its two objectives are total cost of construction and operation and overall sojourn time of stormwater. An improved genetic algorithm is redesigned to solve this complex nondeterministic problem, which incorporates with stochastic and fuzzy characteristics in whole drainage process. A numerical example in Shanghai illustrates how to implement the model, and comparisons with alternative algorithms show its performance in computational flexibility and efficiency. Discussions on sensitivity of four main parameters, that is, quantity of pump stations, drainage pipe diameter, rainstorm precipitation intensity, and confidence levels, are also presented to provide guidance for designing urban drainage system.

  12. Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

    Science.gov (United States)

    Chakravarthy, Srinivas R.; Rumyantsev, Alexander

    2018-03-01

    Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

  13. Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

    Directory of Open Access Journals (Sweden)

    Chakravarthy Srinivas R.

    2018-03-01

    Full Text Available Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

  14. An unreliable group arrival queue with k stages of service, retrial under variant vacation policy

    Science.gov (United States)

    Radha, J.; Indhira, K.; Chandrasekaran, V. M.

    2017-11-01

    In this research work we considered repairable retrial queue with group arrival and the server utilize the variant vacations. A server gives service in k stages. Any arriving group of units finds the server free, one from the group entering the first stage of service and the rest are joining into the orbit. After completion of the i th stage of service, the customer may have the option to choose (i+1)th stage of service with probability θi , with probability pi may join into orbit as feedback customer or may leave the system with probability {q}i=≤ft\\{\\begin{array}{l}1-{p}i-{θ }i,i=1,2,\\cdots k-1\\ 1-{p}i,i=k\\end{array}\\right\\}. If the orbit is empty at the service completion of each stage service, the server takes modified vacation until at least one customer appears in the orbit on the server returns from a vacation. Busy server may get to breakdown and the service channel will fail for a short interval of time. By using the supplementary variable method, steady state probability generating function for system size, some system performance measures are discussed.

  15. Three-dimensional flow structure measurements behind a queue of studied model vehicles

    International Nuclear Information System (INIS)

    Huang, J.F.; Chan, T.L.; Zhou, Y.

    2009-01-01

    The three-dimensional flow structures of a queue of studied model vehicles (i.e., one-, two- and three-vehicle cases) were investigated comprehensively in a closed-circuit wind tunnel using particle image velocimetry (PIV) for the typical urban vehicle speeds (i.e., 10, 30 and 50 km/h). In this three-dimensional vehicle wake, a pair of longitudinal vortices is characterized by counter-rotating and moving downstream at relatively low velocity than their surrounding flow. The flow structures of multiple studied model vehicles are dominated by the wake generated from the last studied model vehicle but the preceding studied model vehicle(s) also has/have some minor effects. Cross-sectional turbulence distribution is non-uniform in the far-wake region for all studied cases. The lowest turbulence occurs at the center part of the vehicle wake while high turbulence occurs at its two sides. As such, it may lead to considerable underestimation in turbulence magnitude if the measurement is only taken along the centerline of the vehicle wake.

  16. Architecture and robustness tradeoffs in speed-scaled queues with application to energy management

    Science.gov (United States)

    Dinh, Tuan V.; Andrew, Lachlan L. H.; Nazarathy, Yoni

    2014-08-01

    We consider single-pass, lossless, queueing systems at steady-state subject to Poisson job arrivals at an unknown rate. Service rates are allowed to depend on the number of jobs in the system, up to a fixed maximum, and power consumption is an increasing function of speed. The goal is to control the state dependent service rates such that both energy consumption and delay are kept low. We consider a linear combination of the mean job delay and energy consumption as the performance measure. We examine both the 'architecture' of the system, which we define as a specification of the number of speeds that the system can choose from, and the 'design' of the system, which we define as the actual speeds available. Previous work has illustrated that when the arrival rate is precisely known, there is little benefit in introducing complex (multi-speed) architectures, yet in view of parameter uncertainty, allowing a variable number of speeds improves robustness. We quantify the tradeoffs of architecture specification with respect to robustness, analysing both global robustness and a newly defined measure which we call local robustness.

  17. Approximate anlysis of an unreliable $M/M/c$ retrial queue with phase merging algorithm.

    Directory of Open Access Journals (Sweden)

    faiza BELARBI

    2016-06-01

    Full Text Available In this paper, we investigate an approximate analysis of unreliable $M/M/c$ retrial queue with $c\\geq 3$ in which all servers are subject to breakdowns and repairs. Arriving customers that are unable to access a server due to congestion or failure can choose to enter a retrial orbit for an exponentially distributed amount of time and persistently attempt to gain access to a server, or abandon their request and depart the system. Once a customer is admitted to a service station, they remain there for a random duration until service is complete and then depart the system. However, if the server fails during service, i.e., an active breakdown, the customer may choose to abandon the system or proceed directly to the retrial orbit while the server begins repair immediately. In the unreliable model, there are no exact solutions when the number of servers exceeds one. Therefore, we seek to approximate the steady-state joint distribution of the number of customers in orbit and the status of the $c$ servers for the case of Markovian arrival and service times. Our approach to deriving the approximate steady-state probabilities employs a phase-merging algorithm.

  18. A Multi-Objective Compounded Local Mobile Cloud Architecture Using Priority Queues to Process Multiple Jobs.

    Science.gov (United States)

    Wei, Xiaohui; Sun, Bingyi; Cui, Jiaxu; Xu, Gaochao

    2016-01-01

    As a result of the greatly increased use of mobile devices, the disadvantages of portable devices have gradually begun to emerge. To solve these problems, the use of mobile cloud computing assisted by cloud data centers has been proposed. However, cloud data centers are always very far from the mobile requesters. In this paper, we propose an improved multi-objective local mobile cloud model: Compounded Local Mobile Cloud Architecture with Dynamic Priority Queues (LMCpri). This new architecture could briefly store jobs that arrive simultaneously at the cloudlet in different priority positions according to the result of auction processing, and then execute partitioning tasks on capable helpers. In the Scheduling Module, NSGA-II is employed as the scheduling algorithm to shorten processing time and decrease requester cost relative to PSO and sequential scheduling. The simulation results show that the number of iteration times that is defined to 30 is the best choice of the system. In addition, comparing with LMCque, LMCpri is able to effectively accommodate a requester who would like his job to be executed in advance and shorten execution time. Finally, we make a comparing experiment between LMCpri and cloud assisting architecture, and the results reveal that LMCpri presents a better performance advantage than cloud assisting architecture.

  19. A Multi-Objective Compounded Local Mobile Cloud Architecture Using Priority Queues to Process Multiple Jobs.

    Directory of Open Access Journals (Sweden)

    Xiaohui Wei

    Full Text Available As a result of the greatly increased use of mobile devices, the disadvantages of portable devices have gradually begun to emerge. To solve these problems, the use of mobile cloud computing assisted by cloud data centers has been proposed. However, cloud data centers are always very far from the mobile requesters. In this paper, we propose an improved multi-objective local mobile cloud model: Compounded Local Mobile Cloud Architecture with Dynamic Priority Queues (LMCpri. This new architecture could briefly store jobs that arrive simultaneously at the cloudlet in different priority positions according to the result of auction processing, and then execute partitioning tasks on capable helpers. In the Scheduling Module, NSGA-II is employed as the scheduling algorithm to shorten processing time and decrease requester cost relative to PSO and sequential scheduling. The simulation results show that the number of iteration times that is defined to 30 is the best choice of the system. In addition, comparing with LMCque, LMCpri is able to effectively accommodate a requester who would like his job to be executed in advance and shorten execution time. Finally, we make a comparing experiment between LMCpri and cloud assisting architecture, and the results reveal that LMCpri presents a better performance advantage than cloud assisting architecture.

  20. Analysis of an MAP/PH/1 Queue with Flexible Group Service

    Directory of Open Access Journals (Sweden)

    Brugno Arianna

    2017-03-01

    Full Text Available A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stieltjes transform of the waiting time is obtained. Results are numerically illustrated.

  1. Fight for your breeding right: hierarchy re-establishment predicts aggression in a social queue.

    Science.gov (United States)

    Wong, Marian; Balshine, Sigal

    2011-04-23

    Social aggression is one of the most conspicuous features of animal societies, yet little is known about the causes of individual variation in aggression within social hierarchies. Recent theory suggests that when individuals form queues for breeding, variation in social aggression by non-breeding group members is related to their probability of inheriting breeding status. However, levels of aggression could also vary as a temporary response to changes in the hierarchy, with individuals becoming more aggressive as they ascend in rank, in order to re-establish dominance relationships. Using the group-living fish, Neolamprologus pulcher, we show that subordinates became more aggressive after they ascended in rank. Female ascenders exhibited more rapid increases in aggression than males, and the increased aggression was primarily directed towards group members of adjacent rather than non-adjacent rank, suggesting that social aggression was related to conflict over rank. Elevated aggression by ascenders was not sustained over time, there was no relationship between rank and aggression in stable groups, and aggression given by ascenders was not sex-biased. Together, these results suggest that the need to re-establish dominance relationships following rank ascension is an important determinant of variation in aggression in animal societies.

  2. THREE-MOMENT BASED APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING SYSTEMS

    Directory of Open Access Journals (Sweden)

    T. I. Aliev

    2014-03-01

    Full Text Available The paper deals with the problem of approximation of probability distributions of random variables defined in positive area of real numbers with coefficient of variation different from unity. While using queueing systems as models for computer networks, calculation of characteristics is usually performed at the level of expectation and variance. At the same time, one of the main characteristics of multimedia data transmission quality in computer networks is delay jitter. For jitter calculation the function of packets time delay distribution should be known. It is shown that changing the third moment of distribution of packets delay leads to jitter calculation difference in tens or hundreds of percent, with the same values of the first two moments – expectation value and delay variation coefficient. This means that delay distribution approximation for the calculation of jitter should be performed in accordance with the third moment of delay distribution. For random variables with coefficients of variation greater than unity, iterative approximation algorithm with hyper-exponential two-phase distribution based on three moments of approximated distribution is offered. It is shown that for random variables with coefficients of variation less than unity, the impact of the third moment of distribution becomes negligible, and for approximation of such distributions Erlang distribution with two first moments should be used. This approach gives the possibility to obtain upper bounds for relevant characteristics, particularly, the upper bound of delay jitter.

  3. Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems

    Energy Technology Data Exchange (ETDEWEB)

    Day, Martin V., E-mail: day@math.vt.edu [Virginia Tech, Department of Mathematics (United States)

    2011-12-15

    We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.

  4. Analysis of Single-Server Queue with Phase-Type Service and Energy Harvesting

    Directory of Open Access Journals (Sweden)

    Sergey A. Dudin

    2016-01-01

    Full Text Available We propose a queueing model suitable, for example, for modelling operation of nodes of sensor networks. The sensor node senses a random field and generates packets to be transmitted to the central node. The sensor node has a battery of a finite capacity and harvests energy during its operation from outside (using solar cells, wind turbines, piezoelectric cells, etc.. We assume that, generally speaking, service (transmission of a packet consists of a random number of phases and implementation of each phase requires a unit of energy. If the battery becomes empty, transmission is failed. To reduce the probability of forced transmission termination, we suggest that the packet can be accepted for transmission only when the number of energy units is greater than or equal to some threshold. Under quite general assumptions about the pattern of the arrival processes of packets and energy, we compute the stationary distributions of the system states and the waiting time of a packet in the system and numerically analyze performance measures of the system as functions of the threshold. Validity of Little’s formula and its counterpart is verified.

  5. Computing a constrained control policy for a single-server queueing system

    DEFF Research Database (Denmark)

    Larsen, Christian

    We consider a single-server queueing system designed to serve homogeneous jobs. The jobs arrive to the system after a Poisson process and all processing times are deterministic. There is a set-up cost for starting up production and a holding cost rate is incurred for each job present. Also......, there is a service cost per job, which is a convex function of the service time. The control policy specifies when the server is on or off. It also specifies the state-dependent processing times. In order to avoid a very detailed control policy (which could be hard to implement) we will only allow the server to use...... n different processing times. Hence, we must subdivide the infinite state space into n disjoint sets and for each set decide which processing time to use. We show how to derive a mathematical expression for the long-run average cost per time unit. We also present an algorithm to find the optimal...

  6. Traffic Regulation on Wireless 802.11 Networks Using Multiple Queue Technique

    Science.gov (United States)

    Dhanal, Radhika J.; Patil, G. A.

    2010-11-01

    WLAN technologies are becoming increasingly popular and are platform for many future applications. IEEE 802.11 Wireless LAN (WLAN) is an excellent solution for the broadband wireless networking. This paper presents a simple approach to enhance the performance of real time (RT) and non-real time (NRT) services over the 802.11 WLAN by using some special queues. This requires the system to first identify the type of service and then use the appropriate scheduling algorithm. The admission control algorithm is used first to determine the admission of particular station. Deficit round robin algorithm is used to set the priorities to RT and NRT packets in order to increase the QoS of WLAN. So we can combine both these algorithms by implementing them one after another. The proposed scheme can improve Voice/Data/Video services through simple software upgrades by reducing the delay, jitter and increasing the throughput. Through simulation, we show that the proposed scheme can give better QoS than existing schemes.

  7. The impact of aviation checkpoint queues on optimizing security screening effectiveness

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Adrian J., E-mail: ajlee@citeri.or [Central Illinois Technology and Education Research Institute, 2312 Connie Drive, Springfield, IL 62704-8722 (United States); Jacobson, Sheldon H., E-mail: shj@illinois.ed [Department of Computer Science, University of Illinois at Urbana-Champaign, 201 N. Goodwin Ave. M/C 258, Urbana, IL 61801-2302 (United States)

    2011-08-15

    Passenger screening at aviation security checkpoints is a critical component in protecting airports and aircraft from terrorist threats. Recent developments in screening device technology have increased the ability to detect these threats; however, the average amount of time it takes to screen a passenger still remains a concern. This paper models the queueing process for a multi-level airport checkpoint security system, where multiple security classes are formed through subsets of specialized screening devices. An optimal static assignment policy is obtained which minimizes the steady-state expected amount of time a passenger spends in the security system. Then, an optimal dynamic assignment policy is obtained through a transient analysis that balances the expected number of true alarms with the expected amount of time a passenger spends in the security system. Performance of a two-class system is compared to that of a selective security system containing primary and secondary levels of screening. The key contribution is that the resulting optimal assignment policies increase security and passenger throughput by efficiently and effectively utilizing available screening resources.

  8. The impact of aviation checkpoint queues on optimizing security screening effectiveness

    International Nuclear Information System (INIS)

    Lee, Adrian J.; Jacobson, Sheldon H.

    2011-01-01

    Passenger screening at aviation security checkpoints is a critical component in protecting airports and aircraft from terrorist threats. Recent developments in screening device technology have increased the ability to detect these threats; however, the average amount of time it takes to screen a passenger still remains a concern. This paper models the queueing process for a multi-level airport checkpoint security system, where multiple security classes are formed through subsets of specialized screening devices. An optimal static assignment policy is obtained which minimizes the steady-state expected amount of time a passenger spends in the security system. Then, an optimal dynamic assignment policy is obtained through a transient analysis that balances the expected number of true alarms with the expected amount of time a passenger spends in the security system. Performance of a two-class system is compared to that of a selective security system containing primary and secondary levels of screening. The key contribution is that the resulting optimal assignment policies increase security and passenger throughput by efficiently and effectively utilizing available screening resources.

  9. Building a High Performance Metadata Broker using Clojure, NoSQL and Message Queues

    Science.gov (United States)

    Truslove, I.; Reed, S.

    2013-12-01

    In practice, Earth and Space Science Informatics often relies on getting more done with less: fewer hardware resources, less IT staff, fewer lines of code. As a capacity-building exercise focused on rapid development of high-performance geoinformatics software, the National Snow and Ice Data Center (NSIDC) built a prototype metadata brokering system using a new JVM language, modern database engines and virtualized or cloud computing resources. The metadata brokering system was developed with the overarching goals of (i) demonstrating a technically viable product with as little development effort as possible, (ii) using very new yet very popular tools and technologies in order to get the most value from the least legacy-encumbered code bases, and (iii) being a high-performance system by using scalable subcomponents, and implementation patterns typically used in web architectures. We implemented the system using the Clojure programming language (an interactive, dynamic, Lisp-like JVM language), Redis (a fast in-memory key-value store) as both the data store for original XML metadata content and as the provider for the message queueing service, and ElasticSearch for its search and indexing capabilities to generate search results. On evaluating the results of the prototyping process, we believe that the technical choices did in fact allow us to do more for less, due to the expressive nature of the Clojure programming language and its easy interoperability with Java libraries, and the successful reuse or re-application of high performance products or designs. This presentation will describe the architecture of the metadata brokering system, cover the tools and techniques used, and describe lessons learned, conclusions, and potential next steps.

  10. On Mx/(G1G2/1/G(BS/Vs vacation queue with two types of general heterogeneous service

    Directory of Open Access Journals (Sweden)

    Kailash C. Madan

    2005-01-01

    Full Text Available We analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoulli schedules under a single vacation policy. We obtain explicit queue size distribution at a random epoch as well as at a departure epoch and also the mean busy period of the server under the steady state. In addition, some important performance measures such as the expected queue size and the expected waiting time of a customer are obtained. Further, some interesting particular cases are also discussed.

  11. Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy

    DEFF Research Database (Denmark)

    Kozlowski, Dawid; Worthington, Dave

    2015-01-01

    chain and discrete event simulation models, to provide an insightful analysis of the public hospital performance under the policy rules. The aim of this paper is to support the enhancement of the quality of elective patient care, to be brought about by better understanding of the policy implications...... on the utilization of public hospital resources. This paper illustrates the use of a queue modelling approach in the analysis of elective patient treatment governed by the maximum waiting time policy. Drawing upon the combined strengths of analytic and simulation approaches we develop both continuous-time Markov...

  12. Approximation of the steady state system state distribution of the M/G/1 retrial queue with impatient customers

    Directory of Open Access Journals (Sweden)

    Stihi Nadjet

    2012-01-01

    Full Text Available For M/G/1 retrial queues with impatient customers, we review the results, concerning the steady state distribution of the system state, presented in the literature. Since the existing formulas are cumbersome (so their utilization in practice becomes delicate or the obtaining of these formulas is impossible, we apply the information theoretic techniques for estimating the above mentioned distribution. More concretely, we use the principle of maximum entropy which provides an adequate methodology for computing a unique estimate for an unknown probability distribution based on information expressed in terms of some given mean value constraints.

  13. Queueing System with Heterogeneous Customers as a Model of a Call Center with a Call-Back for Lost Customers

    OpenAIRE

    Dudin, Sergey; Kim, Chesoong; Dudina, Olga; Baek, Janghyun

    2013-01-01

    A multiserver queueing system with infinite and finite buffers, two types of customers, and two types of servers as a model of a call center with a call-back for lost customers is investigated. Type 1 customers arrive to the system according to a Markovian arrival process. All rejected type 1 customers become type 2 customers. Type r, r=1,2, servers serve type r customers if there are any in the system and serve type r′, r′=1,2,  r′≠r, customers if there are no type r customers in the system....

  14. Computation of a near-optimal service policy for a single-server queue with homogeneous jobs

    DEFF Research Database (Denmark)

    Johansen, Søren Glud; Larsen, Christian

    2001-01-01

    We present an algorithm for computing a near-optimal service policy for a single-server queueing system when the service cost is a convex function of the service time. The policy has state-dependent service times, and it includes the options to remove jobs from the system and to let the server...... be off. The systems' semi-Markov decision model has infinite action sets for the positive states. We design a new tailor-made policy-iteration algorithm for computing a policy for which the long-run average cost is at most a positive tolerance above the minimum average cost. For any positive tolerance...

  15. Computation of a near-optimal service policy for a single-server queue with homogeneous jobs

    DEFF Research Database (Denmark)

    Johansen, Søren Glud; Larsen, Christian

    2000-01-01

    We present an algorithm for computing a near optimal service policy for a single-server queueing system when the service cost is a convex function of the service time. The policy has state-dependent service times, and it includes the options to remove jobs from the system and to let the server...... be off. The system's semi-Markov decision model has infinite action sets for the positive states. We design a new tailor-made policy iteration algorithm for computing a policy for which the long-run average cost is at most a positive tolerance above the minimum average cost. For any positive tolerance...

  16. The Question of Queue: Implications for -Best Practice- in Cross-country Transport of Commercial Spent Nuclear Fuel

    International Nuclear Information System (INIS)

    Williams, J.M.

    2009-01-01

    The 'Standard Contract' authorized by the Nuclear Waste Policy Act of 1982 (Section 302(a)) provides that priority for acceptance of spent nuclear fuel (SNF) shall be based on the date of its discharge from civilian nuclear reactors. Through 2007, about 2,100 discharges of about 58,000 metric tons have created a priority ranking (or 'queue') for US DOE spent fuel acceptance and transport. Since 1982, consideration of the task of large-scale, cross-country SNF transport (by the National Academies and others) has led to several recommendations for 'best practice' in such an unprecedented campaign. Many of these recommendations, however, are inconsistent with the acceptance priority established by the Standard Contract, and in fact cannot be implemented under its provisions. This paper considers the SNF acceptance rankings established by the Standard Contract, and the barrier these place on best practice cross-country transport of the nation's inventory of SNF. Using a series of case studies, the paper explores the challenge of best practice transport from selected shipment origins under current arrangements. The case studies support preliminary conclusions regarding the inconsistency between best practice SNF transport and the Standard Contract acceptance queue, with reference to particular origins sites and their utility owners. The paper concludes with a suggestion for resolving the inconsistencies, and recommended next steps in the inquiry. (authors)

  17. Queueing systems with heavy tails (Summary of Ph.D. thesis on the occasion of receiving the Gijs de Leve prize)

    NARCIS (Netherlands)

    Zwart, A.P.

    2003-01-01

    This article gives a short summary of my PhD thesis Queueing Systems with Heavy-tails, winner of the Gijs De Leve prize for the best Dutch thesis in operations research in the period 2000-2002. Apart from the Gijs de Leve prize, this thesis also received the ASML prize, for best thesis in Ihe

  18. STUDY THE EFFECTIVENESS APPLICATIONS OF FUZZY CONTROLLER WITH TWO ENTRANCES IN THE SYSTEM OF ACTIVE QUEUE MANAGEMENT THE PACKETS IN TCP/IP NETWORKS

    Directory of Open Access Journals (Sweden)

    O. V. Nevdachyna

    2016-01-01

    Full Text Available The paper presents an approach to solving the overloading problem in TCP/IP networks. Offered fuzzy controller with two inputs for system of active queue management packages in TCP/IP networks, and investigated its use in these systems with a random change of traffic load. Proposed controller has two inputs, one of which is the value of the difference between the current queue length and the second – the difference between the current level of usage of the buffer. The output of the fuzzy controller calculates the probability of discarding packet.Mathematical model system of active queue management that is studied is presented in an interactive MATLAB system, in wherein also is demonstrated the processes occurring in the system with a random change of traffic load. The research results show that the AQM-system with fuzzy controller with two entrances stable enough maintains the desired current length the queue for sufficiently small values of the probability of dropping/marking packets (at acceptable size of queue q0= 200 packets, the average probability of dropping / marking is not more than 3,5×10–3 or less 0,35% packets is discarded or marked from the total number of incoming packets. The results obtained will help improve the efficiency of the functioning and operation of TCP / IP networks by increasing data transmission quality. this happens due introduction of the proposed controller at the design of new, more efficient routers for networks to minimize the delay of information.

  19. On the Two-Moment Approximation of the Discrete-Time GI/G/1 Queue with a Single Vacation

    Directory of Open Access Journals (Sweden)

    Doo Ho Lee

    2016-01-01

    Full Text Available We consider a discrete-time GI/G/1 queue in which the server takes exactly one vacation each time the system becomes empty. The interarrival times of arriving customers, the service times, and the vacation times are all generic discrete random variables. Under our study, we derive an exact transform-free expression for the stationary system size distribution through the modified supplementary variable technique. Utilizing obtained results, we introduce a simple two-moment approximation for the system size distribution. From this, approximations for the mean system size along with the system size distribution could be obtained. Finally, some numerical examples are given to validate the proposed approximation method.

  20. An Erlang Loss Queue with Time-Phased Batch Arrivals as a Model for Traffic Control in Communication Networks

    Directory of Open Access Journals (Sweden)

    Moon Ho Lee

    2008-01-01

    Full Text Available A multiserver queueing model that does not have a buffer but has batch arrival of customers is considered. In contrast to the standard batch arrival, in which the entire batch arrives at the system during a single epoch, we assume that the customers of a batch (flow arrive individually in exponentially distributed times. The service time is exponentially distributed. Flows arrive according to a stationary Poisson arrival process. The flow size distribution is geometric. The number of flows that can be simultaneously admitted to the system is under control. The loss of any customer from an admitted flow, with a fixed probability, implies termination of the flow arrival. Analysis of the sojourn time and loss probability of an arbitrary flow is performed.

  1. Performance of an M/M/1 Retrial Queue with Working Vacation Interruption and Classical Retrial Policy

    Directory of Open Access Journals (Sweden)

    Tao Li

    2016-01-01

    Full Text Available An M/M/1 retrial queue with working vacation interruption is considered. Upon the arrival of a customer, if the server is busy, it would join the orbit of infinite size. The customers in the orbit will try for service one by one when the server is idle under the classical retrial policy with retrial rate nα, where n is the size of the orbit. During a working vacation period, if there are customers in the system at a service completion instant, the vacation will be interrupted. Under the stable condition, the probability generating functions of the number of customers in the orbit are obtained. Various system performance measures are also developed. Finally, some numerical examples and cost optimization analysis are presented.

  2. Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

    Directory of Open Access Journals (Sweden)

    Gaidamaka Yuliya

    2014-09-01

    Full Text Available Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M[X]|G|1(L,H|(H,R with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode is presented. Numerical examples that allow comparison of the efficiency of both policies are given

  3. Gender and socioeconomic status as determinants of waiting time for inpatient surgery in a system with implicit queue management.

    Science.gov (United States)

    Arnesen, Kjell E; Erikssen, Jan; Stavem, Knut

    2002-12-01

    In a system with implicit queue management, to examine gender and socioeconomic status as determinants of waiting time for inpatient surgery, after adjusting for other potential predictors. A cohort of 452 subjects was examined in outpatient clinics of a general hospital and referred to inpatient surgery. They were followed until scheduled hospital admission (n=396) or until the requested procedure no longer was relevant (n=56). We compared waiting time between groups from referral date until hospital admission, using Kaplan-Meier estimates of waiting times and log rank test. A Cox proportional hazards model was used for assessing the risk ratio (RR) of hospital admission for scheduled surgery. Gender and socioeconomic status could not explain variations in waiting time. However, patients with suspected/verified neoplastic disease or a risk of serious deterioration without treatment had markedly shorter waiting times than the reference groups, with adjusted RR (95% confidence intervals (95%CI)) of time to receiving in-patient surgery of 2.3 (1.7-3.0) and 2.0 (1.3-3.0), respectively. Being on sick leave was associated with shorter waiting time, adjusted RR of 1.7 (1.2-2.5). Referrals from within the hospital or other hospitals had also shorter waiting times than referrals from primary health care physicians, adjusted RR=1.4 (1.1-1.8). There was no evidence of bias against women or people in lower socioeconomic classes in this implicit queue management system. However, patients' access to inpatient surgery was associated with malignancy, prognosis, sick leave status, physician experience, referral pattern and the major diagnosis category.

  4. The productivity and cost-efficiency of models for involving nurse practitioners in primary care: a perspective from queueing analysis.

    Science.gov (United States)

    Liu, Nan; D'Aunno, Thomas

    2012-04-01

    To develop simple stylized models for evaluating the productivity and cost-efficiencies of different practice models to involve nurse practitioners (NPs) in primary care, and in particular to generate insights on what affects the performance of these models and how. The productivity of a practice model is defined as the maximum number of patients that can be accounted for by the model under a given timeliness-to-care requirement; cost-efficiency is measured by the corresponding annual cost per patient in that model. Appropriate queueing analysis is conducted to generate formulas and values for these two performance measures. Model parameters for the analysis are extracted from the previous literature and survey reports. Sensitivity analysis is conducted to investigate the model performance under different scenarios and to verify the robustness of findings. Employing an NP, whose salary is usually lower than a primary care physician, may not be cost-efficient, in particular when the NP's capacity is underutilized. Besides provider service rates, workload allocation among providers is one of the most important determinants for the cost-efficiency of a practice model involving NPs. Capacity pooling among providers could be a helpful strategy to improve efficiency in care delivery. The productivity and cost-efficiency of a practice model depend heavily on how providers organize their work and a variety of other factors related to the practice environment. Queueing theory provides useful tools to take into account these factors in making strategic decisions on staffing and panel size selection for a practice model. © Health Research and Educational Trust.

  5. Performance Evaluation of a M/Geo[xy]/1 Queue with varying probabilities of success which Treats Two Like Jobs As a Single Entity

    Science.gov (United States)

    Gowrishankar, Lavanya; Bhaskar, Vidhyacharan; Sundarammal, K.

    2018-04-01

    The developed model comprises of a single server capable of handling two different job types X and Y type job. Job Y takes more time for execution than job X. The objective is to construct a single server which would replace the standard M/M/2 queuing model The method used to find the relative measures involves the cost equation. The properties of the service distribution are discussed in detail. The maximum likelihood estimates for the parameters are obtained. The results are analytically derived for the M/Geo[xy]/1 model. A comparison is done between the model proposed and the standard M/M/2 queue. From the numerical results, it is observed that the waiting time in queue increases as the number of cycles is increased but however it is more economical than the M/M/2 model with restriction on the number of time slices.

  6. Managing patients' wait time in specialist out-patient clinic using real-time data from existing queue management and ADT systems.

    Science.gov (United States)

    Ju, John Chen; Gan, Soon Ann; Tan Siew Wee, Justine; Huang Yuchi, Peter; Mei Mei, Chan; Wong Mei Mei, Sharon; Fong, Kam Weng

    2013-01-01

    In major cancer centers, heavy patients load and multiple registration stations could cause significant wait time, and can be result in patient complains. Real-time patient journey data and visual display are useful tools in hospital patient queue management. This paper demonstrates how we capture patient queue data without deploying any tracing devices; and how to convert data into useful patient journey information to understand where interventions are likely to be most effective. During our system development, remarkable effort has been spent on resolving data discrepancy and balancing between accuracy and system performances. A web-based dashboard to display real-time information and a framework for data analysis were also developed to facilitate our clinics' operation. Result shows our system could eliminate more than 95% of data capturing errors and has improved patient wait time data accuracy since it was deployed.

  7. Analysis on preemptive priority retrial queue with two types of customers, balking, optional re-service, single vacation and service interruption

    Science.gov (United States)

    Yuvarani, S.; Saravanarajan, M. C.

    2017-11-01

    This paper concerned with performance analysis of single server preemptive priority retrial queue with a single vacation where two types of customers are considered and they are called priority customers and ordinary customers. The ordinary customers arrive in batch into the system. The priority customers do not form any queue. After the completion of regular service, the customers may demand re-service for the previous service without joining the orbit or may leave the system. As soon as the system is empty, the server goes for vacation and the regular busy server can be subjected to breakdown. By using the supplementary variable technique, we obtain the steady-state probability generating functions for the system/orbit size. Some important system performance measures and the stochastic decomposition are discussed. Finally, numerical examples are presented to visualize the effect of parameters on system performance measures.

  8. Optimal hysteretic control for a B M A P / S M / 1 / N queue with two operation modes

    Directory of Open Access Journals (Sweden)

    Dudin Alexander N.

    1999-01-01

    Full Text Available We consider B M A P / S M / 1 type queueing system with finite buffer of size N . The system has two operation modes, which are characterized by the matrix generating function of B M A P -input, the kernel of the semi-Markovian service process, and utilization cost. An algorithm for determining the optimal hysteresis strategy is presented.

  9. Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks

    NARCIS (Netherlands)

    N. Bayer; O.J. Boxma (Onno)

    1995-01-01

    textabstractTwo variants of an M/G/1 queue with negative customers lead to the study of a random walk $bmsX_{n+1=ppart{bmsX_n+bmsxi_n$ where the integer-valued $bmsxi_n$ are not bounded from below or from above, and are distributed differently in the interior of the state-space and on the boundary.

  10. Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

    Directory of Open Access Journals (Sweden)

    A. D. Banik

    2013-01-01

    Full Text Available We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP. The service discipline is P-limited service, also called E-limited with limit variation (ELV where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values N* of N or a maximum limit L^* of L^ as the number of customers served during a service period at a minimum cost.

  11. Steps in Designing Queue and Interview Process using Information System: A Case of Re-registration of New Students in Universitas Negeri Makassar

    Directory of Open Access Journals (Sweden)

    Ansari Saleh Ahmar

    2016-06-01

    Full Text Available Universitas Negeri Makassar (UNM have a number of prospective students is quite a lot. Based on data released by the BAPSI UNM (2015 that the data student candidates of UNM who passed the selection with SNMPTN SBMPTN selection as 3,791 people. If the prospective graduate students interviewed are normally it will take a long time and will certainly make students uncomfortable. Therefore it is necessary design an information systems to solving this problem. This research aim to develop an information system to facilitate the process queue. The method used in this research is to use the three stages in the Software Development Life Cycle method namely Initiation Phase, Development/Acquisition Phase, and Implementation Phase. This information system development using PHP and CodeIgniter as a its framework. This design results will be obtained an queues and interviews information system that can be used to manage the queue and interview data. By implementing this system, it potentially reduce time to wait and the process of managing results of interviews can be obtained directly without a process of inputting interview repeat if done manually.

  12. A geometric process model for M/PH(M/PH)/1/K queue with new service machine procurement lead time

    Science.gov (United States)

    Yu, Miaomiao; Tang, Yinghui; Fu, Yonghong

    2013-06-01

    In this article, we consider a geometric process model for M/PH(M/PH)/1/K queue with new service machine procurement lead time. A maintenance policy (N - 1, N) based on the number of failures of the service machine is introduced into the system. Assuming that a failed service machine after repair will not be 'as good as new', and the spare service machine for replacement is only available by an order. More specifically, we suppose that the procurement lead time for delivering the spare service machine follows a phase-type (PH) distribution. Under such assumptions, we apply the matrix-analytic method to develop the steady state probabilities of the system, and then we obtain some system performance measures. Finally, employing an important Lemma, the explicit expression of the long-run average cost rate for the service machine is derived, and the direct search method is also implemented to determine the optimal value of N for minimising the average cost rate.

  13. A group arrival retrial G - queue with multi optional stages of service, orbital search and server breakdown

    Science.gov (United States)

    Radha, J.; Indhira, K.; Chandrasekaran, V. M.

    2017-11-01

    A group arrival feedback retrial queue with k optional stages of service and orbital search policy is studied. Any arriving group of customer finds the server free, one from the group enters into the first stage of service and the rest of the group join into the orbit. After completion of the i th stage of service, the customer under service may have the option to choose (i+1)th stage of service with θi probability, with pI probability may join into orbit as feedback customer or may leave the system with {q}i=≤ft\\{\\begin{array}{l}1-{p}i-{θ }i,i=1,2,\\cdots k-1\\ 1-{p}i,i=k\\end{array}\\right\\} probability. Busy server may get to breakdown due to the arrival of negative customers and the service channel will fail for a short interval of time. At the completion of service or repair, the server searches for the customer in the orbit (if any) with probability α or remains idle with probability 1-α. By using the supplementary variable method, steady state probability generating function for system size, some system performance measures are discussed.

  14. About influence of input rate random part of nonstationary queue system on statistical estimates of its macroscopic indicators

    Science.gov (United States)

    Korelin, Ivan A.; Porshnev, Sergey V.

    2018-05-01

    A model of the non-stationary queuing system (NQS) is described. The input of this model receives a flow of requests with input rate λ = λdet (t) + λrnd (t), where λdet (t) is a deterministic function depending on time; λrnd (t) is a random function. The parameters of functions λdet (t), λrnd (t) were identified on the basis of statistical information on visitor flows collected from various Russian football stadiums. The statistical modeling of NQS is carried out and the average statistical dependences are obtained: the length of the queue of requests waiting for service, the average wait time for the service, the number of visitors entered to the stadium on the time. It is shown that these dependencies can be characterized by the following parameters: the number of visitors who entered at the time of the match; time required to service all incoming visitors; the maximum value; the argument value when the studied dependence reaches its maximum value. The dependences of these parameters on the energy ratio of the deterministic and random component of the input rate are investigated.

  15. A study on M/G/1 retrial G - queue with two phases of service, immediate feedback and working vacations

    Science.gov (United States)

    Varalakshmi, M.; Chandrasekaran, V. M.; Saravanarajan, M. C.

    2017-11-01

    In this paper, we discuss about the steady state behaviour of M/G/1 retrial queueing system with two phases of services and immediate feedbacks under working vacation policy where the regular busy server is affected due to the arrival of negative customers. Upon arrival if the customer finds the server busy, breakdown or on working vacation it enters an orbit; otherwise the customer enters into the service area immediately. After service completion, the customer is allowed to make finite number of immediate feedback. The feedback service also consists of two phases. At the service completion epoch of a positive customer, if the orbit is empty the server goes for a working vacation. The server works at a lower service rate during working vacation (WV) period. Using the supplementary variable technique, we found out the steady state probability generating function for the system and in orbit. System performance measures and reliability measures are discussed. Finally, some numerical examples are presented to validate the analyticalresults.

  16. A Hybrid Secure Scheme for Wireless Sensor Networks against Timing Attacks Using Continuous-Time Markov Chain and Queueing Model.

    Science.gov (United States)

    Meng, Tianhui; Li, Xiaofan; Zhang, Sha; Zhao, Yubin

    2016-09-28

    Wireless sensor networks (WSNs) have recently gained popularity for a wide spectrum of applications. Monitoring tasks can be performed in various environments. This may be beneficial in many scenarios, but it certainly exhibits new challenges in terms of security due to increased data transmission over the wireless channel with potentially unknown threats. Among possible security issues are timing attacks, which are not prevented by traditional cryptographic security. Moreover, the limited energy and memory resources prohibit the use of complex security mechanisms in such systems. Therefore, balancing between security and the associated energy consumption becomes a crucial challenge. This paper proposes a secure scheme for WSNs while maintaining the requirement of the security-performance tradeoff. In order to proceed to a quantitative treatment of this problem, a hybrid continuous-time Markov chain (CTMC) and queueing model are put forward, and the tradeoff analysis of the security and performance attributes is carried out. By extending and transforming this model, the mean time to security attributes failure is evaluated. Through tradeoff analysis, we show that our scheme can enhance the security of WSNs, and the optimal rekeying rate of the performance and security tradeoff can be obtained.

  17. Curing the queue

    NARCIS (Netherlands)

    Zonderland, Maartje Elisabeth

    2012-01-01

    In this dissertation we study several problems related to the management of healthcare and the cure of disease. In each chapter a hospital capacity distribution problem is analyzed using techniques from operations research, also known as mathematical decision theory. The problems considered are

  18. Queueing and traffic

    NARCIS (Netherlands)

    Baër, Niek

    2015-01-01

    Traffic jams are everywhere, some are caused by constructions or accidents but a large portion occurs naturally. These "natural" traffic jams are a result of variable driving speeds combined with a high number of vehicles. To prevent these traffic jams, we must understand traffic in general, and to

  19. Continuous feedback fluid queues

    NARCIS (Netherlands)

    Scheinhardt, Willem R.W.; van Foreest, N.D.; Mandjes, M.R.H.

    2003-01-01

    We investigate a fluid buffer which is modulated by a stochastic background process, while the momentary behavior of the background process depends on the current buffer level in a continuous way. Loosely speaking the feedback is such that the background process behaves `as a Markov process' with

  20. Numerical and Weight Productivities of Crossbred D’man by Local Queue Fine de l’Ouest Ewes

    Directory of Open Access Journals (Sweden)

    M. Rekik

    2005-01-01

    Full Text Available Productivity of F1 crossbred ewes between the prolific D’man and the local Queue fine de l’Ouest breeds (D’man x QFO mated with terminal sires of the Brune noire de Suisse (BNS breed was evaluated and compared to that of (i QFO and D’man ewes respectively mated to rams of the same breed in a research station (ESAK and of (ii QFO ewes mated to rams of the same breed in a commercial farm (El-Mabrouka. In ESAK station, data collected between 1995 and 2003, and related to 343, 168 and 323 lambings of QFO, D’man, and F1 crosses D’man x QFO ewes, respectively, were used. At birth, the mean litter size was 1.17 ± 0.37, 1.76 ± 0.71, and 1.40 ± 0.54 for ewes of the QFO, D’man, and crosses D’man x QFO genotypes, respectively, whereas at 90 days after lambing, the corresponding figures were 1.13 ± 0.40, 1.65 ± 0.70, and 1.31 ± 0.54. The year of lambing, genotype of the ewe as well as their interaction were significant sources of variation of all litter sizes. At 10 days after lambing, the weight productivity of QFO ewes was 7.3 ± 2.5 kg, and was thus significantly higher (p < 0.05 than that of D’man (6.6 ± 2.7 kg, and D’man x QFO (7.0 ± 2.3 kg ewes. This trend was reversed 90 days after lambing with weight productivity of D’man x QFO, and D’man ewes reaching 22.9 ± 7.7 and 22.5 ± 12.0 kg, respectively, and that of QFO sheep 19.5 ± 6.7 kg. With the exception of the age of the ewe, all other sources of variation highly influenced (p < 0.001 most weight productivity traits. In El-Mabrouka farm, the data used concerned 1048 and 529 lambings of QFO, and D’man x QFO breeds, respectively, that occurred during years 1999, 2000 and 2001. The year of lambing, genotype of the ewe as well as its age were highly significant sources of variation for the litter size at birth. Crossbred ewes produced on average 0.2 lamb more than QFOs (p < 0.05. Difference in productivity at 70 days after lambing was approximately 3 kg in favor of D

  1. A study on an M/G/1 retrial G-queue with unreliable server under variant working vacations policy and vacation interruption

    Directory of Open Access Journals (Sweden)

    Pakkirisami Rajadurai

    2018-02-01

    Full Text Available We consider a single server retrial queueing system with variant working vacations and vacation interruption where the regular busy server is subjected to breakdown due to the arrival of negative customers. As soon as the orbit becomes empty at the time of regular service completion for a positive customer, the server takes at most J number working vacations until at least one customer is received in the orbit when the server returns from a working vacation. During the working vacation period, the server serves at a lower speed service rate (µv<µb. Using the method of supplementary variable technique, we determined the steady state probability generating function for the system and its orbit. We also obtained some analytical expressions for various performance measures such as system state probabilities, the mean orbit size, the mean system size, and reliability measures of this model. Finally, some numerical examples are presented.

  2. Analysis of an M[X]/(G1,G2/1 retrial queueing system with balking, optional re-service under modified vacation policy and service interruption

    Directory of Open Access Journals (Sweden)

    P. Rajadurai

    2014-09-01

    Full Text Available This paper deals with the steady state analysis of batch arrival retrial queueing system with two types of service under modified vacation policy, where each type consists of an optional re-service. An arriving batch may balk the system at some particular times. After the completion of each types of service the customers may re-service of the same type without joining the orbit or may leave the system. If the orbit is empty at the service completion of each types of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. Busy server may breakdown at any instance and the service channel will fail for a short interval of time. The steady state probability generating function for system/orbit size is obtained by using the supplementary variable method. Some system performance measures and numerical illustrations are discussed.

  3. Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures

    Directory of Open Access Journals (Sweden)

    Wenqing Wu

    2014-05-01

    Full Text Available This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its replacement. Under these assumptions, applying a simple method, the probability that the service station is broken, the rate of occurrence of breakdowns of the service station, the probability that the repair facility is being replaced and the rate of occurrence of failures of the repair facility along with other performance measures are obtained. Following the construction of the long-run expected cost function per unit time, the direct search method is implemented for determining the optimum threshold N* that minimises the cost function.

  4. An M[X]/G(a,b/1 Queueing System with Breakdown and Repair, Stand-By Server, Multiple Vacation and Control Policy on Request for Re-Service

    Directory of Open Access Journals (Sweden)

    G. Ayyappan

    2018-06-01

    Full Text Available In this paper, we discuss a non-Markovian batch arrival general bulk service single-server queueing system with server breakdown and repair, a stand-by server, multiple vacation and re-service. The main server’s regular service time, re-service time, vacation time and stand-by server’s service time are followed by general distributions and breakdown and repair times of the main server with exponential distributions. There is a stand-by server which is employed during the period in which the regular server remains under repair. The probability generating function of the queue size at an arbitrary time and some performance measures of the system are derived. Extensive numerical results are also illustrated.

  5. An Empirical Study Of Using New Technology like NFC, AI, RFID etc. to be implemented in shopping malls in ajmer : To Ease Out The Customer Shopping Experience Like Queue Less And Cashless Payment Mode

    OpenAIRE

    Dimple,; Jyoti Kushwah; Manisha Tak; Neeharika singh; Dr. Ajay Singh Jethoo; Vijay Laxmi Kalyani

    2017-01-01

    In today’s world due to rapid development of new shopping trend. The retailers launches new technologies for new shopping trend. In today scenario every people are busy. When we are talking about shopping from stores, shopping malls etc., the customers waiting in queue for long time for payment process. This is a problematic conditions for customers. The traditional shopping trend consuming more time of customers during shopping. To remove this problem many retailers are focussing that how to...

  6. A Comparative Numerical Study of the Spectral Theory Approach of Nishimura and the Roots Method Based on the Analysis of BDMMAP/G/1 Queue

    Directory of Open Access Journals (Sweden)

    Arunava Maity

    2015-01-01

    Full Text Available This paper considers an infinite-buffer queuing system with birth-death modulated Markovian arrival process (BDMMAP with arbitrary service time distribution. BDMMAP is an excellent representation of the arrival process, where the fractal behavior such as burstiness, correlation, and self-similarity is observed, for example, in ethernet LAN traffic systems. This model was first apprised by Nishimura (2003, and to analyze it, he proposed a twofold spectral theory approach. It seems from the investigations that Nishimura’s approach is tedious and difficult to employ for practical purposes. The objective of this paper is to analyze the same model with an alternative methodology proposed by Chaudhry et al. (2013 (to be referred to as CGG method. The CGG method appears to be rather simple, mathematically tractable, and easy to implement as compared to Nishimura’s approach. The Achilles tendon of the CGG method is the roots of the characteristic equation associated with the probability generating function (pgf of the queue length distribution, which absolves any eigenvalue algebra and iterative analysis. Both the methods are presented in stepwise manner for easy accessibility, followed by some illustrative examples in accordance with the context.

  7. Optimal control of M/M/1 two-phase queueing system with state-dependent arrival rate, server breakdowns, delayed repair, and N-policy

    Science.gov (United States)

    Rao, Hanumantha; Kumar, Vasanta; Srinivasa Rao, T.; Srinivasa Kumar, B.

    2018-04-01

    In this paper, we examine a two-stage queueing system where the arrivals are Poisson with rate depends on the condition of the server to be specific: vacation, pre-service, operational or breakdown state. The service station is liable to breakdowns and deferral in repair because of non-accessibility of the repair facility. The service is in two basic stages, the first being bulk service to every one of the customers holding up on the line and the second stage is individual to each of them. The server works under N-policy. The server needs preliminary time (startup time) to begin batch service after a vacation period. Startup times, uninterrupted service times, the length of each vacation period, delay times and service times follows an exponential distribution. The closed form of expressions for the mean system size at different conditions of the server is determined. Numerical investigations are directed to concentrate the impact of the system parameters on the ideal limit N and the minimum base expected unit cost.

  8. A Parallel Virtual Queue Structure for Active Queue Management

    National Research Council Canada - National Science Library

    Jou, Jia-Shiang; Baras, John S

    2003-01-01

    .... However, a great portion of Internet traffic is shortlife web and UDP traffic. Most web traffic has a small file size and its TCP session is mainly operated in the slow start phase with a small congestion window size...

  9. Modeling left turn queue lengths.

    Science.gov (United States)

    2011-01-01

    This guidebook provides methodologies and procedures for using incident data collected at Texas transportation management centers (TMCs) to perform two types of analysis - evaluation/planning analysis and predictive analysis. For the evaluation/plann...

  10. E-Queue Mobile Application

    OpenAIRE

    Khong Yeen Lai; Ooi Bee Chen; Tan Kok Eng; Binti Ibrahim Salizatul Aizah; Tee Peck Ling

    2017-01-01

    Waiting in line is a common experience in daily life, whether for a table at a popular restaurant or for the service at a bank. This experience is not always pleasant for most of people because they always have to wait for a long time to be serviced. The ability to interact with waiting customers is highly desirable because it allows businesses the opportunity to optimize their existing services and offer new services to waiting customers. However, interacting with individuals waiting in a qu...

  11. Extensão do modelo hipercubo para análise de sistemas de atendimento médico emergencial com prioridade na fila Hypercube model extension for the analysis of emergencial medical systems with priority queue

    Directory of Open Access Journals (Sweden)

    Regiane Máximo de Souza

    2013-01-01

    Full Text Available Em alguns sistemas de atendimento médico emergencial, a demanda pelo serviço pode ser alta devido ao atendimento a pacientes em diferentes estados, desde mais graves até mais leves. Nesses sistemas, pode haver formação de filas de usuários aguardando atendimento, e a necessidade de se considerar explicitamente políticas de prioridade nesse atendimento torna-se importante. Neste trabalho propõe-se uma extensão do clássico modelo hipercubo de filas espacialmente distribuídas para considerar fila com prioridade. Para verificar a viabilidade e a aplicabilidade dessa abordagem, utilizam-se dados de um estudo de caso realizado no SAMU de Ribeirão Preto-SP. Foram analisados dois cenários que consideram dois aspectos relevantes: o impacto dos atendimentos de remoção de pacientes e o aumento da demanda nas diversas classes de chamados dos usuários do sistema. O foco é no tempo médio de resposta aos chamados dos usuários, considerado como uma medida de desempenho importante do sistema, principalmente aos chamados de classes com alta prioridade. Os resultados mostram que a abordagem pode ser utilizada para analisar satisfatoriamente sistemas com prioridade de fila.In some emergency medical systems the service demand is high due to the treatment of patients in the range severe to mild. In these systems, may be queues formation and so the need to explicitly consider priority in care is extremely important. In this study we extend the hypercube model to explicitly consider priority queue. In order to verify the feasibility and applicability of this approach, we conducted a case study at Ribeirão Preto´s SAMU (SAMU-RP. We analyzed two alternative scenarios to examine two important issues: the impact of the removals and the effect of increased demand in the different classes of calls of the system. The focus is on the average response time to users, considered as an important performance measure of the system, especially for the high

  12. Um exame dos modelos de redes de filas abertas aplicados a sistemas de manufatura discretos: parte II A survey on open queueing network models applied to discrete manufacturing systems: part II

    Directory of Open Access Journals (Sweden)

    Gabriel R. Bitran

    1995-12-01

    Full Text Available Este artigo apresenta a segunda (e última parte do nosso exame dos modelos de redes de filas abertas aplicados a sistemas de manufatura discretos. Nosso enfoque é em modelos de projeto e planejamento de job-shops. Na primeira parte (BITRAN & MORABITO, 1995b revisamos métodos de decomposição exatos e aproximados para modelos de avaliação de desempenho em sistemas com múltiplas classes de produtos e diversas estações de trabalho. Nesta segunda parte examinamos modelos de otimização de três categorias de problemas: a primeira minimiza o investimento de capital de maneira a atingir uma medida de desempenho (estoque em processo ou leadtime, a segunda busca otimizar a medida de desempenho sujeito às restrições de recursos, e a terceira explora resultados de pesquisas recentes com a redução de complexidade mediante reprojeto da planta e da partição de produtos.This paper presents the second (and last part of our survey on open queueing network models applied to discrete manufacturing systems. We focus on design and planning for job-shops. In the first part (Bitran and Morabito, 1995b we reviewed exact and approximate decomposition methods for performance evaluation models for single and multiple product class systems. The second part reviews optimization models of three categories of problems: the first minimizes capital investment subject to attaining a performance measure (WIP or leadtime, the second seeks to optimize the performance measure subject to resource constraints, and the third explores recent research developments in complexity reduction through shop redesign and products partitioning.

  13. Queueing Models for Mobile Ad Hoc Networks

    NARCIS (Netherlands)

    de Haan, Roland

    2009-01-01

    This thesis presents models for the performance analysis of a recent communication paradigm: \\emph{mobile ad hoc networking}. The objective of mobile ad hoc networking is to provide wireless connectivity between stations in a highly dynamic environment. These dynamics are driven by the mobility of

  14. Message passing with parallel queue traversal

    Science.gov (United States)

    Underwood, Keith D [Albuquerque, NM; Brightwell, Ronald B [Albuquerque, NM; Hemmert, K Scott [Albuquerque, NM

    2012-05-01

    In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.

  15. Some Problems of Queues with Feedback.

    Science.gov (United States)

    1978-11-01

    occur in comr,uter networks , production networks, Street traffic networks , neural networks , and the like . In spite of these potential applications...55— - - - ~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~~~~~~~~~~~~~~ 29 b where h — ~ j ~ . Now, caking the Lap lace —Stieltjes transform of the above k

  16. Video Broadcasting Using Queue Proportional Scheduling

    Directory of Open Access Journals (Sweden)

    Dimitris Toumpakaris

    2007-01-01

    using a Markov Chain approach leading to a method for approximating the packet delay distribution. Based on the resulting distribution, it is discussed how the video encoding rate can be chosen in order to reduce the expected distortion of streams transmitted through Broadcast Channels.

  17. Infinite queueing system with tree structure

    Czech Academy of Sciences Publication Activity Database

    Fajfrová, Lucie

    2006-01-01

    Roč. 42, č. 5 (2006), s. 585-604 ISSN 0023-5954 R&D Projects: GA ČR GA201/03/0478 Institutional research plan: CEZ:AV0Z10750506 Keywords : invariant measures * zero range process * binary tree Subject RIV: BA - General Mathematics Impact factor: 0.293, year: 2006

  18. Analysis of birth-death fluid queues

    NARCIS (Netherlands)

    van Doorn, Erik A.; Scheinhardt, Willem R.W.

    1996-01-01

    We present a survey of techniques for analysing the performance of a reservoir which receives and releases fluid at rates which are determined by the state of a background birth-death process. The reservoir is assumed to be infinitely large, but the state space of the modulating birth-death process

  19. Funnel Heap - A Cache Oblivious Priority Queue

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    2002-01-01

    The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory...

  20. APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING MODELS

    Directory of Open Access Journals (Sweden)

    T. I. Aliev

    2013-03-01

    Full Text Available For probability distributions with variation coefficient, not equal to unity, mathematical dependences for approximating distributions on the basis of first two moments are derived by making use of multi exponential distributions. It is proposed to approximate distributions with coefficient of variation less than unity by using hypoexponential distribution, which makes it possible to generate random variables with coefficient of variation, taking any value in a range (0; 1, as opposed to Erlang distribution, having only discrete values of coefficient of variation.