ME 366L Weekly Overview - Week 14

ME 366L Weekly Overview - Week 14 - individual systems are...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Week Fourteen – Description of Jackson networks, equations for computing internal arrival rates, examples of queuing networks (computation center, job shop), non- Markovian networks Queuing networks Context: Many real-world applications involve a network of queues rather than a single queuing system. We show that some networks can be analyzed quite readily if each component is an M / M / s queue with unlimited capacity. Purpose: To provide you with an understanding of how the analysis of a network of queues differs from an analysis of a simple queuing system and provide you with a limited set of results for the case when the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: individual systems are Markovian. Objectives: At the end of this lesson, you will be able to: 1. Describe a Jackson network and explain the assumptions under which it can be used as a model for networks of queues. 2. Compute the internal arrival rates to a Jackson network given the external arrival rates to the individual queues. 3. Describe the type of analysis that can be performed on networks of queues when either the interarrival time or service time distributions are not Markovian. 4. Compute performance measures of a Jackson network using the Excel add-in....
View Full Document

This note was uploaded on 12/19/2011 for the course M E 366l taught by Professor Staff during the Spring '08 term at University of Texas.

Ask a homework question - tutors are online