5.04-1. Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The (old) distance vector at e (the node at the center of the network) is also shown, before receiving the new distance vector from its neighbors. Indicate which of the components of new distance vector at e below have a value of 1 after e has received the distance vectors from its neighbors and updated its own distance vector. (b) Suppose we want to implement the following behavior, and that the default configuration is that all traffic from 22.33/16 should be allowed to be forwarded by r2 to the outsidenetwork. However, we also want to implement a higher priority rule (which would be earlier in the table, for example) so that users within the 22.33/16 network are never allowed toconnect to an external web server on port 80. Specify the flow table row entries to implement this rule, by indicating the column entries below. The * is a wildcard match, whichmatches everything - you should use * over more specific answers whenever possible.[Note: You can find more examples of problems similar to this here.]C. v In the "source IP" column, the flow table entry should be:A. v In the "dest. IP" column, the flow table entry should be:D. v In the "dest port" column, the flow table entry should be:F. V In the "action" column, the flow table entry should be:A. 128.119/16B. forward(1)C. 22.33/16D. 80E. UDPF. dropG. forward(2)H. 53.106/16I. C OpenFlowcontroller128.119/16r34253.106/16322.33/162matchactionsource IPdest. IPprotocoldest. portwwТСР.........

Answered: 5.04-1. Bellman Ford Algorithm (1, part…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

5.04-1. Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The (old) distance vector at e (the node at the center of the network) is also shown, before receiving the new distance vector from its neighbors. Indicate which of the components of new distance vector at e below have a value of 1 after e has received the distance vectors from its neighbors and updated its own distance vector.