package topology
- Alphabetic
- Public
- All
Type Members
- class Clique extends Topology
- class DirectedRing extends Topology
- trait GraphTopology extends Topology
- class Ring extends Topology
-
trait
Topology extends AnyRef
Describes a network topology.
Describes a network topology.
It consists in a set of processes, and possibly an underlying graph.
- trait TopologyFactory extends AnyRef
Value Members
-
object
Clique extends TopologyFactory
Factory object to create a clique topologyDescriptor.
- object Combinator
-
object
DirectedRing extends TopologyFactory
Factory object to create an oriented ring topologyDescriptor.
-
object
GeometricRandom extends TopologyFactory
Factory object to create a geometric random graph.
Factory object to create a geometric random graph.
The idea is to generate positions for the nodes uniformly at random in a 1 x 1 square plane. Then, given a radius r, two nodes are neighbors iff. their Euclidean distance is less than r.
The critical radius is calculated from the following formula (linked to percolation theory):
val r = math.sqrt( (math.log(N) + alpha) / (math.Pi * N))
where alpha is an adjustment parameter to increase the likelihood that the resulting graph is connected.
-
object
Grid extends TopologyFactory
Factory object to generate a grid topologyDescriptor.
- object Ladder extends TopologyFactory
-
object
Random extends TopologyFactory
Factory object to create a random graph (of type Erdös-Renyi).
Factory object to create a random graph (of type Erdös-Renyi).
The threshold for deciding whether an edge exists is log(n) / (n-1), where n is the size of the range given as parameter. This choice is because this is a little above the bond percolation threshold for a clique.
-
object
Ring extends TopologyFactory
Factory object to create a ring topologyDescriptor.
- object Topology
- object TopologyFactory