Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D

Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D

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

An example would help me understand distance vectors, link state vectors, and route vector routing.
Distance vector routing is used. Router L receives distance vectors from routers I, H, and K as shown below.(image) The distance from L to I is 30, from L to H is 10, and from L to K is 9. Show L’s updated routing table based on the vectors.
Assume that the TCP Round Trip Time (RTT) is currently 28 msec and the following ACK's come in after 29, 33, 22 ms respectively. What is the new estimate RTT (ms) using Jacoboson's algorithm (a=0.8).
What are the key distinctions between distance vectors, link state vectors, and path vector routing?
- Consider an ARQ protocol that uses only negative acknowledgments (NAKS), but no positive acknowledgments (ACKS). Describe what timeouts would have to be scheduled. Explain why an ACK-based protocol is usually preferred to a NAK-based protocol.
81. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. a. 1 b. 2 c. 3 d. 4
Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D
Consider the following design problem concerning implementation of virtual-circuit service. If virtual circuits are used internal to the subnet, each data packet must have a 3-byte header and each router must tie up 8 bytes of storage for circuit identification. If datagrams are used internally, 15-byte headers are needed but no router table space is required. Transmission capacity costs 1 cent per 106 bytes, per hop. Very fast router memory can be purchased for 1 cent per byte and is depreciated over two years, assuming a 40-hour business week. The statistically average session runs for 1000 sec, in which time 200 packets are transmitted. The mean packet requires four hops. Which implementation is cheaper, and by how much?
Explain the variations between distance vectors, link state vectors, and path vector routing with the use of a concrete illustration.
subject: computer networks theory, ans this question: Use Dijkstra’s link-state algorithm to compute the forwarding table for node C. show all calculations of the algorithm.
need the solve asap plz.... correct ans plz
4. a) Consider designing an ATM network with a leaky-bucket policer that ensures a virtual circuit does not send more cells than expected. Suppose a link has a first-in-first-out (FIFO) queue and carries traffic for two virtual circuits. The traffic on the first virtual circuit follows a leaky- bucket policer (with a bucket depth of 9 cells and a token rate of 100 cells/second) and can settle for best-effort service. The traffic on the second virtual circuit follows a leaky-bucket policer (with a bucket depth of one cell and a token rate of 100 cells/second) that cannot tolerate more than 100 milliseconds of delay in delivering each cell. Suppose the propagation delay on the link is 50 milliseconds. Analyse the smallest transmission rate R, in cells per second, that can satisfy the delay constraint, given that the link serves cells in FIFO order.