We are sending a 50 Mbit file from a source host to a destination host. All links in the path between source and destination have a transmission rate of 10 Mbps. Assume that the propagation speed is 2 * 10^8 meters/sec, and the distance between source and destination is 20,000 km. Question:Now suppose that the file is broken into 5 packets, each of 10 Mbits. Ignore headers that may be added to these packets. Also ignore router processing delays. Assuming store and forward packet switching at the router, what is the total delay?

We are sending a 50 Mbit file from a source host to a destination host. All links in the path between source and destination have a transmission rate of 10 Mbps. Assume that the propagation speed is 2 * 10^8 meters/sec, and the distance between source and destination is 20,000 km. Question:Now suppose that the file is broken into 5 packets, each of 10 Mbits. Ignore headers that may be added to these packets. Also ignore router processing delays. Assuming store and forward packet switching at the router, what is the total delay?

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

Suppose that we are sending a 30 Mb MP3 file from a source host to a destination host. All links in the path between source and destination have a transmission rate of 10 Mbps. Assume that the propagation speed is 2 × 108 meters/sec, and the distance between source and destination is 10,000 km. 1. Now suppose that the MP3 file is broken into 3 packets, each of 10 Mb. Ignore headers that may be added to these packets. Also ignore processing delays. Assuming store and forward packet switching at the router, what is the total delay? 2. Now suppose there is only one link between source and destination, and there are 10 TDM channels in the link. The MP3 file is sent over one of the channels. What is the end-to-end delay?
Let host A sends a file a size of 2200 byte to host B through routers R1, R2, R3, R4 and R5 respectively. Each packet contains 110 bytes of header information along with the user data. Assume that the bandwidth of each link is 106 B/s. File is split into 20 equal parts, and these packets are transmitted from A to B. Consider only transmission time and ignore processing, queuing and propagation delays also no error in transmission. What is the time taken by host A to send the complete file to host B?
Consider sending a 3500-byte datagram that has arrived at a router R₁ that needs to be sent over a link that has an MTU size of 1000 bytes to R2. Then it has to traverse a link with an MTU of 600 bytes. Let the identification number of the original datagram be 465. How many fragments are delivered at the destination? Show the parameters associated with each of these fragments.
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 simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
2. Suppose a large file of size F bits is to be sent from host A to host B. There are two links and two routers on the path from A to B. The links are uncongested and the link propagation delays are negligible. Host A segments the file into segments of size S bits each and adds 60 bits of header to each segment, forming packets of size L = S+ 60 bits. Each link has a transmission rate of R bps. Find the value of S that minimizes the file transfer delay from host A to host B.
A workstation uses the HTTP protocol to download a large file from a web server. No proxy server is used. One router's queue is full when one of the web server's packets arrives.Select the four best statements to describe this situationa. The router stores the packet until such time that it can be sent.b. Further packets sent by the server are transmitted at a higher rate to compensate for the lost packet.c. The router sends an ICMP link congested message to the server.d. The packet must be retransmitted.e. Router configuration and network behavior could be improved by configuring FQ or WFQ.f. Further packets sent by the server are transmitted at a lower rate to reduce the load on the congested link.g. Router configuration and network behavior could be improved by configuring RED or WRED.h. A tail drop will happen.
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.
Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10 msec apart (20 msec RTT) connected by a 1 Gbps link. Assume that they are using a packet size of 1000 bytes to transmit the file. For simplicity, ignore ack packets. At least how big would the window size (in packets) have to be for the channel utilization to be greater than 80%?
Host A sends the information of size 3000 bytes to Host B using TCP protocol. As long as Host B receives each packet in size 1000 bytes, Host B must acknowledge Host A. We assume the header size in each packet is 40 bytes, the starting sequence number used by Host A is 1000, and the window size of the sender side is 3000 bytes. What is the value of RCV.NXT in Host B when the second packet in Host A is sent out and acknowledged? Question options: 1000 2000 3000 4000
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? c. (c) hops required per received packet?