Search
Search Results
-
Demonstrating the feasibility of using Wi-Fi sensors for dynamic bus-stop queue length estimation
We demonstrate that a Wi-Fi sensor located at a bus stop can be used to estimate the current queue length of passengers waiting for the bus. These...
-
Estimating customer delay and tardiness sensitivity from periodic queue length observations
A single server commences its service at time zero every day. A random number of customers decide when to arrive to the system so as to minimize the...
-
Heavy traffic queue length scaling in switches with reconfiguration delay
The Adaptive MaxWeight policy achieves optimal throughput for switches with nonzero reconfiguration delay and has been shown to have good delay...
-
Analytic approach to the non-pre-emptive Markovian priority queue
A new approach is developed for the joint queue-length distribution of the two-level non-pre-emptive M/M/ c (i.e. Markovian) priority queue that...
-
Waiting time and queue length analysis of Markov-modulated fluid priority queues
This paper considers a multi-type fluid queue with priority service. The input fluid rates are modulated by a Markov chain, which is common for all...
-
Join-Up-To(m): improved hyperscalable load balancing
Various load balancing policies are known to achieve vanishing waiting times in the large-scale limit, that is, when the number of servers tends to...
-
Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times
We study the occurrence of large queue lengths in the GI / GI / d queue with heavy-tailed Weibull-type service times. Our analysis hinges on a...
-
On the time-dependent behavior of preemptive single-server queueing systems with Poisson arrivals
We present a detailed study of the time-dependent behavior of both the queue-length process and the workload process of various types of preemptive...
-
Exact results for the distribution of the partial busy period for a multi-server queue
Exact explicit results are derived for the distribution of the partial busy period of the M/M/ c multi-server queue for a general number of servers. A...
-
Proofs of conjectures on the competition between observable and unobservable servers
The impact of information about the quality of service on marketing can be demonstrated by a competition between an observable queue and an...
-
Dynamic flow analysis and crowd management for transfer stations: a case study of Suzhou Metro
Transfer stations are important nodes in the metro network, and it is of great significance to study the coordinated organization scheme between...
-
Queueing networks with path-dependent arrival processes
This paper develops a Gaussian model for an open network of queues having a path-dependent net-input process, whose evolution depends on its early...
-
Analysis of second order properties of production–inventory systems with lost sales
We consider a single-item production–inventory system under a base stock policy for inventory control. We model the system as a closed Gordon–Newell...
-
Subexponential asymptotics of asymptotically block-Toeplitz and upper block-Hessenberg Markov chains
This paper studies the subexponential asymptotics of the stationary distribution vector of an asymptotically block-Toeplitz and upper...
-
-
Continuous review (s, Q) inventory system at a service facility with positive order lead times
In this study, a continuous review (s,Q) inventory system with a service facility is examined. There is only one server and a limited number of...
-
An exact root-free method for the expected queue length for a class of discrete-time queueing systems
For a class of discrete-time queueing systems, we present a new exact method of computing both the expectation and the distribution of the queue...
-
On steady-state joint distribution of an infinite buffer batch service Poisson queue with single and multiple vacation
This article considers a single server, infinite buffer, bulk service Poisson queue with single and multiple vacation. The customers are served in...
-
A general “power-of-d” dispatching framework for heterogeneous systems
Intelligent dispatching is crucial to obtaining low response times in large-scale systems. One common scalable dispatching paradigm is the “power-of- d ...
-
Further results of Markovian bulk-arrival and bulk-service queues with general-state-dependent control
This paper aims to provide several further results for a queueing model recently discussed by Chen et al. (Queueing Syst 95:331–378, 2020), i.e. the...
