Related papers: Queue Length Simulation for Signalized Arterial Ne…
We introduce the {\Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the…
This paper introduces a novel approach employing extreme value theory to analyze queue lengths within a corridor controlled by adaptive controllers. We consider the maximum queue lengths of a signalized corridor consisting of nine…
We propose a macroscopic traffic network flow model suitable for analysis as a dynamical system, and we qualitatively analyze equilibrium flows as well as convergence. Flows at a junction are determined by downstream supply of capacity as…
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…
Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
Due to urbanization and the increase of individual mobility, in most metropolitan areas around the world congestion and inefficient traffic management occur. Highly necessary intelligent traffic control systems, which are able to reduce…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…
The communication networks in real world often couple with each other to save costs, which results in any network does not have a stand-alone function and efficiency. To investigate this, in this paper we propose a transportation model on…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous…
We introduce and analyze two general dynamical models for unidirectional movement of particles along a circular chain and an open chain of sites. The models include a soft version of the simple exclusion principle, that is, as the density…
In this paper, we are concerned with the resilience of locally routed network flows with finite link capacities. In this setting, an external inflow is injected to the so-called origin nodes. The total inflow arriving at each node is routed…
Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…
In the today's Internet and TCP/IP-networks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are…
Motivated by emerging applications in online matching platforms and marketplaces, we study a matching queue. Customers and servers that arrive in a matching queue depart as soon as they are matched. While state-dependent control is an…
We study deterministic continuous-time lossy dynamical flow networks with constant exogenous demands, fixed routing, and finite flow and buffer capacities. In the considered model, when the total net flow in a cell ---consisting of the…
In an increasingly interconnected world, understanding congestion-related phenomena in transportation and their underlying mechanisms is crucial for improving efficiency. As the transportation system becomes denser, different modes of…
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum…