Question

In: Computer Science

Let A and B be two stations attempting to transmit on an Ethernet. Each has a...

Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A’s frames will be numbered ?1, ?2 and so on, and B’s similarly. Let ? = 51.2 ???? be the exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 × ? and 1 × ?, respectively. As a result, Station A transmits ?1 while Station B waits. At the end of this transmission, B will attempt to retransmit ?1 while A will attempt to transmit ?2. These first attempts will collide, but now A backs off for either 0 × ? or 1 × ? (with equal probability), while B backs off for time equal to one of 0 × ?, 1 × ?, 2 × ? and 3× ? (with equal probability).
(a) Give the probability that A wins this second backoff race immediately after his first collision.
(b) Suppose A wins this second backoff race. A transmits ?2 and when it is finished, A and B collide again as A tries to transmit ?3 and B tries once more to transmit ?1. Give the probability that A
wins this third backoff race immediately after the first collision.
(c) What is the probability that A wins all the ? backoff races. (? is a given constant)
(d) Assume that there are 3 stations sharing the Ethernet. Will the chance for A to win all the backoff
races decrease or increase? Why?

Solutions

Expert Solution

(a) Give the probability that A wins this second back-off race immediately after his first collision.
Answer:------------
For the second back-off race,
A picks kA(2) to be either 0 or 1 with equal probability,so 1/2 for each.
B picks kB(2) from (0, 1, 2, 3) with probability 1/4 for each choice.
A wins the second backoff race if kA(2) < kB(2).
P[A wins] = P[kA(2) < kB(2)]
= P[kA(2) = 0] × P[kB(2) > 0] + P[kA(2) = 1] × P[kB(2) > 1]
= 1/2 × 3/4 + 1/2 × 2/4
= 3/8 + 2/8
= 5/8

(b) Suppose A wins this second back-off race. A transmits ?2 and when it is finished, A and B collide again as A tries to transmit ?3 and B tries once more to transmit ?1. Give the probability that A wins this third back-off race immediately after the first collision.
Answer:------------
In this case, again A picks kA(3) to be either 0 or 1 with probability 1/2 each,
while B picks kB(3) from (0, 1, 2, 3, 4, 5, 6, 7), each with probability 1/8:
P[A wins] = P[kA(3) < kB(3)]
= P[kA(3) = 0] × P[kB(3) > 0] + P[kA(3) = 1] × P[kB(3) > 1]
= 1/2 × 7/8 + 1/2 × 6/8
= 7/16 + 6/16
= 13/16


Related Solutions

Almost all FM radio stations transmit digital FM signal. Explain how the fully analog FM has...
Almost all FM radio stations transmit digital FM signal. Explain how the fully analog FM has been converted to fully digital FM.
Explain each part of an Ethernet Packet in detail (about two sentences)
Explain each part of an Ethernet Packet in detail (about two sentences)
You are the observer of a peculiar individual that enters a room with two stations: each...
You are the observer of a peculiar individual that enters a room with two stations: each station has a coin. Suppose that the coin at station A has a 40% chance of landing on heads, while the coin at station B has a 50% chance of landing on heads. The individual plays the following, monotonous game: if the coin lands on tails, he will stay at the station; otherwise, he will move to the other station. (a) Recall that a...
Let A and B be two non empty bounded subsets of R: 1) Let A +B...
Let A and B be two non empty bounded subsets of R: 1) Let A +B = { x+y/ x ∈ A and y ∈ B} show that sup(A+B)= sup A + sup B 2) For c ≥ 0, let cA= { cx /x ∈ A} show that sup cA = c sup A hint:( show c supA is a U.B for cA and show if l < csupA then l is not U.B)
Suppose there are only two TV stations in Arecima, each broadcasting programming over the airwaves. Each...
Suppose there are only two TV stations in Arecima, each broadcasting programming over the airwaves. Each station wishes to get the maximum number of viewers and each is considering whether to carry a reality-tv show or a comedy show in its 11pm slot on Saturdays. The 1000 Arecima residents have the following preferences: 800 of them wish to watch a reality-tv show and have no interest in a comedy show whereas 200 people would enjoy watching a comedy on TV...
A bus travels between two cities A and B that are 100 miles apart.Two service stations...
A bus travels between two cities A and B that are 100 miles apart.Two service stations are located at mile 30 and mile 70, as well as in the cities themselves. The bus breaks down on the road. Assuming the place of breakdown is uniformly distributed between the cities, what is the probability that it is no more than 10 miles to the nearest service station? What is the expectation of the distance to the nearest service station?
(V) Let A ⊆ R, B ⊆ R, A 6= ∅, B 6= ∅ be two...
(V) Let A ⊆ R, B ⊆ R, A 6= ∅, B 6= ∅ be two bounded subset of R. Define a set A − B := {a − b : a ∈ A and b ∈ B}. Show that sup(A − B) = sup A − inf B and inf(A − B) = inf A − sup B
Roll two fair dice. Each die has six faces. A. Let A be the event that...
Roll two fair dice. Each die has six faces. A. Let A be the event that either a 3 or 4 is rolled first followed by an odd number. P(A) =  Round your answer to two decimal places. B. Let B be the event that the sum of the two dice is at most 7. P(B) =  Round your answer to two decimal places. C. Are A and B mutually exclusive events? (Yes or No) D. Are A and B independent or...
Let A = { a , b } A = { a , b } and...
Let A = { a , b } A = { a , b } and B = P ( A ) . B = P ( A ) . Prove that [ B ; ∪ , ∩ , c ] [ B ; ∪ , ∩ , c ] is a Boolean algebra. Write out the operation tables for the Boolean algebra.
A car wash has two stations, 1 and 2. The service time at station 1 is...
A car wash has two stations, 1 and 2. The service time at station 1 is exponentially distributed with parameter λ1, and the service time at station 2 is exponentially distributed with parameter λ2.When a car arrives at the car wash, it begins service at station 1, provided station 1 is free; otherwise, the car waits until station 1 is available. Upon completing service at station 1, the car then proceeds to station 2, provided station 2 is free; otherwise,...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT