<Bit Stuffing Question> a) The following message is to be sent by a host running a...

<Bit Stuffing Question>
a) The following message is to be sent by a host running a protocol with starting and ending flags
and bit stuffing. The starting and ending flags are both 01111110 and they have not yet been
added.
0111111011111011110011111100111111000000111110101111110
What is the message actually sent (after bit stuffing and after adding the starting and ending flags)?
b) Suppose the bit pattern shown above is received by a host running the bit stuffing protocol.
That is, this is the actual message that has been received after bit stuffing and after adding the
starting and ending flags. How many frames are being received? What is the actual content of
each frame before the flags are added and the bits are stuffed?

Expert Solution

a)
Answer : 01111110011111010111110011110011111010011111010000001111100101111101001111110.

This is the message sent actually from the sender side after adding starting and ending flag and bit stuffing.

Given that the starting and ending flag is 01111110 and also we done bit stuffing

Bit Stuffing : To Secure our Transmitting data(message) the Data Link Layer uses the framing concept which is called as Bit Stuffing. Bit Stuffing is one of the mechanism of inserting one or more bits into a message by breaking the sequence of the message. In Bit Stuffing, if five consecutive 1 bits are encountered, then the sender appends the extra 0 bit to the data. This extra stuffed bit is removed from the receiver side to get the original message.

b) Two frames are being received.

The Actual content of the each frame after removing the starting and ending flags and also bit stuffing is

1111111110 00000111111

In the given data 01111110 is the starting flag after that we have five consecutive 11111 so next 0 is removed after 11110 then we have the ending flag 01111110. In the Next frame again we have the starting flag followed by 0000011111 and 0 is removed(stuffed bit) next 1 bit followed by ending flags.

venereology answered 7 months ago

For Networks -> Please tell me about the following: Contrast byte stuffing with bit stuffing. What...

For Networks -> Please tell me about the following: Contrast byte stuffing with bit stuffing. What are the two types of error control? And which is used more? How do you correct transmission errors after detecting an error? Parity, checksum and CRCs are a type of? Why are hamming codes used?

When a message is sent electronically it is usually sent as a stream of bits, each...

When a message is sent electronically it is usually sent as a stream of bits, each of which can be either a 0 or a 1. If the digital channel is noisy then each bit has some probability of being flipped (ie changed from a 0 to a 1 or vice versa) resulting in a corrupted message. Assume that a message is being sent through a noisy channel where the probability that any individual bit will be flipped is 0.1....

Given the message m = 1011110, what will be the actual message sent with the appropriate...

Given the message m = 1011110, what will be the actual message sent with the appropriate parity bits included? Number of bits in the given message (size of m) No of parity bits required as per Hamming’s algorithm (size of r) The final message that is transferred along with parity bits (Final Answer)

Host A sent packet to Host B explain the process of how the packet is going...

Host A sent packet to Host B explain the process of how the packet is going throuth EACH OF OSI LAYERS.. +with explaining EACH LAYER FUNCTION briefly pls..thanks

For each of the following scenarios, identify the nonverbal message being sent and indicate if the...

For each of the following scenarios, identify the nonverbal message being sent and indicate if the sender and/or receiver should handle the matter differently: While you are talking to a client, she starts drumming her fingers on her desk. You are a new employee attending your first group meeting. When a man arrives after the meeting has started, others stand up to offer him a chair. When you make a suggestion at a group meeting, a colleague rolls her eyes....

Stream Cipher. A message is encoded by exclusive-or’ing each bit with a random bit stream. (In...

Stream Cipher. A message is encoded by exclusive-or’ing each bit with a random bit stream. (In exclusive or, 0⊕0 = 0, 1⊕0 = 1, 0⊕1 = 1, and 1⊕1 = 0.) a. Recover the original message from the random stream and encrypted stream, by filling in the blanks in the “Recovered” and “ASCII” rows. (In the ASCII column, interpret the byte as an ASCII character and write the value in that row.) Message: ? ? ? ? ? ? ?...

I have the following python code. I get the following message when running it using a...

I have the following python code. I get the following message when running it using a test script which I cannot send here: while textstring[iterator].isspace(): # loop until we get other than space character IndexError: string index out of range. Please find out why and correct the code. def createWords(textstrings): createdWords = [] # empty list for textstring in textstrings: # iterate through each string in trxtstrings iterator = 0 begin = iterator # new begin variable while (iterator <...

During the pandemic crisis, the federal government sent out checks for a host of programs. An...

During the pandemic crisis, the federal government sent out checks for a host of programs. An administrator for one of these programs commented: “These tax checks should help keep interest rates low or help them decline even further from their current levels.” Critically evaluate this statement (i.e., true, false, and why).

A binary message m, where m is equal either to 0 or to 1, is sent...

A binary message m, where m is equal either to 0 or to 1, is sent over an information channel. Assume that if m = 0, the value s = −1.5 is sent, and if m = 1, the value s = 1.5 is sent. The value received is X, where X = s + E, and E ∼ N(0, 0.66). If X ≤ 0.5, then the receiver concludes that m = 0, and if X > 0.5, then the...

Effect on pipelining We consider the transmission of a message between 2 host A and B...

Effect on pipelining We consider the transmission of a message between 2 host A and B via a router. We dispose of the following information : - the distance between each host and the router is 1500m. - the speed of propagation = 360.000 km/s(speed of light) - the size of each message = 1500 octets. - the speed of the link between host and router = 1Mb/s - the delay of treatment of a message in the router =...

Question