If host A receives two SYN packets from the same port from remote host B, the second may be either a retransmission of the original or, if B has crashed and rebooted, an entirely new connection request. (a) Describe the difference as seen by host A between these two cases. (b) Give an algorithmic description of what the TCP layer needs to do upon receiving a SYN packet. Consider the duplicate/ new cases above and the possibility that nothing is listening to the destination port.

If host A receives two SYN packets from the same port from remote host B, the second may be either a retransmission of the original or, if B has crashed and rebooted, an entirely new connection request. (a) Describe the difference as seen by host A between these two cases. (b) Give an algorithmic description of what the TCP layer needs to do upon receiving a SYN packet. Consider the duplicate/ new cases above and the possibility that nothing is listening to the destination port.

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

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 a simple UDP-based protocol for requesting files (based somewhat loosely on the Trivial File Transport Protocol, or TFTP). The client sends an initial file request, and the server answers (if the file can be sent) with the first data packet. Client and server then continue with a stop-and-wait transmission mechanism. (a) Describe a scenario by which a client might request one file but get another; you may allow the client application to exit abruptly and be restarted with the same port. (b) Propose a change in the protocol that will make this situation much less likely.
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?
It is theoretically feasible for two hosts to communicate with one another by sending packets back and forth over the same connection. Please enumerate all of the components that are responsible for the overall amount of time required to process a single packet, starting to end. Is it to be anticipated that one of the delays will continue for a certain amount of time, while the duration of the other delay will be more unpredictable?
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
Let's say that Host C is running a Web server that listens on port 80. Suppose that this web server is able to maintain persistent connections and responds to requests from both Host A and Host B. Is Host C sending all of the requests over the same connection, or are there many sockets in use? Do each of them have port 80 even though they are broadcast over separate sockets? It's something you need to discuss and provide some clarification on.
It is possible for a series of packets to be sent from one host to another over the same connection. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time while the other delay's length will be more malleable?
A DoS attack has been reported against FTP server 192.168.56.1. FTP traffic spikes were seen prior to the FTP server being taken offline. A network packet capture is delivered to you through this link. From an investigator perspective, what are the IoCs of this case? By following the packet capture analysis methodology, synthesize the right filters that could be used to complete your investigation and answer the following questions: What caused the spikes in FTP traffic? What events took place prior to the FTP server being taken offline? Were any files transferred to/from the FTP server or were any user accounts compromised?
Consider a client connecting to a web server via a router as shown in Fig.Q2. Client A sends a request to the server to retrieve a 7.5 Mbytes file. Given that the segment size is 50 Kbytes, the round trip time (RTT) between the server and client is 10 ms, the initial slow-start threshold is 16 and the client's buffer always has a storage space of 1 Mbytes. Assume that TCP Reno is used, there is no loss during transmission and the headers of protocols are ignored. 400 Mbps 200 Mbps 400 Mbps Link a Link b Link c Client Web Server Fig.Q2 (a) Describe how the value of sending window changes as a function of time (in units of RTT) during the whole connection time. 2.
R6Fragmentation of an IP datagram takes place if its size is larger than the MTU of the subnet over which the datagram will be routed. Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
When HTTP streaming is being used, are the TCP receive buffer and the application buffer on the client both the same thing? If they are unable to speak with one another, it is unclear how they will behave toward one another.
The usage of static routing has been met with opposition for several reasons, but which of the following is NOT one of them? O. Extra hardware or bandwidth is unnecessary. O.b. The routing tables are modest in size, need just occasional attention. Any alteration to the topology will, of course, have consequences for the setup. The path to the destination never deviates from that one.