Exams(TRB,TNPSC,APPSC ,SSC, JE,AE,RRB,etc • Queuing theory is associated with waiting time • In a queuing problem, if the arrivals are completely random then the probability distribution of number of arrivals in agiven time follows Poisson distribution • The utilization factor or traffic intensity in queuing theory is defined as the ratio of mean arrival rate to mean service rate. ϱ = mean arrival rate /mean service rate • The cost of providing service in a queuing system increases with decreased mean time in the queue. • Kendel notation a/b/c:d/e/f where a – the probability law of arrival time b –the probability of law of service time c – the no of service channels or servers. d – service rule or queue discipline e - size of system or maximum number of customers allowed in the system. f- calling source population. • SIRO(service in random order) discipline is generally found in lottery draw. • When a doctor attends to an emergency case leaving his regular service is called non pre- emptive queue discipline • Little's law is a relationship between waiting time and length of the queue in a queuing system. • Service time in queuing theory is usually assumed to follow exponential law. • If the number of arrivals in a queue follows the poisson distribution,then inner arrival time obeys which one of the following distribution? Negative exponential law • FIRST COME FIRST SERVE(FCFS) is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival(suitable for congested job). • Last in first out(LIFO) is a method used to account for inventory, where the most recently produced items are recorded as sold first.it is necessary to store the program counter contents in the last in first out. • The distribution of arrivals in a queuing system can be considered as a pure birth process. • Arrival pattern, service pattern and queue discipline must be known in queuing theory. • Standard costing is stock valuation methods based on a cost estimate made before the part is purchased. • The term jockeying in queuing theory refers to shifting from one queue to another parallel queue. • Monte carlo simulation of queue is used when mathematical analysis cannot be adopted. • The calling population is assumed to be infinite when the arrivals are independent to each other. • Balking –if the queue length appears very large a customer may not join the queue this property is known as balking. • Reneging – customer leave the queue without getting the service . • Calling population: The entire sample of customer from which a few visit the service facility is known as calling population. • The size of calling population can be finite or infinite. • Queuing theory is used for traffic congestion studies • As the ratio of mean arrival to mean service rate is inverted it is likely that customer moves slowly in the system. THANKS FOR WATCHING