Consider the network topology below, which depicts a Source and a Destination connected by two intermediate routers. The Source transmits a file of size F-40MBytes to the destination. The link speeds along the three hops between Source and Destination are as indicated on the diagram. Solve the following problems. Destination Router1 R₁-10Mbps R₂=100Mbps Router2 R₂=10Mbps Source F=40MB A. Identify the bottleneck link and calculate the end-to-end delay for packet transmission from the Source to the Destination. Submit your answer as a typed text in the submission box below, indicating which sub- question you are responding to. B. Considering the store-and-forward principle, briefly justify why the end-to-end delay will not be the sum of nodal delays on each hop. Submit your answer as a typed text in the submission box below, indicating which sub-question you are responding to.

Consider the network topology below, which depicts a Source and a Destination connected by two intermediate routers. The Source transmits a file of size F-40MBytes to the destination. The link speeds along the three hops between Source and Destination are as indicated on the diagram. Solve the following problems. Destination Router1 R₁-10Mbps R₂=100Mbps Router2 R₂=10Mbps Source F=40MB A. Identify the bottleneck link and calculate the end-to-end delay for packet transmission from the Source to the Destination. Submit your answer as a typed text in the submission box below, indicating which sub- question you are responding to. B. Considering the store-and-forward principle, briefly justify why the end-to-end delay will not be the sum of nodal delays on each hop. Submit your answer as a typed text in the submission box below, indicating which sub-question you are responding to.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

Suppose we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = ms
Assume a client is connected to the server and has already received an HTML webpage. It reads the webpage, and it now needs to get 3 new files, File A is 5 MB file B is 1 MB and file C is 1 KB. The client requests the files in the order A B C. The link has an RTT (round trip time) of 0.5 seconds and a bandwidth of 8 Mb/s(Megabits per second) (or 1 Megabyte per second). The client can reuse the open connection if the protocol allows it to. For all parts of this problem ignore header sizes, and start the timer when the client sends How long does it take to get file C under HTTP 0? How long does it take to get file C under HTTP 1 (assume the browser does not support pipeling)? How long does it take to get file C under HTTP 2 assuming a frame size of 1 KB and no server push? What event would make HTTP 3 faster than HTTP 2 for this use case (ignore TLS)?
A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.
In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57−240−123−229
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
3. Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a file from a remote server residing at a well-known address. The client first sends a request with a file name, and the server responds with a sequence of data packets containing different parts of the requested file. To ensure reliability and sequenced delivery, client and server use a stop-and-wait protocol. Ignoring the obvious performance issue, do you see a problem with this protocol? Think carefully about the possibility of processing crashing. State conclusion: Provide Proof: Solution:
Consider the following scenario in which host A is sending a file to host B over a TCP connection. Assuming that the sequence number of the first data byte sent by A is 0 and every segment always includes 1000 bytes of data, excluding the TCP header. At some point of time, bytes up to 6400 have been written into the sender’s buffer. Bytes up to 4999 have been sent out but the segment which contains bytes 2000~2999 has not arrived at host B yet. At the receiver’s side, all bytes up to 3999 have been received except for bytes 2000~2999. Bytes up to 499 have been read from the buffer by the application. Assume that the maximum size of the sender’s buffer is large enough. Consider the sliding window algorithm in TCP and answer the following questions. 1) What are the values for LastByteAcked, LastByteSent, and LastByteWritten? 2) What are the values for LastByteRead, NextByteExpected, and LastByteRcvd? 3) Assuming that the maximum size of the receiver’s buffer is 4000 byte, what would…
An IP address can be written as a 32-bit number. For a class B network, the two most significant bits are set to 10. The 16 most signi cant bits are used as a network ID, and the 16 least signi cant bits are used as a host ID. However, the host ID cannot be all 0's or all 1's. How many hosts (i.e., host IDs) can there be on a class B network?
5.03-5. Dijkstra's Algorithm (3, part 5). Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? OF (A) 3 2 4 B 8 D 10 4 E 4 2 F
In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?
4. The figure below shows a router connected to 4 devices. All devices, including the router, have transmission rates = 1 Mbits/s. The router can process the data instantaneously (processing delay= Os for all packets). The queue can hold a maximum of 10 Mbits at any given time, Note that all packets have to join the queue. The table in the figure shows the time at which packets are generated (in s), where they are generated, where they are going, and the size of each packet. R=1 Mbits/s B R = 1 Mbits/s A Router Queue Processing Delay = Os Transmission Rate = 1 Mbits/s C R = 1 Mbits/s Time (s) from to Size (Mbits) t=0 R = 1 Mbits/s t = 1 D t = 2 В t = 10 D BD ACBO 5 5 A 10 C 10 t = 11 A B 5