|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object | +--edu.iu.iv.modeling.p2p.chord.ChordNetwork
CHORD Network Modeling Algorithm for Structured P2P Networks.
| Constructor Summary | |
ChordNetwork(int networkSize,
int fingerTableSize)
Constructor for ChordNetwork |
|
| Method Summary | |
boolean |
buildChordNetwork()
Build the network based on CHORD topology |
float |
getAvgDegree()
Get average degree of the network |
java.lang.String |
getFailReason()
Get the reason because of which modelig failed |
edu.uci.ics.jung.graph.Graph |
getGraph()
Get the Graph object representing the CHORD network |
int |
getMaxDegree()
Get max degree of the network |
int |
getMinDegree()
Get min degree of the network |
void |
printNetwork()
Print graph |
void |
writeGraph(java.lang.String filename)
Write the graph to a file |
void |
writePajekFile(java.lang.String filename)
Create a Pajek file |
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public ChordNetwork(int networkSize,
int fingerTableSize)
networkSize - : size of the networkfingerTableSize - : minimum number of nodes on the ring a node will connect to| Method Detail |
public edu.uci.ics.jung.graph.Graph getGraph()
public boolean buildChordNetwork()
public void printNetwork()
public void writePajekFile(java.lang.String filename)
public void writeGraph(java.lang.String filename)
public float getAvgDegree()
public int getMaxDegree()
public int getMinDegree()
public java.lang.String getFailReason()
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||