EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem R27RQ
Program Plan Intro
WEP:
WEP stands for Wired Equivalent Privacy and is a security
Given data:
Key stream= 1111000
Data= 10101100
The resulting cipher-text can be found by the following formula = a XOR b. (1)
XOR Truth table:
The XOR gate follows the following truth table:
| A | B | A XOR B |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Assume a TCP sender sends four packets of size 1024 bytes, carrying bytes 0-4095. If the second
packet is lost, what is the content of the Acknowledgement field sent in response to the third
packet? (If you think that no acknowledgement is sent, for example because the third packet is out of
order, then answer -1.)
TCP 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
е. 209
Consider a network connecting
two systems
located 4000 kilometers apart. The bandwidth of
the network is 500 x Mbps. The propagation
speed of the media is 4 × 106 meters per
second. It is needed to design a Go-Back-N
sliding window protocol for this network. The
average packet size is 107 bits. The network is to
be used to its full capacity. Assume that
processing delays at nodes are negligible. What
is the minimum size in bits of the sequence
number field?
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
- TCP 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_forwardAsaparrow_forwardConsider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases: The first packet in the sender window size is lost before reaching the destination. All transmitted packets reached the destination except the third one. Only the first and last packets in the sender window size reached the destination. Only the ACKs of the first and last packets, in the sender window size, reached the destination.arrow_forward
- Consider a long-lived TCP session with an end- to-end bandwidth of 1 Gbps (= 10⁹ bits-per- second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again isarrow_forwardIf we have a UDP packet that sent from port 42,768 to port 42,773 containing a message of exactly bytes "HELO" (coded in 8-bit ASCII). What will be the value in the checksum field.arrow_forwardA TCP connection is using a window size of 8,000 bytes and the previousacknowledgment number was 10,001. It receives a segment with acknowledgment number 12,001 and window size advertisement of 7,000 bytes. Draw a diagram to show the situation of the window before and after.arrow_forward
- With the ECB mode, if there is an error in a block of the transmitted ciphertext, only the corresponding plaintext block is affected. However, in the CBC mode, this error propagates. For example, an error in the transmitted C1 obviously corrupts P1 and P21. 1. Are any blocks beyond P2 affected? 2. Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver? (Encryption algorithms question)arrow_forwardThe sender side of rdt3.0 simply ignores (that is, takes no action on) all received packets that are either in error or have the wrong value in the acknum field of an acknowledgment packet. Suppose that in such circumstances, rdt3.0 were simply to retransmit the current data packet. Would the protocol still work?arrow_forwardQ1.Suppose a client, say C, has established a TCP connection with a server, say S. After establishing the connection, the sender sends two TCP messages with data back-to-back ( the first TCP message with sequence number 32 and the second TCP message with sequence number 100). a. What is the sequence number chosen by the client? What could be the reason for choosing this value of sequence number?b. What is the data size of first and second TCP data messages?c. Suppose the server receives the first and second TCP messages with data with the difference of 100 milliseconds delay. What could be the ACK number for both the TCP data messages from the server side as per the TCP RFC.arrow_forward
- 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)…arrow_forwardPlease 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?…arrow_forwardConsider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of k. Assume that the medium does not reorder messages. Answer the following questions: a. What are the possible sets of sequence numbers inside the sender's window at time !? Justify your answer. b. What are all possible values of the ACK field in all possible messages currently propagating back to the sender at time? Justify your answer.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