• edited by
23,955 views
88 88 votes
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit $100$ $\text{bits}$ plus the end-to-end propagation delay. Assume a propagation speed of $2 \times 10^8 m/sec$. The length of the LAN is $1$ $\text{km}$ with a bandwidth of $10$ $\text{Mbps}$. The maximum number of stations that can be allowed in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$ is
 
  1. $3$
  2. $5$
  3. $10$
  4. $20$

7 Answers

Best answer
125 125 votes
$T_t = 10 \mu s$

$T_p = 5 \mu s$

Efficiency of the network $=\dfrac{T_t }{(T_t + T_p)}=\dfrac{10}{15}=\dfrac{2}{3}.$

Total throughput available for the entire network $=\text{Efficiency$\times $ Bandwidth}$
$=\dfrac{2}{3}\times 10 \text{ Mbps}=\dfrac{20}{3}\text{ Mbps}$

Let, no. of stations $=N\text{(each wants a throughput of $\dfrac{2}{3}$ Mbps)},$

   $N\times \dfrac{2}{3}\text{ Mbps}=\dfrac{20}{3} \text{ Mbps}\Rightarrow N=10.$

$\Rightarrow 10$ stations can be connected in the channel at max.

Correct Answer: $C$
• edited by
21 21 votes

For each station slot time is tx + tp(transmission time+prop. delay) 

tx = 100b/10Mbps = 10μs

tp = d/v = 5μs

So slot time is 15μs

If there are N stations then total cycle time is 15Nμ sec

efficiency will be useful time/total time ie (transmission time/total time) = (10μ/15Nμ) 

throughtput is eff*bandwidth => (10/15N)*10Mbps = (2/3)Mbps.

Solving this for N gives N as 10

Correct answer is 3

1 flag:
✌ Edit necessary ()
19 19 votes

Length of 1 time slot=Transmission time for 100 bits + propagation time (one-way).

Now

$T_t(100\,bits\,)=\frac{100bits}{10^7bps}=10\mu s$

$T_p=\frac{10^3}{2*10^8}=5 \mu s$

Cycle time or 1 slot time=$15 \mu s$

Now in a TDM based channel access method, each node gets dedicated bandwidth of $\frac{R}{N} bps$ where 

R=Bandwidth of the broadcast medium

N=Total number of nodes in the network

For each node, the efficiency would be = $\frac{10}{15}=\frac{useful\,time}{total\,time}=\frac{2}{3}$

So, for each node the Throughput would be=Efficiency*Available Bandwidth=$\frac{2}{3}*\frac{10\,Mbps}{N}$

and this throghput is given in question i.e. $\frac{2}{3}$

$\frac{2}{3}*\frac{10\,Mbps}{N}=\frac{2}{3}\,Mbps$

N=10. Answer

14 14 votes

Efficiency=useful time/total time

=transmission time/transmission +propagation time=10ms/(10ms+15ms)

=2/3

so Effective bandwith utilized=(2/3)*10Mbps

Let there be N stations,throughput of each station should be 2/3 Mbps according to problem statement

so N *2/3 =Effective bandwith 

N*2/3=(2/3)  * 10

N=10 

0 0 votes

In a Time Division Multiplexing (TDM) medium access control bus LAN, each station is assigned one time slot per cycle for transmission. The length of each time slot is defined as the time to transmit 100 bits plus the end-to-end propagation delay.

We are given:

  • Propagation speed = $2 \times 10^8$ m/s
  • Length of LAN = 1 km = 1000 meters
  • Bandwidth = 10 Mbps = $10 \times 10^6$ bps
  • Required throughput per station = $\frac{2}{3}$ Mbps

Propagation delay ($t_p$) is the time for a signal to travel from one end of the LAN to the other:

$$
t_p = \frac{\text{distance}}{\text{propagation speed}} = \frac{1000}{2 \times 10^8} = 5 \times 10^{-6}~\text{seconds} = 5~\mu s
$$

Transmission time ($t_t$) for 100 bits at 10 Mbps:

$$
t_t = \frac{100}{10 \times 10^6} = 10^{-5}~\text{seconds} = 10~\mu s
$$

Each slot duration = transmission time + propagation delay:

$$
T_{\text{slot}} = t_t + t_p = 10~\mu s + 5~\mu s = 15~\mu s
$$

If there are $n$ stations, and each gets one slot per cycle, the total cycle time is:

$$
T_{\text{cycle}} = n \cdot T_{\text{slot}} = n \cdot 15~\mu s
$$

In TDM, each station transmits 100 bits every cycle. So, the throughput per station is:

$$
\text{Throughput}_{\text{per station}} = \frac{100~\text{bits}}{T_{\text{cycle}}} = \frac{100}{n \cdot 15 \times 10^{-6}}~\text{bps}
$$

Simplifying:

$$
= \frac{100 \times 10^6}{15n} = \frac{10^8}{15n}~\text{bps}
$$

We require this to be at least $\frac{2}{3}$ Mbps = $\frac{2}{3} \times 10^6$ bps:

$$
\frac{10^8}{15n} \geq \frac{2}{3} \times 10^6
$$

Multiplying both sides by $n$:

$$
\frac{10^8}{15} \geq \frac{2}{3} \times 10^6 \cdot n
$$

Dividing both sides by $\frac{2}{3} \times 10^6$:

$$
n \leq \frac{10^8}{15} \cdot \frac{3}{2 \times 10^6} = \frac{3 \times 10^8}{30 \times 10^6} = \frac{300}{30} = 10
$$

Thus, the maximum number of stations that can be allowed in the LAN so that each station achieves a throughput of at least $\frac{2}{3}$ Mbps is 10.

$$
\boxed{10}
$$

Answer:
Position:
Show:

Related questions

73 73 votes
7 answers 7 answers
26.7k
26.7k views
Ishrat Jahan asked Nov 3, 2014
26,691 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...
31 31 votes
5 answers 5 answers
9.3k
9.3k views
Ishrat Jahan asked Nov 3, 2014
9,280 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...
27 27 votes
3 answers 3 answers
10.7k
10.7k views
Ishrat Jahan asked Nov 3, 2014
10,742 views
Suppose that two parties $A$ and $B$ wish to setup a common secret key (D-H key) between themselves using the Diffie-Hellman key exchange technique. They agree on $7$ as ...
47 47 votes
6 answers 6 answers
32.3k
32.3k views
Ishrat Jahan asked Nov 3, 2014
32,298 views
Consider the following message $M = 1010001101$. The cyclic redundancy check (CRC) for this message using the divisor polynomial $x^5+x^4+x^2+1$ is :$01110$$01011$$10101$...