fat-tree network topology
E679889
A fat-tree network topology is a hierarchical, tree-like interconnection structure for parallel and distributed systems that increases link bandwidth toward the root to avoid bottlenecks and provide high bisection bandwidth and scalability.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Clos topology | 1 |
| fat-tree network topology canonical | 1 |
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
interconnection network
ⓘ
network topology ⓘ |
| basedOn | tree topology ⓘ |
| canBeImplementedWith |
commodity Ethernet switches
ⓘ
multi-stage switch networks ⓘ |
| commonlyUsedFor |
cloud data center fabrics
ⓘ
cluster interconnects ⓘ |
| connects |
aggregation switches to core switches
ⓘ
edge switches to aggregation switches ⓘ end hosts to edge switches ⓘ |
| differsFrom |
Clos network
NERFINISHED
ⓘ
bus topology ⓘ mesh topology ⓘ ring topology ⓘ simple tree topology ⓘ |
| enables | full bisection bandwidth with sufficient switch ports ⓘ |
| hasAdvantage |
can be built from identical switch building blocks
ⓘ
good scalability with number of switches ⓘ |
| hasCharacteristic |
higher link capacity near the root
ⓘ
multiple equal-cost paths between hosts ⓘ |
| hasDesignGoal |
avoid bottlenecks near the root
ⓘ
provide high aggregate bandwidth ⓘ support large-scale system expansion ⓘ |
| hasLevel |
aggregation layer
ⓘ
core layer ⓘ edge layer ⓘ |
| hasLimitation |
increased cabling complexity
ⓘ
requires careful routing and traffic engineering ⓘ |
| hasProperty |
high bisection bandwidth
ⓘ
multi-path connectivity ⓘ non-blocking under certain traffic patterns ⓘ regular ⓘ scalable ⓘ symmetrical ⓘ |
| hasStructure |
hierarchical
ⓘ
tree-like ⓘ |
| increasesBandwidthToward | root of the tree ⓘ |
| introducedBy | Charles E. Leiserson NERFINISHED ⓘ |
| introducedIn | 1985 ⓘ |
| isInspiredBy | fat-tree data structure in computer science NERFINISHED ⓘ |
| oftenUses |
ECMP routing
ⓘ
layer-3 IP routing in data centers ⓘ |
| originallyProposedFor | VLSI networks ⓘ |
| requires | routing protocols that exploit path diversity ⓘ |
| supports |
fault tolerance via path redundancy
ⓘ
load balancing across multiple paths ⓘ |
| usedIn |
data center networks
ⓘ
distributed systems ⓘ high-performance computing clusters ⓘ parallel computing systems ⓘ |
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Clos topology