Programming SDN Flashcards

(31 cards)

1
Q

Openflow consistence problem

A
  1. update may disrupt packets along an end to end path. 2. Packets from the same flow might be disrupted.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Examples fo state openflow may read

A

failures, topology changes, security events, etc.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Compute Policy

A

decide forwarding behavior

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Write Policy

A

Save the policy back to the swtiches

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What makes openflow programming difficult

A

rules are simple match action rules

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

size problem

A

Limits the number of rules. Cannot install all possible patterns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Solution to the size problem

A

Dynamically unfold rules as traffic arrives. Programmer specifies “GroupBy (srcip)”. Runtime dynamically adds rules as traffic arrives.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Problems when reading state

A

Extra unexpected events might arrive. 1st packet go to control then decision is made. Solution 1. Programmer specifies “limit(1)”. Runtime hides extra events

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

3 approaches to help guaranty consistence when reading state

A

Predicates, unfolding, suppression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Writing policy: Avoiding Disruption

A

Need atomic updates of the entire configuration.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Solution to writing disruption issue

A

2 phase commit version numbers in packets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Optimization for 2 phase commit.

A

Only apply mechanism on switches that involve affected versions of traffic or topology i.e. Keeping the old and new state on routers and switches

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is network virtualization?

A

Abstraction of physical network. Multiple logical networks share physical substrate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Why use network virtualization

A

To work around “Ossification” of internet architecture.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Ossification

A

A tendency toward or state of being molded into a rigid, conventional, sterile or unimaginative condition.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What does network virtualization enable

A

evolution by letting multiple architectures exist in parallel

17
Q

Promise of network virtualization

A

Rapid innovation (software speed), New forms of network control, Potentially simpler programming

18
Q

SDN vs Network Virtualization

A

SDN: Separate data and control NV: separate logical and physical

19
Q

Characteristics of network virtualization

A

Allowing multiple tenants to share underlying physical infrastructure. Separating logical and physical networks

20
Q

Design goals for network vertiualization

A

Flexible, Manageable, scalable, secure, programmable, able to support different technologies

21
Q

Nodes of Virtual Network

A

Must be virtualized

22
Q

Edges

A

Tunnels. Encapsulate the ethernet frame in an ip packet. Decapsulate when virtual host is reached. Openvswitch.org

23
Q

Is mininet a virtual network or sdn

A

Virtual Network

24
Q

How do virtual networks facilitate flexible, agile, development?

A

Rapid innovation, Vendor independence, scale

25
Solution to openflow programming difficulties
Northbound api
26
Northbound api?
Api that allows communication with high level components
27
Southbound api?
api that allows communication with low level components
28
Frenetic
sql like query language
29
Ways to compose policies
Parallel: Perform both policies operations simultaneously (e.g. Counting fowarding). Sequential: Perform one operation then the next.
30
Pyretic features
Network policy as function. Boolean predicates (predicates on packets). Virtual packet header fields. Policy Composition.
31
Dynamic Policies
Timeseries of static policies Current value: self.policy. 1. Set a default policy 2. register callback that updates policy.