Consider a network with the following topology: B F D The owner of the network is deploying a distance-vector routing protocol and the distance vector protocol exchanges distance-vectors every R seconds and the routers send their distance-vector before processing distance-vectors received from other routers. After two rounds, the distance vector table at router F looks as follows: F| Dest. Link Cost E-F 15 E-F E-F 12 12 E-F 7 local a) How does the distance vector table at router F look like after the next round? b) Will there be further changes after the third round? If yes, which ones? If not, why not? c) Is it possible that F knows a cost towards a certain destination that is lower than the cost known by E for the same destination? Explain. ABCDEE

Consider a network with the following topology: B F D The owner of the network is deploying a distance-vector routing protocol and the distance vector protocol exchanges distance-vectors every R seconds and the routers send their distance-vector before processing distance-vectors received from other routers. After two rounds, the distance vector table at router F looks as follows: F| Dest. Link Cost E-F 15 E-F E-F 12 12 E-F 7 local a) How does the distance vector table at router F look like after the next round? b) Will there be further changes after the third round? If yes, which ones? If not, why not? c) Is it possible that F knows a cost towards a certain destination that is lower than the cost known by E for the same destination? Explain. ABCDEE

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

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
1. Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. (a) i. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.                                                                                                                                                            Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
Consider a router that interconnects three subnets: A, B, and C. Supposeall of the interfaces in each of these subnets are required to have the prefix212.1.104.0/21. Suppose subnet A is required to support 1000 interfaces, andsubnets B and C are each required to support 500 interfaces. Provide networkaddresses for A,B and C (in the form a.b.c.d/x) that satisfy these constraints. Model Solution: E.g.: A: 212.1.104.0/22B: 212.1.108.0/23C: 212.1.110.0/23 Can you explain how it comes this model Solution
Consider the 3-node network shown below, with the given link costs When the algorithm converges, what are the distance vectors in each of the routers. Show the iterations the distance vector algorithm will go through to build the distance vector at each router..
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
Consider a router that interconnects three subnets: A, B, and C. Supposeall of the interfaces in each of these subnets are required to have the prefix212.1.104.0/21. Suppose subnet A is required to support 1000 interfaces, andsubnets B and C are each required to support 500 interfaces. Provide networkaddresses for A,B and C (in the form a.b.c.d/x) that satisfy these constraints.
Let's start with a more in-depth examination of routing. Differentiate between these two widely-used routing strategies.
Consider the three-node network below, that uses flow-based generalized forwarding (e.g., as in OpenFlow) in the network's routers. In the question below, we'll want to create match+action entries in the flow table at router r2, with three ports labelled 1,2,3 (in black). In the question, matches are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination port number of the transport-layer segment. The actions are either to drop or to forward(i), that is, to forward a matching packet on port i. The default action (unless stated otherwise) is that if a packet doesn't match a rule, it will be dropped.Question: Suppose we want to implement the following rule: r2 should act as a firewall, only allowing TCP traffic into the 22.33/16 network from any network. Specify a single flow table row entry to implement this rule, indicating the column entries for the row below. The * is a…
Consider this multihpop network running the 802.11 MAC protocol in ad-hoc mode (RTS-CTS-DATA-ACK) and a link speed of 1 Mbps: A === B === C === D Edges ‘===’ represent connectivity, so, for instance, nodes B and C can communicate with each other directly, but A and C cannot. All nodes are able to route packets on behalf of the other nodes and they employ store-and-forward to deliver packets to the destination. Suppose nodes A, B, and C have to send a lot of data frames to node D and have their link layer queue always full. What is the average data rate for A, B, and C assuming no DATA frames get lost due collisions? Explain your answer. Compare the data rates with the link rate.
Consider a node in a network running the BECA topology. Three timer parameters are Ta = 10s, Ty = 2s and Ta = 3s. Assume the node just start on its sleep mode at time Os. Threre routing traffic in the network that it can potentially participate in at times 5s, 11s and 13s. The node aiso has some local data of its own to send at 19s. Given this information, draw a ime line showing periods when the node is asleep, listen and active mode.
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…