Computer Science 4. Exercise.Q1. Consider transferring a file of 5000 bytes from Host A to Host B. Assume an MSS of 1460bytes. The initial sequence number of A is 500. Suppose each data segment is carrying a payloadof MSS size except for the last segment. What is the sequence number of the last data segment?Please show your calculation steps and your answer.Q2. Consider a subnet with prefix 128.119.40.128/26. Give an example of one IP address (of formXXX.XXX.XXx.XXx) that can be assigned to this network. Suppose an ISP owns the block of addressesof the form 128.119.40.64/26. Suppose it wants to create four subnets from this block, with eachblock having the same number of IP addresses. What are the prefixes (of form a.b.c.d/x) for thefour subnets?

Dear student, I can do only first one question. Please re-post your other pending question in next…

4. Exercise. Q1. Consider transferring a file of 5000 bytes from Host A to Host B. Assume an MSS of 1460 bytes. The initial sequence number of A is 500. Suppose each data segment is carrying a payload of MSS size except for the last segment. What is the sequence number of the last data segment? Piease show your calculation steps and your answer.

4. Exercise. Q1. Consider transferring a file of 5000 bytes from Host A to Host B. Assume an MSS of 1460 bytes. The initial sequence number of A is 500. Suppose each data segment is carrying a payload of MSS size except for the last segment. What is the sequence number of the last data segment? Piease show your calculation steps and your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1 = 12.8 Mbps, R2 = 4000 kbps, and R3 = 2 Mbps.a. Assuming no other traffic in the network, what is the throughput for the file transfer?b. Suppose the file is 12 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B?c. Repeat (a) and (b), but now with R2 reduced to 500 kbps.
Consider a web page whose base file is of size S1 = 10 KB. Assume that the web page consists of N = 20 inline objects each of size S2 = 100 KB. Assume that the round-trip time to the web server is T = 100 ms and the bottleneck capacity is C = 10 Mbps. Ignore any packetization delays and header overhead.a. Assuming non-persistent HTTP is used with a single TCP connection, how long does it take to download the web page?b. Assuming non-persistent HTTP is used with 4 parallel TCP connections, how long does it take to download the web page?c. Assuming pipelined, persistent HTTP is used, how long does it take to download the web page? ”Pipelined” means requests for multiple objects can be sent back-to-back on the same connection.d. Assuming non-pipelined, persistent HTTP with 2 parallel TCP connections is used, how long does it take to download the web page? Assume that the 2 parallel connections equally share the total available bandwidth C.
P14. Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to fragmentation?
1. Suppose two hosts, A and B, are separated by 30,000 kilometers and are connected by a direct link of R = 3 Mbps. Suppose the propagation speed over the link is 2.5 x 108 meters/sec. a. Calculate the bandwidth-delay product, R _ dprop. b. Consider sending a file of 900,000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time?
True or false? Suppose Host A is sending Host B a large file over a TCP connection. The number of unacknowledged bytes that A sends cannot exceed the size of the receive buffer.
Assume that a client can use UDP to obtain a file from a distant server at a known address. The client initiates the request for a file name, and the server responds with a sequence of data packets containing various file components. To ensure delivery reliability, the client and server use a stop-and-wait protocol. Is there anything else wrong with this protocol aside apparent performance issues? Consider the possibility of process failure.
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…
Consider transferring an enormous file of L bytes from Host A to Host B. Assume an MSS of 536 bytes.a. What is the maximum value of L such that TCP sequence numbers are not exhausted? Recall that the TCP sequence number field has 4 bytes.b. For the L you obtain in (a), find how long it takes to transmit the file. Assume that a total of 66 bytes of transport, network, and data-link header are added to each segment before the resulting packet is sent out over a 155 Mbps link. Ignore flow control and congestion control so A can pump out the segments back to back and continuously.
Consider transferring an enormous file of L bytes from host A to host B. Assume an MSS of 1460 bytes.a. What is the maximum value of L such that TCP sequence numbers are not exhausted? Recall that the TCP sequence number field has four bytes.b. For the L you obtain in (a), find how long it takes to transmit the file Assume that a total of 66 bytes of transport, network, and data-link header are added to each segment before the resulting packet is sent out over at 10 Mbps link. Ignore flow control and congestion control so A can pump out the segments back to back and continuously.
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
a) In a bus CSMA/CD network with a data rate of 10 Mbps, a collision occurs 20 µs after the first bit of the frame leaves the sending station. What should the length of the frame be so that the sender can detect the collision? b) There are only two stations, A and B, in a bus 1-persistence CSMA/CD network with Tp = 25.6 µs and Tr = 51.2 µs. Station A has a frame to send to station B. The frame is unsuccessful two times and succeeds on the third try. Draw a flowchart for this problem. Assume that the R is 1 and 2 respectively and ignore the time for sending a jamming signal.
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. The bandwidth is infinite, but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four, etc.