Computer Science - Networking - Discussion

How is it possible?

Can please someone explain it correctly.../.?

I also want to know how it is possible?

- Adaptive Tree Walk Protocol Trick: partition the group of station and limit the contention for each slot. Under light load, every one can try for each slot like aloha Under heavy load, only a small group can try for each slot how do we do it " treat stations as the leaf of a binary tree. " first slot (after successful transmission) , all stations (under the root node) can try to get the slot. " if no conflict, fine. " if conflict, only nodes under a subtree get to try for the next one. (depth first search).

Sorry I can't understand how it will get 7 slots?

Please provide us with the explanation because I got 5 in place of 7 slots.

I am not understanding this concept. Can anybody explain me in detail? please.

Please provide us the correct explanation.

I don't understand please explain in a better way.

1. A is tested and encounters a collision from 7,8.
2. B is tested and encounters a collision from 7,8.
3. C is tested and encounters a collision from 7,8.
4. D is tested and encounters a collision from 7,8.
5. E is tested and encounters a collision from 7,8.
6. F is tested and encounters a collision from 7,8.
7. G is tested and transmits 7 & 8 uncontested

thus, 7 slots are required to slot the contention.