UAH CPE 619 - Queueing Networks (62 pages)

Previewing pages 1, 2, 3, 4, 29, 30, 31, 32, 59, 60, 61, 62 of 62 page document View the full content.
View Full Document

Queueing Networks



Previewing pages 1, 2, 3, 4, 29, 30, 31, 32, 59, 60, 61, 62 of actual document.

View the full content.
View Full Document
View Full Document

Queueing Networks

14 views


Pages:
62
School:
University of Alabama in Huntsville
Course:
Cpe 619 - Modeling and Analysis of Computer and Communication Systems

Unformatted text preview:

CPE 619 Queueing Networks Aleksandar Milenkovi The LaCASA Laboratory Electrical and Computer Engineering Department The University of Alabama in Huntsville http www ece uah edu milenka http www ece uah edu lacasa Overview Queueing Network model in which jobs departing from one queue arrive at another queue or possibly the same queue Open and Closed Queueing Networks Product Form Networks Queueing Network Models of Computer Systems 2 Open Queueing Networks Open queueing network external arrivals and departures Number of jobs in the system varies with time Throughput arrival rate Goal To characterize the distribution of number of jobs in the system 3 Closed Queueing Networks Closed queueing network No external arrivals or departures Total number of jobs in the system is constant OUT is connected back to IN Throughput flow of jobs in the OUT to IN link Number of jobs is given determine the throughput 4 Mixed Queueing Networks Mixed queueing networks Open for some workloads and closed for others Two classes of jobs Class types of jobs All jobs of a single class have the same service demands and transition probabilities Within each class the jobs are indistinguishable 5 Series Networks k M M 1 queues in series Each individual queue can be analyzed independently of other queues Arrival rate If i is the service rate for ith server 6 Series Networks cont d Joint probability of queue lengths product form network 7 Product Form Network Any queueing network in which When fi ni is some function of the number of jobs at the ith facility G N is a normalizing constant and is a function of the total number of jobs in the system 8 Example 32 1 Consider a closed system with two queues and N jobs circulating among the queues Both servers have an exponentially distributed service time The mean service times are 2 and 3 respectively The probability of having n1 jobs in the first queue and n2 N n1 jobs in the second queue can be shown to be In this case the normalizing constant G N is 3N



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Queueing Networks and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Queueing Networks and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?