Uses of Interface
bcds.phison.WithEnvParams

Packages that use WithEnvParams

bcds.phison.clustering
bcds.phison.gm	Classes in this package extract measurable properties of a graph, its nodes or links.
bcds.phison.multfailures
bcds.phison.ra	The routing algorithm (ra) package defines the interface expected by the Phison simulator and implements several well-known routing algorithms, such as Dijkstra, WSP and SWP.
bcds.phison.sim	This package comprises the simulator and several processing modules.

Uses of WithEnvParams in bcds.phison.clustering

Subinterfaces of WithEnvParams in bcds.phison.clustering

interface

Clusterer<V,E> Defines methods that clustering algorithms must implement.

Classes in bcds.phison.clustering that implement WithEnvParams

class	Dummy<V,E> Dummy creates one "cluster" per node.
class	NoackLinLog<V,E> NoackLinLog is a wrapper on Andreas Noack's LinLogLayout.
class	ZoneAsCluster<V,E> ZoneAsCluster recasts zones in a ZoneMap object into clusters, that is, it adapts to the Clusterer interface an existing clustering arrangement.

Uses of WithEnvParams in bcds.phison.gm

Subinterfaces of WithEnvParams in bcds.phison.gm

interface

GraphMetric<V,E> A graph metric is a measure of some property of the graph, its nodes or edges.

Classes in bcds.phison.gm that implement WithEnvParams

class	AlgebraicConnectivity<V,E> Computes the algebraic connectivity of a topology, that is, the second smallest eigenvalue of its Laplacian spectrum.
class	Assortativity<V,E> Computes the assortativity coefficient of a graph, based on the Pearson correlation coefficient.
class	AverageEdgeBC<V,E> Computes the average edge betweenness centrality of a directed graph.
class	AverageNeighborConnectivity<V,E> Computes the average neighbor connectivity of a topology as a GraphMetric.
class	AverageNodeBC<V,E> Computes the average node betweenness centrality of a directed graph.
class	AvgPathLength<V,E> Computes the average of the shortest path lengths in the topology, where the link weights are all 1 (hop count).
class	AvgTwoTermReliability<V,E> Computes the average two-terminal reliability coefficient of a graph.
class	BrandesBC<V,E> Computes the betweenness centrality of nodes and links in a directed graph.
class	CheegerConstantBruteForce<V,E> XXX Computes ...........
class	ClusteringCoeff<V,E> Computes the (local) clustering coefficient of each node in a graph.
class	ConnectivityMatrixSpectralRadius<V,E> Computes the largest eigenvalue of the connectivity matrix C of a topology as a GraphMetric.
class	Density<V,E> Computes the density of a topology as a GraphMetric.
class	Diameter<V,E> Computes the network diameter, identifies the path that corresponds to that diameter and computes the average of the shortest paths.
class	EdgeSetSize<V,E> Computes the number of undirected edges in a topology as a GraphMetric.
class	Heterogeneity<V,E> Computes the heterogeneity of a topology as a GraphMetric.
class	LinkConnectivity<V,E> Computes the link connectivity of a topology as a GraphMetric.
class	MaxNodeDegree<V,E> Returns the highest node degree of a topology as a GraphMetric.
class	NodeConnectivity<V,E> Computes the node connectivity of a topology as a GraphMetric.
class	OutNodeDegree<V,E> Computes the average node degree of a topology as a GraphMetric.
class	SpectralRadius<V,E> Computes the spectral radius of a topology, that is, the largest eigenvalue of its adjacency matrix.
class	Spreaders<V,E> Performs a k-shell decomposition of the nodes of a topology as a GraphMetric.
class	SymmetryRatio<V,E> Computes the symmetry ratio of a topology as a GraphMetric.
class	VertexSetSize<V,E> Computes the number of vertices in a topology as a GraphMetric.

Uses of WithEnvParams in bcds.phison.multfailures

Subinterfaces of WithEnvParams in bcds.phison.multfailures

interface

ElemsSequencer<V,E> ElemsSequencer defines the methods that all graph element sequencers must implement.

Classes in bcds.phison.multfailures that implement WithEnvParams

class	ElemsSequencerBase<V,E> Provides default implementations of methods in the ElemsSequencer interface.
class	PmElemsSequencer<V,E> This module loads an ElemsSequencer, whose name is provided by the user, and prints to stdout the list of elements (either nodes or links) in the order determined by the sequencer.
class	PmSID<V,E> This module implements the spreading of epidemics.
class	PmSIDTraceToDOT<V extends GraphIONode,E> Generates .dot files to visually present the states of the nodes with respect to the epidemic infection.
class	PmStatic<V,E> This module implements static failures, which are defined as one-off failures that affect one or more elements (nodes or links) at any given point.
class	SequencerBC<V,E> This class arranges nodes and links in descending order of betweenness centrality (BC), optionally shuffling the order of nodes having the same degree.
class	SequencerCC<V,E> This class arranges nodes in descending order of clustering coefficient (CC).
class	SequencerDegree<V,E> This class arranges nodes in descending order of nodal degree, optionally shuffling the order of nodes having the same degree.
class	SequencerFromFile<V,E> This class returns nodes and links in the order they appear in files (one file for nodes, and another for links).
class	SequencerRandom<V,E> This class arranges nodes or links in a random manner.
class	SequencerSpreaders<V,E> This class arranges nodes in descending order of k-shell index, as a result of a k-shell decomposition of the graph.

Uses of WithEnvParams in bcds.phison.ra

Subinterfaces of WithEnvParams in bcds.phison.ra

interface

RoutingAlg<V,E> Defines the methods that all routing algorithms must implement.

Classes in bcds.phison.ra that implement WithEnvParams

class	DijkstraAll<V,E> Implements a priority queue based Dijkstra algorithm for finding single-source all-destination shortest paths.
class	DijkstraMaxWidth<V,E> Finds a path between two nodes offering the maximum minimum "width", where the width is anything passed as a cost map.
class	LIOA<V,E> Implements the LIOA routing algorithm.
class	LMIR<V,E> Implements the LMIR routing algorithm as described in: Gustavo B.
class	MinHop<V,E> Implements Dijkstra-based min-hop routing.
class	Null<V,E> This is a "null" router: Everything is rejected, no matter what.
class	ProtDPP_MinCost<V,E> Provides Dedicated dath Protection (DPP) using DijkstraAll as the search algorithm.
class	SWP<V,E> Implements the SWP (Shortest Widest Path) routing algorithm.
class	WSP<V,E> Implements the WSP (Widest-Shortest Path) routing algorithm.

Uses of WithEnvParams in bcds.phison.sim

Subinterfaces of WithEnvParams in bcds.phison.sim

interface	ProcessingModule<V,E> Processing modules for PHISON must implement this interface.
interface	StatsExporter The StatsExporter interface defines the methods that must be implemented so that a class can be treated as an statistics exporter of values in a SimStatsCollector object.

Classes in bcds.phison.sim that implement WithEnvParams

class	PmBase<V,E> Provides default functionality and data for classes implementing the ProcessingModule interface.
class	PmDTypeReplicator<V,E> Create new processing modules for each traffic type (rq.traf_type) and send the same received event to each of them.
class	PmDumpRAState<V,E> Dumps the state of all routing algorithms at a given time (time=connection request number).
class	PmLinkFailure<V,E> Process (single) link failures, that is, act upon LINK_FAILURE and LINK_REPAIR events.
class	PmNetProps<V,E> The PmNetProps module print some network properties at the module's shutdown time.
class	PmTrace2TR<V,E> Prints progress indication: The interval of printing is controlled by ".interval".
class	PmTraceConn<V,E> The PmTraceConn module prints to System.out information about connections as events (connection requests and releases) are processed.
class	PmTraceConnGbl<V,E> Prints global information about connections (# of connections received, # of connections blocked, blocking ratio and connection holding time).
class	PmTraceLinkUsage<V,E> Prints: - A frequency table of the usage of each link.
class	PmTraceLinkUsageToDOT<V extends GraphIONode,E> Generates .dot files to visually present (instantaneous) link usage.
class	PmTracePathLength<V,E> Prints: - The frequency of path lengths (of working path, and of backup paths, if available).
class	PmTraceProgress<V,E> The module PmTraceProgress prints information about connections acceptance and rejection at regular intervals of connection requests.
class	PmTraceTimestepBlocking<V,E> Prints the "instantaneous" blocking ratio in each time step.
class	PmTraceTrafficMatrix<V,E> XXX wrong: Prints progress indication:
class	PmTrfReader<V,E> The class PmTrfReader inserts events by reading a .trf file.
class	StatsExporterBase Provides default functionality and data for classes implementing the StatsExporter interface.
class	SxSeriesToGnuPlot The SxSeriesToGnuPlot generates a GNU Plot script for each group of statistical collectors whose members are instances of Series.
class	SxStdoutBasic The SxStdoutBasic class is an exporter that prints (some) of the statistical collectors reports to stdout.