peersim.symphony

Class SymphonyProtocol

java.lang.Object

peersim.symphony.SymphonyProtocol

All Implemented Interfaces:

java.lang.Cloneable, peersim.core.Protocol, peersim.edsim.EDProtocol

public class SymphonyProtocol
extends java.lang.Object
implements peersim.edsim.EDProtocol

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	SymphonyProtocol.BootstrapStatus

Field Summary

Fields

Modifier and Type	Field and Description
boolean	bidirectionalRouting
boolean	fixedLongRangeLinks
java.util.LinkedHashSet<Tuple<peersim.core.Node,SymphonyProtocol.BootstrapStatus>>	leftShortRangeLinks
SymphonyProtocol.BootstrapStatus	loggedIntoNetwork
java.util.LinkedHashSet<peersim.core.Node>	longRangeLinksIncoming
java.util.LinkedHashSet<peersim.core.Node>	longRangeLinksOutgoing
boolean	lookAhead
java.util.LinkedHashMap<peersim.core.Node,java.util.Set<java.lang.Double>[]>	lookAheadMap Array Contract: at position 0 -> OutgoingLongRangeLinks, 1 -> IncomingLongRangeLinks
int	numberFixedLongRangeLinks
int	numberShortRangeLinksPerSide
java.util.LinkedHashSet<Tuple<peersim.core.Node,SymphonyProtocol.BootstrapStatus>>	rightShortRangeLinks
int	sequentialIdentifier

Constructor Summary

Constructors

Constructor and Description
SymphonyProtocol(java.lang.String prefix)

Method Summary

Methods

Modifier and Type	Method and Description
void	clearHistoryMessage()
java.lang.Object	clone()
peersim.core.Node	findClosestNode(double identifierToRoute, java.lang.Iterable<peersim.core.Node> container, boolean clockwise) Individuates effectively the next candidate for the routing.
peersim.core.Node	getCandidateForBidirectionalRoute(double identifierToRoute) Method to individuate the next node that as to be contacted through Bidirectional Routing mode
peersim.core.Node	getCandidateForRouting(double identifierToRoute) Method to identify the next node that has to be contacted.
peersim.core.Node	getCandidateForUnidirectionalRoute(double identifierToRoute) Method to individuate the next node that as to be contacted through Unidirectional Routing mode
Tuple<Message,Message>[]	getHistoryMessage()
double	getIdentifier()
boolean	isBootstrapped()
static boolean	isLeftNeighbour(double rootIdentifier, double neighbourIdentifier)
static boolean	isLeftNeighbour(peersim.core.Node rootNode, peersim.core.Node neighbourNode)
boolean	isManagerOf(double key)
void	processEvent(peersim.core.Node node, int pid, java.lang.Object event)
void	route(peersim.core.Node src, double key, Handler handler)

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

sequentialIdentifier

public final int sequentialIdentifier

numberShortRangeLinksPerSide

public final int numberShortRangeLinksPerSide

bidirectionalRouting

public final boolean bidirectionalRouting

lookAhead

public final boolean lookAhead

fixedLongRangeLinks

public final boolean fixedLongRangeLinks

numberFixedLongRangeLinks

public final int numberFixedLongRangeLinks

longRangeLinksOutgoing

public java.util.LinkedHashSet<peersim.core.Node> longRangeLinksOutgoing

longRangeLinksIncoming

public java.util.LinkedHashSet<peersim.core.Node> longRangeLinksIncoming

rightShortRangeLinks

public java.util.LinkedHashSet<Tuple<peersim.core.Node,SymphonyProtocol.BootstrapStatus>> rightShortRangeLinks

leftShortRangeLinks

public java.util.LinkedHashSet<Tuple<peersim.core.Node,SymphonyProtocol.BootstrapStatus>> leftShortRangeLinks

lookAheadMap

public final java.util.LinkedHashMap<peersim.core.Node,java.util.Set<java.lang.Double>[]> lookAheadMap

Array Contract: at position 0 -> OutgoingLongRangeLinks, 1 -> IncomingLongRangeLinks

loggedIntoNetwork

public SymphonyProtocol.BootstrapStatus loggedIntoNetwork

Constructor Detail

SymphonyProtocol

public SymphonyProtocol(java.lang.String prefix)

Method Detail

getCandidateForRouting

public peersim.core.Node getCandidateForRouting(double identifierToRoute)
                                         throws RoutingException

Method to identify the next node that has to be contacted. It's going to be used the mode that is described into the configuration file

Throws:

RoutingException

getCandidateForUnidirectionalRoute

public peersim.core.Node getCandidateForUnidirectionalRoute(double identifierToRoute)
                                                     throws RoutingException

Method to individuate the next node that as to be contacted through Unidirectional Routing mode

Throws:

RoutingException

getCandidateForBidirectionalRoute

public peersim.core.Node getCandidateForBidirectionalRoute(double identifierToRoute)
                                                    throws RoutingException

Method to individuate the next node that as to be contacted through Bidirectional Routing mode

Throws:

RoutingException

findClosestNode

public peersim.core.Node findClosestNode(double identifierToRoute,
                                java.lang.Iterable<peersim.core.Node> container,
                                boolean clockwise)
                                  throws RoutingException

Individuates effectively the next candidate for the routing. Checks if the lookahead is activated and in case of affirmative answer it's going to use that information.

Parameters:

identifierToRoute - Identifier to reach

container - Candidate Nodes Container

clockwise - true, does unidirectional routing. false, does bidirectional routing.

Returns:

The nearest node to reach identifierToRoute

Throws:

RoutingException - Throw in case no candidate is found

isLeftNeighbour

public static boolean isLeftNeighbour(peersim.core.Node rootNode,
                      peersim.core.Node neighbourNode)

Parameters:

neighbourNode - Neighbour Node

Returns:

true if the node is a left neighbour (or itself), false if it is a right one

isLeftNeighbour

public static boolean isLeftNeighbour(double rootIdentifier,
                      double neighbourIdentifier)

route

public void route(peersim.core.Node src,
         double key,
         Handler handler)
           throws RoutingException

Throws:

RoutingException

processEvent

public void processEvent(peersim.core.Node node,
                int pid,
                java.lang.Object event)

Specified by:

processEvent in interface peersim.edsim.EDProtocol

isManagerOf

public boolean isManagerOf(double key)

getIdentifier

public double getIdentifier()

getHistoryMessage

public Tuple<Message,Message>[] getHistoryMessage()

clearHistoryMessage

public void clearHistoryMessage()

clone

public java.lang.Object clone()

Specified by:

clone in interface peersim.core.Protocol

Overrides:

clone in class java.lang.Object

isBootstrapped

public boolean isBootstrapped()