Returns a reference to a random distribution that will be shared
by consumers depending the value of .Net.randomstream.reproducibility_level
Specification of the RandomDistribution is via a Configuration.
Returns a reference to a random distributrution that will be shared
by consumers depending the value of .Net.randomstream.reproducibility_level
Specification of the RandomDistribution is via a Configuration.
Returns a reference to a random distribution that will be shared
by consumers depending the value of .Net.randomstream.reproducibility_level
Specification of the RandomDistribution is by a name recognized by
class method RandomStream.getDistribution(); the returned handle
is for default values of the distribution's parameters.
Returns a reference to a random distributrution that will be shared
by consumers depending the value of .Net.randomstream.reproducibility_level
Specification of the RandomDistribution is by a name recognized by
class method RandomStream.getDistribution(); the returned handle
is for default values of the distribution's parameters.
Returns a reference to a raw random number generator output specified
by the global attribute .Net.randomstream; that will be shared
by consumers depending the value of
.Net.randomstream.reproducibility_level.
Returns a reference to a raw random number generator output specified
by the global attribute .Net.randomstream; that will be shared
by consumers depending the value of
.Net.randomstream.reproducibility_level.
Create CIDR blocks for virtual loopback links, defined implicitly by the
existence of virtual interfaces within a Net, and establish their CIDR
addresses.
Insert one or more new routes into the linked list, sorted by COST;
return the new head route (either the new route, or this route,
whichever is lower-cost).
Performs a pre-order traversal of this radix tree, calculating an estimate
of the number of bytes that would be produced by the conversion performed
in toBytes.
Internal constructor for an internal CIDR block, given a DML
configuration, a network ID number to use, and a reference to
the cidrBlock representing the Net in which this Net or Link
was defined.
Helper function to let Hosts, Routers, Links set their alignments
consistently from their respective config files, which share
a common optional "alignment" attribute.
Helper function to let Hosts, Routers, Links set their alignments
consistently from their respective config files, which share
a common optional "alignment" attribute.
Method createControlMessageQueueEntry
If the isControlChannelON flage is true, the MPLSInterfaceInfo creates
a Queue for control traffics.
See, MPLSMgmt.java - "mplsinit" DML script
Instantiate and configure an IP packet monitor implementing
the interface SSF.OS.ProtocolMonitor, if specified
locally in this host's IP configuration.
This class is a frame that can be used for algorithms to display the results
For these algorithm, we suppose that all links are bidirectional and there
is only one link (multiple fibers are allowed) between 2 nodes.
DiffServActionFlowProfile contains a FlowProfileTable (Hashtable)
that maintains the DiffServFlowProfiles to specify the packet
processing for each DiffServ packet flow with (multiple) class-type(s).
Method establishTransportNetworkPath
Reference : (1), (2)
Called by the IngressLSR to eastablish a Optical Path
This is the first called function in the OUNI procedure.
Method establishTransportNetworkPath
Reference : (7), (8)
This function is called by the CRLDPControlBlock( - labelRequestProc())
to establish a optical connection between the Egress OXC and the Egress LSR...
Returns the data in the node which is deepest in the tree along
the path from the root to what would be the BEST (not EXACT) match
in the tree, if it existed (which it might, in which case that would
be the deepest node and thus the best match).
Returns the data in the node which is deepest in the tree along
the path from the root to what would be the BEST (not EXACT) match
in the tree, if it existed (which it might, in which case that would
be the deepest node and thus the best match).
Find the LEFT or RIGHT component of graph, connected from the vertex,
edgeCut[0][0] and saved gLeft[][] for the flag LEFT or gRIGHT[][] for the
flag RIGHT.