Router

Type Members

type Policy[T] = (T) ⇒ Channel[T]

Type of a function that selects a channel given an event.

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def deficitRoundRobin[T](targets: Seq[Channel[T]], quantum: Int, cost: (T) ⇒ Int): Policy[T]

Picks the next channel according to the Deficit Round Robin routing algorithm.
Picks the next channel according to the Deficit Round Robin routing algorithm.
This routing policy attempts to send the message to the channel that has so far received the least total cost, according to some cost function cost. The cost of an event could be its size (if the network transmission is the main concern), or the estimate on the processing time of that event (if computing bandwidth is the main concern).
Each target channel has an associated deficit counter, which is increased by an amount called a quantum each time a channel gets selected, and decreased every time that an event is sent to it. When an event with a cost higher than the deficit counter appears, the next channel is selected.
Note: quantum and cost should be relatively close in magnitude.
T
type of routed events
targets
sequence of target channels
quantum
the base cost quantum used to increase
cost
function from an event to its cost
returns
a selector
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hash[T](targets: Seq[Channel[T]], hashing: (T) ⇒ Int = (x: T) => x.##): Policy[T]

Consistently picks a channel using a hashing function on the event.
Consistently picks a channel using a hashing function on the event.
The hashing function is applied to the event, and the hash code is used to select a channel. Given that the same hash code is always returned for the same event, the same channel is always picked. This is useful when implementing, e.g. distributed hash tables.
T
type of the events routed
targets
target channels to which events are routed
hashing
hashing function from an event to some hash value
returns
the selector function
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def random[T](targets: Seq[Channel[T]], randfun: (Int) ⇒ Int = ...): Policy[T]

Picks a channel from a random distribution.
Picks a channel from a random distribution.
T
type of the events routed
targets
target channels to which to route the events
randfun
randomization function, total number of channels to an index
returns
the selector function
def roundRobin[T](targets: Seq[Channel[T]]): Policy[T]

Picks channels in a Round Robin manner.
Picks channels in a Round Robin manner.
T
type of the events to route
targets
the channels to route the events to
returns
a selector function that chooses a channel
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def zeroSelector[T]: Policy[T]

Always returns a zero channel, which loses all the events sent to it.
Always returns a zero channel, which loses all the events sent to it.
T
type of the events to route
returns
a selector function that drops events

Related Docs: class Router | package protocol

object Router extends Serializable

Type Members

type Policy[T] = (T) ⇒ Channel[T]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def deficitRoundRobin[T](targets: Seq[Channel[T]], quantum: Int, cost: (T) ⇒ Int): Policy[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hash[T](targets: Seq[Channel[T]], hashing: (T) ⇒ Int = (x: T) => x.##): Policy[T]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def random[T](targets: Seq[Channel[T]], randfun: (Int) ⇒ Int = ...): Policy[T]

def roundRobin[T](targets: Seq[Channel[T]]): Policy[T]

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

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zeroSelector[T]: Policy[T]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped