Dragonfly Topology for Networks Long Bao Presentation

The Dragonfly Topology for networks with Long Bao's insightful presentation. Covering topics like network topology variations, routing algorithms, and system diagrams, this content provides valuable insights into network structures and connectivity. Dive into the details of Bandwidth, Latency, Cost, and Scalability in network design, along with network hierarchy and inter-group connections.

• Dragonfly Topology
• Networks
• Routing Algorithms
• Network Topology
• Connectivity

coes781 Follow

Uploaded on Feb 18, 2025 | 0 Views

Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

Presentation Transcript

1. Dragonfly Topology for networks Long Long Bao Bao Presented by

2. Netwrok

3. Topology

4. Topology B A

5. Topology B A2A3 A1

6. Topology B A Perfect?

7. Topology Bandwidth Latency Cost Scalability

8. Outlet Dragonfly Topology Description Dragonfly Topology Routing Cost analysis Conclusion

9. Dragonfly Topology Description Hierarchical Network Router, Group and System Figure 1. High-level block diagram of a dragonfly topology

10. Dragonfly Topology Description (a, p, h) network O0, O1, , Oh-1 Oh, O1+h, , O2h-1 Ok1-h, O1+k1-h, , Ok1 Inter-Group Interconnection Network ... Router 0 Router 1 Router a-1 K=p+a+h-1 K =a(p+h) K >>K N=ap(ah+1) I0, I1, , Ip-1 Ip, I1+p, , I2p-1 Ik1-p, I1+k1-p, , Ik1

11. Dragonfly Topology Description A simple example (4,2,2) Network R0 R3 R1 R2 R2 R1 R3 R0 R0 R3 R1 R2 R2 R1 R3 R0 R0 R3 R1 R2 R2 R1 R0 R1 R2 R3 R3 R0 R3 R0 R2 R1 R1 R2 R0 R3 R0 R1 R2 R3

12. Dragonfly Topology Description Topology Variations R0 R1 R2 R3 2 2 R0 R1 R2 R3 R4 R5 R6 R7

13. Dragonfly Topology Routing Existing routing algorithm Minimal (Min) Valiant (Max) Universal Globally-Adaptive Load-balanced (UGAL) UGAL-L UGAL-G

14. Dragonfly Topology Routing Minimal and Valiant method 1 5 4 2 1 2 3 R0 R1 R2 R3 R0 R1 R2 R3 3 Non-mininal route mininal route R0 R1 R2 R3

15. Dragonfly Topology Routing UGAL Problems Limited throughput R0 R1 R2 R3 R0 R1 R2 R3 Group 0 Group 1 O0, O1 O2, O3 O4, O5 O7, O8 Non-mininal route R0 R1 R2 R3 mininal route Group 2 I0, I1 I2, I3 I4, I5 I7, I8

16. Dragonfly Topology Routing UGAL Problems High intermediate latency R0 R1 R2 R3 R0 R1 R2 R3 Q1 Q3 Group 0 Q0 Q2 Group 1 R0 R1 R2 R3 Group 2

17. Cost analysis Dimension 3 channels Global Local Inter-group channels Dimension 2 channels 15 15 16 30 15 Dimension 1 channels Inter-group channels Router Router 15 15 Flattened Butterfly Dragonfly (15+15)/(15+15+15+15)=50% 16/(16+15+15+15)=25%

18. Conclusion Less diameter Low cost Small latency Future Work Routing Strategy Research High-radix topology