Presentation is loading. Please wait.

Presentation is loading. Please wait.

GENI Summer Camp Project Resilient Networks with DAG

Published byAarno Mikkola Modified over 5 years ago

Similar presentations

Presentation on theme: "GENI Summer Camp Project Resilient Networks with DAG"— Presentation transcript:

1 GENI Summer Camp Project Resilient Networks with DAG
Hesham Mekky 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!

31

Download ppt "GENI Summer Camp Project Resilient Networks with DAG"

Similar presentations

Interconnection Networks: Flow Control and Microarchitecture.

Interconnection Networks: Flow Control and Microarchitecture.
CCNA3 v3 Module 7 v3 CCNA 3 Module 7 JEOPARDY K. Martin.

CCNA3 v3 Module 7 v3 CCNA 3 Module 7 JEOPARDY K. Martin.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
TORA! TORA! TORA! By Jansen Cohoon. Developing TORA TORA was funded by the Army Research Laboratory. TORA is presently being transitioned into the commercial.

TORA! TORA! TORA! By Jansen Cohoon. Developing TORA TORA was funded by the Army Research Laboratory. TORA is presently being transitioned into the commercial.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1/14 Ad Hoc Networking, 3.2.2004 Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.

1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.

Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.
TORA : Temporally Ordered Routing Algorithm Invented by Vincent Park and M.Scott Corson from University of Maryland. TORA is an on-demand routing protocol.

TORA : Temporally Ordered Routing Algorithm Invented by Vincent Park and M.Scott Corson from University of Maryland. TORA is an on-demand routing protocol.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Research Paper By V. D. Park and M. S. Corson.

A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Research Paper By V. D. Park and M. S. Corson.
GENI-based Delay-guarantee Communication for Smart Grid with SDN Yanyuan Qin - University of Connecticut Lingyu Ren - University of Connecticut Sourabh.

GENI-based Delay-guarantee Communication for Smart Grid with SDN Yanyuan Qin - University of Connecticut Lingyu Ren - University of Connecticut Sourabh.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.

WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
VeriFlow: Verifying Network-Wide Invariants in Real Time

VeriFlow: Verifying Network-Wide Invariants in Real Time
Leader Election Algorithms for Mobile Ad Hoc Networks Presented by: Joseph Gunawan.

Leader Election Algorithms for Mobile Ad Hoc Networks Presented by: Joseph Gunawan.
Team Member: Xinjie Guan, University of Missouri Kansas City; Xili Wan, University of Missouri Kansas City; Ruiling Gao, Tufts University; Date: June 2,

Team Member: Xinjie Guan, University of Missouri Kansas City; Xili Wan, University of Missouri Kansas City; Ruiling Gao, Tufts University; Date: June 2,
The Way Networks Work Computer Networks Kwangwoon University.

The Way Networks Work Computer Networks Kwangwoon University.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.

Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
The Network Layer.

The Network Layer.
Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks Costas Busch (RPI) Srikanth Surapaneni (RPI) Srikanta Tirthapura (Iowa State University)

Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks Costas Busch (RPI) Srikanth Surapaneni (RPI) Srikanta Tirthapura (Iowa State University)
DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Prof Philippas Tsigas Distributed Computing and Systems Research Group.

DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Prof Philippas Tsigas Distributed Computing and Systems Research Group.

Similar presentations

Ads by Google