Register

iitkgp assignment

• retagged by
647 views
0 0 votes
Two CSMA/CD stations  are each trying to transmit long (multi-frame) files.After each frame is sent,they contend for the channel,using  the binary exponential back-off algorithm. What is the probability that the contention ends on round k, and what is the mean number of rounds per contention period?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Computer architectur...Next → · Self doubt
← Previous in category · In exponential backo...Next in category → · Self doubt
Position:
Show:

Related questions

0 0 votes
0 0 answers
743
743 views
NGK asked Dec 4, 2022
743 views
p persistant CSMA/CD
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability of 0.1. If...
2 2 votes
0 0 answers
164
164 views
Shubham Sharma 2 asked Apr 19
164 views
UGC NET CSE | December 2025 | Part 2 | Question: 64
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: $1$-persistent CSMA provides low delay under low load con...
1 1 vote
1 answers 1 answer
287
287 views
tarunmundriya asked Dec 27, 2025
287 views
Unacademy Test series | Computer Networks | 2 Marks
Consider the network that uses CSMA/CD, consists of four hosts and the distribution of this network is shown below:Distance between O and M = 30 kmDistance between M and ...
4 4 votes
2 2 answers
580
580 views
GO Classes asked Oct 24, 2025
580 views
GO Classes DPP | CN | CSMA/CD
A university department is setting up a new network that uses the CSMA/CD protocol for media access. The network operates at a bandwidth of $100$ Mbps. The design specifi...