scalation.queueingnet

JacksonNet

Related Doc: package queueingnet

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
Learn more about member selection
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 check: Unit

    Check intermediate results.

  6. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  7. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

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

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

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

  20. def report: Unit

    Report the results.

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  22. def toString(): String

    Definition Classes
    AnyRef → Any

  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
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped