Package viceroy

Interface Summary

AuthorizedLookupPeer	Represents a peer in some Lookup network.
AuthorizedViceroyPeer	Represents an authorized lookup peer in the viceroy network.
LookupAlgorithm	Represents a lookup algorithm It is an interface since we wanted to try many lookup algorithms.
LookupMessageStatistics	interface for the statistics of the lookup message
LookupPeer	Represents a peer in some Lookup network.
MessageStatistics	Represent a visited peer in a MessagePath, including the relevant statistics for it.
Resource	Represent a resource which can be stored and looked-up.
ViceroyPeer	Represents a peer in the Viceroy network, with the Viceroy network's topology.

Class Summary

Connection	A type-safe enum representing all the possible connections of a ViceroyPeer.(connections:successor and predeccessor, Relatives:parent/left/right)
FindFastAlgorithm	A Change in the lookup algorithm.
HashValue	Represents the result value of a hash-function on some object.
InitNetCreator	Tests the Local viceroy peer
LocalViceroyPeer	Represents a local peer in the Viceroy network.
LookupMessageStatisticsImpl	A simple implementation class of LookupMessageStatistics
LookupState	Represent a state of a lookup action in a given time.
MessagePath	Represents a path that a message passes over its lifetime
MyTryBig	internal check for the rounding of BigDecimal.
PapersAlgorithm	Represents the lookup algorithm as it appears in the article.
PapersPlusAlgorithm	resembles the paper's algorithm but has a small extra check: in the Traverse Tree phase, before doing anything, i check if the left child or the right is responsible for the value.
PeerState	Represent a state of a peer in a given time This is a type-safe enum implementation
Relative	Represent a type of a relative in the viceroy network: parent,left child or right child.
RemoteViceroyPeer	Represents a remote viceroy peer.
ResourceImp
TestViceroy	Tests the Local viceroy peer
TraverseTreeAbsoluteAlgorithm	Change the Traverse Tree phase of the lookup algorithm the change is as follows: we check which peer is closer (absolute) to the target between this peer/left/right child If left/right child is closer to the target goto this child and continue in this phase else // i am closer to the target goto travese ring phase
TraverseTreePlusAlgorithm	Change the TraverseTree phase in the lookup algorithm The change is as follows: if one of the children exists - certainly go to one of them.
ViceroyApplet
ViceroyStatistics	Statistics on the viceroy

Exception Summary

IllegalResourceInsertionException	Represents a wrong insertion of a resource to a peer, for example insertion of a resource to a peer which is not be responsible for.
ResourceNotFoundException	represents a Resource Not Found error