Given the below network routing graph (with costs). answer the following questions that follow: N6 10 N1 N2 N5 2 N3 N4 (a) What is the path with the least cost when communicating between NI and N5. Is this the only cost effective path? (b) The network is upgraded and a new link between N3 and N5 is created with a cost of 4. Will this affect the path with the least cost? Provide a reason for your answer.

Given the below network routing graph (with costs). answer the following questions that follow: N6 10 N1 N2 N5 2 N3 N4 (a) What is the path with the least cost when communicating between NI and N5. Is this the only cost effective path? (b) The network is upgraded and a new link between N3 and N5 is created with a cost of 4. Will this affect the path with the least cost? Provide a reason for your answer.

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

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?
Consider the 6-node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Fill in the following table using the convention shown the text. I am having trouble identifying the D(u), p(u) of this table. Could you help me, please?
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?
dont dont post unnecessary answer answer only 100% sure ese skip
Look at this network fragment. w and y are x's only neighbors. W's minimum-cost path to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
Suppose TCP is used over a lossy link that loses on average one segment in four. Assume the delay x bandwidth window size is considerably larger than four segments. (a) What happens when we start a connection? Do we ever get to the linear-increase phase of congestion avoidance? (b) Without using an explicit feedback mechanism from the routers, would TCP have any way to distinguish such link losses from congestion losses, at least over the short term? (c) Suppose TCP senders did reliably get explicit congestion indications from routers. Assuming links as above were common, would it be feasible to support window sizes much larger than four segments? What would TCP have to do?
How would you write a system of linear equations based on the given scenario and directions? Scenario You are employed as a network engineer and have been asked to analyze a communication network to determine the current data rates and ensure that the links aren’t at risk of “reaching capacity.” In the following figure of the network, the sender is transmitting data at a total rate of 100+50 = 150 megabits per second (Mbps). The data is transmitted from the sender to the receiver over a network of five different routers. These routers are labeled A, B, C, D, and E. The connections and data rates between the routers are labeled as x1,x2, x3, x4, and x5 . Directions For this assignment, you will analyze the communication network and solve for the unknown data rates using a variety of techniques. The system can be modeled mathematically as a system of linear equations by writing an equation for each node/router in the network. Each of these equations can be written by noting that the sum…
Imagine you are the network administrator of University X having 10 campuses in Towson, Maryland. You want to build a connected network of servers (each server is either a regular or a routing one), one at each campus, and want to choose some of them to be the designated routing servers. A routing server will serve regular servers who connect directly to it via high speed cables, and every regular server must connect to at least one routing server. Your goal is to minimize the total length of high speed cable that you must purchase. Given the locations of the 10 campuses, design a plan that requires (1) the shortest length of cable and (2) the least number of routing servers.
Question 2 Apply link-state algorithm on the network in the following graph. The cost of each link is given along the link. You are required to give steps for building routing table for node A. 8 B D A 4 5 C 2 3 E
Suppose TCP is used over a lossy link that loses on average one segment in four. Assume the delay x bandwidth window size is considerably larger than four segments. (a) What happens when we start a connection? Do we ever get to the linear-increase phase of congestion avoidance? (b) Without using an explicit feedback mechanism from the routers, would TCP have any way to distinguish such link losses from congestion losses, at least over the short term? (c) Suppose TCP senders did reliably get explicit congestion indications from routers. Assuming links as above were common, would it be feasible to support window sizes much larger than four segments? What would TCP have to do?
a) Explain how OSPF routing becomes more scalable in a large network by partitioning it in areas and a backbone area. What is the drawback of breaking a network in smaller areas compared to running OSPF in the original network? b) What is the role of the sequence number in the OSPF LSP?
Think about the count-to-infinity distance vector routing issue. If the cost of a connection is decreased, is it feasible to have a count-to-infinity issue? Why? Consider connecting two unconnected nodes together.