19. How do Internet packets travel to their destination? (A) Router to router based on the Travelling Salesman algorithm (B) Along the same path to stay in order (C) Timed to arrive at the destination in their correct order (D) Along a variety of different paths 20. What action does the Internet Protocol (IP) perform? (A) It ensures packets can be transmitted across different equipment used with the Internet. (B) It enforces the Internet's rules for website names. (C) It classifies the data into clusters used for Internet traffic analysis. (D) It measures the latency on the Internet to determine the fastest path to send the data. 21. You are writing code to count duplicates in an existing list. What code could replace PROCEDURE countDupa (11stNums) ( index - 2 numDuplicates - 0 FOR EACH number in listNums ( REPEAT UNTIL (index a LENGTH (11st Nums)) ( IP (emissing code>) ( numDuplicates - numDuplicates + 1 } index index + 1 RETURN numDuplicates } (A) listNums[index]> listNums[index-1] (B) listNums[index] < number (C) listNums[index] = number (D) listNums[index] = listNums[index] Page 4

19. How do Internet packets travel to their destination? (A) Router to router based on the Travelling Salesman algorithm (B) Along the same path to stay in order (C) Timed to arrive at the destination in their correct order (D) Along a variety of different paths 20. What action does the Internet Protocol (IP) perform? (A) It ensures packets can be transmitted across different equipment used with the Internet. (B) It enforces the Internet's rules for website names. (C) It classifies the data into clusters used for Internet traffic analysis. (D) It measures the latency on the Internet to determine the fastest path to send the data. 21. You are writing code to count duplicates in an existing list. What code could replace PROCEDURE countDupa (11stNums) ( index - 2 numDuplicates - 0 FOR EACH number in listNums ( REPEAT UNTIL (index a LENGTH (11st Nums)) ( IP (emissing code>) ( numDuplicates - numDuplicates + 1 } index index + 1 RETURN numDuplicates } (A) listNums[index]> listNums[index-1] (B) listNums[index] < number (C) listNums[index] = number (D) listNums[index] = listNums[index] Page 4

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

First and foremost, what is the function of a router?2) What exactly is a data packet, and how is it constructed? What is the impact of encapsulation on packets?
Data Communication Suppose that Router A and Router B are connected via a 0.05 Mbps link (note, 1 Mbps = 106 bps) and that the link connecting the two routers has a length of 80 meters. Suppose that Router A is in the process oftransmitting a packet, and that there are 15 additional packets in the queue of the router, when a new packet arrives at Router A. Assume the followinga. Every packet consists of 15,000 bits.b. 5000 bits of the currently-being-transmitted packet has been transmitted by Router A when the new packet arrives at Router A. c. Propagation speed of a bit over the link connecting the two routersis 2 ? 103 meters/sec.d. Processing delay of a packet at a router takes 1 millisecond (i.e., 0.001 seconds).What is the total delay of the new packet in arriving at Router B, i.e., how long does it take the new packet to arrive at Router B from the time it arrived at Router A? In your solution, clearly identify all four delay components the new packet experiences.
76. In link state routing algorithm after the construction of link state packets, new routes are computed using: a. DES algorithm b. Dijkstra's algorithm c. RSA algorithm d. Packets
COMPUTER NETWORKS: Please solve with solutions and provide correct answer An application message is segmented into 20 packets, each of which is 1000-byte in size. Caculate the end-to-end delay for the message when the bit rate for any node is 1 Mbps, the optical path total distance is 2000-km, and the queuing and processing delays are 1-ms and 1-ms, respectively. There are 4 intermediate routers in the path, each of which uses the store-and-forward approach.
Topic: Network Delay Assume two hosts, A and B, that are linked by a single link with a rate of R bps and are spaced m meters away from one another. A packet of size L bits is being sent from Host A to Host B. Suppose that the propagation through the connection is occurring at s meters/second. (Answer the following question while showing work) 1) Assuming that processing and queuing delays are 0, provide an expression for end-to-end delay in terms of m, s, L, and R. 2) Where is the final bit of the packet at time t = dtrans if Host A starts transmission at time t = 0?
1.) There is a data that has a file size of 26Mb with an ethernet overhead of 8 Mb. Find the Total amount of data to be transferred and Throughput, if there is an amount of data loss of 15 Mbps due to errors and acknowledgments. 2.) Assume that the distance between the sender and the receiver is 5000 km and that light travels at 1.7 x 108 m/s. What is the propagation time and the transmission time for a 1.44 MB message if the bandwidth of the network is 3 Mbps? 3.) An analog signal has a bit rate of 36000 bps and a baud rate of 1200 baud. How many data elements are carried by each signal element? How many signal elements do we need?
Assume that an end-to-end communications system is made up of three networks with date rate in Mbps ρ1, ρ2, and ρ3, respectively. Ignoring the other delay components, what is the total end-to-end delay to transmit a packet size of λ?
Subject- Data communication Networks 1) A router has just received the following new IP addresses: 128.14.120.0/23, 128.14.118.0/23,128.14.114.0/23, and 128.14.110.0/23. If all of them use the same outgoing line, can they beaggregated?
Use again the network architecture provided in the figure above, were Rs, Rc and Ri for i = {1,2,3,4}, the transmission rates of the server link, client link and intermediate network links. Consider a message that is 60 · 106 bits long that is to be sent from client to server. Ignore propagation, queuing, and processing delays. c.How long does it take to move the file from source host to destination host when message segmentation is used and both path R1, R2 and path R3, R4 are used? How many packages should be routed from path R1, R2 and how many from path R3, R4 in order to maximize the use of the network? d.What is the end to end throughput if path R1, R2 is used, and what if path R3, R4 is used? What is the total throughput from client to server (if both paths are being used at the same time)?
68. In TCP/IP reference model, the job of ____ layer is to permit hosts to inject packets into any network and travel them independently to the destination. a. Physical b. Host to network c. Application d. None of the above
UDP and TCP are the two transport-layer protocols provided by the TCP/IP software package (UDP).I Typically, applications such as VoIP, online gaming, and live audio streaming employ UDP connections instead of TCP connections. If the assertion is true, explain how well-known ports and registered port numbers vary in terms of port numbers.
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…