Log In
1 vote
Consider a network using the pure $\text{ALOHA}$ medium access control protocol, where each frame is of length $1,000$ bits. The channel transmission rate is $1$ Mbps ($=10^6$ bits per second). The aggregate number of transmissions across all the nodes (including new frame transmissions and retransmitted frames due to collisions) is modelled as a Poisson process with a rate of $1,000$ frames per second. Throughput is defined as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ______________
in Computer Networks
edited by

3 Answers

1 vote
$L/B$ $→$ $1$ $ms$

$g*$ $e^{-2*g}$

$\text{pure aloha formula, if we put g=1, for one frame, we get 0.13533 }$
$\text{for 1000 frames, we get 135.33}$

$\text{Nearest integer 135}$

edited ago by
What if we do like :

Efficiency in pure aloha = 18%.

Since Throughput = Efficiency*Bandwith

                                = 0.18 * 1 Mbps

Throughput in terms of frames = (0.18 * 10^6)/1000

efficiency in pure aloha is 18.4% when you have g as 0.5

that is the maxima

but did the question ask about maxima?
Thanks. Got the mistake.
1 vote
Frame Transmission Time : $T_{fr}= L/B$ = 1000/$10^{6}$ =1ms

System generates 1000 frames in 1 second.

Now, G is defined as average no of frames generated by the system in one frame transmission time.

       in 1 second → 1000 frames

      $\therefore$  in 1 ms → 1 frame

Therefore,  G= 1

average no of successful transmissions, $S=G*e^{-2G}$ = $1*e^{-2}=$$0.13534$  i.e. 13.534%

13.5% of the frames get successfully transmitted.

$\therefore$  Throughput = $\frac{13.534}{100}$$*1000$= 135.34 $\approx 135$
0 votes
Read 1st two lines of the question & skipped it :/
1 flag:
✌ Spam (Hira Thakur)

Related questions

0 votes
1 answer
A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit frame on average once every 100 sec, even if the previous one has not yet been sent (e.g., the stations can buffer outgoing frames). What is the maximum value of N?
asked Mar 15, 2019 in Computer Networks ajaysoni1924 756 views
0 votes
2 answers
1 vote
1 answer
A large population of ALOHA users manages to generate $50 \hspace{0.1cm} requests/sec$, including both originals and retransmissions. Time is slotted in units of $40 \hspace{0.1cm} msec$. What is the chance of success on the first attempt? What is the probability of exactly k collisions and then a success? What is the expected number of transmission attempts needed?
asked May 29, 2018 in Computer Networks Abhilash Mishra 391 views
1 vote
2 answers
Consider a complete binary tree with $7$ nodes. Let $A$ denote the set of first $3$ elements obtained by performing Breadth-First Search $\text{(BFS)}$ starting from the root. Let $B$ denote the set of first $3$ elements obtained by performing Depth-First Search $\text{(DFS)}$ starting from the root. The value of $\mid A-B \mid $ is _____________
asked Feb 18 in DS Arjun 310 views