b. (The Shortest Route Network) The YÇD Company needs to connect main phone station A to other 9 station (B - J). Determine the shortest path from the starting node A to the each other 9 nodes such as (A-B), (A-C), (A-D), (A-E), (A-F), (A-G), (A- Н), (А-I), (А-J). All physically possible connections between nodes are shown in the figure below with distances in meters indicated between each stations. 90 110 (B D (H) 80 90 60 80 70 55 70 95 60 80 G. 65 75 130 60 110 F

b. (The Shortest Route Network) The YÇD Company needs to connect main phone station A to other 9 station (B - J). Determine the shortest path from the starting node A to the each other 9 nodes such as (A-B), (A-C), (A-D), (A-E), (A-F), (A-G), (A- Н), (А-I), (А-J). All physically possible connections between nodes are shown in the figure below with distances in meters indicated between each stations. 90 110 (B D (H) 80 90 60 80 70 55 70 95 60 80 G. 65 75 130 60 110 F

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

Apply Dijkstra’s algorithm to the network shown below to find the least-cost routes from node A to all other nodes. Display the results in a table.
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?
Q4: Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, where X is 1
A=32, B=33, C=34, D=35 x1, y1, z1 are the interfaces for the router gateway, while x2, x3, y2, y3, z2, z3 are for the router interface Find the Routing Table R1, R2, and R3 using the following table! Destination Next Hop Interface With the Routing Table that you have specified in point a, which path will PC1B take when communicating with PC2B and PC3B In theory there is a routing table for Network Address 0.0.0.0 with a Subnet Mask of 0.0.0.0, explain the function of this routing table? Does the image network require routing at point c? Why?
In a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?
talk about routing algorithm, forwadring and circuit network in one answer.
Computer Networks Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, where X is 9.
Write a report that explains link-state and distance-vector routing algorithms.The report should include the following: 1-A detailed explanation for both algorithms 2- A detailed example for each one 3- List of advantages and disadvantages for each one
Computer Networks Draw a graph for TCP congestion control for both a) TCP Tahoe b) TCP Reno based on the following information. Also show SS, AI and MD phases on the graph. At round 1 CWND =1 MSS Initial ssthresh =Infinity Timeout = At round 7 3 Duplicate ACK = At round 15 3 Duplicate ACK = At round 22 Add X round after 22, X=9
Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward…
Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…
Assume the VC number of a virtual-circuit network is a 16-bit field. What is the maximum number of virtual circuits that can be carried over a link? If the path and the VC number for each VC are determined by a central node of the network and the same VC number is used for all links along the path of same VC, how does the central node determine the VC number at the setup time?