M/M/1 queue consists of a first-in-first-out (FIFO) buffer with packets

arriving randomly server retrieves packets from the buffer at a specified

service rate.
The performance of an M/M/1 queuing system depends on:
a) Packet arrival rate
b) Packet size
c) Service capacity
The M/M/1 queue is generally depicted by a Poisson process governing the
arrival of packets into an infinite buffer. When a packet reaches the head of
the buffer, it is processed by a server and sent to its destination.
(Arrival rate) = 1/(Inter arrival time)
C = Service capacity
M = Mean service requirement
(Service rate of one server) = CM
(Server utilization or traffic intensity) = /
w (long run time average spent in system per customer) = 1/( -)
L (long run time average spent in system per customer) = /(1- )

Ans 1. Node Model:

C = 28800 b/s
1/M = 9000 b/ p s
Inter arrival time = 0.4 sec
So,
= 1/0.4 = 2.5 /sec
= 28800/9000
= 3.2 /sec
= 2.5/3.2 = 0.78125
Thus,
w (Mean delay) = 1/( -) = 1/(3.2 2.5) = 1428.5 m sec
L = 0.78125/ (1- 0.78125) = 3571.4 m
Graph: Time Average Queuing Delay: Simulation for 8hrs

The large change early in the simulation reflects the sensitivity of averages to
the relatively small number of samples collected. Towards the end of the
simulation, the average stabilizes. The curve starts settling after 3hr to 6hrs,
finally at around 1.42 sec i.e mean time average queue delay.
Graph: Time Average Queue Size: Simulation for 8hrs

Graphs of the mean queuing delay and the time-averaged queue size are very
similar. This is because of the large number of well-dispersed queue insertions
and removals that occur during the simulation, the difference between the
final values of the two statistics is negligible. The curve starts settling after 3hr
to 6hrs, finally at around 3.58 i.e mean queue time average size.
Ans 2. Node Model:

L required= 20
Note: This model is the sum of two Poisson (exponential arrival rates)
processes and the arrival rate for this sum is the sum of the two arrival
rates.
a)
L = /(1- ) = 20
=> = 20/21
= 28800/9000
= 3.2
eff = src + src2
= 2.5 + 1/t inter arrival src2
= eff/
On solving,
t inter arrival src2 = 1826.1 m sec
= 1.826 sec
b)
Graph: Time Average Queue Size: Simulation for 75hrs

Useful property of Poisson process is that if N independent Poisson streams of

rates 1, 2,.., N are merged, the resulting stream is Poisson with rate . The
curve starts settling after 56hr to 75hrs, finally at around 21.6 i.e mean
queue size.
c)

My boss tells me that the average of 20 packets in the system and the
corresponding average time in the system is too high. He thinks we can reprogram the server so that it processes each fixed size 9000 bit packet in
9000/28500 seconds and this is fixed. To model this we need to change the
service rate of the server to 28,500 bit per second and change the packet
size to be constant.
Earlier packet size was exp(9000) meaning that the size of the generated
packets was exponentially distributed with mean size of 9k bits per packet.
And service capacity was 28800 bits/sec.
Thus, my boss is asking me to remodel for constant packet size & bit lower
service capacity.
Graph: Comparing Time Average Queue Size: Simulation for 75hrs

Red Curve: C=28500 bps & constant packet size -> The curve starts settling
after 56hr to 75hrs, finally at around 13.57 i.e mean time average queue
size
Blue Curve: C=28800 bps & exponential packet size -> The curve starts settling
after 56hr to 75hrs, finally at around 21.6 i.e mean time average queue size
Lets gauge the performance of both curves based on the number of bits
received by the sink in a fixed time. My taking this approach because when
packet size was exponential, we cannot comment on the performance just
based on the number of packets received.

Eg- I am transferring a video to user by 2 methods. Method1: variable packet

size (similar to exponential in our case) & Method2: fixed packet size.
Suppose by method1 user received 3 packets of size 4k, 6k & 8k bits i.e total
18k bits. And, by method2 user received 6 packets each of size 3k i.e total
18k bits (considering same time interval). Thus, both methods are equally
good.
Graph: Comparing Time Average Bits received: Simulation for 75hrs

As we can see that the blue curve settles with mean traffic (bps) of around
27500 bps while red curve settles with mean traffic (bps) of around 27450.
Thus, its advisable to keep packet size exponential rather than making it
constant.

Ans 3. Node Model: Tandem server or servers in series and can represent
two routers in sequence. Here, we
added another queue that takes
packets, the output from the original
server, as input to the new server,
Server_2. The attributes of the new
server are exactly the same as the
original server.
In a Tandem Queuing System packet

must visit both servers before service is completed. For cases in which
packet arrives according to Poisson process and service time in each station
is exponential.
Therefore,
Total Average Time in System = average times at individual stations
Graph: Time Average Queue Size: Simulation for 75hrs

Red Curve: Mean time average queue size for server2 is approx 5.6
Blue Curve: Mean time average queue size for server is approx 21.6
As we can infer from the graph that the time average queue size of server2 is
almost constant while time average queue size of server varies & settles
when it gets full. Until server is full, the sources will push packets into it at
the rate in which they generate which is variable (starting of curve). But
server2 always gets packets at constant rate from server which is
transmission from server to link + propagation.