It's UWAweek 16 (1st semester, week 7)

help3002

This forum is provided to promote discussion amongst students enrolled in CITS3002 Computer Networks.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message. How do I ask a good question?

Displaying selected article
Showing 1 of 203 articles.
Currently 1 other person reading this forum.


 UWA week 15 (1st semester, week 6) ↓
SVG not supported

Login to reply

👍?
helpful
10:20pm Tue 9th Apr, ANONYMOUS

Hi, hoping I could check my solution to tutorial Q2c with someone here as I couldn't make it to the last two tutes :) (c) What is the probability that all 3 devices can successfully transmit their frames in a maximum of 3 time slots after the original collision? P(maximum of 3 time slots after the original collision) = P(any one node is successful in slot-1) * P(any one node is successful in slot-2) * P(final node successful in slot-3) Slot 1: three device with backoff times of 0, 1 at a probability of 1/2 each P(any one node is successful in slot-1) = 3C1 * P(0) * P(1) * P(1) = 3 * 1/2 * 1/2 * 1/2 = 3/8 Slot 2: two devices with backoff times of 0, 1, 2, 3 at a probability of 1/4 each If k1 is the backoff time chosen by one device, and k2 is backoff time chosen by the other device P(any one node is successful in slot-2) = 2C1 * P(k1 < k2) P(k1 < k2) consists of the 6 pairs [(0,1), (0,2), (0,3), (1,2), (1,3), (2,3)] and each pair occurs with a probability of 1/4 * 1/4 = 1/16 P(k1 < k2) = 6 * 1/16 = 6/16 P(any one node is successful in slot-2) = 2 * 6/16 = 12/16 = 3/4 Slot 3: one device with backoff times of 0, 1, 2, 3, 4, 5, 6, 7 at a probability of 1/8 each P(final node successful in slot-3) = 1 Finally: P(maximum of 3 time slots after the original collision) = 3/8 * 3/4 * 1 = 9/32

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy