Ch3_queue_theory-2008-3

Ch3_queue_theory-2008-3 - Queueing Theory (Delay Models)...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Queueing Theory (Delay Models) Sunghyun Choi Adopted from Prof. Saewoong Bahks material Priority Queueing M/G/1 with n priority classes of customers For class k , Independent Poisson arrival processes Non preemptive priority Complete the on-going service without interruption Separate queue for each priority class : avg. number of customers in queue for priority k : avg. queueing time for priority k : R : mean residual service time k Q N k W k k k = 2 , 1 , k k k k X X = for class 1 (highest priority) and 2 1 1 < = n i i ( 29 ( 29 2 1 1 2 1 1 1 2 2 1 2 2 1 1 2 1 1 2 2 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Then 1 queue in waiting is customer 2 class a while arrive that 1 class of customers to due delay queueing additional - - - = - - + = + + + = + + + = - = + = + = R W R W W W W R W N N R W R W W R N R W Q Q Q For class k System delay for class k Mean residual service time finally...
View Full Document

Page1 / 10

Ch3_queue_theory-2008-3 - Queueing Theory (Delay Models)...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online