• edited by
21,349 views
45 45 votes

A network with CSMA/CD protocol in the MAC layer is running at $1 \text{Gbps}$ over a $1 \text{km}$ cable with no repeaters. The signal speed in the cable is $2 \times  10^{8}\text{m/sec}$. The minimum frame size for this network should be:

  1. $10000 \text{bits}$
  2. $10000 \text{bytes}$
  3. $5000\text{ bits}$
  4. $5000 \text{bytes}$

4 Answers

Best answer
77 77 votes

Answer is(A)

Minimum frame size is needed to ensure that collisions are detected properly. The minimum frame size ensures that before a frame is completely send, it would be notified of any possible collision and hence collision detection works perfectly.

In CSMA/CD a sender won't send a packet if it senses that another sender is using it. So, assume a sender A and a receiver B. When sender sends a packet, receiver might use the cable until it is notified that a packet is being send to it. The receiver will be notified as soon as the first bit arrives that a packet is coming and it won't send any packet after this until that packet is finished. So, in the worst case for collision, receiver will transmit a packet back to the sender just before the first bit of the packet reaches it. (If $t_d$ is the propagation delay of the channel, this time would be just $t_d$). In this case, surely there will be collision. But for the sender to detect it, it should be notified of B's packet before the sending of the first packet finishes. i.e., when B's packet arrives at A (takes another $t_d$ time), A shouldn't have finished transmission of the first packet for it to detect a collision. i.e., A should be still continuing the sending of the packet in this time interval of $2 \times t_d$. Thus,

The amount of bits that can be transmitted by A in $2\times t_d$ time should be less than the frame size (S) (sending of the frame shouldn't finish in this time)

Amount of bits transmitted in time $t$ is $\text{bandwidth} \times t$ and propagation delay- $t_d$ is $\dfrac{\text{distance}}{\text{link speed}}$

So, $S  \geq 2\times \text{bandwidth} \times t_d$

$\geq 2 \times 10^9 \times \dfrac{ 1000}{ 2 \times 10^8}$

$\geq 10000$ bits

• edited by
8 8 votes

CSMA/CD can detect collisions always if below condition is satisfied:

$T.T \geq 2 * P.T$ where T.T is Transmission time and P.T is Propagation time.

If above condition is satisfied CSMA/CD can work always and can not stuck.

So, We know that $T.T = \frac{Data size}{Band width}$ and $P.T = \frac{Distance}{Velocity}$

Therefore,  $\frac{Data size}{Band width} \geqslant 2 * \frac{Distance}{Velocity}$

                    $\frac{Data size}{ 10^{9}} \geqslant 2 * \frac{1000 }{2\ast 10^{8}}$

by solving,  Data size $\geqslant$ 10000 bits.

Hence, Option (A) is correct.

 

You can apply same procedure for below questions also by keeping $T.T \geq 2 * P.T$ condition satisfied.

https://gateoverflow.in/3376/gate2008-it-65 Same question as above, asked for 'Frame size' all other things are given.

https://gateoverflow.in/8400/gate2015-3-6 This question is also easily solvable by the same method, here we have to find 'velocity' all other things are given in question.

https://gateoverflow.in/39589/gate2016-2-53 This question also solvable by above formula, here we have to find 'Frame size' all other things are given in question.

• edited by
Answer:
Position:
Show:

Related questions

62 62 votes
8 answers 8 answers
22.5k
22.5k views
Ishrat Jahan asked Nov 3, 2014
22,474 views
Which of the following statements is TRUE about CSMA/CD:IEEE $802.11$ wireless LAN runs CSMA/CD protocolEthernet is not based on CSMA/CD protocolCSMA/CD is not suitable f...
111 111 votes
12 answers 12 answers
42.0k
42.0k views
Ishrat Jahan asked Nov 3, 2014
41,954 views
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte ...
48 48 votes
11 answers 11 answers
23.0k
23.0k views
go_editor asked Feb 14, 2015
23,040 views
Consider a CSMA/CD network that transmits data at a rate of $100\;\textsf{Mbps}\; (10^8\;\text{bits}$ per second) over a $1\;\textsf{km}$ (kilometre) cable with no repeat...
74 74 votes
7 answers 7 answers
27.2k
27.2k views
Ishrat Jahan asked Nov 3, 2014
27,191 views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...