Question 6 Chapter 2- Part 2: Link State Routing 1. Link state routing Consider the following network. The objective is to fill the routing and forwarding tables of node X. 12- 7- 8. FAO/ FA0/2 FAO/9 X FAO/5 6- 3- U W Q1. Draw the shortest-path tree from X Use the Dijkstra's algorithm to compute the shortest path from X to all the other routers, then draw the shortest path tree. Only the following file extensions are accepted: .pdf. docx , .gif and .gpg, Hand writing figures are not accepted Browse Content Collection Attach File Browse Local Files N

Question 6 Chapter 2- Part 2: Link State Routing 1. Link state routing Consider the following network. The objective is to fill the routing and forwarding tables of node X. 12- 7- 8. FAO/ FA0/2 FAO/9 X FAO/5 6- 3- U W Q1. Draw the shortest-path tree from X Use the Dijkstra's algorithm to compute the shortest path from X to all the other routers, then draw the shortest path tree. Only the following file extensions are accepted: .pdf. docx , .gif and .gpg, Hand writing figures are not accepted Browse Content Collection Attach File Browse Local Files N

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

C PROGRAMMING you are to write a TCP/IP server that can build up a graph of a network ofnetworks (using the supplied graph library and implementation of Dijkstra’s algorithm) and thenquery that graph to find out which link between two networks should be used as the next hop tosend a packet of data from one network to another within the network of networks (using thesupplied implementation of Dijkstra’s algorithm). using the following program as a start point: /* * NetworkServer.c * ProgrammingPortfolio Skeleton * */ /* You will need to include these header files to be able to implement the TCP/IP functions */#include <stdio.h>#include <stdlib.h>#include <string.h>#include <sys/types.h>#include <netinet/in.h>#include <netdb.h>#include <fcntl.h>#include <unistd.h>#include <errno.h>#include <sys/socket.h> /* You will also need to add #include for your graph library header files */ int main(int argc, const char * argv[]){ int…
4 8 10 2 2 F 4 1 If you apply Link state routing algorithm at Node A, and the algorithm steps are applied in the following order A, B, C, D, E, F. What is the routing cost from A to F, after including nodes A, B, C?
Needham and Schroeder suggest the following variant of their protocol: 1. Alice → Bob : Alice 2. Bob→ Alice: {Alice rand3}kBob 3. Alice → Cathy : {Alice Bob rand₁|{Alice rand3}kBob} 4. Cathy → Alice: {Alice Bob rand₁|ksession|{Alice rand3|ksession}KBob}KAlice 5. Alice → Bob: {Alice rand3|ksession}kBob 6. Bob→ Alice: {rand2}ksession 7. Alice → Bob: {rand2-1}ksession Show that this protocol solves the problem of replay as a result of stolen session keys. Hint: Consider two cases, one in which the attacker does not send an initial message to Bob and one in which the attacker does.
3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…
Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.
Consider the three words in the network A, B, and C. The host sends a 700-bit packet to the host saw via the host b tree. The propagation speed from A to B is 2 *10 power 8 metres per second, and the propagation speed from B to C is 3 *10 power 8 metres per second. The distance between hosts a and b is in the thousands of kilometres. B and C are separated by 1500 kilometres. The a-b and b-c RCM connection bandwidth is 5 Mbps. What is the packet's end-to-end delay?
Shown below is a network with cycles in it. The bridges run the distributed spanning tree algorithm. For all of the labeled ports, indicate the final state, assuming that B1 is the root bridge. Recall that RP = "Root Port," DP = "Designated Port," and BP = "Blocked Port." Carefully note the port numbers for each bridge when entering your answers! 1 B3 B8 2 2 E В K B1 T B4 B6 2 2 C 1 B5 1 3, B7 B2 2 W Bridge Port 1 Port 2 Port 3 B2 [ Select ] [ Select ] B3 [ Select ] [ Select ]
6.4-4. Self Learning Switches (a). Consider the network below with six nodes, star-connected into an Ethernet switch. Suppose that A sends a frame to A, A' replies to A, then B sends a message to B' and B' replies to B. Enter the values that are present in the switch's forwarding table after B'-to-B frame is sent and received. Assumed that the table is initially empty and that entries are added to the table sequentially. Answer the questions below from the pulldown list. C' B' S A 3 A' B What is the first entry added to the table? [Choose ] [Choose ] B,2 What is the second entry added to the table? C,6 What is the third entry added to the table? What is the fourth entry added to the table? C,3 A,4 B₁,5 A,1 [Choose ] <
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
Problem 4: Consider the tree Collision Resolution Protocol (CRP). Let exactly k collisions occur during a collision resolution phase. Determine the number of slots required for terminating the collision resolution phase as a function of k . Note that k does not represent the number of packets that have initially collided, but the number of collisions in the CRP feedback pattern (i.e., the number of e 's)
Q3) Consider weighted queueing scheme with three queues at the output port. The weights assigned to queues are w = 4, w = 2, and w = 1. The contents of each queue at time t1 are shown in below Figure. Assume packets are all the same size and that transmission time for each is 1 micro-second. Answer the following: a) Using timeline, show the departure time for each packet,
A 3 5 сл 2 B 1 3 E F 7. Consider the network from the problem running distance-vector routing has already achieved convergence. At some time link B-C fails. a) Give the routing tables at A and D after B and C have reported the news. b) Give the routing tables at A and D after their next mutual exchange.