| Interface | Description |
|---|---|
| GraphReaderIF |
This interface abstracts an reader for different graph-file-formats
|
| Class | Description |
|---|---|
| DelayMatrix_Float |
This class represents an delay-topology storing every distance between connected nodes
|
| FloydWarshall_Float |
FloydWarshall algorithm to calculate all pairs delay and predecessor matrix.
|
| GraphReaderBrite |
This class is just an file-reader for the special brite-format! the brite-file is structured as
followed: Node-section: NodeID, xpos, ypos, indegree, outdegree, ASid, type(router/AS)
Edge-section: EdgeID, fromNode, toNode, euclideanLength, linkDelay, linkBandwith, AS_from, AS_to,
type
|
| TopologicalGraph |
This class represents an graph containing nodes and edges, used for input with an network-layer
Graphical-Output Restricions! EdgeColors: GraphicalProperties.getColorEdge NodeColors:
GraphicalProperties.getColorNode
|
| TopologicalLink |
This class represents an link (edge) from an graph
|
| TopologicalNode |
Just represents an topological network node retrieves its information from an
topological-generated file (eg.
|
Copyright © 2012 The Cloud Computing and Distributed Systems (CLOUDS) Laboratory, The University of Melbourne. All Rights Reserved.