How many simple paths (those that do not repeat a node) are there from node A to G? What is the shortest path from node A to node G? What is the overall delay? If node E fails, does that change the shortest path? If so, what is the new shortest path?

How many simple paths (those that do not repeat a node) are there from node A to G? What is the shortest path from node A to node G? What is the overall delay? If node E fails, does that change the shortest path? If so, what is the new shortest path?

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

P7. Examine the network fragment below. w and y are x's only neighbours. W's minimum-cost route 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.
A) Assume there is a wide-area network with N nodes, where N ≥ 2 What is the smallest number of point-to-point communication links such that every node in the network is able to talk to every other node? (Note: A network in which some nodes are unable to exchange messages with other nodes because there is no path between them is called disconnected.)
In designing a communication network, the Minimum Spanning Tree is being used to show the connected subset of the original network graph showing the least amount of links needed to interconnect all the nodes based on all the link costs. Given the diagram below, create the minimum spanning tree (MST) using Kruskal’s Algorithm. With your final MST, find the sum of all the edge weights
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).…
Q3) Consider weighted queueing scheme with three queues at the output port. The weights assigned to queues are w = 4, w = 2, and w = 1. The contents of each queue at time t1 are shown in below Figure. Assume packets are all the same size and that transmission time for each is 1 micro-second. Answer the following: a) Using timeline, show the departure time for each packet,
Consider Figure 2.12, for which there is an institutional network connected to the Internet. Suppose that the average object size is 1,000,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use ∆/(1 - ∆b), where ∆ is the average time required to send an object over the access link and b is the arrival rate of objects to the access link. Find the total average response time. I get ∆=1000000/15000000= 1/15, then ∆/(1 - ∆b)= (1/15)/(1-(1/15)*16)=-1, so the finally answer is : 3+(-1)=2s or 3+0=3s?
The following questions related to the given picture 3.1.1 Consider the network shown in the figure 3.1 above with four nodes. Cost links are shown in the diagram. Give the distance-vector routing tables for all the nodes in the network. Let node B to be the first node to broadcast its routing table.
Let A and B be two stations attempting to transmit on Ethernet. Each has a steady queue of frames ready to send. A's frames will be numbered A₁, A₂ and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff = base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times OxT and 1xT, respectively, meaning 'A' wins the race and transmits A₁, while B waits. At the end of this transmission, B will attempt to transmit B, while A will attempt to transmit A₂. These first attempts will collide, but now A backs off for either OxT or 1xT while B backs off for time equal to one of OxT......3xT. Give the probability that A wins the second backoff race.
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.
Let's imagine that in order for your kid to access the internet, they need to connect to the school's wireless local area network (LAN) and type in www.google.com before they may do so. Continue on with this hypothetical situation. (Or, more generally speaking, any other website that springs immediately to mind) Include the various routing protocols in the precise sequence in which they should be applied to avoid any misunderstanding that may develop as a result of the inclusion of this information.
Consider the below image EIGRP topology and answer the following questions accordingly. 1. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R1 : 2. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R4: 3. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R5: 4. Which router is considered a feasible successor to reach THE INTERNET from R2? * R1 R3 R4 R5 5. Calculate the reported distance from the other 2 routers to reach THE INTERNET: 6. Is there a feasible successor of R2 to reach the Internet? * R1 R3 R4 R5 None of the above
DONT COPY FROM CHEGG!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using:i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing