scalation
API
Generated with
scalation/scalation/scalation.simulation/scalation.simulation.queueingnet/MMck_Queue

MMck_Queue

scalation.simulation.queueingnet.MMck_Queue
class MMck_Queue(λ: Double, μ: Double, c: Int, k: Int) extends MM_Queue

The MMck_Queue class is used to solve single node Markovian Queueing problems. It models a service station consisting of one queue, c servers and a capacity to hold at most k entities, i.e., an M/M/c/k queue.

Value parameters

c

the number of servers (defualts to one)

k

the capacity of the queue (defualts to infinite)

λ

the overall arrival rate (lambda)

μ

the per unit service rate (mu)

Attributes

See also

also MMc_Queue to model infinite capacity Markovian queues.

Graph
Supertypes
trait MM_Queue
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def `π_0`: Double

Probability system is empty.

Probability system is empty.

Attributes

override def `π_k`: Double

Probability system is full.

Probability system is full.

Attributes

Definition Classes
override def l_q: Double

Expected length of the waiting queue.

Expected length of the waiting queue.

Attributes

Definition Classes
def l_y: Double

Expected length/number in sYstem.

Expected length/number in sYstem.

Attributes

override def view(): Unit

View/check intermediate results.

View/check intermediate results.

Attributes

Definition Classes

Inherited methods

def a: Double

The overAll traffic intensity or rate ratio.

The overAll traffic intensity or rate ratio.

Attributes

Inherited from:
MM_Queue
def l_s: Double

Attributes

Inherited from:
MM_Queue
def report(): Unit

Report the results.

Report the results.

Attributes

Inherited from:
MM_Queue
def t_q: Double

Expected time in the sYstem, Service and Queue (computed using Little's Law).

Expected time in the sYstem, Service and Queue (computed using Little's Law).

Attributes

Inherited from:
MM_Queue
def t_s: Double

Attributes

Inherited from:
MM_Queue
def t_y: Double

Attributes

Inherited from:
MM_Queue
def λe: Double

The effective arrival rate = λ (1 - π_k) that factors in turn aways. For infinite capacity queues, λe = λ.

The effective arrival rate = λ (1 - π_k) that factors in turn aways. For infinite capacity queues, λe = λ.

Attributes

Inherited from:
MM_Queue
def ρ: Double

The server utilization factor (overall arrival rate / total service rate). Also referred to as the traffic intensity per server ρ (rho) in [0, 1] where 0 => always idle, 1 => always busy.

The server utilization factor (overall arrival rate / total service rate). Also referred to as the traffic intensity per server ρ (rho) in [0, 1] where 0 => always idle, 1 => always busy.

Attributes

Inherited from:
MM_Queue
Generated with