Scribd
Upload
30 views2 pages

MAP 6264 Homework 4 (Finite-Source Input, BCC) 30 Points

This document provides instructions for homework assignment 4 which involves adapting a previous simulation program to account for finite customer sources. The student is asked to simulate and calculate three performance measures - probability of idle server (Ps[n]), probability of blocked customers (Πs[n]), and utilization (ρ) - for various values of number of sources (n) under three different combinations of think and service time distributions. The measures are to be calculated and compared to theoretical values. Code, calculations and explanations are to be attached.

Uploaded by

Jean Rene
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views2 pages

MAP 6264 Homework 4 (Finite-Source Input, BCC) 30 Points

This document provides instructions for homework assignment 4 which involves adapting a previous simulation program to account for finite customer sources. The student is asked to simulate and calculate three performance measures - probability of idle server (Ps[n]), probability of blocked customers (Πs[n]), and utilization (ρ) - for various values of number of sources (n) under three different combinations of think and service time distributions. The measures are to be calculated and compared to theoretical values. Code, calculations and explanations are to be attached.

Uploaded by

Jean Rene
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MAP 6264

Homework 4 (Finite-Source Input, BCC)

30 Points

Adapt the simulation program of Homework 1 (Blocked Customers Cleared) to account for finite-source input. Consider the three cases: 1. Exponential think times (quasirandom input), exponential service times. 2. Exponential think times, constant service times. 3. Constant think times, exponential service times. (offered load per Assume that s = 10 servers; and, for each value of n (number of sources), calculate a * idle source) so that a (intended offered load) is 9.6 erlangs. Run each simulation for as many arrivals as necessary to attain statistical stability. When n = (in Case 1 and Case 2) use the simulation of Homework 1. (Note that for every value of n, the theory values are the same for each case, because of insensitivity of the equilibrium probabilities to the think times and the service times). Fill in the tables. Attach code for simulation and theory; and explain all calculations.

Ps [n]
n 10 11 12 13 14 15 25 50 100 1000 theory -------------------- simulation -------------------1 2 3

s [ n]
n 10 11 12 13 14 15 25 50 100 1000 theory -------------------- simulation -------------------1 2 3

n 10 11 12 13 14 15 25 50 100 1000 theory -------------------- simulation -------------------1 2 3

You might also like