Related papers: A Queueing Model for Sleep as a Vacation
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state…
Queueing systems present many opportunities for applying machine-learning predictions, such as estimated service times, to improve system performance. This integration raises numerous open questions about how predictions can be effectively…
Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…
We propose in this article a M/G/c/c state dependent queuing model for road traffic flow. The model is based on finite capacity queuing theory which captures the stationary density-flow relationships. It is also inspired from the…
This paper addresses web object size which is one of important performance measures and affects to service time in multiple access environment. Since packets arrive according to Poission distribution and web service time has arbitrary…
Queueing systems with batch Markovian arrival process (BMAP) have paramount applications in the domain of wireless communication. The BMAP has been used to model the superposition of video sources and to approximate the super-position of…
An efficient system of a queue control and regulation in public spaces is very important in order to avoid the traffic jams and to improve the customer satisfaction. This article offers a detailed road map based on a merger of intelligent…
We study a passenger-taxi double-ended queue with impatient passengers and two-point matching time in this paper. The system considered in this paper is different from those considered in the existing literature, which fully considers the…
Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people.…
We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon…
Continuous Integration and Continuous Deployment (CI/CD) pipelines are central to modern software development. In large organizations, the high volume of builds and tests creates bottlenecks, especially under shared infrastructure. This…
The rapid growth of the travel industry has increased the need for real-time optimization in reservation systems that could take care of huge data and transaction volumes. This study proposes a hybrid framework that ut folds an Artificial…
A single queueing system with time-dependent exponentially distributed arrival processes and exponential machine processes (Kendall notation $M_t/M_t/1$) is analyzed. Modeling the time evolution for the discrete queue-length distribution by…
In this paper we establish a relation between the spread of infectious diseases and the dynamics of so called M/G/1 queues with processor sharing. The in epidemiology well known relation between the spread of epidemics and branching…
To ensure the effective and objective development of transportation networks, it is crucial to identify performance limitations across various subsystems. A timetable-independent assessment of infrastructure capacity at railway junctions is…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class…
Queue networks describe complex stochastic systems of both theoretical and practical interest. They provide the means to assess alterations, diagnose poor performance and evaluate robustness across sets of interconnected resources. In the…
To study electronic transport through chaotic quantum dots, there are two main theoretical approachs. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other…
Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current…