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.

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...
icon
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.

(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 outside
network. 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 to
connect 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, which
matches 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/16
B. forward(1)
C. 22.33/16
D. 80
E. UDP
F. drop
G. forward(2)
H. 53.106/16
I.
Transcribed Image Text:(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 outside network. 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 to connect 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, which matches 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/16 B. forward(1) C. 22.33/16 D. 80 E. UDP F. drop G. forward(2) H. 53.106/16 I.
C OpenFlow
controller
128.119/16
r3
4
2
53.106/16
3
22.33/16
2
match
action
source IP
dest. IP
protocol
dest. port
ww
ТСР
...
...
...
Transcribed Image Text:C OpenFlow controller 128.119/16 r3 4 2 53.106/16 3 22.33/16 2 match action source IP dest. IP protocol dest. port ww ТСР ... ... ...
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY