Scribd
Upload
11 views

CSMA-CD-Numerical-solution

The document discusses various problems related to CSMA/CD networks, including calculating minimum frame sizes, packet sizes, collision probabilities, and transmission times. It presents specific scenarios involving nodes A and B on Ethernet segments, detailing their transmission attempts and outcomes. The author expresses uncertainty about some answers and suggests consulting faculty for verification.

Uploaded by

user.prayag2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

CSMA-CD-Numerical-solution

The document discusses various problems related to CSMA/CD networks, including calculating minimum frame sizes, packet sizes, collision probabilities, and transmission times. It presents specific scenarios involving nodes A and B on Ethernet segments, detailing their transmission attempts and outcomes. The author expresses uncertainty about some answers and suggests consulting faculty for verification.

Uploaded by

user.prayag2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

1.

-In a CSMA / C D network running at 1 Gbps over 1 km cable with no repeaters, the signal
speed in the cable is 200000 km/sec. What is minimum frame size?

Probable answers from here on are given by me (Tirth Shah 22BCP230) and no faculties were
consulted by me so be cautious in using these answers.

Probable Ans -> Tt >= 2Tp, Tt = L/B, Tp = d/v, L = ?, solving according to first equation i
get,

2. A 2 km long broadcast LAN has 10 7 bps bandwidth and uses CSMA / CD. The signal travels
along the wire at 2 x 10 8 m/sec. What is the minimum packet size that can be used on this
network?

Probable Answer:

Like the above question, use same formula:


In the above image Medium Access Control Method = CSMA/CD and not MAC

3. A and B are the only two stations on Ethernet. Each has a steady queue of frames to send.
Both A and B attempts to transmit a frame, collide and A wins first back off race. At the end
of this successful transmission by A, both A and B attempt to transmit and collide. The
probability that A wins the second back off race is ___ .

Probable Answer:

After k Collissions there are (0, 2k –


1) possible timestamps for retransmission (Binary
Backoff)
4. Suppose nodes A and B are on same 10 Mbps Ethernet segment and the propagation delay
between two nodes is 225 bit times. Suppose A and B send frames at t=0, the frames collide,
then at what time they finish transmitting a jam signal. Assume a 48 bit jam signal.

Probable Answer:
(Formula: Time in bit times to sec = Bit Time / Bandwidth ---- Do Cross Check With Faculty
Once ----)

5. Suppose nodes A and B are attached to opposite ends of the cable with propagation delay of
12.5 ms. Both nodes attempt to transmit at t=0. Frames collide and after first collision, A
draws k=0 and B draws k=1 in the exponential back off protocol. Ignore the jam signal. At
what time (in seconds), is A’s packet completely delivered at B if bandwidth of the link is
10mbps and packet size is 1000 bits.

This is my answer, but i am really not sure about this one, so if someone has a better
answer/explanation then please tell here or DM on teams [email protected], Thank
You.

This is what i found online and i am not sure about the channel clearing time so it is better to
get it rechecked by a faculty member first. The picture for the solution is on next page.
6.

You might also like