{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# class17 - Chapter 7 Queuing Networks Kendal...

This preview shows pages 1–2. Sign up to view the full content.

Sheet1 Page 1 Chapter 7 Queuing Networks Kendal Notation (A/D/C/K/M/Z) A = Arival process D = Service Distribution(poisson) C = Number of identical Processors K = Max num cutomers in the system M = Max number that arrive Z = queuing discipline(FCFS) M/M/1 systems 1st M = poisson Arival rate 2nd M = Exponential service rate K = infinite queue (blank) 1 = one processor M/M/1/K same as above but finite queue M/M/C C identical Processors wont cover 7.1.4 M/G/1 7.1.5 G/M/1 G= general distribution ------------------------------------------------------------------------------- 7.2 + 7.4 Step 1 Specify Explicitly what info is necessary to capture the state of the system ���ͻ���ͻ���ͻ���ͻ Ĵ д д д п ��� ��� ��� ��� ��� ; ; ; ; ��� ��� ��� ��� bubble mean the state of the system (number of jobs) arcs -> state transitions assumed -all jobs are equal -location of a job is not important what happens if we have two classes of jobs what happens if we have two disks and a cpu(with their own queues) FIGURE to describe the state of the system. you need to know how many of each type h0t °1t °2t °3t °4h

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

class17 - Chapter 7 Queuing Networks Kendal...

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

View Full Document
Ask a homework question - tutors are online