EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem P18P
Program Plan Intro
Transmission Control Protocol (TCP):
- TCP is an internet protocol used for exchanging of data between the sender and the receiver. It is a secured protocol for transferring the data.
- When the sender sends data to the receiver, he/she waits for the acknowledgement from the receiver.
- If acknowledgement is received then the next data packet will be sent and the process continues till all the data packets are sent.
- If acknowledgement is not received then the receiver is assumed as hacker or intruder and the connection will be removed.
Network Address Translation (NAT):
- NAT is a method which is used to connect numerous numbers of computers to the internet using a single Internet Protocol (IP) address.
- It offers the home users who using multiple computers which are used by the family members at home to connect with the internet and small businesses a cheap and efficient internet connections.
- Usually, most of the companies use more than one router to connect with the internet.
- But after installing NAT, the mapping is kept only at a single router. Thus, it is essential to use a same router to connect with the internet.
- Multi-homing with more routers using NAT can be done by using the same router for a single connection and thus mapping is done properly.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In this problem we'll explore the impact of NATS on P2P applications. Suppose a peer
with username Arnold discovers through querying that a peer with username Bernard
has a file it wants to download. Also suppose that Bernard and Arnold are both behind a
NAT. Try to devise a technique that will allow Arnold to establish a TCP connection with
Bernard without application specific NAT configuration. If you have difficulty devising
such a technique, discuss why.
We will examine the effect of NATs on P2P applications in this problem. Suppose a peer with Arnold finds that a peer with Bernard username has a file to download. Suppose also that both Bernard and Arnold are behind a NAT. Try to formulate a technique that will permit Arnold to create a TCP link to Bernard without a special NAT application setup. If you have trouble developing such a strategy, please explain why.
We will examine the effect of NATs on P2P applications in this problem. Suppose a peer with Arnold finds that a peer with Bernard username has a file to download. Suppose also that both Bernard and Arnold are behind a NAT. Try to formulate a technique that will permit Arnold to create a TCP link to Bernard without a special NAT application setup. If you have trouble developing such a strategy, please explain why.qap
Chapter 4 Solutions
EBK COMPUTER NETWORKING
Ch. 4 - Lets review some of the terminology used in this...Ch. 4 - Prob. R2RQCh. 4 - Prob. R3RQCh. 4 - Prob. R4RQCh. 4 - Prob. R5RQCh. 4 - Prob. R6RQCh. 4 - Prob. R7RQCh. 4 - Prob. R8RQCh. 4 - Prob. R9RQCh. 4 - Prob. R10RQ
Ch. 4 - Prob. R11RQCh. 4 - Prob. R12RQCh. 4 - Prob. R13RQCh. 4 - Prob. R14RQCh. 4 - Prob. R15RQCh. 4 - Prob. R16RQCh. 4 - Prob. R17RQCh. 4 - Prob. R18RQCh. 4 - Prob. R19RQCh. 4 - Prob. R20RQCh. 4 - Prob. R21RQCh. 4 - Prob. R22RQCh. 4 - Prob. R23RQCh. 4 - Prob. R24RQCh. 4 - Prob. R25RQCh. 4 - Prob. R26RQCh. 4 - Prob. R27RQCh. 4 - Prob. R28RQCh. 4 - Prob. R29RQCh. 4 - Prob. R30RQCh. 4 - Prob. R31RQCh. 4 - Prob. R32RQCh. 4 - Prob. R33RQCh. 4 - Prob. R34RQCh. 4 - Prob. R35RQCh. 4 - Prob. P1PCh. 4 - Prob. P2PCh. 4 - Prob. P3PCh. 4 - Consider a datagram network using 32-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Prob. P8PCh. 4 - Prob. P9PCh. 4 - Prob. P10PCh. 4 - Prob. P11PCh. 4 - Prob. P12PCh. 4 - Consider sending a 2400-byte datagram into a link...Ch. 4 - Prob. P15PCh. 4 - Prob. P16PCh. 4 - Prob. P17PCh. 4 - Prob. P18PCh. 4 - Prob. P19PCh. 4 - Prob. P20PCh. 4 - Prob. P21PCh. 4 - Prob. P22P
Knowledge Booster
Similar questions
- We explore whether either UDP or TCP offers any level of end-point authentication in this problem. a. Consider a server that accepts a request via UDP and responds via UDP (for example, as done by a DNS server). Where would the server give its answer if a client with IP address X spoofs it with address Y? b. Assume a server receives a SYN with IP source address Y and responds with SYNACK. The server then receives an ACK with IP source address Y and the right . acknowledgment amount. Assuming the server selects a random initial sequence number and there is no "man-in-the-middle," how can the server be confident that the recipient is really at Y (and not at any other address X that spoofs Y)?arrow_forwardWe explore whether either UDP or TCP offers any level of end-point authentication in this problem. a. Consider a server that accepts a request via UDP and responds via UDP (for example, as done by a DNS server). Where would the server give its answer if a client with IP address X spoofs it with address Y? b. Assume a server receives a SYN with IP source address Y and responds with SYNACK. The server then receives an ACK with IP source address Y and the right acknowledgmentamount. Assuming the server selects a random initial sequence number and there is no "man-in-the-middle," how can the server be confident that the recipient is really at Y (and not at any other address X that spoofs Y)?arrow_forwardThree-way handshake is used by a TCP client and a TCP server to establish a connection, as illustrated below: 1st: client:port1 -> server:port2, SYN 2nd: server:port2 -> client:port1, SYNACK 3rd: client:port1 -> server:port2, ACK When this client is performing scanning attacks, it will generated a large number of failed connections. In each failed connection, the three-way handshake fails to complete. People commonly use SYN together with the absence of its corresponding SYNACK in this same TCP session to identify whether this connection is failed. By investigating the failed connections, an engineer finds that in legitimate/benign cases, if the server does not return SYNACK to the client, the client will not send the ACK packet after SYNACK (e.g., the 3rd packet above). Therefore, this engineer suggests that we can count the failed connections based on the following rules without considering SYNACK:arrow_forward
- Three-way handshake is used by a TCP client and a TCP server to establish a connection, as illustrated below: 1st: client:port1 -> server:port2, SYN 2nd: server:port2 -> client:port1, SYNACK 3rd: client:port1 -> server:port2, ACK When this client is performing scanning attacks, it will generated a large number of failed connections. In each failed connection, the three-way handshake fails to complete. People commonly use SYN together with the absence of its corresponding SYNACK in this same TCP session to identify whether this connection is failed. By investigating the failed connections, an engineer finds that in legitimate/benign cases, if the server does not return SYNACK to the client, the client will not send the ACK packet after SYNACK (e.g., the 3rd packet above). Therefore, this engineer suggests that we can count the failed connections based on the following rules without considering SYNACK: If a client:port1 sends…arrow_forwardTCP sessions are full-duplex, which means that data can be sent in either direction during the lifetime of the session. Consider a session in which the connection is established, the client sends 100 data segments, all of them are ACKed, and all of the ACKS are received by the sender, then the session is ended by both sides closing the connect. How many segments in total have the SYN bit of the header set to 1? а. 4 O b. 2 с. O d. 1 е. 209arrow_forwardConsider 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.arrow_forward
- Kerberos is a protocol that is based around Needham-Schroeder protocol for many to many authentications. Now answer the following questions. (Use necessary diagrams to justify your answers) i) Explain why the password of the user is not sent over the network and instead session keys are generated and shared in the Kerberos protocol. ii) The information in a TGT (Ticket Granting Ticket) is encrypted so the client cannot access the information in the TGT. However, all information in the ticket is already known to the client. Why is it still necessary to encrypt it? iii) Describe the working mechanism of how a ticket is generated between the client and server by the TGS (Ticket Granting Server) and how it is used for client-server communication.arrow_forward3. 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:arrow_forwardConsider a TCP connection between Host A and Host B and the transmission of a large file from A to B. If the buffer of host B is significantly smaller than the size of the buffer of host A and the file itself, what would be outcome?arrow_forward
- Using a TCP SYN spoofing attack, the attacker aims to flood the table of TCP connection requests on a system so that it is unable to respond to legitimate connection requests. Consider a server system with a table for 256 connection requests. This system will retry sending the SYN-ACK packet five times when it fails to receive an ACK packet in response, at 30 second intervals, before purging the request from its table. Assume that no additional countermeasures are used against this attack and that the attacker has filled this table with an initial flood of connection requests. a. At what rate must the attacker continue to send TCP connection requests to this system in order to ensure that the table remains full? b. Assuming that the TCP SYN packet is 40 bytes in size (ignoring framing overhead), how much bandwidth does the attacker consume to continue this attack?arrow_forwardTCP sessions are full-duplex, which means that data can be sent in either direction during the lifetime of the session. Consider a session in which the connection is established, the client sends 100 data segments, all of them are ACKed, and all of the ACKS are received by the sender, then the session is ended by both sides closing the connect. How many segments in total have the SYN bit of the header set to 1? а. 209 O b. 2 6 с. d. 4 О е. 1arrow_forwardR6Fragmentation 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?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education