2010
DOI: 10.1016/j.physa.2010.06.045
|View full text |Cite
|
Sign up to set email alerts
|

Critical phenomena in discrete-time interconnection networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(14 citation statements)
references
References 39 publications
0
13
1
Order By: Relevance
“…Many researchers [5][6][7][8][9][10][11][12][13][14] have used simulation to investigate congestion spread in network topologies. These researchers often find congestion can be modeled as a percolation process on a graph, spreading slowly under increasing load until a critical point.…”
Section: ----------------------------------------------------------57mentioning
confidence: 99%
See 4 more Smart Citations
“…Many researchers [5][6][7][8][9][10][11][12][13][14] have used simulation to investigate congestion spread in network topologies. These researchers often find congestion can be modeled as a percolation process on a graph, spreading slowly under increasing load until a critical point.…”
Section: ----------------------------------------------------------57mentioning
confidence: 99%
“…The most popular deterministic topology was a square lattice, either open [8,13] or folded into a toroid [5-7, 9, 11]. Rykalova et al [12] also used a ring. Echenique et al [14] used a real topology taken from the Internet autonomous system map, circa 2001.…”
Section: Similarities and Variations Among Previous Studiesmentioning
confidence: 99%
See 3 more Smart Citations