Consider a scenario in which Host A wants to simultaneously send packets to Hosts B and C. A is connected to B and C via a broadcast channel-a packet sent by A is carried by the channel to both B and C. Suppose that the broadcast channel connecting A, B, and C can independently lose and corrupt packets (and so, for example, a packet sent from A might be correctly received by B, but not by C). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A to B and C, such that A will not get new data from the upper layer

Question

Lauren Robles

Computers & Technology

31 October, 07:53

Consider a scenario in which Host A wants to simultaneously send packets to Hosts B and C. A is connected to B and C via a broadcast channel-a packet sent by A is carried by the channel to both B and C. Suppose that the broadcast channel connecting A, B, and C can independently lose and corrupt packets (and so, for example, a packet sent from A might be correctly received by B, but not by C). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A to B and C, such that A will not get new data from the upper layer

+1

Answers (1)

Know the Answer?

Weston Donaldson · Answer 1

The description for the given question is described in the explanation section below.

Explanation:

Anyway, after getting acknowledgment from B, C and D will A immediately send a package here. So that we can establish a procedure whereby A must wait until all three acknowledgments are provided.

Start waiting for the specified scenario or situation:

⇒ For sender (sender is A here):

Keep the following steps repeated before all packets are shipped out.

Step 1 : Place in the broadcast network a fresh packet and configure the wait bit = 1 and the ack bits = 000 and begin the timer (t=0). While bit allows while for the sender (A) to deliver the next packet. Ack parts will hold the earned acknowledgments until now. When first bit = 1 then ack obtained from B, if second bit = 1 then ack obtained from B and instead ack collected from D if the last bit = 1. Step 2 : Once sender (A) receives a new acknowledgment, change the ack bits through generating the resulting bit = 1. Step 3 : Test if bits of the ack = 111 otherwise render a bit of wait = 0. Go so far as to step 1 and proceed to step 2. Step 4 : Whether A has been waiting for t = t0 time and therefore not gotten at least one ack, then place a certain packet on the channel and make t=0, ack bits = 000 and start preparing bit = 1. Then move forward with step 2.

⇒ For receiver (receiver are B, C and C here):

Step 1 : Wait for another package. Step 2 : On delivery of the new document, send ack to the provider and begin countdown t = 0. Step 3 : When no latest packet arrives in t = t0 time then give the existing packet acknowledgment again. As it indicates the channel ack may be missing. Step 4 : Taking a move to 1.