Related papers: Closed queueing networks under congestion: non-bot…
We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance…
We introduce a macroscopic model for a network of conveyor belts with various speeds and capacities. In a different way from traffic flow models, the product densities are forced to move with a constant velocity unless they reach a maximal…
Traffic congestion is usually observed at the upper streams of bottlenecks such as tunnels. Congestion appears as stop-and-go waves and high density uniform flow. We perform simulations of traffic flow with a bottleneck using the coupled…
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…
Order-independent (OI) queues, introduced by Berezner, Kriel, and Krzesinski in 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…
When suspended particles are pushed by liquid flow through a constricted channel they might either pass the bottleneck without trouble or encounter a permanent clog that will stop them forever. However, they may also flow intermittently…
The flow of a charged-stabilized suspension through a single constricted channel is studied experimentally by tracking the particles individually. Surprisingly, the behavior is found to be qualitatively similar to that of inertial dry…
Maglaras, Moallemi, and Zheng (2021) have introduced a flexible queueing model for fragmented limit-order markets, whose fluid limit remains remarkably tractable. In the present study we prove that, in the limit of small and frequent…
The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers…
A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of…
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…
Given a player is guaranteed the same payoff for each delivery path in a single-cube delivery network, the player's best response is to randomly divide all goods and deliver them to all other nodes, and the best response satisfies the…
We propose a framework for constructing microscopic traffic models from microscopic acceleration patterns that can in principle be experimental measured and proper averaged. The exact model thus obtained can be used to justify the…
Motivated by a wide variety of applications, this paper introduces a general class of networks of stochastic loss systems in which congestion renders lost revenue due to customers or jobs being permanently removed from the system. We seek…
Wirelessly connected vehicles that exchange information about traffic conditions can reduce delays caused by congestion. At a 2-to-1 lane reduction, the improvement in flow past a bottleneck due to traffic with a random mixture of 40%…
We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the $\Delta_{(i)}/G/1$ queue, the customers decide…
We study a class of dynamical multi-commodity flow networks in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a…
We consider a single server system with infinite waiting room in a random environment. The service system and the environment interact in both directions. Whenever the environment enters a prespecified subset of its state space the service…
In this paper, we study the pickup and delivery problem with multiple transportation modalities, and address the challenge of efficiently allocating transportation resources while price matching users with their desired delivery modes. More…
The tandem fluid queueing model is a useful tool for performance analysis and control design for a variety of transportation systems. In this article, we study the joint impact of stochastic capacity and spillback on the long-time…