Related papers: Point queue models: a unified approach

During the last decade bike sharing systems have emerged as a public transport mode in urban short trips in more than 500 major cities around the world. For the mobility service mode, many challenges from its operations are not well…

We study networks of interacting queues governed by utility-maximising service-rate allocations in both discrete and continuous time. For {\em finite} networks we establish stability and some steady-state moment bounds under natural…

Two models of a queue are proposed: a human queue and two lines of vehicles before a narrowing. In both models, a queuer tries to evaluate his waiting time, taking into account the delay caused by intruders who jump to the queue front. As…

We develop link rate control policies to minimize the queueing delay of packets in overloaded networks. We show that increasing link rates does not guarantee delay reduction during overload. We consider a fluid queueing model that…

Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism…

It is well known that building analytical performance models in practice is difficult because it requires a considerable degree of proficiency in the underlying mathematics. In this paper, we propose a machine-learning approach to derive…

In this paper we study coordinated multipath routing at the flow-level in networks with routes of length one. As a first step the static case is considered, in which the number of flows is fixed. A clustering pattern in the rate allocation…

With the increasing availability of transaction data collected by digital parking meters, paid curbside parking can be advantageously modeled as a network of interdependent queues. In this article we introduce methods for analyzing a…

The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service…

We present a queuing model of parking dynamics and a model-based prediction method to provide real-time probabilistic forecasts of future parking occupancy. The queuing model has a non-homogeneous arrival rate and time-varying service time…

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…

In this paper, we consider modeling time-dependent multi-server queues that include abandonments and retrials. For the performance analysis of those, fluid and diffusion models called "strong approximations" have been widely used in the…

The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this…

This report presents a novel approach to calculate volumes of trains from a set of requirements describing the transportation demands. The model presented is based on a multi commodity network flow model. The model comprises three different…

Currently, there is no general theory for deriving diffusion approximations of queueing systems with high- or infinite-dimensional state descriptors. In this paper, we explore one path for deriving diffusion limit equations of queueing…

Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain…

Demand for studying queueing systems with multiple servers providing correlated services was created about 60 years ago, motivated by various applications. In recent years, the importance of such studies has been significantly increased,…

Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…

Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…

We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…