On a p-node linear array there are two packets at each node to begin with. Assume p is even. Packets at node 1 are destined for node + 1, packets at node 2 are destined for + 2, and so on. Let each packet take the shortest path from its origin to its destination. Compute the routing time for this problem under the following priority schemes: farthest origin first, farthest destination first, FIFO, and LIFO.

On a p-node linear array there are two packets at each node to begin with. Assume p is even. Packets at node 1 are destined for node + 1, packets at node 2 are destined for + 2, and so on. Let each packet take the shortest path from its origin to its destination. Compute the routing time for this problem under the following priority schemes: farthest origin first, farthest destination first, FIFO, and LIFO.

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

A set of n towns are connected by an airplane network. To travel between any two given towns, one can fly directly or via a number of intermediate cities. We assume that the same town will not be visited twice. 1) How many paths are there between two given towns in a network comprising of (a) 2 towns, (b) 3 towns, (c) 4 towns. 2) Suppose that A(n) represents the number of possible paths between two given towns in a network of n towns. Develop a recurrence relation for A(n) with base of A(2). (To begin, consider the number of first stop over possibilites and for each, the number of subsequent paths.) 3) Show by induction that A(n) < nh where the base case is n=2.
Use the provided data to create the Dijkstra Shortest Weighted Path method.Precondition: S is a node in the weighted (directed or undirected) network G.Post-cond: specifies the shortest weighted route between each node of G and s, and d specifies the lengths of those paths.
Create an algorithm for the Dijkstra Shortest Weighted Path based on the provided data.G is a weighted (directed or undirected) network, and s is a node in it.post-cond: specifies the shortest weighted route from s to each node of G, and d the lengths of those paths.
When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
QUESTION 4 Given G-({a, b, c d, e t.g h, LJ), E ) and JE| -45, how many different length-8 paths from a to b are there in G if G is undirected? Answer:
Consider the prime path [3, 1, 3] and path p3. Does p3 tour the prime pathdirectly?
What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
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 and u = 850 %3D 1000. Find the smallest value of B such that P(N > B) < € = 10-4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B.
Suppose that you are receiving a packet number of a data travelling over a network in array. First of all input number of packets a data will be in. Received packets must be in an order and there will be difference of 4 among packet numbers. If there is any missing packet than display message packet missing. If no packets are missing but are not in order arrange the packets in an order.
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…
An input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network. Note: Please Answer Python only Input 1 5 cbcdc Output 5