Phase transition in a computer network traffic model

Ohira, Toru; Sawatari, Ryusuke

doi:10.1103/physreve.58.193

Cited by 243 publications

(190 citation statements)

References 14 publications

Supporting

Mentioning

182

Contrasting

Unclassified

Order By: Relevance

“…In [18] we proposed a general form although in this paper we will only show results for the case in which the number of delivered packets is constant. This particular case is consistent with simple models of computer queues [14], although the precise definition of the models may differ from ours. The election of the functional form for the quality of the channels and the capability of the nodes is arbitrary.…”

Section: Description Of the Modelsupporting

confidence: 88%

Search and Congestion in Complex Networks

Arenas

Cabrales

Dı́az-Guilera

et al. 2003

Statistical Mechanics of Complex Networks

View full text Add to dashboard Cite

show abstract

Section: Description Of the Modelsupporting

confidence: 88%

Search and Congestion in Complex Networks

Arenas

Cabrales

Dı́az-Guilera

et al. 2003

Statistical Mechanics of Complex Networks

View full text Add to dashboard Cite

show abstract

“…In the square lattice model of a computer network developed by Ohira and Sawatari [310] information packets are generated at the sites on the boundary at a rate λ with the corresponding destination addresses chosen randomly from among the boundary sites. The packets can form queues of unlimited length at the the inner nodes, which act as routers of the network.…”

Section: Computer Networkmentioning

confidence: 99%

“…Computing the average lifetime as a function of the birth rate λ of the packets, Ohira and Sawatari [310] observed a transition from a low-congestion phase to a high-congestion phase at a non-zero finite value λ * .…”

Section: Computer Networkmentioning

confidence: 99%

Statistical physics of vehicular traffic and some related systems

2000

View full text Add to dashboard Cite

In the so-called "microscopic" models of vehicular traffic, attention is paid explicitly to each individual vehicle each of which is represented by a "particle"; the nature of the "interactions" among these particles is determined by the way the vehicles influence each others' movement. Therefore, vehicular traffic, modeled as a system of interacting "particles" driven far from equilibrium, offers the possibility to study various fundamental aspects of truly nonequilibrium systems which are of current interest in statistical physics. Analytical as well as numerical techniques of statistical physics are being used to study these models to understand rich variety of physical phenomena exhibited by vehicular traffic. Some of these phenomena, observed in vehicular traffic under different circumstances, include transitions from one dynamical phase to another, criticality and self-organized criticality, metastability and hysteresis, phase-segregation, etc. In this critical review, written from the perspective of statistical physics, we explain the guiding principles behind all the main theoretical approaches. But we present detailed discussions on the results obtained mainly from the so-called "particle-hopping" models, particularly emphasizing those which have been formulated in recent years using the language of cellular automata.

show abstract

“…(2) For another, the routing protocol designed in multirouter network environment: congestion was represented by the phase transition of traffic flow [20], which meant the free flow state became a congestion state. At present, routing protocol can be divided into global algorithm and local algorithm.…”

Section: Related Workmentioning

confidence: 99%

Consensus Congestion Control in Multirouter Networks Based on Multiagent System

Yang

2017

Complexity

View full text Add to dashboard Cite

Due to the unbalance distribution of network resources and network traffic, congestion is an inherent property of the Internet. The consensus congestion controller based on the multiagent system theory is designed for the multirouter topology, which improves the performance of the whole networks. Based on the analysis of the causes of congestion, the topology of multirouter networks is modeled based on the graph theory and the network congestion control problem is described as a consensus problem in multiagent systems. Simulation results by MATLAB and Ns2 indicate that the proposed algorithm maintains a high throughput and a low packet drip ratio and improves the quality of the service in the complex network environment.

show abstract

Phase transition in a computer network traffic model

Cited by 243 publications

References 14 publications

Search and Congestion in Complex Networks

Search and Congestion in Complex Networks

Statistical physics of vehicular traffic and some related systems

Consensus Congestion Control in Multirouter Networks Based on Multiagent System

Contact Info

Product

Resources

About