Related papers: Jamming transition in traffic flow under the prior…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
The jamming transition characterizes athermal systems of particles interacting via finite range repulsive potentials, and occurs on increasing the density when particles cannot avoid making contacts with those of their first coordination…
A two-dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major…
Within the Nagel-Schreckenberg traffic flow model we consider the transition from the free flow regime to the jammed regime. We introduce a method of analyzing the data which is based on the local density distribution. This analyzes allows…
We study the information traffic in Barab\'asi-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order…
We consider the transition of the Nagel-Schreckenberg traffic flow model from the free flow regime to the jammed regime. We examine the inhomogeneous character of the system by introducing a new method of analysis which is based on the…
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories,…
Most car-following models show a transition from laminar to ``congested'' flow and vice versa. Deterministic models often have a density range where a disturbance needs a sufficiently large critical amplitude to move the flow from the…
We numerically study jamming transitions in pedestrian flow interacting with an attraction, mostly based on the social force model for pedestrians who can join the attraction. We formulate the joining probability as a function of social…
We investigate the jamming transition in packings of emulsions and granular materials via molecular dynamics simulations. The emulsion model is composed of frictionless droplets interacting via nonlinear normal forces obtained using…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regime, where both the number of servers $s$ and the arrival rate $\lambda$ grow large (taking the service rate as unity), with…
We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnection) Reference Model…
We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic…
The role of friction coefficient, $\mu$, on the jamming properties of disordered, particle packings is studied using computer simulations. Compressed, soft-sphere packings are brought towards the jamming transition - the point where a…
In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…
Most existing routing strategies to improve transport efficiency have little attention what order should the packets be delivered, just simply used first-in-first-out queue discipline. However, it is far from optimal. In this paper we apply…