We study the dynamical properties of a collection of models for communication processes, characterized by a single parameter $\xi$ representing the relation between information load of the nodes and its ability to deliver this information. The critical transition to congestion reported so far occurs only for $\xi=1$. This case is well analyzed for different network topologies. We focus of the properties of the order parameter, the susceptibility and the time correlations when approaching the critical point. For $\xi1$ the transition to congestion is discontinuous and congestion nuclei arise
We study a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider cong...
Ohira and Sawatari [Phys. Rev. E 58, 193 (1998)] introduced a simple model for computer network and ...
The interactions between people, technology and modern communication paradigms form large and comple...
We study the dynamical properties of a collection of models for communication processes, characteriz...
We present a simple model of communication in networks with hierarchical branching. We analyze the b...
Many transport processes on networks depend crucially on the underlying network geometry, although t...
The congestion transition triggered by multiple walkers walking along the shortest path on complex n...
Many transport processes on networks depend crucially on the underlying network geometry, although t...
We study the congestion phenomenon in a mathematical model of the data packets traffic in transmissi...
Abstract. The congestion transition triggered by multiple walkers walking along the shortest path on...
Abstract- The problem of traffic congestion in complex net- between the caller node and receiver nod...
International audienceThe equilibrium distributions of a Markovian model describing the interaction ...
There is a growing interest in the study of graphs that evolve over time. Communication networks, pe...
In a time when large amounts of data about social, economical, technological, and biological systems...
We consider data losses in a single node of a packet- switched Internet-like network. We employ two ...
We study a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider cong...
Ohira and Sawatari [Phys. Rev. E 58, 193 (1998)] introduced a simple model for computer network and ...
The interactions between people, technology and modern communication paradigms form large and comple...
We study the dynamical properties of a collection of models for communication processes, characteriz...
We present a simple model of communication in networks with hierarchical branching. We analyze the b...
Many transport processes on networks depend crucially on the underlying network geometry, although t...
The congestion transition triggered by multiple walkers walking along the shortest path on complex n...
Many transport processes on networks depend crucially on the underlying network geometry, although t...
We study the congestion phenomenon in a mathematical model of the data packets traffic in transmissi...
Abstract. The congestion transition triggered by multiple walkers walking along the shortest path on...
Abstract- The problem of traffic congestion in complex net- between the caller node and receiver nod...
International audienceThe equilibrium distributions of a Markovian model describing the interaction ...
There is a growing interest in the study of graphs that evolve over time. Communication networks, pe...
In a time when large amounts of data about social, economical, technological, and biological systems...
We consider data losses in a single node of a packet- switched Internet-like network. We employ two ...
We study a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider cong...
Ohira and Sawatari [Phys. Rev. E 58, 193 (1998)] introduced a simple model for computer network and ...
The interactions between people, technology and modern communication paradigms form large and comple...