EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem R23RQ
Program Plan Intro
SA:
In
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
In an RPC-like protocol, where numerous requests can be active at the same time and responses can be given in any sequence, the following is possible: Pretend requests are sequentially numbered, and that ACK[N] confirms the receipt of reply[N]. Should the number of ACKs be cumulative? If not, what should happen in the event that an ACK is not received?
Please solve it correctly and please provide explanation of your answers.
A PC and a Web Server are communicating over a TCP connection. The PC had started the three way handshake with the initial sequence number of 3069 . The Web Server's initial sequence number is 4830 . The window size of the PC is 815 bytes and the window size of the Web Server is 463 bytes. Using the third TCP handshake ack segment the PC sends the http request of the size 396 bytes to the Web Server. Then the Web Server answers with 3 segments containing the requested data. The first segment size is 42 bytes and the second segment size is 276 bytes and the third segment size is 146 bytes respectively. The PC receives all three segments within the timer. But unfortunately the second segment was corrupted. So the PC immediately sends an acknowledgement segment. Assume that the PC uses Selective Repeat/Reject ARQ.
(d) What will be the window size of PC A after receiving only the first segment from webserver?
(e)…
Please solve it correctly and please provide explanation of your answers.
A PC and a Web Server are communicating over a TCP connection. The PC had started the three way handshake with the initial sequence number of 3069 . The Web Server's initial sequence number is 4830 . The window size of the PC is 815 bytes and the window size of the Web Server is 463 bytes. Using the third TCP handshake ack segment the PC sends the http request of the size 396 bytes to the Web Server. Then the Web Server answers with 3 segments containing the requested data. The first segment size is 42 bytes and the second segment size is 276 bytes and the third segment size is 146 bytes respectively. The PC receives all three segments within the timer. But unfortunately the second segment was corrupted. So the PC immediately sends an acknowledgement segment. Assume that the PC uses Selective Repeat/Reject ARQ.
(a) What will be the sequence number of the third TCP handshake signal send from PC to webserver?…
Chapter 8 Solutions
EBK COMPUTER NETWORKING
Ch. 8 - Prob. R1RQCh. 8 - Prob. R2RQCh. 8 - Prob. R3RQCh. 8 - Prob. R4RQCh. 8 - Prob. R5RQCh. 8 - Prob. R6RQCh. 8 - Prob. R7RQCh. 8 - Prob. R8RQCh. 8 - Prob. R9RQCh. 8 - Prob. R10RQ
Ch. 8 - Prob. R11RQCh. 8 - Prob. R12RQCh. 8 - Prob. R13RQCh. 8 - Prob. R14RQCh. 8 - Prob. R15RQCh. 8 - Prob. R16RQCh. 8 - Prob. R17RQCh. 8 - Prob. R18RQCh. 8 - Prob. R19RQCh. 8 - Prob. R20RQCh. 8 - Prob. R21RQCh. 8 - Prob. R22RQCh. 8 - Prob. R23RQCh. 8 - Prob. R24RQCh. 8 - Prob. R25RQCh. 8 - Prob. R26RQCh. 8 - Prob. R27RQCh. 8 - Prob. R28RQCh. 8 - Prob. R29RQCh. 8 - Prob. R30RQCh. 8 - Prob. R31RQCh. 8 - Prob. R32RQCh. 8 - Prob. R33RQCh. 8 - Prob. P1PCh. 8 - Prob. P2PCh. 8 - Prob. P3PCh. 8 - Prob. P4PCh. 8 - Prob. P5PCh. 8 - Prob. P6PCh. 8 - Prob. P8PCh. 8 - Prob. P12PCh. 8 - Prob. P13PCh. 8 - Prob. P14PCh. 8 - Prob. P18PCh. 8 - Prob. P20PCh. 8 - Prob. P21PCh. 8 - Prob. P22PCh. 8 - Prob. P23P
Knowledge Booster
Similar questions
- For the Zhou-Gollman non-repudiation protocol discussed in the lecture on “Non-Repudiationand Anonymity Protocols”, which one of the following statements is false:arrow_forwardPlease solve it correctly and please provide explanation of your answers. Please answer parts g, h and i. A PC and a Web Server are communicating over a TCP connection. The PC had started the three way handshake with the initial sequence number of 3069 . The Web Server's initial sequence number is 4830 . The window size of the PC is 815 bytes and the window size of the Web Server is 463 bytes. Using the third TCP handshake ack segment the PC sends the http request of the size 396 bytes to the Web Server. Then the Web Server answers with 3 segments containing the requested data. The first segment size is 42 bytes and the second segment size is 276 bytes and the third segment size is 146 bytes respectively. The PC receives all three segments within the timer. But unfortunately the second segment was corrupted. So the PC immediately sends an acknowledgement segment. Assume that the PC uses Selective Repeat/Reject ARQ. g) The second segment from webserver was corrupted. So the PC…arrow_forwardTCP is a sliding window protocol. This means... а. the TCP retransmission timer slides up as ACKS are received. O b. there can be more than one segment "in flight" (sent but no ACK has been received) at a time. с. there can only be one segment outstanding (sent but no ACK has been received) at at time.arrow_forward
- Alice encrypts a message using AES, and sends the ciphertext to Bob. Unfortunately, during the calculation of the third block, a lightning struck Alice’s house, corrupting the 2nd bit of the AES output (for the third block). Fortunately, nothing else of the calculation was affected. How much of the plaintext can Bob still recover if the mode of encryption is one of the followings: CBC, CFB, OFB, or CTR?arrow_forwardSuppose Bob receives a PGP message from Alice. If Bob receives a message, how does he know it was delivered by Alice and not, say, Trudy? Does PGP use a message authentication code (MAC)?arrow_forwardKerberos 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_forward
- In an RPC-like protocol, where numerous requests can be active at the same time and responses can be given in any sequence, the following is possible: Pretend requests are sequentially numbered, and that ACKIN] confirms the receipt of reply[N]. Should the number of ACKS be cumulative? If not, what should happen in the event that an ACK is not received?|arrow_forwardYour task is to compute a session key in a DHKE protocol based on elliptic curves. Your private key is a = 6. You receive Bob’s public key B =( 5,9). The elliptic curve being used is defined by y^2 ≡x^3+x+6 mod 11. \ no hand writtenarrow_forwardWhen Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56arrow_forward
- For Diffie Hellman Key exchange protocol, following are given:Generator g=11Prime p=23Alice chooses a random number, a = last digit of your roll number(If Roll Number: ch.en.u4cys20095, then a=5) Use a=8 Bob chooses a random number, b = 7Find the key shared by Alice (KSA) and Bob (KSB).Also verify the final key calculated by Alice and Bob are same.arrow_forwardFor the Zhou-Gollman non-repudiation protocol discussed in the lecture on “Non-Repudiationand Anonymity Protocols”, which one of the following statements is false:a) At time point 4, both A and B can produce evidence to prove that they received Kb) At time point 2, both A and B can produce evidence to prove that they received a signedmessage from the other partyc) At time point 0, S cannot prove anythingd) At time point 3, B cannot produce evidence to prove that A has access to key Ke) At time point 1, A can prove that B is alivef) At time point 4, S can prove that A is aliveg) At time point 3, S can produce evidence that that A has access to key Kh) At time point 0, A is not alivei) At time point 2, A can produce evidence to prove that B is alivej) At time point 4, the protocol terminatesarrow_forwardTCP is a sliding window protocol. This means. а. there can be more than one segment "in flight" (sent but no ACK has been received) at a time. O b. the TCP retransmission timer slides up as ACKS are received. O c. there can only be one segment outstanding (sent but no ACK has been received) at at time.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 EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable 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