Public Types |
Public Member Functions |
Protected Member Functions |
Private Member Functions |
Private Attributes |
Static Private Attributes |
Friends |
List of all members
oversim::Nice Class Reference
NICE overlay module. More...
#include <Nice.h>
Inheritance diagram for oversim::Nice:
Public Types | |
| typedef std::set < TransportAddress > | TaSet |
| typedef std::set < TransportAddress >::iterator | TaSetIt |
 Public Types inherited from BaseOverlay | |
| enum | States { INIT = 0, BOOTSTRAP = 1, DISCOVERY = 2, PREJOIN = 3, JOIN = 4, POSTJOIN = 5, READY = 6, REFRESH = 7, SHUTDOWN = 8, FAILED = 9, RSET = JOIN, BSET = POSTJOIN } |
| Public Types inherited from BaseTcpSupport | |
| enum | EvCode { NO_EST_CONNECTION, PEER_CLOSED, PEER_TIMEDOUT, PEER_REFUSED, CONNECTION_RESET, CONNECTION_SUCC_ClOSED } |
Public Member Functions | |
| Nice () | |
| virtual | ~Nice () |
| virtual void | initializeOverlay (int stage) |
| Initializes derived-class-attributes. | |
| virtual void | handleTimerEvent (cMessage *msg) |
| virtual void | handleUDPMessage (BaseOverlayMessage *msg) |
| Processes messages from underlay. | |
| virtual void | handleAppMessage (cMessage *msg) |
| Processes "timer" self-messages. | |
| virtual void | finishOverlay () |
| collects statistical data in derived class | |
| Public Member Functions inherited from BaseOverlay | |
| BaseOverlay () | |
| virtual | ~BaseOverlay () |
| Virtual destructor. | |
| States | getState () |
| bool | isMalicious () |
| Returns true, if node is malicious. | |
| bool | isInSimpleMultiOverlayHost () |
| Returns true if overlay is one in an array, inside a SimpleMultiOverlayHost. | |
| const simtime_t & | getCreationTime () |
| void | join (const OverlayKey &nodeID=OverlayKey::UNSPECIFIED_KEY) |
| Join the overlay with a given nodeID. | |
| virtual NodeVector * | local_lookup (const OverlayKey &key, int num, bool safe) |
| finds nodes closest to the given OverlayKey | |
| virtual NodeVector * | neighborSet (int num) |
| virtual bool | isSiblingFor (const NodeHandle &node, const OverlayKey &key, int numSiblings, bool *err) |
| Query if a node is among the siblings for a given key. | |
| virtual int | getMaxNumSiblings () |
| Query the maximum number of siblings (nodes close to a key) that are maintained by this overlay protocol. | |
| virtual int | getMaxNumRedundantNodes () |
| Query the maximum number of redundant next hop nodes that are returned by findNode(). | |
| void | sendMessageToUDP (const TransportAddress &dest, cPacket *msg, simtime_t delay=SIMTIME_ZERO) |
| Sends message to underlay. | |
| void | sendToKey (const OverlayKey &key, BaseOverlayMessage *message, int numSiblings=1, const std::vector< TransportAddress > &sourceRoute=TransportAddress::UNSPECIFIED_NODES, RoutingType routingType=DEFAULT_ROUTING) |
| Sends a message to an overlay node, with the generic routing algorithm. | |
| virtual OverlayKey | distance (const OverlayKey &x, const OverlayKey &y, bool useAlternative=false) const |
| This method should implement the distance between two keys. | |
| void | registerComp (CompType compType, cModule *module) |
| cModule * | getCompModule (CompType compType) |
| cGate * | getCompRpcGate (CompType compType) |
| void | sendMessageToAllComp (cMessage *msg, CompType srcComp) |
| bool | providesKbr () |
| virtual uint8_t | getBitsPerDigit () |
| bool | getMeasureAuthBlock () |
| BootstrapList & | getBootstrapList () const |
| virtual OverlayKey | estimateMeanDistance () |
| returns mean distance between OverlayKeys in the network | |
| virtual uint32_t | estimateOverlaySize () |
| estimates the current number of nodes online | |
| Public Member Functions inherited from BaseRpc | |
| BaseRpc () | |
| const NodeHandle & | getThisNode () |
| Returns the NodeHandle of this node. | |
| simtime_t | getUdpTimeout () |
| Public Member Functions inherited from RpcListener | |
| virtual | ~RpcListener () |
| destructor | |
| Public Member Functions inherited from BaseTcpSupport | |
| virtual void | socketDataArrived (int connId, void *yourPtr, cPacket *msg, bool urgent) |
| virtual void | socketEstablished (int connId, void *yourPtr) |
| virtual void | socketPeerClosed (int connId, void *yourPtr) |
| virtual void | socketFailure (int connId, void *yourPtr, int code) |
| virtual void | socketStatusArrived (int connId, void *yourPtr, TCPStatusInfo *status) |
| Public Member Functions inherited from TopologyVis | |
| TopologyVis () | |
| void | showOverlayNeighborArrow (const NodeHandle &neighbor, bool flush=true, const char *displayString=NULL) |
| Draws an arrow from this node to neighbor. | |
| void | deleteOverlayNeighborArrow (const NodeHandle &neighbor) |
| Removes an arrow from this node to neighbor. | |
Protected Member Functions | |
| virtual void | changeState (int toState) |
| changes node state | |
| virtual void | joinOverlay () |
| Join the overlay with a given nodeID in thisNode.key. | |
| virtual void | handleNodeLeaveNotification () |
| This method gets call **.gracefulLeaveDelay seconds before it is killed. | |
| Protected Member Functions inherited from BaseOverlay | |
| int | numInitStages () const |
| Sets init stage. | |
| void | bindToPort (int port) |
| Tells UDP we want to get all packets arriving on the given port. | |
| virtual void | route (const OverlayKey &key, CompType destComp, CompType srcComp, cPacket *msg, const std::vector< TransportAddress > &sourceRoute=TransportAddress::UNSPECIFIED_NODES, RoutingType routingType=DEFAULT_ROUTING) |
| Routes message through overlay. | |
| void | callDeliver (BaseOverlayMessage *msg, const OverlayKey &destKey) |
| Calls deliver function in application. | |
| void | callForward (const OverlayKey &key, BaseRouteMessage *msg, const NodeHandle &nextHopNode) |
| Calls forward function in application. | |
| void | callUpdate (const NodeHandle &node, bool joined) |
| Informs application about state changes of nodes or newly joined nodes. | |
| void | handleMessage (cMessage *msg) |
| Checks for message type and calls corresponding method. | |
| void | handleBaseOverlayMessage (BaseOverlayMessage *msg, const OverlayKey &destKey=OverlayKey::UNSPECIFIED_KEY) |
| Handles a BaseOverlayMessage | |
| virtual void | receiveChangeNotification (int category, const cPolymorphic *details) |
| callback-method for events at the NotificationBoard | |
| virtual void | handleTransportAddressChangedNotification () |
| This method gets call if the node has a new TransportAddress (IP address) because he changed his access network. | |
| virtual void | handleNodeGracefulLeaveNotification () |
| This method gets call **.gracefulLeaveDelay seconds before it is killed if this node is among the gracefulLeaveProbability nodes. | |
| virtual void | recordOverlaySentStats (BaseOverlayMessage *msg) |
| Collect overlay specific sent messages statistics. | |
| void | setOverlayReady (bool ready) |
| Sets the overlay ready icon and register/deregisters the node at the GlobalNodeList. | |
| virtual AbstractLookup * | createLookup (RoutingType routingType=DEFAULT_ROUTING, const BaseOverlayMessage *msg=NULL, const cPacket *findNodeExt=NULL, bool appLookup=false) |
| Creates an abstract iterative lookup instance. | |
| virtual void | removeLookup (AbstractLookup *lookup) |
| Removes the abstract lookup instance. | |
| virtual NodeVector * | findNode (const OverlayKey &key, int numRedundantNodes, int numSiblings, BaseOverlayMessage *msg=NULL) |
| Implements the find node call. | |
| virtual void | joinForeignPartition (const NodeHandle &node) |
| Join another overlay partition with the given node as bootstrap node. | |
| virtual bool | handleFailedNode (const TransportAddress &failed) |
| Handles a failed node. | |
| virtual void | lookupRpc (LookupCall *call) |
| virtual void | nextHopRpc (NextHopCall *call) |
| void | countFindNodeCall (const FindNodeCall *call) |
| void | countFailedNodeCall (const FailedNodeCall *call) |
| bool | internalHandleRpcCall (BaseCallMessage *msg) |
| Handles internal rpc requests. | |
| void | internalHandleRpcResponse (BaseResponseMessage *msg, cPolymorphic *context, int rpcId, simtime_t rtt) |
| Handles rpc responses internal in base classes | |
| void | internalHandleRpcTimeout (BaseCallMessage *msg, const TransportAddress &dest, cPolymorphic *context, int rpcId, const OverlayKey &destKey) |
| Handles rpc timeouts internal in base classes | |
| void | internalSendRouteRpc (BaseRpcMessage *message, const OverlayKey &destKey, const std::vector< TransportAddress > &sourceRoute, RoutingType routingType) |
| CompType | getThisCompType () |
| Return the component type of this module. | |
| Protected Member Functions inherited from BaseRpc | |
| void | initRpcs () |
| Initializes Remote-Procedure state. | |
| void | finishRpcs () |
| Deinitializes Remote-Procedure state. | |
| virtual void | internalHandleRpcMessage (BaseRpcMessage *msg) |
| Handles incoming rpc messages and delegates them to the corresponding listeners or handlers. | |
| uint32_t | sendRouteRpcCall (CompType destComp, const TransportAddress &dest, const OverlayKey &destKey, BaseCallMessage *msg, cPolymorphic *context=NULL, RoutingType routingType=DEFAULT_ROUTING, simtime_t timeout=-1, int retries=0, int rpcId=-1, RpcListener *rpcListener=NULL) |
| Routes a Remote-Procedure-Call message to an OverlayKey. | |
| uint32_t | sendRouteRpcCall (CompType destComp, const OverlayKey &destKey, BaseCallMessage *msg, cPolymorphic *context=NULL, RoutingType routingType=DEFAULT_ROUTING, simtime_t timeout=-1, int retries=0, int rpcId=-1, RpcListener *rpcListener=NULL) |
| Routes a Remote-Procedure-Call message to an OverlayKey. | |
| uint32_t | sendRouteRpcCall (CompType destComp, const TransportAddress &dest, BaseCallMessage *msg, cPolymorphic *context=NULL, RoutingType routingType=DEFAULT_ROUTING, simtime_t timeout=-1, int retries=0, int rpcId=-1, RpcListener *rpcListener=NULL) |
| Sends a Remote-Procedure-Call message using the overlay's UDP port This replaces ROUTE_DIRECT calls! | |
| uint32_t | sendUdpRpcCall (const TransportAddress &dest, BaseCallMessage *msg, cPolymorphic *context=NULL, simtime_t timeout=-1, int retries=0, int rpcId=-1, RpcListener *rpcListener=NULL) |
| Sends a Remote-Procedure-Call message to the underlay | |
| uint32_t | sendInternalRpcCall (CompType destComp, BaseCallMessage *msg, cPolymorphic *context=NULL, simtime_t timeout=-1, int retries=0, int rpcId=-1, RpcListener *rpcListener=NULL) |
| Sends an internal Remote-Procedure-Call between two tiers | |
| void | cancelRpcMessage (uint32_t nonce) |
| Cancels a Remote-Procedure-Call. | |
| void | cancelAllRpcs () |
| Cancels all RPCs. | |
| void | sendRpcResponse (TransportType transportType, CompType destComp, const TransportAddress &dest, const OverlayKey &destKey, BaseCallMessage *call, BaseResponseMessage *response) |
| Send Remote-Procedure response message and deletes call message. | |
| void | sendRpcResponse (BaseCallMessage *call, BaseResponseMessage *response) |
| Send Remote-Procedure response message to UDP and deletes call message. | |
| int | pingNode (const TransportAddress &dest, simtime_t timeout=-1, int retries=0, cPolymorphic *context=NULL, const char *caption="PING", RpcListener *rpcListener=NULL, int rpcId=-1, TransportType transportType=INVALID_TRANSPORT) |
| ping a node by its TransportAddress | |
| virtual bool | handleRpcCall (BaseCallMessage *msg) |
| Processes Remote-Procedure-Call invocation messages. | |
| virtual void | pingResponse (PingResponse *pingResponse, cPolymorphic *context, int rpcId, simtime_t rtt) |
| virtual void | pingTimeout (PingCall *pingCall, const TransportAddress &dest, cPolymorphic *context, int rpcId) |
| bool | internalHandleMessage (cMessage *msg) |
| Protected Member Functions inherited from RpcListener | |
| virtual void | handleRpcResponse (BaseResponseMessage *msg, cPolymorphic *context, int rpcId, simtime_t rtt) |
| This method is called if an RPC response has been received. | |
| virtual void | handleRpcResponse (BaseResponseMessage *msg, const RpcState &rpcState, simtime_t rtt) |
| This method is called if an RPC response has been received. | |
| virtual void | handleRpcTimeout (BaseCallMessage *msg, const TransportAddress &dest, cPolymorphic *context, int rpcId, const OverlayKey &destKey) |
| This method is called if an RPC timeout has been reached. | |
| virtual void | handleRpcTimeout (const RpcState &rpcState) |
| This method is called if an RPC timeout has been reached. | |
| Protected Member Functions inherited from BaseTcpSupport | |
| void | handleTCPMessage (cMessage *msg) |
| Member function to handle incoming TCP messages. | |
| void | bindAndListenTcp (int port) |
| Member function to bind service to the specified port and listen afterwards. | |
| bool | isAlreadyConnected (TransportAddress address) |
| Member function to check if the service is already connected. | |
| void | establishTcpConnection (TransportAddress address) |
| Member function to establish a connection to the specified node. | |
| void | sendTcpData (cPacket *msg, TransportAddress address) |
| Member function to send TCP data to the specified node. | |
| virtual void | handleConnectionEvent (EvCode code, TransportAddress address) |
| Member function to handle passive connection events. | |
| virtual void | handleDataReceived (TransportAddress address, cPacket *msg, bool urgent) |
| Member function to handle incoming data. | |
| virtual void | handleIncomingConnection (TransportAddress address) |
| Member function to handle newly opened connections. | |
| void | closeTcpConnection (TransportAddress address) |
| Member function to close an established connection. | |
| void | setTcpOut (cGate *gate) |
| Member function to set local gate towards the TCP module during init phase. | |
| cGate * | getTcpOut () |
| Member function to get local gate towards the TCP module. | |
| Protected Member Functions inherited from TopologyVis | |
| void | initVis (cModule *terminal) |
Private Member Functions | |
| void | updateVisualization () |
| int | getHighestLeaderLayer () |
| int | getHighestLayer () |
| void | BasicJoinLayer (short layer) |
| void | ClusterSplit (int layer) |
| void | Query (const TransportAddress &node, short layer) |
| void | handleNiceClusterMergeRequest (NiceClusterMerge *mergeMsg) |
| void | handleNiceForceMerge (NiceMessage *msg) |
| void | handleNiceHeartbeat (NiceHeartbeat *msg) |
| void | handleNiceLeaderHeartbeat (NiceLeaderHeartbeat *lhbMsg) |
| void | handleNiceLeaderTransfer (NiceLeaderHeartbeat *transferMsg) |
| void | handleNiceJoinCluster (NiceMessage *joinMsg) |
| void | handleNiceJoineval (NiceMessage *msg) |
| void | handleNiceJoinevalResponse (NiceMessage *msg) |
| void | handleNiceLeaderHeartbeatOrTransfer (NiceMessage *msg) |
| void | handleNiceMulticast (NiceMulticastMessage *multicastMsg) |
| void | handleNicePeerTemporary (NiceMessage *msg) |
| void | handleNicePeerTemporaryRelease (NiceMessage *msg) |
| void | handleNicePingProbe (NiceMessage *msg) |
| void | handleNicePingProbeResponse (NiceMessage *msg) |
| void | handleNicePollRp (NiceMessage *msg) |
| void | handleNicePollRpResponse (NiceMessage *msg) |
| void | handleNiceQuery (NiceMessage *queryMsg) |
| void | handleNiceQueryResponse (NiceMemberMessage *queryRspMsg) |
| void | handleNiceRemove (NiceMessage *msg) |
| void | JoinCluster (const TransportAddress &leader, short layer) |
| void | sendHeartbeats () |
| void | cleanPeers () |
| Cleans the tempPeers map from peers that have timed out, removes timed-out peers in peerInfos and also removes them from the clusters. | |
| bool | splitNeeded () |
| Splits clusters if needed. | |
| bool | mergeNeeded () |
| Merges clusters if needed. | |
| bool | checkLeaderHeartbeatsForCollisions (NiceLeaderHeartbeat *hbMsg) |
| Checks if we have received conflicting leader heartbeats. | |
| void | maintenance () |
| simtime_t | getMaxDistance (TransportAddress member, const std::set< TransportAddress > &neighbors) |
| template<class ConstIter > | |
| simtime_t | getMaxDistance (TransportAddress member, ConstIter neighborsBegin, ConstIter neighborsEnd) |
| simtime_t | getMeanDistance (std::set< TransportAddress > neighbors) |
| void | LeaderTransfer (int layer, TransportAddress leader, TaSet cluster, TransportAddress sc_leader, TaSet superCluster) |
| void | LeaderTransfer (int layer, TransportAddress leader) |
| void | Remove (int layer) |
| void | sendHeartbeatTo (const TransportAddress &node, int layer) |
| void | sendRemoveTo (const TransportAddress &node, int layer) |
| sendRemoveTo | |
| void | ClusterMerge (int layer) |
| void | ClusterMergeRequest (const TransportAddress &node, int layer) |
| void | gracefulLeave (short bottomLayer) |
| std::pair< TransportAddress, simtime_t > | findCenter (TaSet cluster, bool allowRandom=false) |
| std::pair< TransportAddress, simtime_t > | findCenter (std::vector< TransportAddress > cluster, bool allowRandom=false) |
| std::pair< TransportAddress, simtime_t > | findCenter (const NiceCluster &cluster, bool allowRandom=false) |
| template<class ConstIter > | |
| std::pair< TransportAddress, simtime_t > | findCenter (ConstIter begin, ConstIter end, bool allowRandom=false) |
| void | sendDataToOverlay (NiceMulticastMessage *appMsg) |
| void | pollRP (int layer) |
Static Private Attributes | |
| static const short | maxLayers = 10 |
Friends | |
| class | NicePeerInfo |
Additional Inherited Members | |
| Protected Types inherited from BaseOverlay | |
| typedef UNORDERED_SET < AbstractLookup *, lookupHashFcn, lookupHashFcn > | LookupSet |
| Protected Attributes inherited from BaseOverlay | |
| int | numAppDataForwarded |
| number of forwarded app data packets | |
| int | bytesAppDataForwarded |
| number of forwarded app data bytes at out-gate | |
| int | numAppLookupForwarded |
| number of forwarded app lookup packets | |
| int | bytesAppLookupForwarded |
| number of forwarded app lookup bytes at out-gate | |
| int | numMaintenanceForwarded |
| number of forwarded maintenance packets | |
| int | bytesMaintenanceForwarded |
| number of forwarded maintenance bytes at out-gate | |
| int | numFindNodeSent |
| int | bytesFindNodeSent |
| int | numFindNodeResponseSent |
| int | bytesFindNodeResponseSent |
| int | numFailedNodeSent |
| int | bytesFailedNodeSent |
| int | numFailedNodeResponseSent |
| int | bytesFailedNodeResponseSent |
| std::vector< HopDelayRecord * > | singleHopDelays |
| simtime_t | creationTime |
| simtime when the node has been created | |
| GlobalNodeList * | globalNodeList |
| pointer to GlobalNodeList in this node | |
| NotificationBoard * | notificationBoard |
| pointer to NotificationBoard in this node | |
| UnderlayConfigurator * | underlayConfigurator |
| pointer to UnderlayConfigurator in this node | |
| BootstrapList * | bootstrapList |
| pointer to the BootstrapList module | |
| GlobalParameters * | globalParameters |
| pointer to the GlobalParameters module | |
| uint32_t | overlayId |
| identifies the overlay this node belongs to (used for multiple overlays) | |
| bool | debugOutput |
| debug output ? | |
| RoutingType | defaultRoutingType |
| bool | useCommonAPIforward |
| forward messages to applications? | |
| bool | collectPerHopDelay |
| collect delay for single hops | |
| bool | routeMsgAcks |
| send ACK when receiving route message | |
| uint32_t | recNumRedundantNodes |
| numRedundantNodes for recursive routing | |
| bool | recordRoute |
| record visited hops on route | |
| bool | drawOverlayTopology |
| bool | rejoinOnFailure |
| bool | sendRpcResponseToLastHop |
| needed by KBR protocols for NAT support | |
| bool | dropFindNodeAttack |
| if node is malicious, it tries a findNode attack | |
| bool | isSiblingAttack |
| if node is malicious, it tries a isSibling attack | |
| bool | invalidNodesAttack |
| if node is malicious, it tries a invalidNode attack | |
| bool | dropRouteMessageAttack |
| if node is malicious, it drops all received BaseRouteMessages | |
| int | localPort |
| used UDP-port | |
| int | hopCountMax |
| maximum hop count | |
| bool | measureAuthBlock |
| if true, measure the overhead of signatures in rpc messages | |
| bool | restoreContext |
| if true, a node rejoins with its old nodeId and malicious state | |
| int | numDropped |
| number of dropped packets | |
| int | bytesDropped |
| number of dropped bytes | |
| cOutVector | delayVector |
| statistical output vector for packet-delays | |
| cOutVector | hopCountVector |
| statistical output vector for hop-counts | |
| States | state |
| IterativeLookupConfiguration | iterativeLookupConfig |
| RecursiveLookupConfiguration | recursiveLookupConfig |
| LookupSet | lookups |
| bool | kbr |
| set this to true, if the overlay provides KBR services | |
Detailed Description
NICE overlay module.
Implementation of the NICE overlay as described in "Scalable Application Layer Multicast" by S. Banerjee and B. Bhattacharjee and C. Kommareddy, published at SIGCOMM'02, 2002.
Member Typedef Documentation
| typedef std::set<TransportAddress> oversim::Nice::TaSet |
| typedef std::set<TransportAddress>::iterator oversim::Nice::TaSetIt |
Constructor & Destructor Documentation
| oversim::Nice::Nice | ( | ) |
Definition at line 72 of file Nice.cc.
: isRendevouzPoint(false),
isTempPeered(false),
numQueryTimeouts(0),
numPeerTimeouts(0),
numJoins(0),
numReceived(0),
numHeartbeat(0),
{
/* do nothing at this point of time, OverSim calls initializeOverlay */
} // Nice
|
virtual |
Definition at line 97 of file Nice.cc.
{
// destroy self timer messages
cancelAndDelete(heartbeatTimer);
cancelAndDelete(maintenanceTimer);
cancelAndDelete(rpPollTimer);
cancelAndDelete(queryTimer);
cancelAndDelete(visualizationTimer);
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.begin();
for (; it != peerInfos.end(); it++) {
delete it->second;
}
} // ~NICE
Member Function Documentation
|
private |
Definition at line 555 of file Nice.cc.
Referenced by changeState(), handleNiceLeaderTransfer(), and maintenance().
{
// Cancel timers involved in structure refinement
/*
if (layer == -1 || layer == 0) {
cancelEvent(maintenanceTimer);
cancelEvent(heartbeatTimer);
}
*/
Query(RendevouzPoint, -1);
if (layer > -1)
targetLayer = layer;
else
targetLayer = 0;
// Temporary peer with RP for faster data reception
msg->setSrcNode(thisNode);
msg->setCommand(NICE_PEER_TEMPORARY);
msg->setLayer(-1);
msg->setBitLength(NICEMESSAGE_L(msg));
sendMessageToUDP(RendevouzPoint, msg);
isTempPeered = true;
} // BasicJoinLayer
|
protectedvirtual |
changes node state
- Parameters
-
toState state to change to
Definition at line 248 of file Nice.cc.
Referenced by handleNiceQueryResponse(), and joinOverlay().
{
switch (toState) {
case INIT:
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 1, "red");
scheduleAt(simTime() + 1, visualizationTimer);
break;
case JOIN:
/* get rendevouz point */
isRendevouzPoint = true;
/* join cluster layer 0 as first node */
return;
}
else {
pollRP(-1);
/* initiate NICE structure joining */
BasicJoinLayer(-1);
}
break;
case READY:
cancelEvent(heartbeatTimer);
scheduleAt(simTime() + heartbeatInterval, heartbeatTimer);
cancelEvent(maintenanceTimer);
scheduleAt(simTime() + maintenanceInterval, maintenanceTimer);
getParentModule()->getParentModule()->getDisplayString().setTagArg
setOverlayReady(true);
/* allow only rendevouz point to be bootstrap node */
break;
}
} // changeState
|
private |
Checks if we have received conflicting leader heartbeats.
checkLeaderHeartbeatsForCollisions
Returns true if a collision was detected.
Definition at line 2263 of file Nice.cc.
{
bool collisionDetected = false;
//Alternative Detection
leaderHeartbeats.push_back(std::make_pair(hbMsg->getSrcNode(), simTime()));
if (leaderHeartbeats.size() > 3) {
if (debug_heartbeats)
EV << simTime() << "leaderHeartbeats.size() > 3 : " << leaderHeartbeats.size() << endl;
simtime_t predecessor = leaderHeartbeats.at(leaderHeartbeats.size()-2).second;
if (debug_heartbeats)
EV << simTime() << "predecessor : " << predecessor << endl;
if (simTime() < (predecessor + heartbeatInterval)) {
if (debug_heartbeats)
EV << simTime() << "simTime() < (predecessor + heartbeatInterval)" << endl;
if (debug_heartbeats) {
EV << simTime() << "(leaderHeartbeats.at(leaderHeartbeats.size()-2).first != hbMsg->getSrcNode())" << endl;
EV << "leaderHeartbeats.at(leaderHeartbeats.size()-2).first: " << leaderHeartbeats.at(leaderHeartbeats.size()-2).first << endl;
}
if (debug_heartbeats) {
EV << simTime() << "(leaderHeartbeats.at(leaderHeartbeats.size()-3).first == hbMsg->getSrcNode())" << endl;
EV << "leaderHeartbeats.at(leaderHeartbeats.size()-3).first: " << leaderHeartbeats.at(leaderHeartbeats.size()-3).first << endl;
}
if (leaderHeartbeats.at(leaderHeartbeats.size()-4).first == leaderHeartbeats.at(leaderHeartbeats.size()-2).first) {
if (debug_heartbeats) {
EV << simTime() << "(leaderHeartbeats.at(leaderHeartbeats.size()-4).first == leaderHeartbeats.at(leaderHeartbeats.size()-2).first" << endl;
EV << "leaderHeartbeats.at(leaderHeartbeats.size()-4).first: " << leaderHeartbeats.at(leaderHeartbeats.size()-4).first << endl;
}
if (debug_heartbeats)
removeMsg->setSrcNode(thisNode);
removeMsg->setCommand(NICE_REMOVE);
removeMsg->setBitLength(NICEMESSAGE_L(removeMsg));
collisionDetected = true;
}
}
}
}
}
/* Tidy up leaderheartbeats */
if (leaderHeartbeats.size() > 4) {
leaderHeartbeats.erase(leaderHeartbeats.begin());
}
}
return collisionDetected;
}
|
private |
Cleans the tempPeers map from peers that have timed out, removes timed-out peers in peerInfos and also removes them from the clusters.
cleanPeers
Definition at line 2150 of file Nice.cc.
Referenced by maintenance().
{
// Clean tempPeers
std::vector<TransportAddress> deadTempPeers;
std::map<TransportAddress, simtime_t>::iterator itTempPeer;
if (simTime() > (itTempPeer->second + 3 * heartbeatInterval)) {
deadTempPeers.push_back(itTempPeer->first);
}
}
std::vector<TransportAddress>::iterator itDead;
for (itDead = deadTempPeers.begin(); itDead != deadTempPeers.end(); ++itDead) {
tempPeers.erase(*itDead);
deleteOverlayNeighborArrow(*itDead);
}
/* Delete nodes that haven't been active for too long autonomously */
std::vector<TransportAddress> deadPeers;
std::map<TransportAddress, NicePeerInfo*>::iterator itPeer = peerInfos.begin();
while (itPeer != peerInfos.end()) {
if (itPeer->first != thisNode && simTime() > (itPeer->second->getActivity() + offset)) {
if (debug_peertimeouts) {
EV << "Activity : " << itPeer->second->getActivity() << endl;
}
deadPeers.push_back(itPeer->first);
}
++itPeer;
}
for (itDead = deadPeers.begin(); itDead != deadPeers.end(); ++itDead) {
delete peerInfos[*itDead];
peerInfos.erase(*itDead);
// Delete nodes from all layer clusters
deleteOverlayNeighborArrow(*itDead);
}
}
} // cleanPeers
|
private |
Definition at line 2868 of file Nice.cc.
Referenced by mergeNeeded().
{
ASSERT(layer < maxLayers - 1);
simtime_t min_delay = 999;
TransportAddress min_node = TransportAddress::UNSPECIFIED_NODE;
if (node != thisNode) {
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(node);
if (it != peerInfos.end()) {
simtime_t delay = it->second->get_distance();
if ((delay > 0) && (delay < min_delay)) {
min_delay = delay;
min_node = node;
}
}
}
}
if (!min_node.isUnspecified()) {
// send merge request
ClusterMergeRequest(min_node, layer);
// leave above layer, we are no longer the leader of this cluster.
gracefulLeave(layer + 1);
clusters[layer].confirmLeader();
}
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 1, clustercolors[i]);
}
}
else {
}
} // ClusterMerge
|
private |
Definition at line 2936 of file Nice.cc.
Referenced by ClusterMerge(), and handleNiceForceMerge().
{
ASSERT(!clusters[layer+1].getLeader().isUnspecified());
msg->setSrcNode(thisNode);
msg->setLayer(layer);
msg->setMembersArraySize(clusters[layer].getSize());
/* Fill in members */
}
msg->setNewClusterLeader(clusters[layer+1].getLeader());
msg->setBitLength(NICECLUSTERMERGE_L(msg));
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 0, "block/circle_vs");
sendMessageToUDP(node, msg);
} // ClusterMergeRequest
|
private |
Definition at line 2621 of file Nice.cc.
Referenced by splitNeeded().
{
/* Get cluster to be splitted */
NiceCluster cluster = clusters[layer];
/* Introduce some helper structures */
std::vector<TransportAddress> vec1;
std::vector<TransportAddress> vec2;
std::vector<TransportAddress> cl1;
std::vector<TransportAddress> cl2;
TaSet cl1set, cl2set;
TransportAddress cl1_center = TransportAddress::UNSPECIFIED_NODE;
TransportAddress cl2_center = TransportAddress::UNSPECIFIED_NODE;
simtime_t min_delay = 999;
/* Delete all arrows in visualization */
deleteOverlayNeighborArrow(cluster.get(i));
/* Put all members to first vector */
vec1.push_back(cluster.get(i));
//EV << "vec1.push_back(cluster.get(i)): " << cluster.get(i).getIp() << endl;
/* Put first half of members to second vector */
if (i < cluster.getSize()/2) {
vec2.push_back(cluster.get(i));
//EV << "vec2.push_back(cluster.get(i)): " << cluster.get(i).getIp() << endl;
}
}
int combinations = 0;
TaSet::iterator sit;
if (cluster.getSize() < 18) {
/* Go through all combinations of clusters */
do {
combinations++;
//EV << "combinations: " << combinations << endl;
/* Introduce some helper structures */
TransportAddress q1_center;
TransportAddress q2_center;
std::vector<TransportAddress> vec3;
/* Determine elements that are in first set but not in second */
std::set_difference(vec1.begin(), vec1.end(), vec2.begin(), vec2.end(), inserter(vec3, vec3.begin()));
simtime_t min_q1_delay = 999;
simtime_t min_q2_delay = 999;
simtime_t max_delay = 0;
q1_center = findCenter(vec2).first;
//EV << "q1_center: " << q1_center.getIp() << endl;
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(q1_center);
if (it != peerInfos.end()) {
min_q1_delay = it->second->get_distance();
}
else {
min_q1_delay = 0;
}
q2_center = findCenter(vec3).first;
//EV << "q2_center: " << q2_center.getIp() << endl;
it = peerInfos.find(q2_center);
if (it != peerInfos.end()) {
min_q2_delay = it->second->get_distance();
}
else {
min_q2_delay = 0;
}
max_delay = std::max(min_q1_delay, min_q2_delay);
if (min_delay == 0) min_delay = max_delay;
min_delay = max_delay;
cl1 = vec2;
cl2 = vec3;
cl1_center = q1_center;
cl2_center = q2_center;
}
} while (next_combination(vec1.begin(), vec1.end(), vec2.begin(), vec2.end()));
//build sets
cl1set.insert(cl1.begin(), cl1.end());
cl2set.insert(cl2.begin(), cl2.end());
}
else {
cl1set.clear();
cl2set.clear();
if (i < cluster.getSize()/2) {
cl1set.insert(cluster.get(i));
}
else {
cl2set.insert(cluster.get(i));
}
}
cl1_center = findCenter(cl1set,true).first;
cl2_center = findCenter(cl2set,true).first;
}
if (isRendevouzPoint) {
// Make certain that we remain leader
if (cl1set.count(thisNode) > 0) {
cl1_center = thisNode;
}
else {
cl2_center = thisNode;
}
}
// Cluster split accomplished, now handling consequences
// CASE 1: We lost all cluster leaderships
// repair all cluster layer, top down
TransportAddress scLeader;
if (layer < getHighestLayer()) {
gracefulLeave(layer+1);
}
else {
scLeader = cl1_center;
if (isRendevouzPoint) {
opp_error("Something went wrong in Nice::ClusterSplit and the RendevouzPoint is trying to give up leadership. This is a bug in OverSim's implementation of Nice. Please fix it, or file a bug.");
}
}
// Leaving the upper layer before sending LTs leads to wrong information in the packets.
LeaderTransfer(layer, cl1_center, cl1set, scLeader, superCluster);
LeaderTransfer(layer, cl2_center, cl2set, scLeader, superCluster);
if (layer < maxLayers - 1) {
deleteOverlayNeighborArrow(*itn);
}
}
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 0, "block/circle_vs");
}
// CASE 2: We stay leader in one of the new clusters
if (clusters[layer + 1].getSize() == 0) {
clusters[layer + 1].confirmLeader();
}
if (cl1_center == thisNode) {
LeaderTransfer(layer, cl2_center, cl2set, clusters[layer + 1].getLeader(), superCluster);
}
else {
LeaderTransfer(layer, cl1_center, cl1set, clusters[layer + 1].getLeader(), superCluster);
}
}
// Set local cluster info
// Depends on in which of the two clusters this node is
if (cl1set.count(thisNode)) {
TaSet::iterator cit = cl1set.begin();
while (cit != cl1set.end()) {
cit++;
}
}
else {
TaSet::iterator cit = cl2set.begin();
while (cit != cl2set.end()) {
cit++;
}
}
clusters[layer].confirmLeader();
//update arrows
if (pimp)
} // ClusterSplit
|
private |
Definition at line 2971 of file Nice.cc.
Referenced by ClusterSplit(), findCenter(), gracefulLeave(), and maintenance().
|
private |
|
private |
template<class ConstIter >
|
private |
Definition at line 2998 of file Nice.cc.
{
simtime_t min_delay = 1000;
for (ConstIter it = begin; it != end; ++it) {
simtime_t delay = getMaxDistance(*it, begin, end);
if ((delay > 0) && (delay < min_delay)) {
min_delay = delay;
center = *it;
}
}
if (center.isUnspecified()) {
center = *begin;
}
//EV << "center: " << center << endl;
return std::make_pair(center, min_delay);
} // findCenter
|
virtual |
collects statistical data in derived class
Reimplemented from BaseOverlay.
Definition at line 521 of file Nice.cc.
{
if (isRendevouzPoint) {
}
globalStatistics->addStdDev("Nice: Own Messages Received/s", (double)numOwnMessagesReceived / time);
globalStatistics->addStdDev("Nice: Received Multicast Messages/s (subscribed groups only)", (double)numReceived / time);
globalStatistics->addStdDev("Nice: Received Multicast Bytes/s (subscribed groups only)", (double)totalReceivedBytes / time);
} // finishOverlay
|
private |
Definition at line 1642 of file Nice.cc.
Referenced by changeState(), ClusterMerge(), ClusterSplit(), getHighestLeaderLayer(), gracefulLeave(), handleNiceLeaderHeartbeat(), handleNicePingProbeResponse(), maintenance(), Remove(), sendDataToOverlay(), sendHeartbeats(), and updateVisualization().
{
if (clusters[0].getSize() == 0) {
// Not yet joined to overlay
return -1;
}
int highest = 0;
while (highest < maxLayers &&
!clusters[highest].getLeader().isUnspecified() &&
++highest;
}
if (highest == maxLayers) {
// we are top leader
return maxLayers - 1;
}
// we are top leader. highest is one plus our layer.
return highest - 1;
}
else {
return highest;
}
} // getHighestLayer
|
private |
Definition at line 1628 of file Nice.cc.
Referenced by gracefulLeave(), handleNiceClusterMergeRequest(), handleNicePollRp(), handleNiceQuery(), maintenance(), mergeNeeded(), and splitNeeded().
{
int layer = getHighestLayer();
return layer;
}
else if (layer == -1) {
return -1;
}
else {
return layer - 1;
}
} // getHighestLeaderLayer
|
private |
Definition at line 3075 of file Nice.cc.
Referenced by findCenter(), and maintenance().
template<class ConstIter >
|
private |
Definition at line 3031 of file Nice.cc.
{
simtime_t maxDelay = 0;
simtime_t delay = 0;
if (member == thisNode) {
for (ConstIter it = neighborsBegin; it != neighborsEnd; ++it) {
std::map<TransportAddress, NicePeerInfo*>::iterator itInfo = peerInfos.find(*it);
if (itInfo != peerInfos.end()) {
delay = itInfo->second->get_distance();
maxDelay = std::max(delay, maxDelay);
}
}
}
else {
std::map<TransportAddress, NicePeerInfo*>::iterator itInfo = peerInfos.find(member);
if (itInfo != peerInfos.end()) {
for (ConstIter it = neighborsBegin; it != neighborsEnd; ++it) {
//EV << "getDistanceTo " << *it2 << endl;
delay = itInfo->second->getDistanceTo(*it);
//EV << thisNode.getIp() << " : Distance to " << it2->getIp() << " : " << delay << endl;
maxDelay = std::max(delay, maxDelay);
}
}
}
return maxDelay;
} // getMaxDistance
|
private |
Definition at line 3083 of file Nice.cc.
Referenced by maintenance().
{
simtime_t meanDelay = 0;
simtime_t delay = 0;
unsigned int number = 0;
std::set<TransportAddress>::iterator it = neighbors.begin();
while (it != neighbors.end()) {
if (*it != thisNode) {
std::map<TransportAddress, NicePeerInfo*>::iterator it2 = peerInfos.find(*it);
if (it2 != peerInfos.end()) {
delay = it2->second->get_distance();
//EV << "delay to " << *it << " : " << delay << endl;
if (delay > 0.0) {
meanDelay += delay;
number++;
}
}
}
it++;
}
if (number > 0) {
return meanDelay/number;
}
else {
return 0;
}
} // getMeanDistance
|
private |
Definition at line 3234 of file Nice.cc.
Referenced by ClusterMerge(), ClusterSplit(), handleNiceLeaderHeartbeat(), and maintenance().
{
int layer = getHighestLayer();
ASSERT(layer >= bottomLayer);
if (isRendevouzPoint) {
opp_error("The RendevouzPoint is trying to leave a layer and the simulation cannot continue. This is a bug in the Nice implementation in OverSim, please check the backtrace and fix it or submit a bug report.");
}
// simply leave cluster
if (!clusters[layer].getLeader().isUnspecified()) {
Remove(layer);
}
}
for (layer = getHighestLeaderLayer(); layer >= bottomLayer; layer--) {
EV << "REPAIR: " << layer << endl;
for (TaSet::const_iterator itNode = clusters[layer].begin(); itNode != clusters[layer].end(); ++itNode) {
EV << "rest: " << itNode->getIp() << endl;
deleteOverlayNeighborArrow(*itNode);
}
EV << "remove from: " << layer << endl;
Remove(layer);
if (clusters[layer].getSize() > 0) {
if (new_sc_center.isUnspecified()) {
EV << "UNSPECIFIED! instead choose: " << new_sc_center.getIp() << endl;
}
LeaderTransfer(layer, new_sc_center);
}
}
} // gracefulLeave
|
virtual |
Processes "timer" self-messages.
- Parameters
-
msg A self-message Processes non-commonAPI messages msg non-commonAPIMessage
Reimplemented from BaseOverlay.
Definition at line 3300 of file Nice.cc.
{
if ( ALMAnycastMessage* anycastMsg = dynamic_cast<ALMAnycastMessage*>(msg) ) {
<< " Anycast message for group " << anycastMsg->getGroupId() << "\n"
<< " ignored: Not implemented yet!"
<< endl;
}
<< " Create message for group " << createMsg->getGroupId() << "\n"
<< " ignored: Not implemented yet!"
<< endl;
}
<< " Delete message for group " << deleteMsg->getGroupId() << "\n"
<< " ignored: Not implemented yet!"
<< endl;
}
<< " Leave message for group " << leaveMsg->getGroupId() << "\n"
<< " ignored: Not implemented yet!"
<< endl;
}
niceMsg->setCommand(NICE_MULTICAST);
niceMsg->setLayer(-1);
niceMsg->setSrcNode(thisNode);
niceMsg->setLastHop(thisNode);
niceMsg->setHopCount(0);
niceMsg->setBitLength(NICEMULTICAST_L(niceMsg));
niceMsg->encapsulate(multicastMsg);
sendDataToOverlay(niceMsg);
// otherwise msg gets deleted later
msg = NULL;
}
<< " Subscribe message for group " << subscribeMsg->getGroupId() << "\n"
<< " ignored: Not implemented yet!"
<< endl;
}
// Delete msg if not already deleted
if ( msg ) {
delete msg;
}
} // handleAppMessage
|
private |
Definition at line 755 of file Nice.cc.
Referenced by handleUDPMessage().
{
short layer = mergeMsg->getLayer();
// Only react if I am a leader of this cluster layer
if (clusters[layer].getLeader().isUnspecified()) {
EV << simTime() << " : " << thisNode.getIp() << " : NO LEADER! BREAK. NICE_CLUSTER_MERGE_REQUEST finished" << endl;
delete mergeMsg;
return;
}
deleteOverlayNeighborArrow(mergeMsg->getSrcNode());
if (oldLeader.isUnspecified() || oldLeader != thisNode) {
}
/* Add new node to cluster */
/* Create peer context to joining node */
/* Check if peer info already exists */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(mergeMsg->getMembers(i));
}
else { /* Create PeerInfo object */
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(mergeMsg->getMembers(i), pi));
}
/* Draw arrow to new member */
EV << "getHighestLeaderLayer()].getSize(): " << clusters[getHighestLeaderLayer()].getSize() << endl;
#if 0
// cancel layer
deleteOverlayNeighborArrow(*itn);
}
if (clusters[i].getSize() > 0) {
getParentModule()->getParentModule()->getDisplayString().setTagArg
("i2", 1, clustercolors[i]);
}
}
}
}
#endif
}
}
else { // Forward to new cluster leader
if (pimp) {
sendMessageToUDP(clusters[layer].getLeader(), dup);
delete mergeMsg;
return;
}
}
if (pimp)
delete mergeMsg;
}
|
private |
Definition at line 862 of file Nice.cc.
Referenced by handleUDPMessage().
|
private |
Definition at line 869 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_heartbeats)
EV << simTime() << " : " << thisNode.getIp() << " : NICE_HEARTBEAT from " << hbMsg->getSrcNode() << endl;
/* Update sequence number information and evaluate distance */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(hbMsg->getSrcNode());
if (it != peerInfos.end()) {
/* We already know this node */
// Collect subcluster infos
it->second->setSubClusterMembers(hbMsg->getSublayermembers());
it->second->set_last_HB_arrival(simTime().dbl());
if (it->second->get_backHB(hbMsg->getSeqRspNo()) > 0) {
/* Valid distance measurement, get value */
double oldDistance = it->second->get_distance();
/* Use Exponential Moving Average with factor 0.1 */
double newDistance = (simTime().dbl() - it->second->get_backHB(hbMsg->getSeqRspNo()) - hbMsg->getHb_delay())/2.0;
if (oldDistance > 0) {
it->second->set_distance((0.1 * newDistance) + (0.9 * oldDistance));
}
else {
it->second->set_distance(newDistance);
}
}
it->second->set_last_recv_HB(hbMsg->getSeqNo());
}
it = peerInfos.find(hbMsg->getSrcNode());
if (it != peerInfos.end()) {
for (unsigned int i=0; i<hbMsg->getMembersArraySize(); i++) {
it->second->updateDistance(hbMsg->getMembers(i), hbMsg->getDistances(i));
}
}
delete hbMsg;
if (debug_heartbeats)
}
|
private |
Definition at line 1282 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_join)
short layer = joinMsg->getLayer();
if (debug_join)
if (!clusters[layer].getLeader().isUnspecified()) {
if (pimp) {
sendMessageToUDP(clusters[layer].getLeader(), dup);
}
}
else {
RECORD_STATS(++numJoins);
/* Add new node to cluster */
/* Create peer context to joining node */
/* Check if peer info already exists */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(joinMsg->getSrcNode());
}
else { /* Create PeerInfo object */
peerInfos.insert(std::make_pair(joinMsg->getSrcNode(), pi));
}
/* Draw arrow to new member */
if (pimp)
sendHeartbeatTo(joinMsg->getSrcNode(), layer);
}
}
else {
if (debug_join)
EV << "Leader unspecified. Ignoring request." << endl;
}
if (debug_join)
delete joinMsg;
} // handleNiceJoinCluster
|
private |
Definition at line 1348 of file Nice.cc.
Referenced by handleUDPMessage().
{
responseMsg->setSrcNode(thisNode);
responseMsg->setCommand(NICE_JOINEVAL_RESPONSE);
responseMsg->setBitLength(NICEMESSAGE_L(responseMsg));
sendMessageToUDP(msg->getSrcNode(), responseMsg);
delete msg;
}
|
private |
Definition at line 1362 of file Nice.cc.
Referenced by handleUDPMessage().
|
private |
Definition at line 928 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_heartbeats)
EV << simTime() << " : " << thisNode.getIp() << " : NICE_LEADERHEARTBEAT from " << lhbMsg->getSrcNode() << endl;
ASSERT(lhbMsg->getSrcNode() != thisNode);
/* Update sequence number information and evaluate distance */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(lhbMsg->getSrcNode());
it->second->set_last_HB_arrival(simTime().dbl());
if (it->second->get_backHB(lhbMsg->getSeqRspNo()) > 0) {
/* Valid distance measurement, get value */
it->second->set_distance((simTime().dbl() - it->second->get_backHB(lhbMsg->getSeqRspNo()) - lhbMsg->getHb_delay())/2);
}
it->second->set_last_recv_HB(lhbMsg->getSeqNo());
}
it = peerInfos.find(lhbMsg->getSrcNode());
if (it != peerInfos.end()) {
it->second->updateDistance(lhbMsg->getMembers(i), lhbMsg->getDistances(i));
}
}
// Maintain cluster memberships
/* Node is not part of this cluster, remove it */
if (debug_heartbeats)
delete lhbMsg;
return;
}
if (debug_heartbeats)
EV << "Leader collision...";
if (debug_heartbeats)
EV << "...making other leader." << endl;
gracefulLeave(lhbMsg->getLayer() + 1);
}
/* Fix visualisation - remove arrows */
int hbLayer = lhbMsg->getLayer();
deleteOverlayNeighborArrow(*itn);
}
}
else {
if (debug_heartbeats)
EV << "...remaining leader." << endl;
delete lhbMsg;
return;
}
}
if (debug_heartbeats)
EV << "Possible multiple leaders detected... sending remove to " << clusters[lhbMsg->getLayer()].getLeader() << " leader.\n";
}
/* Everything is in order. Process HB */
bool leaderChanged = clusters[lhbMsg->getLayer()].getLeader().isUnspecified() || clusters[lhbMsg->getLayer()].getLeader() != lhbMsg->getSrcNode();
deleteOverlayNeighborArrow(*itn);
}
}
//Check if member is already part of cluster
/* Check if peer info already exists */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(lhbMsg->getMembers(i));
}
else { /* Create PeerInfo object */
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(lhbMsg->getMembers(i), pi));
}
}
if (!leaderChanged)
if (lhbMsg->getSupercluster_membersArraySize() > 0) {
for (TaSet::iterator itn = clusters[lhbMsg->getLayer() + 1].begin(); itn != clusters[lhbMsg->getLayer() + 1].end(); ++itn) {
deleteOverlayNeighborArrow(*itn);
}
/* Check if peer info already exists */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(lhbMsg->getSupercluster_members(i));
}
else { /* Create PeerInfo object */
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(lhbMsg->getSupercluster_members(i), pi));
}
}
it = peerInfos.find(lhbMsg->getSrcNode());
if (it != peerInfos.end()) {
}
}
else {
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(lhbMsg->getSrcNode(), pi));
}
}
if (debug_heartbeats)
EV << simTime() << " : " << thisNode.getIp() << " : handleNiceLeaderHeartbeat() finished. " << endl;
delete lhbMsg;
}
|
private |
|
private |
Definition at line 1117 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_heartbeats)
EV << simTime() << " : " << thisNode.getIp() << " : NICE_LEADERTRANSFER from " << transferMsg->getSrcNode() << " for " << transferMsg->getLayer() << endl;
/* React only if I am not already leader */
if (debug_heartbeats)
EV << "I am not already leader of this cluster layer." << endl;
for (TaSet::iterator itn = clusters[transferMsg->getLayer()].begin(); itn != clusters[transferMsg->getLayer()].end(); ++itn) {
deleteOverlayNeighborArrow(*itn);
}
if (debug_heartbeats)
EV << "Adding: " << transferMsg->getMembers(i) << endl;
showOverlayNeighborArrow(transferMsg->getMembers(i), false, clusterarrows[transferMsg->getLayer()]);
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(transferMsg->getMembers(i));
if (it != peerInfos.end()) {
/* We already know this node */
it->second->touch();
}
else {
//We don't know him yet
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(transferMsg->getMembers(i), pi));
}
}
if (transferMsg->getSupercluster_membersArraySize() > 0) {
for (TaSet::iterator itn = clusters[transferMsg->getLayer() + 1].begin(); itn != clusters[transferMsg->getLayer() + 1].end(); ++itn) {
deleteOverlayNeighborArrow(*itn);
}
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(transferMsg->getSupercluster_members(i));
if (it != peerInfos.end()) {
/* We already know this node */
it->second->touch();
}
else {
//We don't know him yet
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(transferMsg->getSupercluster_members(i), pi));
}
}
// experimental
showOverlayNeighborArrow(transferMsg->getSupercluster_members(i), false, clusterarrows[transferMsg->getLayer()+1]);
}
}
else {
}
}
}
else {
BasicJoinLayer(transferMsg->getLayer() + 1);
}
}
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 1, clustercolors[i]);
}
}
else {
if (debug_heartbeats)
EV << "Adding: " << transferMsg->getMembers(i) << endl;
showOverlayNeighborArrow(transferMsg->getMembers(i), false, clusterarrows[transferMsg->getLayer()]);
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(transferMsg->getMembers(i));
if (it == peerInfos.end()) {
//We don't know him yet
pi->set_last_HB_arrival(simTime().dbl());
peerInfos.insert(std::make_pair(transferMsg->getMembers(i), pi));
}
}
}
}
if (pimp)
if (debug_heartbeats)
delete transferMsg;
}
|
private |
Definition at line 1385 of file Nice.cc.
Referenced by handleUDPMessage().
{
/* If it is mine, count */
}
else {
hopCount++;
if (hopCount < 8) {
forOverlay->setHopCount(hopCount);
sendDataToOverlay(forOverlay);
send(multicastMsg->decapsulate(), "appOut");
}
}
delete multicastMsg;
}
|
private |
Definition at line 1416 of file Nice.cc.
Referenced by handleUDPMessage().
{
// Add node to tempPeers
tempPeers.insert(std::make_pair(msg->getSrcNode(), simTime()));
delete msg;
}
|
private |
Definition at line 1424 of file Nice.cc.
Referenced by handleUDPMessage().
{
// Remove node from tempPeers
tempPeers.erase(msg->getSrcNode());
deleteOverlayNeighborArrow(msg->getSrcNode());
delete msg;
}
|
private |
Definition at line 1433 of file Nice.cc.
Referenced by handleUDPMessage().
{
// Only answer if I am part of requested layer
probe->setSrcNode(thisNode);
probe->setCommand(NICE_PING_PROBE_RESPONSE);
probe->setBitLength(NICEMESSAGE_L(probe));
sendMessageToUDP(msg->getSrcNode(), probe);
}
else {
//Do nothing
}
delete msg;
}
|
private |
Definition at line 1457 of file Nice.cc.
Referenced by handleUDPMessage().
{
//Only react if still in same cluster as when asked
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(msg->getSrcNode());
if (it != peerInfos.end()) {
double distance = simTime().dbl() - it->second->getDES();
it->second->set_distance(distance);
it->second->touch();
}
}
delete msg;
}
|
private |
Definition at line 1478 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (isRendevouzPoint) {
response->setSrcNode(thisNode);
response->setCommand(NICE_POLL_RP_RESPONSE);
response->setLayer(getHighestLeaderLayer());
response->setBitLength(NICEMESSAGE_L(response));
sendMessageToUDP(msg->getSrcNode(), response);
}
delete msg;
}
|
private |
Definition at line 1494 of file Nice.cc.
Referenced by handleUDPMessage().
|
private |
Definition at line 623 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_queries)
short layer = queryMsg->getLayer();
if (layer >= maxLayers) {
if (debug_queries)
delete queryMsg;
return;
}
if (debug_queries)
EV << " layer before: " << layer << endl;
if (layer > getHighestLeaderLayer()) {
if (isRendevouzPoint) {
if (debug_queries)
}
}
else {
if (debug_queries)
delete queryMsg;
return;
}
}
if (layer < 0) {
if (isRendevouzPoint) {
/* If layer is < 0, response with highest layer I am leader of */
if (debug_queries)
EV << " I am RP." << endl;
layer = getHighestLeaderLayer();
}
else {
if (debug_queries)
EV << " I am not RP. Return." << endl;
if (pimp) {
/* forward to Rendevouz Point */
sendMessageToUDP(RendevouzPoint, dup);
}
delete queryMsg;
return;
}
}
if (debug_queries)
EV << " layer after: " << layer << endl;
if (!clusters[layer].getLeader().isUnspecified()) {
if (pimp) {
sendMessageToUDP(clusters[layer].getLeader(), dup);
}
if (debug_queries)
EV << " I am not leader of this cluster. return." << endl;
delete queryMsg;
return;
}
}
else {
delete queryMsg;
return;
}
response->setSrcNode(thisNode);
response->setCommand(NICE_QUERY_RESPONSE);
response->setLayer(layer);
/* Fill in current cluster members except me */
response->setMembersArraySize(clusters[layer].getSize()-1);
int j=0;
if (debug_queries)
j++;
}
}
response->setBitLength(NICEMEMBERMESSAGE_L(response));
sendMessageToUDP(queryMsg->getSrcNode(), response);
if (debug_queries)
EV << " Sent response to: " << queryMsg->getSrcNode() << endl;
if (debug_queries)
delete queryMsg;
} // handleNiceQuery
|
private |
Definition at line 1506 of file Nice.cc.
Referenced by handleUDPMessage().
{
cancelEvent(queryTimer);
short layer = queryRspMsg->getLayer();
/* Check layer response */
if (layer == targetLayer) {
/* Use member information for own cluster update */
}
/* Initiate joining of lowest layer */
JoinCluster(queryRspMsg->getSrcNode(), layer);
}
else {
/* Evaluate RTT to queried node */
query_start = simTime() - query_start;
/* Find out who is nearest cluster member in response, if nodes are given */
if (queryRspMsg->getMembersArraySize() > 0) {
joineval->setSrcNode(thisNode);
joineval->setCommand(NICE_JOINEVAL);
joineval->setLayer(layer);
joineval->setBitLength(NICEMESSAGE_L(joineval));
/* Initiate evaluation with all cluster members */
sendMessageToUDP(queryRspMsg->getMembers(i), dup);
}
delete joineval;
}
else { // Directly query same node again for lower layer
}
evalLayer = layer;
query_compare = simTime();
}
delete queryRspMsg;
} // handleNiceQueryResponse
|
private |
Definition at line 1572 of file Nice.cc.
Referenced by handleUDPMessage().
{
if (debug_removes)
if (debug_removes)
delete msg;
return;
}
short layer = msg->getLayer();
if (pimp) {
if (!clusters[layer].getLeader().isUnspecified()) {
if (clusters[layer].getLeader() != thisNode && (clusters[layer].getLeader() != msg->getSrcNode())) {
sendMessageToUDP(clusters[layer].getLeader(), dup);
delete msg;
return;
}
}
}
if (debug_removes)
EV << simTime() << " : " << thisNode.getIp() << " : removing " << msg->getSrcNode() << " from layer " << layer << endl;
// check prevents visualization arrows to be deleted by error
deleteOverlayNeighborArrow(msg->getSrcNode());
}
}
}
if (debug_removes)
delete msg;
}
|
protectedvirtual |
This method gets call **.gracefulLeaveDelay seconds before it is killed.
Reimplemented from BaseOverlay.
Definition at line 236 of file Nice.cc.
{
if (isRendevouzPoint) {
opp_error("The NICE Rendevouz Point is being churned out and the simulation cannot continue. "
"Please, check your config and make sure that the Chrun Generator's configuration is correct. "
"Specifically, the Rendevouz Point must not get churned out during the simulation.");
}
}
|
virtual |
Reimplemented from BaseRpc.
Definition at line 320 of file Nice.cc.
{
if (msg->isName("visualizationTimer")) {
scheduleAt(simTime() + 1, visualizationTimer);
}
else if (msg->isName("heartbeatTimer")) {
scheduleAt(simTime() + heartbeatInterval, heartbeatTimer);
}
else if (msg->isName("maintenanceTimer")) {
maintenance();
cancelEvent(maintenanceTimer);
scheduleAt(simTime() + maintenanceInterval, maintenanceTimer);
}
else if (msg->isName("queryTimer")) {
(tempResolver == RendevouzPoint ||
}
else {
}
}
else if (msg->isName("rpPollTimer")) {
pollRP(-1);
}
} // handleTimerEvent
|
virtual |
Processes messages from underlay.
- Parameters
-
msg Message from UDP
Reimplemented from BaseOverlay.
Definition at line 368 of file Nice.cc.
{
// try message cast to NICE base message
if (dynamic_cast<NiceMessage*>(msg) != NULL) {
NiceMessage* niceMsg = check_and_cast<NiceMessage*>(msg);
// First of all, update activity information for sourcenode
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(niceMsg->getSrcNode());
if (it != peerInfos.end()) {
it->second->touch();
}
/* Dispatch message, possibly downcasting to a more concrete type */
switch (niceMsg->getCommand()) {
/* More concrete types, to which the message is cast if needed */
NiceMemberMessage* queryRspMsg;
NiceClusterMerge* mergeMsg;
NiceMulticastMessage* multicastMsg;
case NICE_QUERY:
handleNiceQuery(niceMsg);
break;
case NICE_QUERY_RESPONSE:
queryRspMsg = check_and_cast<NiceMemberMessage*>(niceMsg);
handleNiceQueryResponse(queryRspMsg);
break;
case NICE_JOIN_CLUSTER:
handleNiceJoinCluster(niceMsg);
break;
case NICE_POLL_RP:
handleNicePollRp(niceMsg);
break;
case NICE_POLL_RP_RESPONSE:
handleNicePollRpResponse(niceMsg);
break;
case NICE_HEARTBEAT:
handleNiceHeartbeat(check_and_cast<NiceHeartbeat*>(niceMsg));
break;
case NICE_LEADERHEARTBEAT:
handleNiceLeaderHeartbeat(check_and_cast<NiceLeaderHeartbeat*>(niceMsg));
break;
case NICE_LEADERTRANSFER:
handleNiceLeaderTransfer(check_and_cast<NiceLeaderHeartbeat*>(niceMsg));
break;
case NICE_JOINEVAL:
handleNiceJoineval(niceMsg);
break;
case NICE_JOINEVAL_RESPONSE:
handleNiceJoinevalResponse(niceMsg);
break;
case NICE_REMOVE:
handleNiceRemove(niceMsg);
break;
case NICE_PEER_TEMPORARY:
handleNicePeerTemporary(niceMsg);
break;
handleNicePeerTemporaryRelease(niceMsg);
break;
case NICE_PING_PROBE:
handleNicePingProbe(niceMsg);
break;
case NICE_PING_PROBE_RESPONSE:
handleNicePingProbeResponse(niceMsg);
break;
case NICE_FORCE_MERGE:
handleNiceForceMerge(niceMsg);
break;
mergeMsg = check_and_cast<NiceClusterMerge*>(niceMsg);
handleNiceClusterMergeRequest(mergeMsg);
break;
case NICE_MULTICAST:
multicastMsg = check_and_cast<NiceMulticastMessage*>(msg);
handleNiceMulticast(multicastMsg);
break;
default:
delete niceMsg;
}
}
else {
delete msg;
}
} // handleUDPMessage
|
virtual |
Initializes derived-class-attributes.
Initializes derived-class-attributes, called by BaseOverlay::initialize(). By default this method is called once. If more stages are needed one can overload numInitStages() and add more stages.
- Parameters
-
stage the init stage
Reimplemented from BaseOverlay.
Definition at line 122 of file Nice.cc.
{
/* Because of IPAddressResolver, we need to wait until interfaces
* are registered, address auto-assignment takes place etc. */
if (stage != MIN_STAGE_OVERLAY)
return;
/* Set appearance of node in visualization */
getParentModule()->getParentModule()->getDisplayString().setTagArg("i", 0, "device/pc_vs");
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 0, "block/circle_vs");
/* Initially clear all clusters */
deleteOverlayNeighborArrow(*itn);
}
}
/* Initialize Self-Messages */
// Periodic Heartbeat Messages
heartbeatInterval = par("heartbeatInterval");
// Periodic Protocol Maintenance
maintenanceInterval = par("maintenanceInterval");
queryInterval = par("queryInterval");
rpPollTimerInterval = par("rpPollTimerInterval");
peerTimeoutHeartbeats = par("peerTimeoutHeartbeats");
pimp = par("enhancedMode");
isRendevouzPoint = false;
/* DEBUG */
clusterrefinement = par("debug_clusterrefinement");
debug_heartbeats = par("debug_heartbeats");
debug_visualization = par("debug_visualization");
debug_join = par("debug_join");
debug_peertimeouts = par("debug_peertimeouts");
debug_removes = par("debug_removes");
debug_queries = par("debug_queries");
/* Read cluster parameter k */
k = par("k");
CLUSTERLEADERBOUND = par("clusterLeaderBound");
CLUSTERLEADERCOMPAREDIST = par("clusterLeaderCompareDist");
SC_PROC_DISTANCE = par("scProcDistance");
SC_MIN_OFFSET = par("scMinOffset");
/* Add own node to peerInfos */
pi->set_distance(0);
/* Set evaluation layer to not specified */
evalLayer = -1;
joinLayer = -1;
// add some watches
WATCH(thisNode);
WATCH(evalLayer);
WATCH(query_start);
WATCH(heartbeatTimer);
WATCH_MAP(tempPeers);
WATCH(RendevouzPoint);
WATCH(isRendevouzPoint);
WATCH(numInconsistencies);
WATCH(numQueryTimeouts);
WATCH(numPeerTimeouts);
WATCH(numTempPeerTimeouts);
WATCH(numStructurePartitions);
WATCH(numOwnMessagesReceived);
WATCH(totalSCMinCompare);
WATCH(numJoins);
WATCH(totalForwardBytes);
WATCH(numReceived);
WATCH(totalReceivedBytes);
WATCH(numHeartbeat);
WATCH(totalHeartbeatBytes);
} // initializeOverlay
|
private |
Definition at line 1670 of file Nice.cc.
Referenced by handleNiceLeaderTransfer(), handleNiceQueryResponse(), and maintenance().
{
if (debug_join)
msg->setSrcNode(thisNode);
msg->setCommand(NICE_JOIN_CLUSTER);
msg->setLayer(layer);
msg->setBitLength(NICEMESSAGE_L(msg));
sendMessageToUDP(leader, msg);
/* Create peer context to leader */
/* Check if peer info already exists */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(leader);
}
else { /* Create PeerInfo object */
peerInfos.insert(std::make_pair(leader, pi));
}
/* Locally add thisNode, too */
/* Set leader for cluster */
if (clusters[i].getSize() > 0) {
getParentModule()->getParentModule()->getDisplayString().setTagArg
("i2", 1, clustercolors[i]);
}
}
}
// If not already running, schedule some timers
if (!heartbeatTimer->isScheduled()) {
scheduleAt(simTime() + heartbeatInterval, heartbeatTimer);
}
if (!maintenanceTimer->isScheduled()) {
scheduleAt(simTime() + heartbeatInterval, maintenanceTimer);
}
if (isTempPeered) {
// Release temporary peering
msg->setSrcNode(thisNode);
msg->setLayer(-1);
msg->setBitLength(NICEMESSAGE_L(msg));
sendMessageToUDP(RendevouzPoint, msg);
isTempPeered = false;
}
if (debug_join)
} // JoinCluster
|
protectedvirtual |
Join the overlay with a given nodeID in thisNode.key.
Join the overlay with a given nodeID in thisNode.key. This method may be called by an application to join the overlay with a specific nodeID. It is also called if the node's IP address changes.
Reimplemented from BaseOverlay.
|
private |
Definition at line 3135 of file Nice.cc.
Referenced by ClusterSplit(), gracefulLeave(), handleNiceLeaderHeartbeat(), LeaderTransfer(), and maintenance().
{
msg->setSrcNode(thisNode);
msg->setCommand(NICE_LEADERTRANSFER);
msg->setLayer(layer);
msg->setMembersArraySize(cluster.size());
// fill in members
TaSet::iterator it = cluster.begin();
int i = 0;
while (it != cluster.end()) {
msg->setMembers(i++, *it);
it++;
}
// fill in supercluster members, if existent
msg->setSupercluster_leader(sc_leader);
msg->setSupercluster_membersArraySize(superCluster.size());
it = superCluster.begin();
i = 0;
while (it != superCluster.end()) {
msg->setSupercluster_members(i++, *it);
++it;
}
msg->setBitLength(NICELEADERHEARTBEAT_L(msg));
sendMessageToUDP(leader, msg);
} // LeaderTransfer
|
private |
Definition at line 3171 of file Nice.cc.
{
ASSERT(clusters[layer].contains(leader));
if (isRendevouzPoint) {
opp_error("The RendevouzPoint is handing off leadership and the simulation cannot continue. This is a bug in the Nice implementation in OverSim, please check the backtrace and fix it or submit a bug report.");
}
if (layer == maxLayers - 1)
else
LeaderTransfer(layer, leader, cluster, clusters[layer + 1].getLeader(), TaSet(clusters[layer + 1].begin(), clusters[layer+1].end()));
}
|
private |
Definition at line 2352 of file Nice.cc.
Referenced by handleTimerEvent().
{
// care for structure connection timer
EV << "No RendevouzPoint! " << endl;
}
int highestLayer = getHighestLayer();
bool leaderDied = false;
clusters[highestLayer].isLeaderConfirmed();
TransportAddress newLeader;
cleanPeers();
// Cluster Leader died. Select new. If the old leader is unspecified, then we're
// probably waiting to join the layer.
leaderDied = true;
newLeader = findCenter(clusters[highestLayer]).first;
}
splitNeeded();
mergeNeeded();
if (leaderDied && RendevouzPoint != oldLeader) {
if (newLeader == thisNode) {
BasicJoinLayer(highestLayer + 1);
}
else {
LeaderTransfer(highestLayer, newLeader);
}
}
if (!isRendevouzPoint) {
pollRP(-1);
BasicJoinLayer(getHighestLayer() + 1);
}
}
highestLayer = getHighestLayer();
if (clusters[i].getSize() != 0) {
EV << "Stale data for cluster " << i << endl;
deleteOverlayNeighborArrow(*itn);
}
}
}
// if highest super cluster has more than one member, try to find a closer leader.
// However, the Rendevouz Point must can't move between clusters.
if (!isRendevouzPoint && highestLayer < maxLayers - 1 && clusters[highestLayer + 1].getSize() > 1) {
if (clusterrefinement)
EV << simTime() << " : " << thisNode.getIp() << " : Look for better parent node in cluster : " << highestLayer + 1 << " ..."<< endl;
std::map<TransportAddress, NicePeerInfo*>::iterator it;
if (!highestLeader.isUnspecified()) {
it = peerInfos.find(highestLeader);
}
else {
it = peerInfos.end();
}
if (it != peerInfos.end() && it->second->get_distance() > 0) {
double distance = it->second->get_distance() - ((it->second->get_distance()/100.0) * SC_PROC_DISTANCE);
double smallest = 10000.0;
TransportAddress candidate = TransportAddress::UNSPECIFIED_NODE;
std::map<TransportAddress, NicePeerInfo*>::iterator it2 = peerInfos.find(clusters[highestLayer+1].get(i));
if (it2 != peerInfos.end()) {
if ((it2->second->get_distance() < smallest) && (it2->second->get_distance() > 0)) {
smallest = it2->second->get_distance();
candidate = it2->first;
}
}
}
}
std::set<TransportAddress> clusterset;
}
simtime_t meanDistance = getMeanDistance(clusterset);
simtime_t minCompare = (meanDistance/100.0)*SC_MIN_OFFSET;
RECORD_STATS(totalSCMinCompare += minCompare.dbl());
if (minCompare < 0.005)
minCompare = 0.005;
if ((smallest < distance) && ((distance - smallest) > minCompare.dbl())) { // change supercluster
if (clusterrefinement) {
EV << simTime() <<" : " << thisNode.getIp() << ": Change SuperCluster! to " << candidate.getIp() << endl;
EV << "Old distance (): " << it->second->get_distance() << endl;
EV << "SC_PROC_DISTANCE: " << SC_PROC_DISTANCE << endl;
EV << "Compare distance: " << distance << endl;
EV << "New distance: " << smallest << endl;
EV << "New SC_MIN_OFFSET: " << SC_MIN_OFFSET << endl;
}
// leave old
Remove(highestLayer);
// join new
JoinCluster(candidate, highestLayer);
return;
}
}
else {
//Do nothing
}
}
if (!isRendevouzPoint) {
// Try to find better leader.
bool allDistancesKnown = true;
if (clusterrefinement)
EV << simTime() << " : " << thisNode.getIp() << " : Find better cluster leader in ..." << i << endl;
/* Only make decisions if node has total distance knowledge in this cluster */
/* Check if peer info already exists */
if (it != peerInfos.end()) {
simtime_t distance = it->second->get_distance();
//EV << "My distance to " << it->first << " : " << distance << endl;
if (distance < 0) {
allDistancesKnown = false;
continue;
}
allDistancesKnown = false;
break;
}
}
}
}
else {
allDistancesKnown = false;
}
}
if (allDistancesKnown) {
if (clusterrefinement)
EV << "Complete distance knowledge available." << endl;
// Perform check for better cluster leader
if (clusterrefinement)
std::set<TransportAddress> clusterset;
clusterset.insert(clusters[i].get(m));
}
simtime_t meanDistance = getMeanDistance(clusterset);
simtime_t oldDistance = getMaxDistance(clusters[i].getLeader(), clusterset);
simtime_t newDistance = getMaxDistance(new_leader, clusterset);
simtime_t compareDistance = (oldDistance - ((oldDistance/100.0)*CLUSTERLEADERCOMPAREDIST));
simtime_t minCompare = (meanDistance/100.0)*CLUSTERLEADERBOUND;
if (minCompare < 0.005)
minCompare = 0.005;
if ((newDistance.dbl() < compareDistance.dbl()) && ((compareDistance.dbl() - newDistance.dbl()) > minCompare.dbl())) {
if (clusterrefinement)
EV << "CHANGE " << CLUSTERLEADERCOMPAREDIST << endl;
if (new_leader != thisNode) {
// Set new leader for this cluster
}
gracefulLeave(i);
LeaderTransfer(i, new_leader);
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 0, "block/circle_vs");
}
}
if (clusterrefinement) {
EV << "MaxDistance " << new_leader.getIp() << " : " << getMaxDistance(new_leader, clusterset) << endl;
EV << "MaxDistance " << clusters[i].getLeader() << " : " << getMaxDistance(clusters[i].getLeader(), clusterset) << endl;
}
}
} // if cluster i has other members
} // for i from highest leader layer to 0
} // if this is not the rendevouz point
} // maintenance
|
private |
Merges clusters if needed.
mergeNeeded
Returns true if a merge was made, false otherwise.
Definition at line 2229 of file Nice.cc.
Referenced by maintenance().
{
if (isRendevouzPoint) {
// The Rendevouz Point can't initiate a merge, since that would
// compromise its status as a Rendevouz Point.
return false;
}
// The layer at which we must merge
int mergeLayer;
int highestLeaderLayer = getHighestLeaderLayer();
// Find lowest layer that needs merging.
// The node will disappear from all higher layers.
for (mergeLayer= 0; mergeLayer <= highestLeaderLayer && mergeLayer < maxLayers - 1; ++mergeLayer) {
/* Do not attempt merging if we're not sure we belong as leader */
clusters[mergeLayer + 1].isLeaderConfirmed()) {
ClusterMerge(mergeLayer);
// The merge may fail, check if it did.
// If it really did, we should try to see if there's some other layer that we may merge.
return true;
}
}
}
return false;
}
|
private |
Definition at line 3467 of file Nice.cc.
Referenced by changeState(), handleTimerEvent(), and maintenance().
{
if (debug_queries)
msg->setSrcNode(thisNode);
msg->setCommand(NICE_POLL_RP);
msg->setLayer(layer);
msg->setBitLength(NICEMESSAGE_L(msg));
cancelEvent(rpPollTimer);
scheduleAt(simTime() + rpPollTimerInterval, rpPollTimer);
sendMessageToUDP(RendevouzPoint, msg);
if (debug_queries)
} // pollRP
|
private |
Definition at line 594 of file Nice.cc.
Referenced by BasicJoinLayer(), handleNiceJoinevalResponse(), handleNiceQueryResponse(), and handleTimerEvent().
{
if (debug_queries)
msg->setSrcNode(thisNode);
msg->setCommand(NICE_QUERY);
msg->setLayer(layer);
msg->setBitLength(NICEMESSAGE_L(msg));
query_start = simTime();
tempResolver = destination;
cancelEvent(queryTimer);
scheduleAt(simTime() + queryInterval, queryTimer);
joinLayer = layer;
sendMessageToUDP(destination, msg);
if (debug_queries)
} // Query
|
private |
Definition at line 3190 of file Nice.cc.
Referenced by gracefulLeave(), and maintenance().
{
if (debug_removes)
int highestLayer = getHighestLayer();
ASSERT(layer <= highestLayer);
msg->setSrcNode(thisNode);
msg->setCommand(NICE_REMOVE);
msg->setLayer(layer);
msg->setBitLength(NICEMESSAGE_L(msg));
sendMessageToUDP(clusters[layer].getLeader(), msg);
if (clusters[i].getSize() > 0) {
getParentModule()->getParentModule()->getDisplayString().setTagArg
("i2", 1, clustercolors[i]);
}
}
}
if (debug_removes)
} // Remove
|
private |
Definition at line 3365 of file Nice.cc.
Referenced by handleAppMessage(), and handleNiceMulticast().
{
if ( appMsg->getLayer() != layer ) {
if (!(member == thisNode)) {
dup->setLayer( layer );
dup->setLastHop(thisNode);
sendMessageToUDP(member, dup);
}
}
} // for
}
}
// Also forward data to temporary peers
std::map<TransportAddress, simtime_t>::iterator it = tempPeers.begin();
while (it != tempPeers.end()) {
dup->setSrcNode(thisNode);
sendMessageToUDP(it->first, dup);
it++;
}
delete appMsg;
} // sendDataToOverlay
|
private |
Definition at line 1757 of file Nice.cc.
Referenced by ClusterSplit(), handleNiceClusterMergeRequest(), handleNiceLeaderTransfer(), and handleTimerEvent().
{
/* Go through all cluster layers from top to bottom */
/* Determine if node is cluster leader in this layer */
if (!clusters[i].getLeader().isUnspecified()) {
clusters[i].confirmLeader();
/* Build heartbeat message with info on all current members */
msg->setSrcNode(thisNode);
msg->setCommand(NICE_LEADERHEARTBEAT);
msg->setLayer(i);
msg->setOne_hop_distance(simTime().dbl());
msg->setSc_tolerance(SC_PROC_DISTANCE);
msg->setMembersArraySize(clusters[i].getSize());
/* Fill in members */
}
/* Fill in distances to members */
msg->setDistancesArraySize(clusters[i].getSize());
if (it != peerInfos.end()) {
msg->setDistances(j, it->second->get_distance());
}
else {
msg->setDistances(j, -1);
}
}
/* Fill in Supercluster members, if existent */
if (clusters[i+1].getSize() > 0) {
msg->setSupercluster_leader(clusters[i+1].getLeader());
msg->setSupercluster_membersArraySize(clusters[i+1].getSize());
}
}
/* Send Heartbeat to all members in cluster, except me */
/* Get corresponding sequence numbers out of peerInfo */
if (it != peerInfos.end()) {
unsigned int seqNo = it->second->get_last_sent_HB();
copy->setSeqNo(++seqNo);
it->second->set_backHB(it->second->get_backHBPointer(), seqNo, simTime().dbl());
it->second->set_last_sent_HB(seqNo);
it->second->set_backHBPointer(!it->second->get_backHBPointer());
copy->setSeqRspNo(it->second->get_last_recv_HB());
if (it->second->get_last_HB_arrival() > 0) {
copy->setHb_delay(simTime().dbl() - it->second->get_last_HB_arrival());
}
else {
copy->setHb_delay(0.0);
}
}
copy->setBitLength(NICELEADERHEARTBEAT_L(msg));
}
}
delete msg;
}
else { // I am normal cluster member
/* Build heartbeat message with info on all current members */
msg->setSrcNode(thisNode);
msg->setCommand(NICE_HEARTBEAT);
msg->setLayer(i);
msg->setOne_hop_distance(simTime().dbl());
msg->setSublayermembers(0);
if (i>0) {
msg->setSublayermembers(clusters[i-1].getSize());
}
msg->setMembersArraySize(clusters[i].getSize());
/* Fill in members */
}
/* Fill in distances to members */
msg->setDistancesArraySize(clusters[i].getSize());
if (it != peerInfos.end()) {
msg->setDistances(j, it->second->get_distance());
}
else {
msg->setDistances(j, -1);
}
}
/* Send Heartbeat to all members in cluster, except me */
/* Get corresponding sequence number out of peerInfo */
if (it != peerInfos.end()) {
unsigned int seqNo = it->second->get_last_sent_HB();
copy->setSeqNo(++seqNo);
it->second->set_backHB(it->second->get_backHBPointer(), seqNo, simTime().dbl());
it->second->set_backHBPointer(!it->second->get_backHBPointer());
it->second->set_last_sent_HB(seqNo);
copy->setSeqRspNo(it->second->get_last_recv_HB());
copy->setHb_delay(simTime().dbl() - it->second->get_last_HB_arrival());
}
copy->setBitLength(NICEHEARTBEAT_L(msg));
}
}
delete msg;
}
}
}
// Additionally, ping all supercluster members, if existent
if (clusters[getHighestLayer()+1].getSize() > 0 && !clusters[getHighestLayer()].getLeader().isUnspecified()) {
msg->setSrcNode(thisNode);
msg->setCommand(NICE_PING_PROBE);
msg->setLayer(getHighestLayer()+1);
msg->setBitLength(NICEMESSAGE_L(msg));
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(clusters[getHighestLayer()+1].get(i));
if (it != peerInfos.end()) {
it->second->set_distance_estimation_start(simTime().dbl());
}
}
}
delete msg;
}
} // sendHeartbeats
|
private |
Definition at line 1999 of file Nice.cc.
Referenced by handleNiceJoinCluster().
{
/* Build heartbeat message with info on all current members */
msg->setSrcNode(thisNode);
msg->setCommand(NICE_LEADERHEARTBEAT);
msg->setLayer(layer);
msg->setMembersArraySize(clusters[layer].getSize());
/* Fill in members */
}
/* Fill in distances to members */
msg->setDistancesArraySize(clusters[layer].getSize());
if (it != peerInfos.end()) {
msg->setDistances(j, it->second->get_distance());
}
else {
msg->setDistances(j, -1);
}
}
/* Fill in Supercluster members, if existent */
if (clusters[layer+1].getSize() > 0) {
msg->setSupercluster_leader(clusters[layer+1].getLeader());
msg->setSupercluster_membersArraySize(clusters[layer+1].getSize());
}
}
/* Get corresponding sequence numbers out of peerInfo */
std::map<TransportAddress, NicePeerInfo*>::iterator it = peerInfos.find(node);
if (it != peerInfos.end()) {
unsigned int seqNo = it->second->get_last_sent_HB();
msg->setSeqNo(++seqNo);
it->second->set_backHB(it->second->get_backHBPointer(), seqNo, simTime().dbl());
it->second->set_last_sent_HB(seqNo);
it->second->set_backHBPointer(!it->second->get_backHBPointer());
msg->setSeqRspNo(it->second->get_last_recv_HB());
msg->setHb_delay(simTime().dbl() - it->second->get_last_HB_arrival());
}
msg->setBitLength(NICELEADERHEARTBEAT_L(msg));
sendMessageToUDP(node, msg);
}
else {
// build heartbeat message with info on all current members
msg->setSrcNode(thisNode);
msg->setCommand(NICE_HEARTBEAT);
msg->setLayer(layer);
msg->setMembersArraySize(clusters[layer].getSize());
// fill in members
}
// fill in distances to members
msg->setDistancesArraySize(clusters[layer].getSize());
if (it != peerInfos.end()) {
msg->setDistances(j, it->second->get_distance());
}
msg->setDistances(j, 0);
}
else {
msg->setDistances(j, -1);
}
}
msg->setBitLength(NICEHEARTBEAT_L(msg));
RECORD_STATS(++numHeartbeat; totalHeartbeatBytes += msg->getByteLength());
sendMessageToUDP(node, msg);
}
} // sendHeartbeatTo
|
private |
sendRemoveTo
Definition at line 2135 of file Nice.cc.
Referenced by handleNiceLeaderHeartbeat().
{
msg->setSrcNode(thisNode);
msg->setCommand(NICE_REMOVE);
msg->setLayer(layer);
msg->setBitLength(NICEMESSAGE_L(msg));
sendMessageToUDP(node, msg);
} // sendRemoveTo
|
private |
Splits clusters if needed.
splitNeeded
Returns true if a split was made, false otherwise.
Definition at line 2208 of file Nice.cc.
Referenced by maintenance().
{
bool splitMade = false;
// Check if cluster split is necessary
// Find lowest layer that needs splitting and split it. If we're still cluster leader, continue up.
++i) {
clusters[i].isLeaderConfirmed() &&
splitMade = true;
ClusterSplit(i);
}
}
return splitMade;
} // splitNeeded
|
private |
Definition at line 3420 of file Nice.cc.
Referenced by ClusterSplit(), handleNiceRemove(), and handleTimerEvent().
{
if (debug_visualization)
/* Update node symbol */
getParentModule()->getParentModule()
->getDisplayString().setTagArg("i2", 0, "block/circle_vs");
if (isRendevouzPoint) {
getParentModule()->getParentModule()->getDisplayString().setTagArg("i2", 0, "block/star_vs");
}
/* Update node color */
if (debug_visualization)
EV << "getHighestLayer(): " << getHighestLayer() << endl;
getParentModule()->getParentModule()
//redraw
if (!(clusters[i].getLeader().isUnspecified())) {
if (debug_visualization)
}
}
}
}
} // updateVisualization
Friends And Related Function Documentation
|
friend |
Definition at line 65 of file Nice.h.
Referenced by handleNiceClusterMergeRequest(), handleNiceJoinCluster(), handleNiceLeaderHeartbeat(), handleNiceLeaderTransfer(), initializeOverlay(), and JoinCluster().
Member Data Documentation
|
private |
Definition at line 186 of file Nice.h.
Referenced by initializeOverlay(), and maintenance().
|
private |
Definition at line 187 of file Nice.h.
Referenced by initializeOverlay(), and maintenance().
|
private |
Definition at line 146 of file Nice.h.
Referenced by initializeOverlay(), and maintenance().
|
private |
Definition at line 158 of file Nice.h.
Referenced by changeState(), cleanPeers(), ClusterMerge(), ClusterMergeRequest(), ClusterSplit(), getHighestLayer(), getHighestLeaderLayer(), gracefulLeave(), handleNiceClusterMergeRequest(), handleNiceJoinCluster(), handleNiceLeaderHeartbeat(), handleNiceLeaderTransfer(), handleNicePingProbe(), handleNiceQuery(), handleNiceQueryResponse(), handleNiceRemove(), initializeOverlay(), JoinCluster(), LeaderTransfer(), maintenance(), mergeNeeded(), Remove(), sendDataToOverlay(), sendHeartbeats(), sendHeartbeatTo(), splitNeeded(), and updateVisualization().
|
private |
Definition at line 147 of file Nice.h.
Referenced by checkLeaderHeartbeatsForCollisions(), handleNiceHeartbeat(), handleNiceLeaderHeartbeat(), handleNiceLeaderTransfer(), and initializeOverlay().
|
private |
Definition at line 149 of file Nice.h.
Referenced by finishOverlay(), handleNiceJoinCluster(), initializeOverlay(), and JoinCluster().
|
private |
Definition at line 150 of file Nice.h.
Referenced by cleanPeers(), and initializeOverlay().
|
private |
Definition at line 152 of file Nice.h.
Referenced by handleNiceQuery(), initializeOverlay(), pollRP(), and Query().
|
private |
Definition at line 151 of file Nice.h.
Referenced by handleNiceRemove(), initializeOverlay(), and Remove().
|
private |
Definition at line 148 of file Nice.h.
Referenced by initializeOverlay(), and updateVisualization().
|
private |
Definition at line 161 of file Nice.h.
Referenced by handleNiceJoinevalResponse(), handleNiceQueryResponse(), and initializeOverlay().
|
private |
Definition at line 139 of file Nice.h.
Referenced by initializeOverlay().
|
private |
Definition at line 116 of file Nice.h.
Referenced by changeState(), checkLeaderHeartbeatsForCollisions(), cleanPeers(), handleTimerEvent(), initializeOverlay(), and JoinCluster().
|
private |
Definition at line 115 of file Nice.h.
Referenced by changeState(), handleTimerEvent(), initializeOverlay(), JoinCluster(), and ~Nice().
|
private |
Definition at line 110 of file Nice.h.
Referenced by changeState(), ClusterSplit(), finishOverlay(), gracefulLeave(), handleNiceLeaderTransfer(), handleNicePollRp(), handleNiceQuery(), handleNodeLeaveNotification(), initializeOverlay(), LeaderTransfer(), maintenance(), mergeNeeded(), and updateVisualization().
|
private |
Definition at line 184 of file Nice.h.
Referenced by BasicJoinLayer(), and JoinCluster().
|
private |
Definition at line 162 of file Nice.h.
Referenced by handleTimerEvent(), initializeOverlay(), and Query().
|
private |
Definition at line 155 of file Nice.h.
Referenced by handleNiceLeaderHeartbeat(), initializeOverlay(), maintenance(), mergeNeeded(), sendHeartbeats(), and splitNeeded().
|
private |
Definition at line 143 of file Nice.h.
Referenced by checkLeaderHeartbeatsForCollisions().
|
private |
Definition at line 120 of file Nice.h.
Referenced by changeState(), handleTimerEvent(), and initializeOverlay().
|
private |
Definition at line 119 of file Nice.h.
Referenced by changeState(), handleTimerEvent(), initializeOverlay(), JoinCluster(), and ~Nice().
|
staticprivate |
Definition at line 63 of file Nice.h.
Referenced by cleanPeers(), ClusterMerge(), ClusterSplit(), getHighestLayer(), handleNiceClusterMergeRequest(), handleNiceLeaderHeartbeat(), handleNiceLeaderTransfer(), handleNiceQuery(), initializeOverlay(), JoinCluster(), LeaderTransfer(), maintenance(), mergeNeeded(), Remove(), and splitNeeded().
|
private |
Definition at line 208 of file Nice.h.
Referenced by finishOverlay(), and handleNiceMulticast().
|
private |
Definition at line 216 of file Nice.h.
Referenced by finishOverlay(), initializeOverlay(), sendHeartbeats(), and sendHeartbeatTo().
|
private |
Definition at line 192 of file Nice.h.
Referenced by finishOverlay(), handleTimerEvent(), initializeOverlay(), and maintenance().
|
private |
Definition at line 206 of file Nice.h.
Referenced by finishOverlay(), handleNiceJoinCluster(), and initializeOverlay().
|
private |
Definition at line 202 of file Nice.h.
Referenced by finishOverlay(), handleNiceMulticast(), and initializeOverlay().
|
private |
Definition at line 196 of file Nice.h.
Referenced by cleanPeers(), finishOverlay(), and initializeOverlay().
|
private |
Definition at line 194 of file Nice.h.
Referenced by finishOverlay(), handleTimerEvent(), and initializeOverlay().
|
private |
Definition at line 212 of file Nice.h.
Referenced by finishOverlay(), handleNiceMulticast(), and initializeOverlay().
|
private |
Definition at line 200 of file Nice.h.
Referenced by finishOverlay(), initializeOverlay(), and maintenance().
|
private |
Definition at line 198 of file Nice.h.
Referenced by cleanPeers(), finishOverlay(), and initializeOverlay().
|
private |
Definition at line 180 of file Nice.h.
Referenced by cleanPeers(), ClusterMerge(), ClusterSplit(), getMaxDistance(), getMeanDistance(), handleNiceClusterMergeRequest(), handleNiceHeartbeat(), handleNiceJoinCluster(), handleNiceLeaderHeartbeat(), handleNiceLeaderTransfer(), handleNicePingProbeResponse(), handleUDPMessage(), initializeOverlay(), JoinCluster(), maintenance(), sendHeartbeats(), sendHeartbeatTo(), and ~Nice().
|
private |
Definition at line 130 of file Nice.h.
Referenced by cleanPeers(), and initializeOverlay().
|
private |
Definition at line 106 of file Nice.h.
Referenced by ClusterSplit(), handleNiceClusterMergeRequest(), handleNiceJoinCluster(), handleNiceLeaderTransfer(), handleNiceQuery(), handleNiceRemove(), and initializeOverlay().
|
private |
Definition at line 165 of file Nice.h.
Referenced by handleNicePollRpResponse(), handleTimerEvent(), initializeOverlay(), and pollRP().
|
private |
Definition at line 174 of file Nice.h.
Referenced by handleNiceJoinevalResponse(), and handleNiceQueryResponse().
|
private |
Definition at line 168 of file Nice.h.
Referenced by handleNiceJoinevalResponse(), handleNiceQueryResponse(), initializeOverlay(), and Query().
|
private |
Definition at line 124 of file Nice.h.
Referenced by initializeOverlay(), and Query().
|
private |
Definition at line 123 of file Nice.h.
Referenced by handleNiceQueryResponse(), initializeOverlay(), Query(), and ~Nice().
|
private |
Definition at line 108 of file Nice.h.
Referenced by BasicJoinLayer(), changeState(), finishOverlay(), handleNiceLeaderTransfer(), handleNicePollRpResponse(), handleNiceQuery(), handleTimerEvent(), initializeOverlay(), JoinCluster(), maintenance(), and pollRP().
|
private |
Definition at line 127 of file Nice.h.
Referenced by handleNicePollRpResponse(), initializeOverlay(), pollRP(), and ~Nice().
|
private |
Definition at line 128 of file Nice.h.
Referenced by initializeOverlay(), and pollRP().
|
private |
Definition at line 189 of file Nice.h.
Referenced by initializeOverlay(), and maintenance().
|
private |
Definition at line 188 of file Nice.h.
Referenced by initializeOverlay(), maintenance(), and sendHeartbeats().
|
private |
Definition at line 141 of file Nice.h.
Referenced by initializeOverlay().
|
private |
Definition at line 177 of file Nice.h.
Referenced by BasicJoinLayer(), and handleNiceQueryResponse().
|
private |
Definition at line 183 of file Nice.h.
Referenced by cleanPeers(), handleNicePeerTemporary(), handleNicePeerTemporaryRelease(), initializeOverlay(), and sendDataToOverlay().
|
private |
Definition at line 171 of file Nice.h.
Referenced by handleNiceJoinevalResponse(), handleTimerEvent(), and Query().
|
private |
Definition at line 210 of file Nice.h.
Referenced by finishOverlay(), handleNiceMulticast(), and initializeOverlay().
|
private |
Definition at line 218 of file Nice.h.
Referenced by finishOverlay(), initializeOverlay(), sendHeartbeats(), and sendHeartbeatTo().
|
private |
Definition at line 214 of file Nice.h.
Referenced by finishOverlay(), handleNiceMulticast(), and initializeOverlay().
|
private |
Definition at line 204 of file Nice.h.
Referenced by finishOverlay(), initializeOverlay(), and maintenance().
|
private |
Definition at line 133 of file Nice.h.
Referenced by changeState(), handleTimerEvent(), initializeOverlay(), and ~Nice().
The documentation for this class was generated from the following files:
