EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 6, Problem P1P
Suppose the information content of a packet is the bit pattern 1110 0110 1001 1101 and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.
Expert Solution & Answer
Learn your wayIncludes step-by-step video
schedule06:06
Students have asked these similar questions
For the following two (2) questions, assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details:
The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E).
To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data.
For simplicity, assume that no other header/trailer information is added to the data.
1. The following bit stream represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing.
0111110001010011111111100101111111111110
2. The following bit stream represents data received by the link layer of a computer. For simplicity, assume that there are no errors in the bit stream. Retrieve the original data from this received bit stream.
01111110010111101111101100101001111101101111110
Suppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.
Suppose the information content of a packet is the bit pattern 1110 0110 1001 1101 and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum length checksum field is used.
Chapter 6 Solutions
EBK COMPUTER NETWORKING
Ch. 6 - Consider the transportation analogy in Section...Ch. 6 - If all the links in the Internet were to provide...Ch. 6 - Prob. R3RQCh. 6 - Prob. R4RQCh. 6 - Prob. R5RQCh. 6 - Prob. R6RQCh. 6 - Prob. R7RQCh. 6 - Prob. R8RQCh. 6 - Prob. R9RQCh. 6 - Prob. R10RQ
Ch. 6 - Prob. R11RQCh. 6 - Prob. R12RQCh. 6 - Prob. R13RQCh. 6 - Prob. R14RQCh. 6 - Prob. R15RQCh. 6 - Prob. R16RQCh. 6 - Suppose the information content of a packet is the...Ch. 6 - Suppose the information portion of a packet (D in...Ch. 6 - Prob. P4PCh. 6 - Prob. P5PCh. 6 - Prob. P6PCh. 6 - Prob. P7PCh. 6 - Prob. P8PCh. 6 - Prob. P9PCh. 6 - Prob. P10PCh. 6 - Prob. P11PCh. 6 - Prob. P12PCh. 6 - Prob. P13PCh. 6 - Prob. P14PCh. 6 - Prob. P15PCh. 6 - Prob. P16PCh. 6 - Prob. P17PCh. 6 - Prob. P18PCh. 6 - Prob. P19PCh. 6 - Prob. P20PCh. 6 - Prob. P21PCh. 6 - Prob. P22PCh. 6 - Prob. P23PCh. 6 - Prob. P24PCh. 6 - Prob. P25PCh. 6 - Prob. P26PCh. 6 - Prob. P27PCh. 6 - Prob. P32PCh. 6 - Prob. P33P
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
A(n) __________ statement is displayed on the screen to explain to the user what to enter.
Prelude to Programming
RetailItem Class Write a class named RetailItem that holds data about an item in a retail store. The class shou...
Starting Out with Python (3rd Edition)
What are the hot resistance level and current rating of a 120 V, 100 W bulb?
Introductory Circuit Analysis (13th Edition)
3. 11 (Employee Class) Create a class called Employee that includes three pieces of information as
data member...
C++ How to Program (10th Edition)
State whether each of the following is true or false. An algorithm is a procedure for solving a problem in term...
Java How To Program (Early Objects)
Knowledge Booster
Similar questions
- Suppose you are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 50-Mbps network, the RTT of the network is 80 ms and the maximum segment lifetime is 60 seconds. How many bits would you include in the Advertised Window and Sequence Num fields of your protocol header?arrow_forwardConsider 7-bit messages that we encode into 11-bit codewords using 4 parity bits. Thus our codewords look like: ⟨a, b, c, d, e, f, g, p1, p2, p3, p4⟩ where a, b, c, d, e, f, g are the original 7-bits of the message, and p1, p2, p3, p4 are 4 parity bits. Recall the two properties from Tutorial 2: (0) each bit of the original message appears in at least two parity bits, and(1) no two bits of the original message appear in exactly the same set of parity bits. For the following proposed parity bits, select whether they satisfy property (0), property (1), both, or neither. p1 = a ⊕ ep2 = b ⊕ e ⊕ fp3 = c ⊕ f ⊕ gp4 = d ⊕ g Question 3 options: a neither property b both properties c only property (0) d only property (1)arrow_forwardConsider 7-bit messages that we encode into 11-bit codewords using 4 parity bits. Thus our codewords look like: ⟨a, b, c, d, e, f, g, p1, p2, p3, p4⟩ where a, b, c, d, e, f, g are the original 7-bits of the message, and p1, p2, p3, p4 are 4 parity bits. Recall the two properties from Tutorial 2: (0) each bit of the original message appears in at least two parity bits, and(1) no two bits of the original message appear in exactly the same set of parity bits. For the following proposed parity bits, select whether they satisfy property (0), property (1), both, or neither. p1 = a ⊕ d ⊕ ep2 = a ⊕ b ⊕ e ⊕ fp3 = b ⊕ c ⊕ f ⊕ gp4 = c ⊕ d ⊕ g Question 1 options: a neither property b both properties c only property (0) d only property (1)arrow_forward
- Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channelarrow_forwardComputer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) 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?arrow_forwardSInternet Check sum Consider the figure below (simplex communication scenario). The TCP sender sends an initial window of 4 segments. Suppose the initial value of the sender ན༽)། sequence number, SEQ1, is 100 and the first 4 segments each contain 400 bytes of payload. As you can see ACK 3 is lost. What is the SEQ number (SEQ2, SEQ3, SEQ4, SEQ5) from the Sender and ACK Number (ACK1, ACK2, ACK3, ACK4, ACK5) from the receiver for each segment? Sender Seq1 Seq2 Seq3 Seg4 ACK1 ACK2 ACK3 ACK4 Seq5 ACK5 Receiverarrow_forward
- Consider the message M = 1111001101. Calculate the cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1. Also calculate error code if the 6th bit is flipped in received data. Note: consider Most Significant bit (MSB) as first bit.arrow_forwardConsider 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?arrow_forwardSuppose Alice and Bob are going to communicate using AES in CBC mode. Unfortunately Alice's message length (in bytes) is not a multiple of 16. Suppose the last block of her message is just a single zero byte. How can she pad out the last block so that she can use CBC mode? Since this needs to be a reversible operation, how does Bob recognize the padding and remove it?arrow_forward
- 4. UDP and TCP use 1's compliment for there checksum. Suppose you have the following three 8-bit bytes: 01010011 01100110 01110100 What is the 1's compliment of the sum of these bytes? Show all work. With the 1's complement scheme, how does the receiver detect errors? Is it possible that a 1-bit error will go undetected? How about a 2-bit error?arrow_forwardThe parity check matrix is given as shown:Determine the format of the codeword. c = [message | parity bits] c = [parity bits | message] c = [message | parity bits | message] none of the answersarrow_forwardWe compress the video with the pattern GoP (16 : 3) by using MPEG coding. Assume that the average compression ratios of frame I, frame P, and frame B are 1:5, 1:20, and 1:60, respectively. We put the compressed frames in 512 B packets and send them. The header size of each packet is 5% of the size of packet. Each packet contains information on one frame and its header, Each frame can be sent in multiple packets. Picture resolution is 196 × 144 for a video at 32 fps. (a)What is the compression ratio in this pattern? (b)What is the order of coding and transmitting frames in this pattern? (c)If frame 6 is lost while transmission, which frames will be faulty? (d)If frame 5 is lost while transmission, which frames will be faulty? (e)If frame 17 is lost while transmission, which frames will be faulty? (f)Find the size of uncompressed image frame? (g)In how many packets can an I-frame be transmitted on average? (h)In how many packets can an I-frame be transmitted on average? (i)In how many…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning