Статті в журналах з теми "Service of queues"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Service of queues.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Service of queues".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.
Повний текст джерелаАнотація:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
2
Yurindra, Yurindra, Ari Amir Alkodri, Anisah Anisah, and Supardi Supardi. "Aplikasi Client Server Berbasis Android pada Barbershop The Barbega Menggunakan Model Multi Channel - Single Phase." Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, no. 1 (April 27, 2020): 138. http://dx.doi.org/10.32736/sisfokom.v9i1.837.
Повний текст джерелаАнотація:
A common problem that is often faced by almost most Barbershop is in terms of serving customer queues, for barbershops who have many customers and have many service chairs, then of course a good customer queue service management concept is needed as well. One of the concepts of queuing services for customers is how queue information can reach customers without queuing at the location. For this reason, a queue service concept for customers is needed based on Android. Android is preferred because almost all smartphone users are currently based on Android. The application will be built based on the concept of client server so that the queue service will occur in real time. The Queuing model used is Multi Channel Single Phase, because in the queue at barbershop there will only be one stage of the process, but it requires a lot of queue flow. This can be seen in the structure of the development diagram. By using an Android-based application based on a single phase multi channel model that will be built it is ensured that customers will find it helpful, without having to spend time in a queue customers can order queues and see queues in real time so they can rush to barbershop when it is close to the queue
3
Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 1 (March 2006): 274–81. http://dx.doi.org/10.1239/jap/1143936259.
Повний текст джерелаАнотація:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C1 and C2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
4
Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 01 (March 2006): 274–81. http://dx.doi.org/10.1017/s0021900200001522.
Повний текст джерелаАнотація:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C 1 and C 2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
5
Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 01 (March 1996): 308–26. http://dx.doi.org/10.1017/s0001867800027385.
Повний текст джерелаАнотація:
Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.
6
Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 1 (March 1996): 308–26. http://dx.doi.org/10.2307/1427923.
Повний текст джерелаАнотація:
Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.
7
van Ommeren, Jan-Kees, Ahmad Al Hanbali, and Richard J. Boucherie. "Analysis of polling models with a self-ruling server." Queueing Systems 94, no. 1-2 (November 22, 2019): 77–107. http://dx.doi.org/10.1007/s11134-019-09639-6.
Повний текст джерелаАнотація:
AbstractPolling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.
8
Boxma, Onno, Mayank Saxena, Stella Kapodistria, and Rudesindo Núñez Queija. "Two queues with random time-limited polling." Probability and Mathematical Statistics 37, no. 2 (May 14, 2018): 257–89. http://dx.doi.org/10.19195/0208-4147.37.2.4.
Повний текст джерелаАнотація:
TWO QUEUES WITH RANDOM TIME-LIMITED POLLINGIn this paper, we analyse a single server polling model withtwo queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues withgenerally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is noswitch-over time. For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis.
9
Comte, Céline, and Jan-Pieter Dorsman. "Pass-and-swap queues." Queueing Systems 98, no. 3-4 (April 12, 2021): 275–331. http://dx.doi.org/10.1007/s11134-021-09700-3.
Повний текст джерелаАнотація:
AbstractOrder-independent (OI) queues, introduced by Berezner et al. (Queueing Syst 19(4):345–359, 1995), expanded the family of multi-class queues that are known to have a product-form stationary distribution by allowing for intricate class-dependent service rates. This paper further broadens this family by introducing pass-and-swap (P&S) queues, an extension of OI queues where, upon a service completion, the customer that completes service is not necessarily the one that leaves the system. More precisely, we supplement the OI queue model with an undirected graph on the customer classes, which we call a swapping graph, such that there is an edge between two classes if customers of these classes can be swapped with one another. When a customer completes service, it passes over customers in the remainder of the queue until it finds a customer it can swap positions with, that is, a customer whose class is a neighbor in the graph. In its turn, the customer that is ejected from its position takes the position of the next customer it can be swapped with, and so on. This is repeated until a customer can no longer find another customer to be swapped with; this customer is the one that leaves the queue. After proving that P&S queues have a product-form stationary distribution, we derive a necessary and sufficient stability condition for (open networks of) P&S queues that also applies to OI queues. We then study irreducibility properties of closed networks of P&S queues and derive the corresponding product-form stationary distribution. Lastly, we demonstrate that closed networks of P&S queues can be applied to describe the dynamics of new and existing load-distribution and scheduling protocols in clusters of machines in which jobs have assignment constraints.
10
Boxma, O. J., and W. P. Groenendijk. "Pseudo-conservation laws in cyclic-service systems." Journal of Applied Probability 24, no. 4 (December 1987): 949–64. http://dx.doi.org/10.2307/3214218.
Повний текст джерелаАнотація:
This paper considers single-server, multi-queue systems with cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. A stochastic decomposition for the amount of work in such systems is obtained. This decomposition allows a short derivation of a ‘pseudo-conservation law' for a weighted sum of the mean waiting times at the various queues. Thus several recently proved conservation laws are generalised and explained.
11
Boxma, O. J., and W. P. Groenendijk. "Pseudo-conservation laws in cyclic-service systems." Journal of Applied Probability 24, no. 04 (December 1987): 949–64. http://dx.doi.org/10.1017/s002190020011681x.
Повний текст джерелаАнотація:
This paper considers single-server, multi-queue systems with cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. A stochastic decomposition for the amount of work in such systems is obtained. This decomposition allows a short derivation of a ‘pseudo-conservation law' for a weighted sum of the mean waiting times at the various queues. Thus several recently proved conservation laws are generalised and explained.
12
Ishizaki, Fumio. "Decomposition property in a discrete-time queue with multiple input streams and service interruptions." Journal of Applied Probability 41, no. 02 (June 2004): 524–34. http://dx.doi.org/10.1017/s0021900200014479.
Повний текст джерелаАнотація:
This paper studies a discrete-time single-server queue with two independent inputs and service interruptions. One of the inputs to the queue is an independent and identically distributed process. The other is a much more general process and it is not required to be Markov nor is it required to be stationary. The service interruption process is also general and it is not required to be Markov or to be stationary. This paper shows that a stochastic decomposition property for the virtual waiting-time process holds in the discrete-time single-server queue with service interruptions. To the best of the author's knowledge, no stochastic decomposition results for virtual waiting-time processes in non-work-conserving queues, such as queues with service interruptions, have been obtained before and only work-conserving queues have been studied in the literature.
13
Ishizaki, Fumio. "Decomposition property in a discrete-time queue with multiple input streams and service interruptions." Journal of Applied Probability 41, no. 2 (June 2004): 524–34. http://dx.doi.org/10.1239/jap/1082999083.
Повний текст джерелаАнотація:
This paper studies a discrete-time single-server queue with two independent inputs and service interruptions. One of the inputs to the queue is an independent and identically distributed process. The other is a much more general process and it is not required to be Markov nor is it required to be stationary. The service interruption process is also general and it is not required to be Markov or to be stationary. This paper shows that a stochastic decomposition property for the virtual waiting-time process holds in the discrete-time single-server queue with service interruptions. To the best of the author's knowledge, no stochastic decomposition results for virtual waiting-time processes in non-work-conserving queues, such as queues with service interruptions, have been obtained before and only work-conserving queues have been studied in the literature.
14
Baccelli, F., E. G. Coffman, and E. N. Gilbert. "Tandem Conveyor Queues." Probability in the Engineering and Informational Sciences 3, no. 4 (October 1989): 517–36. http://dx.doi.org/10.1017/s0269964800001364.
Повний текст джерелаАнотація:
This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1– a – b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.
15
Pedarsani, Ramtin, and Jean Walrand. "Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling." Journal of Applied Probability 53, no. 2 (June 2016): 421–33. http://dx.doi.org/10.1017/jpr.2016.10.
Повний текст джерелаАнотація:
Abstract We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routeing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routeing decisions at the queues are independent, stationary, and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routeing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system can be stable. We propose two robust policies: longest-queue scheduling and a new policy called longest-dominating-queue scheduling. We show that longest-queue scheduling is throughput-optimal for two groups of two queues. We also prove the throughput-optimality of longest-dominating-queue scheduling when the network topology is acyclic, for an arbitrary number of groups and queues.
16
Park, Jaesung, and Yujin Lim. "Online Service-Time Allocation Strategy for Balancing Energy Consumption and Queuing Delay of a MEC Server." Applied Sciences 12, no. 9 (April 29, 2022): 4539. http://dx.doi.org/10.3390/app12094539.
Повний текст джерелаАнотація:
MEC servers (MESs) support multiple queues to accommodate the delay requirements of tasks offloaded from end devices or transferred from other MESs. The service time assigned to each queue trades off the queue backlog and energy consumption. Because multiple queues share the computational resources of a MES, optimally scheduling the service time among them is important, reducing the energy consumption of a MES and ensuring the delay requirement of each queue. To achieve a balance between these metrics, we propose an online service-time allocation method that minimizes the average energy consumption and satisfies the average queue backlog constraint. We employ the Lyapunov optimization framework to transform the time-averaged optimization problem into a per-time-slot optimization problem and devise an online service-time allocation method whose time complexity is linear to the number of queues. This method determines the service time for each queue at the beginning of each time slot using the observed queue length and expected workload. We adopt a long short-term memory (LSTM) deep learning model to predict the workload that will be imposed on each queue during a time slot. Using simulation studies, we verify that the proposed method strikes a better balance between energy consumption and queuing delay than conventional methods.
17
Jain, Gautam, and Karl Sigman. "A Pollaczek–Khintchine formula for M/G/1 queues with disasters." Journal of Applied Probability 33, no. 4 (December 1996): 1191–200. http://dx.doi.org/10.2307/3214996.
Повний текст джерелаАнотація:
A disaster occurs in a queue when a negative arrival causes all the work (and therefore customers) to leave the system instantaneously. Recent papers have addressed several issues pertaining to queueing networks with negative arrivals under the i.i.d. exponential service times assumption. Here we relax this assumption and derive a Pollaczek–Khintchine-like formula for M/G/1 queues with disasters by making use of the preemptive LIFO discipline. As a byproduct, the stationary distribution of the remaining service time process is obtained for queues operating under this discipline. Finally, as an application, we obtain the Laplace transform of the stationary remaining service time of the customer in service for unstable preemptive LIFO M/G/1 queues.
18
Jain, Gautam, and Karl Sigman. "A Pollaczek–Khintchine formula for M/G/1 queues with disasters." Journal of Applied Probability 33, no. 04 (December 1996): 1191–200. http://dx.doi.org/10.1017/s0021900200100580.
Повний текст джерелаАнотація:
A disaster occurs in a queue when a negative arrival causes all the work (and therefore customers) to leave the system instantaneously. Recent papers have addressed several issues pertaining to queueing networks with negative arrivals under the i.i.d. exponential service times assumption. Here we relax this assumption and derive a Pollaczek–Khintchine-like formula for M/G/1 queues with disasters by making use of the preemptive LIFO discipline. As a byproduct, the stationary distribution of the remaining service time process is obtained for queues operating under this discipline. Finally, as an application, we obtain the Laplace transform of the stationary remaining service time of the customer in service for unstable preemptive LIFO M/G/1 queues.
19
Evdokimova, Ekaterina, Sabine Wittevrongel, and Dieter Fiems. "A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load." Mathematical Problems in Engineering 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/3298605.
Повний текст джерелаАнотація:
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
Chen, Thomas M. "On the independence of sojourn times in tandem queues." Advances in Applied Probability 21, no. 02 (June 1989): 488–89. http://dx.doi.org/10.1017/s000186780001870x.
Повний текст джерелаАнотація:
Reich (1957) proved that the sojourn times in two tandem queues are independent when the first queue is M/M /1 and the second has exponential service times. When service times in the first queue are not exponential, it has been generally expected that the sojourn times are not independent. A proof for the case of deterministic service times in the first queue is offered here.
21
Chen, Thomas M. "On the independence of sojourn times in tandem queues." Advances in Applied Probability 21, no. 2 (June 1989): 488–89. http://dx.doi.org/10.2307/1427176.
Повний текст джерелаАнотація:
Reich (1957) proved that the sojourn times in two tandem queues are independent when the first queue is M/M /1 and the second has exponential service times. When service times in the first queue are not exponential, it has been generally expected that the sojourn times are not independent. A proof for the case of deterministic service times in the first queue is offered here.
22
Vlasiou, M., and U. Yechiali. "M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES." Probability in the Engineering and Informational Sciences 22, no. 1 (December 18, 2007): 81–106. http://dx.doi.org/10.1017/s0269964808000065.
Повний текст джерелаАнотація:
We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and the service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, anM/G/∞-type queue. A job that is not completed during a visit will have a new service-time requirement sampled from the service-time distribution of the corresponding queue. To the best of our knowledge, this article is the first in which anM/G/∞-type polling system is analyzed. For this polling model, we derive the probability generating function and expected value of the queue lengths and the Laplace–Stieltjes transform and expected value of the sojourn time of a customer. Moreover, we identify the policy that maximizes the throughput of the system per cycle and conclude that under the Hamiltonian-tour approach, the optimal visiting order isindependentof the number of customers present at the various queues at the start of the cycle.
23
Tandra, Rahul, N. Hemachandra, and D. Manjunath. "JOIN MINIMUM COST QUEUE FOR MULTICLASS CUSTOMERS: STABILITY AND PERFORMANCE BOUNDS." Probability in the Engineering and Informational Sciences 18, no. 4 (October 2004): 445–72. http://dx.doi.org/10.1017/s0269964804184027.
Повний текст джерелаАнотація:
We consider a system of K parallel queues providing different grades of service through each of the queues and serving a multiclass customer population. Service differentiation is achieved by specifying different join prices to the queues. Customers of class j define a cost function ψij(ci,xi) for taking service from queue i when the join price for queue i is ci and congestion in queue i is xi and join the queue that minimizes ψij(·,·). Such a queuing system will be called the “join minimum cost queue” (JMCQ) and is a generalization of the join shortest queue (JSQ) system. Non-work-conserving (called Paris Metro pricing system) and work-conserving (called the Tirupati system) versions of the JMCQ are analyzed when the cost to an arrival of joining a queue is a convex combination of the join price for that queue and the expected waiting time in that queue at the arrival epoch. Our main results are for a two-queue system.We obtain stability conditions and performance bounds. To obtain the lower and upper performance bounds, we propose two quasi-birth–death (QBD) processes that are derived from the original systems by suitably truncating the state space. The state space truncation in the non-work-conserving JMCQ follows the method of van Houtum and colleagues. We then show that this method is not applicable to the work-conserving JMCQ and provide sample-path-based proofs to show that the number in each queue is bounded by the number in the corresponding queues of these QBD processes. These sample-path proof techniques might also be of independent interest. We then show that the performance measures like mean queue length and revenue rate of the system are also bounded by the corresponding quantities of these QBD processes. Numerical examples show that these bounds are fairly tight. Finally, we generalize some of these results to systems with more queues.
24
Bambos, Nicholas, and Jean Walrand. "On stability of state-dependent queues and acyclic queueing networks." Advances in Applied Probability 21, no. 03 (September 1989): 681–701. http://dx.doi.org/10.1017/s0001867800018875.
Повний текст джерелаАнотація:
We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.
25
Bambos, Nicholas, and Jean Walrand. "On stability of state-dependent queues and acyclic queueing networks." Advances in Applied Probability 21, no. 3 (September 1989): 681–701. http://dx.doi.org/10.2307/1427642.
Повний текст джерелаАнотація:
We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.
26
Gall, Pierre Le. "Single server queueing networks with varying service times and renewal input." Journal of Applied Mathematics and Stochastic Analysis 13, no. 4 (January 1, 2000): 429–50. http://dx.doi.org/10.1155/s1048953300000368.
Повний текст джерелаАнотація:
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).
27
Setyono, Gusty. "PENERAPAN SISTEM ANTRIAN PELAYANAN (SIAP)." Jurnal Teknologi dan Komunikasi Pemerintahan 2, no. 1 (June 25, 2020): 28–42. http://dx.doi.org/10.33701/jtkp.v2i1.2298.
Повний текст джерелаАнотація:
SIAP (Service Queuing System) application is an innovation in terms of service queues. SIAP is an android based application developed as a form of innovation for better service by considering technological developments to the public. This application provides a registration menu to people who want to do service. By entering the ID number, name and type of service, the registrant (community) can get a queue number. After the community registers, the registrants will be verified by the administrator. After being verified, the registrant gets a queue number. After the registrant gets a queue number then he can immediately come to the Administrative Services and Civil Registration Service to receive services in accordance with the order of the queue number in the SIAP Application. After carrying out the service, the community can see the service status. In addition, there is also a feature of complaints from the public if there are irregularities in the service that are directly conveyed to the leadership without going through the administrator or staff.
Keyword : SIAP (Service Queuing System), service, application, administrator.
28
Hordijk, Arie, and Ger Koole. "On the Assignment of Customers to Parallel Queues." Probability in the Engineering and Informational Sciences 6, no. 4 (October 1992): 495–511. http://dx.doi.org/10.1017/s0269964800002692.
Повний текст джерелаАнотація:
This paper considers routing to parallel queues in which each queue has its own single server and service times are exponential with nonidentical parameters. We give conditions on the cost function such that the optimal policy assigns customers to a faster queue when that server has a shorter queue. The queues may have finite buffers, and the arrival process can be controlled and can depend on the state and routing policy. Hence our results on the structure of the optimal policy are also true when the assigning control is in the “last” node of a network of service centers. Using dynamic programming we show that our optimality results are true in distribution.
29
Devos, Arnaud, Joris Walraevens, Dieter Fiems, and Herwig Bruneel. "Heavy-Traffic Comparison of a Discrete-Time Generalized Processor Sharing Queue and a Pure Randomly Alternating Service Queue." Mathematics 9, no. 21 (October 27, 2021): 2723. http://dx.doi.org/10.3390/math9212723.
Повний текст джерелаАнотація:
This paper compares two discrete-time single-server queueing models with two queues. In both models, the server is available to a queue with probability 1/2 at each service opportunity. Since obtaining easy-to-evaluate expressions for the joint moments is not feasible, we rely on a heavy-traffic limit approach. The correlation coefficient of the queue-contents is computed via the solution of a two-dimensional functional equation obtained by reducing it to a boundary value problem on a hyperbola. In most server-sharing models, it is assumed that the system is work-conserving in the sense that if one of the queues is empty, a customer of the other queue is served with probability 1. In our second model, we omit this work-conserving rule such that the server can be idle in case of a non-empty queue. Contrary to what we would expect, the resulting heavy-traffic approximations reveal that both models remain different for critically loaded queues.
30
Zeng, Yun, and Cathy Honghui Xia. "Optimal bulking threshold of batch service queues." Journal of Applied Probability 54, no. 2 (June 2017): 409–23. http://dx.doi.org/10.1017/jpr.2017.8.
Повний текст джерелаАнотація:
Abstract Batch service has a wide application in manufacturing, communication networks, and cloud computing. In batch service queues with limited resources, one critical issue is to properly schedule the service so as to ensure the quality of service. In this paper we consider an M/G[a,b]/1/N batch service queue with bulking threshold a, max service capacity b, and buffer capacity N, where N can be finite or infinite. Through renewal theory, busy period analysis and decomposition techniques, we demonstrate explicitly how the bulking threshold influences the system performance such as the mean waiting time and time-averaged number of loss customers in batch service queues. We then establish a necessary and sufficient condition on the optimal bulking threshold that minimizes the expected waiting time. Enabled by this condition, we propose a simple algorithm which guarantees to find the optimal threshold in polynomial time. The performance of the algorithm is also demonstrated by numerical examples.
31
Righter, Rhonda, and J. George Shanthikumar. "Extremal properties of the FIFO discipline in queueing networks." Journal of Applied Probability 29, no. 4 (December 1992): 967–78. http://dx.doi.org/10.2307/3214728.
Повний текст джерелаАнотація:
We show that using the FIFO service discipline at single server stations with ILR (increasing likelihood ratio) service time distributions in networks of monotone queues results in stochastically earlier departures throughout the network. The converse is true at stations with DLR (decreasing likelihood ratio) service time distributions. We use these results to establish the validity of the following comparisons:(i) The throughput of a closed network of FIFO single-server queues will be larger (smaller) when the service times are ILR (DLR) rather than exponential with the same means.(ii) The total stationary number of customers in an open network of FIFO single-server queues with Poisson external arrivals will be stochastically smaller (larger) when the service times are ILR (DLR) rather than exponential with the same means.We also give a surprising counterexample to show that although FIFO stochastically maximizes the number of departures by any time t from an isolated single-server queue with IHR (increasing hazard rate, which is weaker than ILR) service times, this is no longer true for networks of more than one queue. Thus the ILR assumption cannot be relaxed to IHR.Finally, we consider multiclass networks of exponential single-server queues, where the class of a customer at a particular station determines its service rate at that station, and show that serving the customer with the highest service rate (which is SEPT — shortest expected processing time first) results in stochastically earlier departures throughout the network, among all preemptive work-conserving policies. We also show that a cµ rule stochastically maximizes the number of non-defective service completions by any time t when there are random, agreeable, yields.
32
Righter, Rhonda, and J. George Shanthikumar. "Extremal properties of the FIFO discipline in queueing networks." Journal of Applied Probability 29, no. 04 (December 1992): 967–78. http://dx.doi.org/10.1017/s0021900200043837.
Повний текст джерелаАнотація:
We show that using the FIFO service discipline at single server stations with ILR (increasing likelihood ratio) service time distributions in networks of monotone queues results in stochastically earlier departures throughout the network. The converse is true at stations with DLR (decreasing likelihood ratio) service time distributions. We use these results to establish the validity of the following comparisons: (i) The throughput of a closed network of FIFO single-server queues will be larger (smaller) when the service times are ILR (DLR) rather than exponential with the same means. (ii) The total stationary number of customers in an open network of FIFO single-server queues with Poisson external arrivals will be stochastically smaller (larger) when the service times are ILR (DLR) rather than exponential with the same means. We also give a surprising counterexample to show that although FIFO stochastically maximizes the number of departures by any time t from an isolated single-server queue with IHR (increasing hazard rate, which is weaker than ILR) service times, this is no longer true for networks of more than one queue. Thus the ILR assumption cannot be relaxed to IHR. Finally, we consider multiclass networks of exponential single-server queues, where the class of a customer at a particular station determines its service rate at that station, and show that serving the customer with the highest service rate (which is SEPT — shortest expected processing time first) results in stochastically earlier departures throughout the network, among all preemptive work-conserving policies. We also show that a cµ rule stochastically maximizes the number of non-defective service completions by any time t when there are random, agreeable, yields.
33
Boon, M. A. A., and E. M. M. Winands. "HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS." Probability in the Engineering and Informational Sciences 28, no. 4 (June 27, 2014): 451–71. http://dx.doi.org/10.1017/s0269964814000096.
Повний текст джерелаАнотація:
In this paper, we study a two-queue polling model with zero switchover times and k-limited service (serve at most ki customers during one visit period to queue i, i=1, 2) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as the number of customers in a vacation system with Erlang-k2 distributed vacations. The queue-length distribution of the critically loaded queue, after applying an appropriate scaling, is exponentially distributed. Finally, we show that the two queue-length processes are independent in heavy traffic.
34
Sparaggis, P. D., D. Towsley, and C. G. Cassandras. "Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates." Journal of Applied Probability 30, no. 1 (March 1993): 223–36. http://dx.doi.org/10.2307/3214634.
Повний текст джерелаАнотація:
We consider the problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities. Service rates are state-dependent and non-decreasing with respect to queue lengths. We establish the extremal properties of the shortest non-full queue (SNQ) and the longest non-full queue (LNQ) policies, in systems with concave/convex service rates. Our analysis is based on the weak majorization of joint queue lengths which leads to stochastic orderings of critical performance indices. Moreover, we solve the buffer allocation problem, i.e. the problem of how to distribute a number of buffers among the queues. The two optimal allocation schemes are also ‘extreme', in the sense of capacity balancing. Some extensions are also discussed.
35
Sparaggis, P. D., D. Towsley, and C. G. Cassandras. "Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates." Journal of Applied Probability 30, no. 01 (March 1993): 223–36. http://dx.doi.org/10.1017/s0021900200044120.
Повний текст джерелаАнотація:
We consider the problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities. Service rates are state-dependent and non-decreasing with respect to queue lengths. We establish the extremal properties of the shortest non-full queue (SNQ) and the longest non-full queue (LNQ) policies, in systems with concave/convex service rates. Our analysis is based on the weak majorization of joint queue lengths which leads to stochastic orderings of critical performance indices. Moreover, we solve the buffer allocation problem, i.e. the problem of how to distribute a number of buffers among the queues. The two optimal allocation schemes are also ‘extreme', in the sense of capacity balancing. Some extensions are also discussed.
36
He, Shuangchi. "Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient." Operations Research 68, no. 4 (July 2020): 1265–84. http://dx.doi.org/10.1287/opre.2019.1917.
Повний текст джерелаАнотація:
The analysis of queues with multiple servers is typically challenging when the service time distribution is general. Such analysis usually involves an infinite-dimensional process for tracking service ages or residual service times. In “Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient,” He demonstrates from a macroscopic perspective that, if customers are relatively patient and the system is overloaded, the dynamics of a many-server queue could be as simple as the dynamics of a single-server queue. In particular, the virtual waiting time process can be captured by a one-dimensional diffusion process, which enables us to obtain simple formulas for performance measures, such as service levels and effective abandonment fractions. To justify this diffusion model, a functional central limit theorem is established for the superposition of stationary renewal processes.
37
Tu, Rungting, Wenting Feng, Cheryl Lin, and Pikuei Tu. "Read into the lines: the positive effects of queues." Journal of Service Theory and Practice 28, no. 5 (September 10, 2018): 661–81. http://dx.doi.org/10.1108/jstp-07-2017-0119.
Повний текст джерелаАнотація:
PurposeCompanies work hard to reduce queue lengths due to the common belief that queues in general are undesirable. Extant literature mainly has focused on the negative consequences of queues and overlooked the potential positive effects. The purpose of this paper is to address the benefits of queues by examining how consumers of different segments may read into the lines (queues) as well as why and when positive effects occur.Design/methodology/approachApplying and integrating psychology and marketing theories, the study develops a model with several propositions to identify and explain the mechanism and conditions under which queues have positive effects.FindingsContrary to conventional belief, queues may serve as positive signs. In certain segments, consumers can perceive a queue as a reflection of superior service/product quality, an opportunity to fulfill the need(s) for self-uniqueness or social inclusion or an avenue to avoid social exclusion. In addition, the benefits of long queues may come from consumers’ joining a line to seek desirable outcomes/gains based on their attribution of the queue, and consumers’ prefactual thinking that regards “not joining” the queue as potential losses. Furthermore, the magnitude of such effects depends on queue distinctiveness, choice heterogeneity, consumption hedonism and performance uncertainty.Originality/valueThis paper explains how, why and when a long queue can be read as positive cues and benefits both the firms and target/potential consumers. The authors demonstrate the psychological mechanisms of joining a queue based on attribution and prefactual thinking, and identify conditions under which positive queue effects are most likely to occur.
38
Lee, Ho Woo, Soon Seok Lee, and K. C. Chae. "A fixed-size batch service queue with vacations." Journal of Applied Mathematics and Stochastic Analysis 9, no. 2 (January 1, 1996): 205–19. http://dx.doi.org/10.1155/s1048953396000196.
Повний текст джерелаАнотація:
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.
39
Szczotka, Władysław. "Exponential approximation of waiting time and queue size for queues in heavy traffic." Advances in Applied Probability 22, no. 01 (March 1990): 230–40. http://dx.doi.org/10.1017/s000186780001942x.
Повний текст джерелаАнотація:
An exponential approximation for the stationary waiting time distribution and the stationary queue size distribution for single-server queues in heavy traffic is given for a wide class of queues. This class contains for example not only queues for which the generic sequence, i.e. the sequence of service times and interarrival times, is stationary but also such queues for which the generic sequence is asymptotically stationary in some sense. The conditions ensuring the exponential approximation of the characteristics considered in heavy traffic are expressed in terms of the invariance principle for the stationary representation of the generic sequence and its first two moments.
40
Szczotka, Władysław. "Exponential approximation of waiting time and queue size for queues in heavy traffic." Advances in Applied Probability 22, no. 1 (March 1990): 230–40. http://dx.doi.org/10.2307/1427606.
Повний текст джерелаАнотація:
An exponential approximation for the stationary waiting time distribution and the stationary queue size distribution for single-server queues in heavy traffic is given for a wide class of queues. This class contains for example not only queues for which the generic sequence, i.e. the sequence of service times and interarrival times, is stationary but also such queues for which the generic sequence is asymptotically stationary in some sense. The conditions ensuring the exponential approximation of the characteristics considered in heavy traffic are expressed in terms of the invariance principle for the stationary representation of the generic sequence and its first two moments.
41
Susanto, Edi, and Fidianti SE. "ANALISIS PERBANDINGAN SISTEM ANTRIAN MODEL M/M/1 DAN M/M/S UNTUK PELAYANAN PBB DI DPKAD KABUPATEN PURWAKARTA." Eqien: Jurnal Ekonomi dan Bisnis 3, no. 2 (October 6, 2018): 19–30. http://dx.doi.org/10.34308/eqien.v3i2.25.
Повний текст джерелаАнотація:
Research on the comparative analysis of single channel queuing system and multiple channel query system with 2 fasilties and 3 facilities. This study aims to investigate how the optimal number of facilities due to the large queues waiting for their turn receive services especially Pajak Bumi dan Bangunan in the Office of Dinas Pengelola Keuangan dan Aset Daerah Kabupaten Purwakarta.The analytical method used is the model M / M / 1 for single channel system query and M / M / S is used for multiple channel query system. based on the results of the analysis using the model found that the results of a query using a single channel system services Pajak Bumi dan Bangunan certainly not optimal due to the ability of the service itself 12 people per hour. On the other side using the model M / M / S found the average amount of time service during rush hour period 10:00 to 11:00 of 0:15 hours or can be 9 minute and an average queue length 1.0667. In contrast to the number 3 facility, the taxpayer at a busy period 10:00 to 11:00 can wait with a difference of only 0.0923 hours or 5:54 minutes and the number of queues waiting with an average of 0.1446.Suggestion research obtained in order to use the three facilities while maintaining the service with optimal. So that all service activities will not be interrupted and did not make the queue longer taxpayer.Keyword : Queue, single channel queuing system and multiple channel query system, services, tax payer
42
Guillemin, Fabrice, Philippe Robert, and Bert Zwart. "Tail asymptotics for processor-sharing queues." Advances in Applied Probability 36, no. 02 (June 2004): 525–43. http://dx.doi.org/10.1017/s0001867800013598.
Повний текст джерелаАнотація:
The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the reduced-service-rate approximation is established when service times are heavy tailed. This result is applied to various models based on M/G/1 processor-sharing queues.
43
Guillemin, Fabrice, Philippe Robert, and Bert Zwart. "Tail asymptotics for processor-sharing queues." Advances in Applied Probability 36, no. 2 (June 2004): 525–43. http://dx.doi.org/10.1239/aap/1086957584.
Повний текст джерелаАнотація:
The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the reduced-service-rate approximation is established when service times are heavy tailed. This result is applied to various models based on M/G/1 processor-sharing queues.
44
Hirayama, Tetsuji, Masaaki Kijima, and Shoichi Nishimura. "Further results for dynamic scheduling of multiclass G/G/1 queues." Journal of Applied Probability 26, no. 03 (September 1989): 595–603. http://dx.doi.org/10.1017/s0021900200038183.
Повний текст джерелаАнотація:
We consider discrete-time dynamic scheduling problems of the following three types ofG/G/1 queue withKdifferent customer classes: (i) aG/DFR/1 queue withKclasses under preemptive resume service discipline, (ii) aG/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) aG/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for aG/M/1 queue by Buyukkoc et al. (1985) to general queues.
45
Dimitriou, Ioannis. "A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES." Probability in the Engineering and Informational Sciences 31, no. 2 (January 23, 2017): 139–79. http://dx.doi.org/10.1017/s0269964816000528.
Повний текст джерелаАнотація:
We consider a single server system accepting two types of retrial customers, which arrive according to two independent Poisson streams. The service station can handle at most one customer, and in case of blocking, typeicustomer,i=1, 2, is routed to a separate typeiorbit queue of infinite capacity. Customers from the orbits try to access the server according to the constant retrial policy. We consider coupled orbit queues, and thus, when both orbit queues are non-empty, the orbit queueitries to re-dispatch a blocked customer of typeito the main service station after an exponentially distributed time with rate μi. If an orbit queue empties, the other orbit queue changes its re-dispatch rate from μito$\mu_{i}^{\ast}$. We consider both exponential and arbitrary distributed service requirements, and show that the probability generating function of the joint stationary orbit queue length distribution can be determined using the theory of Riemann (–Hilbert) boundary value problems. For exponential service requirements, we also investigate the exact tail asymptotic behavior of the stationary joint probability distribution of the two orbits with either an idle or a busy server by using the kernel method. Performance metrics are obtained, computational issues are discussed and a simple numerical example is presented.
46
Calvert, Bruce, Wiremu Solomon, and Ilze Ziedins. "Braess's paradox in a queueing network with state-dependent routing." Journal of Applied Probability 34, no. 1 (March 1997): 134–54. http://dx.doi.org/10.2307/3215182.
Повний текст джерелаАнотація:
We consider initially two parallel routes, each of two queues in tandem, with arriving customers choosing the route giving them the shortest expected time in the system, given the queue lengths at the customer's time of arrival. All interarrival and service times are exponential.We then augment this network to obtain a Wheatstone bridge, in which customers may cross from one route to the other between queues, again choosing the route giving the shortest expected time in the system, given the queue lengths ahead of them.We find that Braess's paradox can occur: namely in equilibrium the expected transit time in the augmented network, for some service rates, can be greater than in the initial network.
47
Calvert, Bruce, Wiremu Solomon, and Ilze Ziedins. "Braess's paradox in a queueing network with state-dependent routing." Journal of Applied Probability 34, no. 01 (March 1997): 134–54. http://dx.doi.org/10.1017/s0021900200100774.
Повний текст джерелаАнотація:
We consider initially two parallel routes, each of two queues in tandem, with arriving customers choosing the route giving them the shortest expected time in the system, given the queue lengths at the customer's time of arrival. All interarrival and service times are exponential. We then augment this network to obtain a Wheatstone bridge, in which customers may cross from one route to the other between queues, again choosing the route giving the shortest expected time in the system, given the queue lengths ahead of them. We find that Braess's paradox can occur: namely in equilibrium the expected transit time in the augmented network, for some service rates, can be greater than in the initial network.
48
Koole, Ger, Panayotis D. Sparaggis, and Don Towsley. "Minimizing response times and queue lengths in systems of parallel queues." Journal of Applied Probability 36, no. 04 (December 1999): 1185–93. http://dx.doi.org/10.1017/s0021900200017952.
Повний текст джерелаАнотація:
We consider the problem of routeing customers to one of two parallel queues. Arrivals are independent of the state of the system but otherwise arbitrary. Assuming that queues have infinite capacities and the service times form a sequence of i.i.d. random variables with increasing likelihood ratio (ILR) distribution, we prove that the shortest queue (SQ) policy minimizes various cost functionals related to queue lengths and response times. We give a counterexample which shows that this result is not generally true when the service times have increasing hazard rate but are not increasing in the likelihood rate sense. Finally, we show that when capacities are finite the SQ policy stochastically maximizes the departure process and minimizes the loss counting process.
49
Koole, Ger, Panayotis D. Sparaggis, and Don Towsley. "Minimizing response times and queue lengths in systems of parallel queues." Journal of Applied Probability 36, no. 4 (December 1999): 1185–93. http://dx.doi.org/10.1239/jap/1032374764.
Повний текст джерелаАнотація:
We consider the problem of routeing customers to one of two parallel queues. Arrivals are independent of the state of the system but otherwise arbitrary. Assuming that queues have infinite capacities and the service times form a sequence of i.i.d. random variables with increasing likelihood ratio (ILR) distribution, we prove that the shortest queue (SQ) policy minimizes various cost functionals related to queue lengths and response times. We give a counterexample which shows that this result is not generally true when the service times have increasing hazard rate but are not increasing in the likelihood rate sense. Finally, we show that when capacities are finite the SQ policy stochastically maximizes the departure process and minimizes the loss counting process.
50
Al Hanbali, A., M. Mandjes, Y. Nazarathy, and W. Whitt. "The asymptotic variance of departures in critically loaded queues." Advances in Applied Probability 43, no. 1 (March 2011): 243–63. http://dx.doi.org/10.1239/aap/1300198521.
Повний текст джерелаАнотація:
We consider the asymptotic variance of the departure counting processD(t) of the GI/G/1 queue;D(t) denotes the number of departures up to timet. 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+cs2), where λ is the arrival rate, andca2andcs2are squared coefficients of variation of the interarrival and service times, respectively. As a consequence, the departures variability has a remarkable singularity in the case in which ϱ equals 1, in line with the BRAVO (balancing reduces asymptotic variance of outputs) effect which was previously encountered in finite-capacity birth-death queues. Under certain technical conditions, our result generalizes to multiserver queues, as well as to queues with more general arrival and service patterns. For the M/M/1 queue, we present an explicit expression of the variance ofD(t) for anyt.