Homework 2 Subhojeet Mukherjee CSU Database and Security Research Group Details Due October 11 2016 Tuesday before class on CANVAS Reading Chapter 3 Rubric Question Number Total Points Subdivisons ID: 770781
Download Presentation The PPT/PDF document "Homework 2 Subhojeet Mukherjee" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Homework 2 Subhojeet Mukherjee CSU Database and Security Research Group
Details Due : October 11, 2016 (Tuesday) before class on CANVAS Reading: Chapter 3Rubric: Question Number Total Points Subdivisons 1 24 6 sections, 4 points each 2 20 N/A 3 18 N/A 4 24 3 sections, 8 points each 5 14 N/A
Question 1 Using the example network given in the following figure, give the virtual circuit table for all the switches after each of the following connections is established. Assume that the sequence of connections is cumulative; that is, the first connection is still up when the second connection is established, and so on. Also assume that the VCI assignment always pick the lowest unused VCI on each link, starting with 0, and that a VCI is consumed for both directions of a virtual circuit. a) Host A connects to host C. b) Host D connects to host B. c) Host D connects to host I. d) Host A connects to host B. e) Host F connects to host J.f) Host H connects to host A.
Lets Visualize Basic Operation of a Switch: http://scisweb.ulster.ac.uk/~kevin/com320/labs/Simulations/switch.swf
Question 1 : Building Virtual Circuits Dynamically a b c d DST d DST d DST d VCI DST 6 a VCI DST 3 a VCI DST 7 a DST d DST d DST d VCI DST 9 b VCI DST 8 b VCI DST 4 b Incoming Interface Incoming VCI Outgoing Interface Outgoing VCI 1 3 2 6 3 4 2 8 Incoming Interface Incoming VCI Outgoing Interface Outgoing VCI 1 6 2 7 1 8 2 9
Question 2 Given the extended LAN shown in the following figure, and the bridge interfaces are indicated by the lan that it connects to (for example for bridge B7, the interface that connects it to Lan A is indicated by B7.A) indicate which interfaces are not selected by the spanning tree algorithm.Assume that number of hops is used as the cost of a path.
Lets Visualize Bridge Inter Collison-Domain Communication: http://my.fit.edu/~gibbsk/Bridge4.swf
Why Spanning Tree? Source : http://scisweb.ulster.ac.uk/~kevin/com320/labs/Simulations/stp.swf
Spanning Tree Explanation (Example) Source :http ://www.cisco.com/image/gif/paws/10556/spanning_tree1.swf
Question 3 Referring back to figure below, assume that B1 suffers a catastrophic failure. Indicate which interfaces are not selected by the spanning tree algorithm after the recovery process and a new tree has been formed.
Question 4 For the network shown below, give global distance-vector tables whena) Each node knows only the distances to its immediate neighbors.b) Each node has reported the information it had in the preceding step to its immediate neighbors. c) Step (b) has happens a second time.
Distance Vector Routing: On Board Explanation
Question 5 For the network shown in the figure above, show how the link-state algorithm builds the routing table for node D .
Link State Routing: On Board Explanation