Packages

class MMck_Queue extends Error

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. ------------------------------------------------------------------------------

See also

also MGc_Queue to model queues with general service time distributions. ------------------------------------------------------------------------------

also MMc_Queue to model infinite capacity Markovian queues.

Linear Supertypes
Error, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MMck_Queue
  2. Error
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MMck_Queue(lambda: Double, mu: Double, c: Int = 1, k: Int = 1)

    lambda

    the arrival rate

    mu

    the service rate

    c

    the number of servers

    k

    the capacity of the queue

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def flaw(method: String, message: String): Unit
    Definition Classes
    Error
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. val l_q: Double

    Expected length of the waiting queue.

  14. val l_s: Double

    Expected length/number in Service.

  15. val l_y: Double

    Expected length/number in sYstem.

  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  19. def prob_0: Double

    Probability system is empty

  20. def prob_k: Double

    Probability system is full.

  21. def report(): Unit

    Report the results.

  22. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  23. val t_q: Double

    Expected time in the waiting Queue (using Little's Law).

  24. val t_s: Double

    Expected time in Service.

  25. val t_y: Double

    Expected time in the sYstem.

  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. def view(): Unit

    View/check intermediate results.

  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Error

Inherited from AnyRef

Inherited from Any

Ungrouped