(a) A router RI receives traffic from two Local Area Networks LAN 1 and LAN 2, a
ID: 3874368 • Letter: #
Question
(a) A router RI receives traffic from two Local Area Networks LAN 1 and LAN 2, and forwards traffic on a link at 8 Mbits/sec towards a router R2. Router R2 receives also traffic from another Local Area Network LAN 3, and forwards packets on a link towards a LAN 4 (see figure Q4) The average arrival rate of the packets into R1 from LAN 1 is 400 packets/sec, and LAN 3 sends packets into R2 on average every 6 msec. Assume all arrival processes into the routers are Poisson processes, and the size of packets is exponentially distributed with an average size of 1250 bytes. 4. Figure Q4 (i) Consider Rl as an MM/1 queue, and assume LAN 2 sends no packets. Calculate the average delay experienced by packets in R1. [6 marks] (ii) Assume R1 and R2 operate both as MM/I queues. Assume LAN 2 sends no packets. Calculate what the forwarding rate on the outgoing link from router R2 should be in bits/sec to have an average delay per packet from LAN 1 to LAN 4 of 10 msec. (Consider the propagation delays negligible.) (6 marks] (ii) Assume R1 operates as an M/M/1/N queue, and R2 operates as an MM/1 queue with the forwarding rate found i Now LAN 2 sends 200 packets/sec. What should be the buffer size in router R1 so that its throughput is limited to a value that does not lead to an unstable system in R2 (i.e. service rate in R2 should remain greater than arrival rate)? Give your result as an integer number. 6 marks] (iv) Assuming for RI the finite capacity calculated ini, establish what the number of dropped packets per second in R1 will be when LAN 2 stops sending packets. 6 marks] Note: The probability P of having n packets in a queuing system accommodating at most N packets (M/M/1/N) is: p where is the traffic intensityExplanation / Answer
If arrival rate to link exceeds transmission rate of link for a period of time queuing delay will occur. Packets will queue and will wait to be transmitted on links. If memory buffer fills up packets can be dropped/ lost.
There are mainly four sources for packet delay:
dproc : nodal processing which checks bit errors.
dqueue: checks the queue delay.
dtrans: checks the transmission delay of a packet.
dprop: checks propagation delay of a link.
To calculate queuing delay we will only consider:
R: link bandwidth
L: packet length
a: average packet arrival rate.
The following outcome can be observed on queuing delay:
La/R ~ 0 :avg. queuing delay small
La/R -> 1:avg. queuing delay large
La/R> 1: more “work” arriving than can be serviced, average delay infinite.
Now from the above question:
Arrival rate a = 1/(L/R) = (R/L)
L = 1250 bytes = 0.01 Mbits
R = 8Mbits
So arrival rate = (8/0.01) = 800
Traffic intensity = a(L/R) = (L/R)(R/L) =1
Average queuing delay = 0. Queue is empty initially.
So Average queuing delay =
(N-1)L/(2*R) = (400-1) 0.01 / (2*8)
= 0.1875 sec
So average delay experienced by packets in R1 is 0.1875 sec.
Please check that I have answered the first question only.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.