Packages

class JacksonNet extends AnyRef

The JacksonNet class is used to solve Jackson Queueing Network problems. Each node in the network represents a service station consisting of one queue and k_i servers. It is currently limited to networks of M/M/k queues.

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

Instance Constructors

  1. new JacksonNet(p: MatrixD, r: VectorD, mu: VectorD, k: Array[Int] = null)

    p

    the routing probabilities from node to node

    r

    the external arrival rates for each node

    mu

    the service rates for each node

    k

    the number of servers for each node

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
    @native() @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 getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def nQueue(j: Int): Double

    Calculate the expected number in the queue at the j-th node.

    Calculate the expected number in the queue at the j-th node.

    j

    the j-th node

  13. def nQueue_1(j: Int): Double

    Calculate the expected number in the queue at the j-th node for an M/M/1 queue.

    Calculate the expected number in the queue at the j-th node for an M/M/1 queue.

    j

    the j-th node

  14. def nQueue_k(j: Int): Double

    Calculate the expected number in the queue at the j-th node for an M/M/k queue.

    Calculate the expected number in the queue at the j-th node for an M/M/k queue.

    j

    the j-th node

  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. def pi_0(ro: Double, kk: Int): Double

    Calculate the probability of a node being empty, based on its utilization factor and number of servers.

    Calculate the probability of a node being empty, based on its utilization factor and number of servers.

    ro

    the utilization factor

    kk

    the number of servers

  19. def report(): Unit

    Report the results.

  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. def view(): Unit

    View/check intermediate results.

  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped