Flipper: Fault-Tolerant Distributed Network Management and Control - - PowerPoint PPT Presentation

flipper fault tolerant distributed network management and
SMART_READER_LITE
LIVE PREVIEW

Flipper: Fault-Tolerant Distributed Network Management and Control - - PowerPoint PPT Presentation

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion Flipper: Fault-Tolerant Distributed Network Management and Control Subhrendu Chattopadhyay , Niladri Sett, Sukumar Nandi, and Sandip Chakraborty


slide-1
SLIDE 1

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Flipper: Fault-Tolerant Distributed Network Management and Control

Subhrendu Chattopadhyay, Niladri Sett, Sukumar Nandi, and Sandip Chakraborty May 8, 2017

Flipper Subhrendu

slide-2
SLIDE 2

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Content

1 Introduction 2 SDN 3 Flipper 4 Properties of Flipper 5 Simulation Results 6 Emulation Results 7 Conclusion

Flipper Subhrendu

slide-3
SLIDE 3

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Example Scenario

An academic institute Just like IIT, Guwahati Sys admin wants to distribute bandwidth policies based on network usage Not scalable Minor misconfiguration may lead to network underutilization

Flipper Subhrendu

slide-4
SLIDE 4

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Problems of Traditional Architecture

Lack of programmability Complex architecture Customized protocols for heterogeneous hardware platform and vendor dependence Delay in deployment Resource management and inconsistent policies.

Flipper Subhrendu

slide-5
SLIDE 5

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Definition

Data and control plane separation Controller based decision Flow based decision Programmable network

Flipper Subhrendu

slide-6
SLIDE 6

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

SDN with distributed controller

Required for improved scalability e.g ONIX1, ONOS2 ONIX uses two types of data bases

Transactional database for high level network rules. DHT-based database for volatile network state information.

Controller Placement trade-off: Number of controller vs control plane overhead3,

1Teemu Koponen et al. “Onix: A Distributed Control Platform for Large-scale Production Networks”.

In: Proceedings of the 9th USENIX Conference on OSDI, 2010. USENIX Association, 2010, pp. 1–6.

2Pankaj Berde et al. “ONOS: towards an open, distributed SDN OS”. . In: Proceedings of the 3rd HotSDN,

  • 2014. ACM. 2014, pp. 1–6.

3Soheil Hassas Yeganeh, Amin Tootoonchian, and Yashar Ganjali. “On scalability of software-defined

networking”. In: IEEE Communications Magazine, 51.2 (2013), pp. 136–141. Flipper Subhrendu

slide-7
SLIDE 7

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

SDN with distributed controller

POCO-PLC4

Off-line placement of controllers. Fault-resilience towards node or double link failure. Claims 20% of needs nodes needs to be deployed as controller for most practical small scale topology.

4David Hock et al. “POCO-PLC: Enabling Dynamic Pareto-Optimal Resilient Controller Placement in SDN

Networks”. In: Proceedings of the 33rd INFOCOM, 2014 (2014). Flipper Subhrendu

slide-8
SLIDE 8

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Issues with POCO-PLC and SDN

POCO-PLC

Requires SDN enabled infrastructure Does not cope up with arbitrary link/node failure. Off-line solution

Flipper Subhrendu

slide-9
SLIDE 9

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Proposal: Flipper Architecture

COTS devices acts as PDEP. Uses NFV to achieve this feature5

Based on ONIX, tran-NIB and DHT-NIB. Each nodes are called flipper. Each flipper can act as either DHT-NIB or switch.

DHT-flipper can convert itselves to switch flipper dynamically (and vice versa)

5M Said Seddiki et al. “Flowqos: Qos for the rest of us”.

In: Proceedings of the 3rd HotSDN, 2014. ACM. 2014, pp. 207–208. Flipper Subhrendu

slide-10
SLIDE 10

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Proposal: How Flipper works

DHT-flipper: Hosts: A,B,C,D tran-NIB: High level network rules (e.g ACLs etc.) Switch-flipper: Acts as forwarding device

Flipper Subhrendu

slide-11
SLIDE 11

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Proposal: How Flipper works

DHT-flipper: Acts as NIB for volatile network

  • information. (e.g.

Link statistics) DHT-flipper requires to be placed within

  • ne-hop of

distance of the switch.

Flipper Subhrendu

slide-12
SLIDE 12

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Flipper: Failure Use-Case

R5 fails.

R4 and R6 can detect failure.

R4, R6 readjusts new locations of DHT-NIBs.

Flipper Subhrendu

slide-13
SLIDE 13

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Fault-tolerant Flipper Readjustment

Algorithm is represented as Guarded statements.

(Ruleno)| < Guard >→< Action >

Each guarded statement execution timing diagram is given in the figure.

Flipper Subhrendu

slide-14
SLIDE 14

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Fault-tolerant Flipper Readjustment

Variables: Labeli = {NIB, Swi, Wait} Prii = {0, 1, . . . , B} Functions: NNIB(i) = ∀j ∈ Ni : Labelj = NIB NWait(i) = ∀j ∈ Ni : Labelj = Wait MaxW (i) = ∀j ∈ NWait : Max(Prij) Trial(i)Prii = Rand(0, 1, . . . , B)

Labeli = Wait Labeli = NIB Labeli = Swi NNIB

i

= ∅|Trial(i) NNIB

i

= ∅

( NNIB

i

= ∅ )

∧(Prii > MaxW(i))

( NNIB

i

= ∅ )

∧(Prii = MaxW(i))|Trial(i)

NNIB

i

= ∅

Flipper Subhrendu

slide-15
SLIDE 15

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Properties of Flipper Readjustment

If any flipper in the system is in intermediate state then there is at least one rule which can be executed further. If the system is in a state where flippers with DHT-flippers form a MIS, it will remain in that state forever, provided no further fault occurs. (Closure property)

Flipper Subhrendu

slide-16
SLIDE 16

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Properties of Flipper Readjustment

If X denote the random variable indicating the number of rounds required to find a unique maximum priority in the closed neighborhood of v then E[X] ≤ e, where e represents Euler-Mascheroni constant. The expected number of moves for convergence is O(n).

Flipper Subhrendu

slide-17
SLIDE 17

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Properties of Flipper Readjustment

Flipper is partition tolerant:

Say, R3 and R4 fails. In such cases the R1 and R3 invokes the flipper readjustment. A new DHT-flipper is chosen in their vicinity.

Flipper Subhrendu

slide-18
SLIDE 18

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Simulation Results

Based on NS3. Comparison with POCO-PLC 3 different topologies are used.

Synthetic Grid (64x64 nodes) AS733 real dataset6 Oregon real dataset7

6SNAP Autonomous systems AS-733 data set.

http://snap.stanford.edu/data/as.html.

7SNAP Autonomous systems - Oregon-1 data set.

http://snap.stanford.edu/data/oregon1.html. Flipper Subhrendu

slide-19
SLIDE 19

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Simulation Result

1 2 3 4 5 6 Grid AS Oregon Moves/Node Topology Theoritical bound Number of moves per node

Figure : Number of moves executed per node

Flipper Subhrendu

slide-20
SLIDE 20

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Simulation Result

2000 4000 6000 8000 10000 12000 Grid AS Oregon Number Of DHT-flippers Topology Total flippers Number of DHT-flippers

Figure : Number of placed controllers

Flipper Subhrendu

slide-21
SLIDE 21

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Simulation Result

2 4 6 8 10 Grid AS Oregon Controller - OFS delay (ms) Topology POCO-PLC (20% controller) SS-DCP

Figure : Number of moves executed per node

Flipper Subhrendu

slide-22
SLIDE 22

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Summery of Simulation Results

Number of required Flipper depends on the topology. 5% 10% increase in number of DHT-flipper can reduce flow setup delay by more than 60% for both of the real networks. The performance improvement in terms of flow initiation delay is due to the fact that, each switch-flipper has a DHT-flipper in its neighborhood.

Flipper Subhrendu

slide-23
SLIDE 23

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Emulation Results

50 node topology taken from Oregon dataset. 200 random flows Mininet for emulation.

Experiment 1: The selected flippers are 1-hop away from each other. Experiment 2: The selected flippers are more than 2 hops distance apart.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

Figure : Used Topology

Flipper Subhrendu

slide-24
SLIDE 24

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Emulation Results

500 1000 1500 2000 2500 3000 3500 4000 4500 1 2 3 4 5 6 Convergence Time (ms) Number of Faults Experiment 1 Experiment 2

Figure : Convergence time vs number of flipper failure

Flipper Subhrendu

slide-25
SLIDE 25

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Emulation Results

20 40 60 80 100 1 2 3 4 5 6 Nunber of flow adjustment Number of Faults Experiment 1 Experiment 2

Figure : Number of flow adjustment readjustment vs number of flipper failure

Flipper Subhrendu

slide-26
SLIDE 26

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Emulation Results

1000 2000 3000 4000 5000 6000 1 2 3 4 5 6 Convergence Time (ms) Number of Faults Experiment 1 Experiment 2

Figure : Convergence time vs number of link failure

Flipper Subhrendu

slide-27
SLIDE 27

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Emulation Results

20 40 60 80 100 1 2 3 4 5 6 Nunber of flow adjustment Number of Faults Experiment 1 Experiment 2

Figure : Number of flow adjustment readjustment vs number of flipper failure

Flipper Subhrendu

slide-28
SLIDE 28

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Summery of Emulation Results

Convergence time is dependent on the separation of the failed flippers or failed links. Increase in number of flipper failure or link failure increases the number of flows required to be rerouted. The performance improvement in terms of flow initiation delay is due to the fact that, each switch-flipper has a DHT-flipper in its neighborhood.

Flipper Subhrendu

slide-29
SLIDE 29

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Future Plan

Flipper: Supports SDN like network management and control. Avoids the controller bottleneck problem. Supports a stronger notion of fault tolerance. Provides a scalable notion of dynamic role adaptation.

Flipper Subhrendu

slide-30
SLIDE 30

Introduction SDN Flipper Properties of Flipper Simulation Results Emulation Results Conclusion

Thank You

Flipper Subhrendu