edited by
229 views
0 votes
0 votes

Consider sending a message of $10,000$ bits from the source node $S$ to the destination node $D$ passing through the two routers $R 1$ and $R 2$ as shown in the figure. Each of the three links on the path has a propagation delay of $20\; \mathrm{~ms}$. Node $S$ has a transmission rate of $100 \;\mathrm{bits} / \mathrm{sec}$, and each of $R 1$ and $R 2$ has a transmission rate of $1000\; \mathrm{bits} / \mathrm{sec}$. Assume that: (i) each router uses store-and-forward packet switching;  (ii) the size of the header is negligible compared to the packet size; (iii) except transmission and propagation delays, all other delay components are negligible.

 

  1. Find the end-to-end latency of the message when it is sent as a whole.
  2. Find the end-to-end latency of the message when it is broken into $10$ packets each of size $1000$ bits, and then transmitted to the destination.
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
2
admin asked Aug 8, 2022
584 views
Let $G$ be a simple undirected graph having $n$ vertices with the property that the average of the degrees of the vertices in $G$ is at least $4.$ Consider the following ...
0 votes
0 votes
1 answer
3