1 / 31

Enhancing Network Resilience: The DAG Approach at GENI Summer Camp

This project focuses on implementing a Directed Acyclic Graph (DAG) resilient algorithm to minimize packet loss in network systems due to link failures. Participants will gain insights into GENI resources, tools, and terminology, as well as demonstrate their ability to create a destination-oriented DAG. The session will cover the background of link failures, the goals of reducing packet losses, and future work on resilience strategies. Key concepts include boot-strapping DAGs and discovering network topology. Join us for an interactive and informative experience.

onawa
Télécharger la présentation

Enhancing Network Resilience: The DAG Approach at GENI Summer Camp

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. GENI Summer Camp ProjectResilient Networks with DAG HeshamMekky Cheng Jin

  2. Agenda • Background • DAG-resilient algorithm • GENI resource • Implementation • Future work

  3. Background • Link failures cause packets loss. • Goals • Demonstrate understanding of GENI terminology, tools, and resources. • Reduce packet loss. E. M. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 1981

  4. DAG-resilient • Boot-strapping (create DAG) • Generate a random directed acyclic graph (DAG) • Make the random DAG as destination oriented DAG

  5. Boot-strapping SW0 SW1 SW2 SW4 SW3

  6. Boot-strapping SW0 SW1 SW2 SW4 SW3

  7. Boot-strapping SW0 SW1 SW2 SW4 SW3

  8. Boot-strapping SW0 SW1 SW2 SW4 SW3

  9. Boot-strapping SW0 SW1 SW2 SW4 SW3

  10. Boot-strapping SW0 SW1 SW2 SW4 SW3

  11. Boot-strapping SW0 SW1 SW2 SW4 SW3

  12. Boot-strapping SW0 SW1 SW2 SW4 SW3

  13. Boot-strapping SW0 SW1 SW2 SW4 SW3

  14. Boot-strapping SW0 SW1 SW2 SW4 SW3

  15. Boot-strapping SW0 SW1 SW2 SW4 SW3

  16. DAG-resilient • Guarantee resilience (link failures happen) • If another outgoing link exists, take it. • If no outgoing link, reverse all incoming links.

  17. Resilience: another outgoing link exists SW0 SW1 SW2 SW4 SW3

  18. Resilience: another outgoing link exists SW0 SW1 SW2 SW4 SW3

  19. Resilience: another outgoing link exists SW0 SW1 SW2 SW4 SW3

  20. Resilience: another outgoing link exists SW0 SW1 SW2 SW4 SW3

  21. Resilience: no other outgoing link exists SW0 SW1 SW2 SW4 SW3

  22. Resilience: no other outgoing link exists SW0 SW1 SW2 SW4 SW3

  23. Resilience: no other outgoing link exists SW0 SW1 SW2 SW4 SW3

  24. Resilience: no other outgoing link exists SW0 SW1 SW2 SW4 SW3

  25. GENI Resources • Aggregates: Utah ProtoGENI • OpenFlow Switches • Five raw PCs running OpenvSwitch • OpenFlow Controller • Raw PC running POX

  26. GENI Resources

  27. Implementation • Controller discovers the topology. • Controller generates a random DAG. • Given a destination, controller generates a destination oriented DAG. • Install flows

  28. Demo

  29. Future Work • Continue to work on resilience. • Single link fails and another outgoing link exists. • Single link fails and no more outgoing link exists. • Multiple links fail (i.e. node failure).

  30. Thanks!

More Related