Compound Module SimpleMultiOverlayHost

Package: oversim.underlay.simpleunderlay
File: src/underlay/simpleunderlay/SimpleMultiOverlayHost.ned

Host in the simple network that participates in the overlay

Author: Stephan Krause, Bernhard Heep, Ingmar Baumgart

NotificationBoard ITier ITier ITier IOverlay SimpleUDP SimpleTCP InterfaceTable NeighborCache CryptoModule BootstrapList

Usage diagram:

The following diagram shows usage relationships between types. Unresolved types are missing from the diagram. Click here to see the full picture.

Inheritance diagram:

The following diagram shows inheritance relationships for this type. Unresolved types are missing from the diagram. Click here to see the full picture.

Parameters:

Name Type Default value Description
overlayType string

overlay protocol compound module to use

tier1Type string

tier 1 application to use

tier2Type string

tier 2 module to use

tier3Type string

tier 3 module to use

numTiers int

number of tiers

numOverlayModulesPerNode double

number of parallel overlays

routingFile string ""
IPForward bool false

Properties:

Name Value Description
display bgb=433,386

Gates:

Name Direction Size Description
overlayNeighborArrowIn [ ] input

incoming gate for visualizing overlay neighborship with connection arrows

overlayNeighborArrowOut [ ] output

incoming gate for visualizing overlay neighborship with connection arrows

out output

Dummy gate for storing channel informations

in input

Dummy gate for connecting out

Unassigned submodule parameters:

Name Type Default value Description
udp.constantDelay double

constant delay between two peers

udp.useCoordinateBasedDelay bool

delay should be calculated from euklidean distance between two peers

udp.delayFaultType string

augment coordinate based delays with a realistic error, according to "Network Coordinates in the Wild", Figure 7 possible values: empty, "live_all", "live_planetlab", "simulation"

udp.jitter double

average amount of jitter in %

udp.enableAccessRouterTxQueue bool

model the tx queue of the access router of an destination node

tcp.advertisedWindow int 14*this.mss

in bytes, corresponds with the maximal receiver buffer capacity (Note: normally, NIC queues should be at least this size)

tcp.delayedAcksEnabled bool false

delayed ACK algorithm (RFC 1122) enabled/disabled

tcp.nagleEnabled bool true

Nagle's algorithm (RFC 896) enabled/disabled

tcp.limitedTransmitEnabled bool false

Limited Transmit algorithm (RFC 3042) enabled/disabled (can be used for TCPReno/TCPTahoe/TCPNewReno/TCPNoCongestionControl)

tcp.increasedIWEnabled bool false

Increased Initial Window (RFC 3390) enabled/disabled

tcp.sackSupport bool false

Selective Acknowledgment (RFC 2018, 2883, 3517) support (header option) (SACK will be enabled for a connection if both endpoints support it)

tcp.windowScalingSupport bool false

Window Scale (RFC 1323) support (header option) (WS will be enabled for a connection if both endpoints support it)

tcp.timestampSupport bool false

Timestamps (RFC 1323) support (header option) (TS will be enabled for a connection if both endpoints support it)

tcp.mss int 536

Maximum Segment Size (RFC 793) (header option)

tcp.tcpAlgorithmClass string "TCPReno"

TCPReno/TCPTahoe/TCPNewReno/TCPNoCongestionControl/DumbTCP

tcp.sendQueueClass string "TCPVirtualDataSendQueue"

TCPVirtualDataSendQueue/TCPMsgBasedSendQueue

tcp.receiveQueueClass string "TCPVirtualDataRcvQueue"

TCPVirtualDataRcvQueue/TCPMsgBasedRcvQueue

tcp.recordStats bool true

recording of seqNum etc. into output vectors enabled/disabled

tcp.constantDelay double

constant delay between two peers

tcp.useCoordinateBasedDelay bool

delay should be calculated from euklidean distance between two peers

tcp.delayFaultType string

augment coordinate based delays with a realistic error, according to "Network Coordinates in the Wild", Figure 7 possible values: empty, "live_all", "live_planetlab", "simulation"

tcp.jitter double

average amount of jitter in %

neighborCache.rpcUdpTimeout double

default timeout value for direct RPCs

neighborCache.rpcKeyTimeout double

default timeout value for routed RPCs

neighborCache.optimizeTimeouts bool

calculate timeouts from measured RTTs and network coordinates

neighborCache.rpcExponentialBackoff bool

if true, doubles the timeout for every retransmission

neighborCache.debugOutput bool

enable debug output

neighborCache.enableNeighborCache bool

use neighbor cache for reducing ping traffic?

neighborCache.rttExpirationTime double

expiration of the validity of the measured rtts

neighborCache.maxSize double

maximum size of the cache

neighborCache.rttHistory int
neighborCache.timeoutAccuracyLimit double
neighborCache.defaultQueryType string
neighborCache.defaultQueryTypeI string
neighborCache.defaultQueryTypeQ string
neighborCache.doDiscovery bool
neighborCache.collectClosestNodes int
neighborCache.ncsType string
neighborCache.useNcsForTimeout bool
neighborCache.ncsPiggybackOwnCoords bool
neighborCache.discoveryModeNumCloseNodes int

discovery mode settings

neighborCache.discoveryModeNumSpreadedNodes int
neighborCache.discoveryModeMaxSteps int
neighborCache.discoveryModeSpreadedSteps int
neighborCache.gnpDimensions int

gnp settings

neighborCache.gnpCoordCalcRuns int
neighborCache.gnpLandmarkTimeout double
neighborCache.npsMaxLayer int

nps settings

neighborCache.vivaldiShowPosition bool

vivaldi settings

neighborCache.vivaldiErrorConst double
neighborCache.vivaldiCoordConst double
neighborCache.vivaldiDimConst double
neighborCache.vivaldiEnableHeightVector bool
neighborCache.svivaldiLossConst double

svivaldi settings

neighborCache.svivaldiLossResetLimit double
neighborCache.simpleNcsDelayFaultType string

simpleNcs settings

neighborCache.treeMgmtEnableTreeManagement bool

Tree Management Settings

neighborCache.treeMgmtBuildInterval double

the interval to check the childNodeMap

neighborCache.treeMgmtChildrenTimeOut double

after this timeout an alive check ping is send

neighborCache.gvbEnableGlobalViewBuilder bool

Global View Builder Settings

neighborCache.gvbCoordSendInterval double

the interval to send the coordinates data

neighborCache.gvbOnlyAcceptCompleteCCD bool
neighborCache.gvbSendStrategy string

the send strategy to use. (sendAll|simplifyCoords|removeRandom|removeInaccurate|regions|treeTest)

neighborCache.gvbStrategyRemoveCoordsMode string

strategy mode (percentage|limitCoords|limitTraffic)

neighborCache.gvbStrategyRemoveCoordsPercentage int
neighborCache.gvbStrategyRemoveCoordsCoordsLimit int
neighborCache.gvbStrategyRemoveCoordsTrafficLimit int
neighborCache.gvbStrategyRegionsSizePerDimension int
neighborCache.gvbStrategyRegionsMaxSpread int
neighborCache.gvbStrategySimplifyCoordsFactor int
neighborCache.gvbC2AParameter string

parameterstring to append to c2a.rb call

neighborCache.gvbDistributeGlobalView bool

create areas and distribute the globalView to all nodes

cryptoModule.keyFile string

the name of the file containing the public key pair used to sign messages

bootstrapList.rpcUdpTimeout double

default timeout value for direct RPCs

bootstrapList.rpcKeyTimeout double

default timeout value for routed RPCs

bootstrapList.optimizeTimeouts bool

calculate timeouts from measured RTTs and network coordinates

bootstrapList.rpcExponentialBackoff bool

if true, doubles the timeout for every retransmission

bootstrapList.debugOutput bool

enable debug output

bootstrapList.mergeOverlayPartitions bool

if true, detect and merge overlay partitions

bootstrapList.maintainList bool

maintain a list of bootstrap candidates and check them periodically

Source code:

//
// Host in the simple network that participates in the overlay
//
// @author Stephan Krause, Bernhard Heep, Ingmar Baumgart
//
module SimpleMultiOverlayHost
{
    parameters:
        string overlayType; // overlay protocol compound module to use        
        string tier1Type; // tier 1 application to use
        string tier2Type;// tier 2 module to use
        string tier3Type; // tier 3 module to use
        int numTiers; // number of tiers
        double numOverlayModulesPerNode; // number of parallel overlays
        string routingFile = default("");
        bool IPForward = default(false);

        @display("bgb=433,386");
    gates:
        input overlayNeighborArrowIn[]; // incoming gate for visualizing overlay neighborship with connection arrows
        output overlayNeighborArrowOut[]; // incoming gate for visualizing overlay neighborship with connection arrows
        output out; // Dummy gate for storing channel informations
        input in; // Dummy gate for connecting out

    submodules:
        notificationBoard: NotificationBoard {
            parameters:
                @display("p=64,239");
        }
        tier3[numOverlayModulesPerNode]: <tier3Type> like ITier {
            parameters:
                @display("p=64,64;i=block/segm");
        }
        tier2[numOverlayModulesPerNode]: <tier2Type> like ITier {
            parameters:
                @display("p=179,104;i=block/segm");
        }
        tier1[numOverlayModulesPerNode]: <tier1Type> like ITier {
            parameters:
                @display("p=290,162;i=block/segm");
        }
        overlay[numOverlayModulesPerNode]: <overlayType> like IOverlay {
            parameters:
                @display("p=370,231;i=block/network2");
        }
        udp: SimpleUDP {
            parameters:
                @display("p=370,318");
        }
        tcp: SimpleTCP {
            parameters:
                @display("p=309,318");
        }
        interfaceTable: InterfaceTable {
            parameters:
                @display("p=64,318");
        }
        neighborCache: NeighborCache {
            parameters:
                @display("p=168,318");
        }
        cryptoModule: CryptoModule {
            parameters:
                @display("p=64,162");
        }
        bootstrapList: BootstrapList {
            parameters:
                @display("p=168,239");

        }
    connections allowunconnected:
        bootstrapList.udpOut --> udp.appIn++;
        bootstrapList.udpIn <-- udp.appOut++;

        for i=0..numOverlayModulesPerNode-1 {
            tier1[i].to_lowerTier --> overlay[i].appIn if numTiers>0;
            tier1[i].from_lowerTier <-- overlay[i].appOut if numTiers>0;
            tier1[i].udpOut --> udp.appIn++ if numTiers>0;
            udp.appOut++ --> tier1[i].udpIn if numTiers>0;
            tier1[i].tcpOut --> tcp.appIn++ if numTiers>0;
            tcp.appOut++ --> tier1[i].tcpIn if numTiers>0;

            tier2[i].to_lowerTier --> tier1[i].from_upperTier if numTiers > 1;
            tier2[i].from_lowerTier <-- tier1[i].to_upperTier if numTiers > 1;
            tier2[i].udpOut --> udp.appIn++ if numTiers>1;
            udp.appOut++ --> tier2[i].udpIn if numTiers>1;
            tier2[i].tcpOut --> tcp.appIn++ if numTiers>1;
            tcp.appOut++ --> tier2[i].tcpIn if numTiers>1;

            tier3[i].to_lowerTier --> tier2[i].from_upperTier if numTiers > 2;
            tier3[i].from_lowerTier <-- tier2[i].to_upperTier if numTiers > 2;
            tier3[i].udpOut --> udp.appIn++ if numTiers>2;
            udp.appOut++ --> tier3[i].udpIn if numTiers>2;
            tier3[i].tcpOut --> tcp.appIn++ if numTiers>2;
            tcp.appOut++ --> tier3[i].tcpIn if numTiers>2;

            overlay[i].udpOut --> udp.appIn++;
            overlay[i].udpIn <-- udp.appOut++;

            overlay[i].tcpOut --> tcp.appIn++;
            overlay[i].tcpIn <-- tcp.appOut++;

        }

}