Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
242 views

QueuingTheory Matlab Assignment

This document assigns 12 groups a mini project on queuing theory using Matlab. It provides a brief description of the queuing system each group is asked to analyze through simulation and calculate performance metrics like number of customers, average time delay, blocking probability, etc. The groups will model systems like M/M/S/B, tandem queues, priority queues, state dependent arrival/service rates and more.

Uploaded by

Shyam Shankar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
242 views

QueuingTheory Matlab Assignment

This document assigns 12 groups a mini project on queuing theory using Matlab. It provides a brief description of the queuing system each group is asked to analyze through simulation and calculate performance metrics like number of customers, average time delay, blocking probability, etc. The groups will model systems like M/M/S/B, tandem queues, priority queues, state dependent arrival/service rates and more.

Uploaded by

Shyam Shankar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Mini Project: Queuing Theory Matlab Assignment

Group Roll No of
No. Students Name of Students
1 EE15B016 B.VISWA CHAITANYA
EE15B021 CH.PHANI VIGNAN
2 EE15B014 B. AGNI RAJ
EE15B028 G. S. ASWATH
3 EE15B070 A.MANISH REDDY
EE15B112 SARATH B
4 EE14B101 RAJAT RAO
EE14B106 SAMEER KULKARNI
5 EE15B131 KEERTHI SURESH
EE15B074 ANIT TOMY
6 EE15B008 A.Tarun
EE15B024 G.V.K.Chaitanya
7 EE15B003 Abhiman N
EE15B127 Shyam Shankar
8 EE16D415 Amritha R
EE17D056 Navya
9 ME17D018 Sudeepta Ranjan Sahoo
EE16S038 Bhaswar Majumder
10 EE14B028 Kevin Selva Prasanna V
CS17D012 Chigullapally Sriharsha
11 EE15B056 Samyak Raj Pasala
EE14B128 Abhijith S Gupta
12 EE17M002 Pranav Opal
EE17M003 Neeraj

Group 1: M/M/S/B (An M/M/S queue with S servers that limit the number
of customers to 'B’ after which customers are lost) .Analyze the queue for 3
values of server utilization factor, 0.2, 0.5 and 0.8. (S=10, B=50)

Group 2: A system of two servers where customers from outside the


system arrive at server 1 at a Poisson rate 4 and at server 2 at a Poisson rate
5. The service rates of 1 and 2 are respectively 8 and 10. A customer upon
completion of service at server 1 is equally likely to go to server 2 or to
leave the system , whereas a departure from server 2 will go 25 percent of
the time to server 1 and will depart the system otherwise.

Group 3: A two-class non-pre emptive resume priority M/M/1 queuing


system with λ 1 = 1 and λ 2 = 2, X 1 and X 2 are exponentially distributed.

Group 4: M/M/1 queue with impatient customers where each customer


will only spend an exponential time with rate α in queue before quitting the
queue.

Group 5: M/G/1 queue with server vacation such that vacation time, V and
service time, X are exponentially disributed and E[V]=10E[X].

Group 6: M/M/1 queue where each customer join the queue with
probability (0.7)n where n is the present number of customer in the queue.
(state dependent arrival)

Group 7:Generate a traffic based on Pareto distribution and send it to a


server with a deterministic service time and analyze the system (Number of
customers in the system, average time delay through the system, Number of
customers in the queue, etc. ) as the parameters of the Pareto distribution are
changed?

Group 8: Generate a Markov Modulated Poisson Process and send it to a


server with a deterministic service time and analyze the system (Number of
customers in the system, average time delay through the system, Number of
customers in the queue, etc. )?

Group 9: Simulate two M/M/1 Queues in tandem and analyze the


system(find N1(Number of Customers in the first queue),N2(for the second
queue),T1,T2, etc)?
Group 10:For an M/M/m system with server loss, using Erlang-B formula
,calculate the blocking probability and compare them with the simulation
results?

Group 11: A two-class pre-emptive resume priority M/M/1 queuing system


with λ1 = 1 and λ 2 = 2, X 1 and X 2 are exponentially distributed.

Group 12: To simulate an M/M/1/K queue with state dependent service rate
(µ_n = (1.1^n) µ)

You might also like