Presented by Long Bao Netwrok Topology Topology A B Topology A1 B A2 A3 Topology A B Perfect Topology Bandwidth Latency Cost Scalability Outlet Dragonfly Topology Description ID: 706994
Download Presentation The PPT/PDF document "Dragonfly Topology for networks" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Dragonfly Topology for networks
Presented by：Long BaoSlide2
NetwrokSlide3
TopologySlide4
Topology
A
BSlide5
Topology
A1
BA2A3Slide6
Topology
A
B
Perfect?Slide7
Topology
BandwidthLatencyCostScalabilitySlide8
Outlet
Dragonfly Topology DescriptionDragonfly Topology RoutingCost analysisConclusionSlide9
Dragonfly Topology Description
Hierarchical NetworkRouter, Group and System
Figure 1. High-level block diagram of a dragonfly topologySlide10
Dragonfly Topology Description
(a, p, h) networkK=p+a+h-1K’=a(p+h
)K’>>KN=ap(ah+1)Slide11
Dragonfly Topology Description
A simple example—(4,2,2) NetworkSlide12
Dragonfly Topology Description
Topology VariationsSlide13
Dragonfly Topology Routing
Existing routing algorithmMinimal (Min)Valiant (Max)Universal Globally-Adaptive Load-balanced (UGAL)UGAL-LUGAL-GSlide14
Dragonfly Topology Routing
Minimal and Valiant methodSlide15
Dragonfly Topology Routing
UGALProblemsLimited throughputSlide16
Dragonfly Topology Routing
UGALProblemsHigh intermediate latencySlide17
Cost analysis
(15+15)/(15+15+15+15)=50%16/(16+15+15+15)=25%Slide18
Conclusion
Less diameterLow costSmall latencyFuture WorkRouting Strategy ResearchHigh-radix topology