Question 3: Efficient Traffic Engineering with SDN 5 6 12 Figure 1: Traffic Engineering with Open Flow Figure 1 reveals a network where the traffic flowing from the router u to z needs to be routed along the path u,v,w,z; while the traffic flowing from the router x to router z needs to be routed along the path x,w,y,z. Please describe the local flow table of each of the routers u,v,x,w,y,z (in terms of match and action rules) to enable the routing of the two traffic flows according to the constraints described above. Note that you can build upon the open flow example at the end of chapter 4 to answer to this question. The example is presented below - this is only an illustration to show what your tables might look like. OpenFlow Example: datagrams from hosts h5 and h6 should be sent to h3 or h4, via s1 and from there to s2 match action IP Src 10.3.*.* IP Dst = 10.2.*.* forward(3) Host h5 10.3.0.5 Host h6 10.3.0.6 $3 2 s1 4 Host h1 3 10.1.0.1 match ingress port = 1 action IP Src = 10.3.*.* forward(4) IP Dst 10.2.*.* OpenFlow controller $2 Host h4 10.2.0.4 Host h2 10.1.0.2 Host h3 10.2.0.3 match ingress port = 2 IP Dst 10.2.0.3 ingress port = 2 IP Dst 10.2.0.4 action forward(3) forward(4) Question 4: Efficient Traffic Engineering with SDN You are asked to traffic engineering the network represented in the figure below to split the traffic over two paths so that: i) datagrams from host h5 to host h3 should be sent via switch s1 and from there to switch s2, while ii) datagrams from host h6 to host h4 should be sent via switch s4 and from there to switch s2. Please provide the local flow tables of each of the switches s1, s2, s3 and s4 that would accomplish these requirements. match action Host h6 10.3.0.6 match Host h5 10.3.0.5 Host h1 10.1.0.1 2 $1 action OpenFlow controller $3 $4 match action $2 4 Host h4 10.2.0.4 Host h2 10.1.0.2 Host h3 10.2.0.3 match action