« View all new features in Mathematica 9  previous  |  next 
New in Mathematica 9Markov Chains and Queues

Fundamentals of Queueing Theory 

Verify Little's law relating the system size and waiting time for a queue.

In[1]:=
Click for copyable input
X
In[2]:=
Click for copyable input
X
Out[2]=
In[3]:=
Click for copyable input
X
Out[3]=
In[4]:=
Click for copyable input
X
Out[4]=
In[5]:=
Click for copyable input
X
Out[5]=

Verify Burke's theorem for a feedforward network with three queues in series.

In[6]:=
Click for copyable input
X

Compute a probability for the steady state of the network.

In[7]:=
Click for copyable input
X
Out[7]=

Verify the result using Burke's theorem.

In[8]:=
Click for copyable input
X
Out[8]=

Verify the definition of the Erlang B loss probability for an M/M/c/c queue.

In[9]:=
Click for copyable input
X
Out[9]=

Use the built-in ErlangB function to compute the same result.

In[10]:=
Click for copyable input
X
Out[10]=

Confirm that the two answers are indeed the same.

In[11]:=
Click for copyable input
X
Out[11]=