Abstract: A method for establishing a segment routing (SR) tunnel based on an Internet Protocol version 6 (IPv6) data plane using a Path Computation Element Communication Protocol (PCEP) includes generating, by a path computation element (PCE), a first PCEP message, wherein the first PCEP message comprises indicating information and segment identifier (SID), and wherein the indicating information indicates that the SID is an IPv6 prefix of a node in a tunnel; receiving, by a first path computation client (PCC), the first PCEP message from the PCE; and establishing, by the first PCC, a Segment Routing over IPv6 (SRv6) tunnel from the first PCC to a second PCC.

Abstract: Intelligent query routing may be performed across shards of a scalable database table. A router of a database system may receive an access request directed to one or more database tables. The router may evaluate the access request with respect to metadata obtained for the database tables to determine an assignment distribution of computing resources of the database system to data that can satisfy the access request. The router can select planning locations to perform the access request based on the assignment distribution of the computing resources. The router can cause the access request to be performed according to planning at the selected planning locations.

Abstract: An operation method of a network device and a control chip of the network device are provided. The network device receives an input signal through a fiber medium. The operation method includes the following steps: setting a target speed of the network device to a first speed; transmitting and/or receiving a data at the first speed; and setting the target speed of the network device to a second speed which is different from the first speed when the amplitude or energy of the input signal is not greater than a threshold.

Abstract: A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.

Abstract: The disclosure provides an approach for reducing congestion within a network, the network comprising a plurality of subnets, the plurality of subnets comprising a plurality of host machines and a plurality of virtual computing instances (VCIs) running on the plurality of host machines. Embodiments include receiving, by an edge services gateway (ESG) of a first subnet of the plurality of subnets, membership information for a group identifying a subset of the plurality of host machines. Embodiments include receiving a multicast packet directed to the group and selecting from the plurality of host machines, a replicator host machine for the multicast packet. Embodiments include sending, to the replicator host machine, the multicast packet along with metadata indicating that the replicator host machine is to replicate the multicast packet to remaining host machines of the subset of the plurality of host machines identified in the membership information for the group.

Abstract: A relay device includes a plurality of input/output ports (111); an authentication information storage unit (114) to store authentication information used for performing authentication of a target relay device which is a relay device to be authenticated; an authentication processing unit (113) to acquire a target authentication packet which is an authentication packet used for authentication of the target relay device via a target input/output port (111) which is an input/output port connected to the target relay device in the plurality of input/output ports and to authenticate the target relay device by referring to the authentication information, and a relay processing unit (112) to cause a transfer input/output port which is an input/output port (111) to which a transfer destination of the transfer packet is connected, and to discard the transfer packet when the authentication of the target relay device is failed.

Abstract: Method and apparatus may be used for determining whether or not redundant transmission is enabled. One method for determining whether or not redundant transmission is enable includes: receiving trigger information, wherein the trigger information includes at least one of prediction information, load information, QoS information and reliability indication information; and determining whether or not redundant transmission is enabled according to the received trigger information.

Abstract: Methods, apparatus, computer program products for exchange data among air-gapped devices are provided. The method comprises: identifying, by a device in a cluster of devices, a plurality of accessible devices in the cluster via corresponding respective quick response (QR) codes; generating, by the device, logical routing information based on the identified plurality of accessible devices, the logical routing information comprising at least identifiers of the identified plurality of accessible devices; and transmitting, by the device, data encoded in a plurality of QR codes to a destination device in the cluster based on a shortest routing path identified in the logical routing information.

Abstract: A mesh network protocol, comprising: receiving a packet from a sender, identifying the sender, a prior sender, a flood mode, a time-to-live, and a sequence identifier; marking the recipient as critical if during a full flood period, the recipient is the same as the prior sender, and marking the recipient as non-critical if no packet is received with the recipient the same as the prior sender; rebroadcasting the packet, modified by updating sender with the recipient, and sender as prior sender, decrementing the time to live until expiration, and, the identity of the recipient is different from the identity of the prior sender in full flood mode; or the identity of the recipient is different from the prior sender, and the recipient is critical, in partial flood mode.

Abstract: Systems and methods are described for using opportunistically delayed delivery of content to address sub-optimal bandwidth resource usage in network infrastructures that allow subscribers to share forward link resources. According to some embodiments, content is identified as delayable and assigned to a delaycast queue and/or service flow. For example, a server system of a satellite communications system identifies content that can be delayed to exploit future excess link capacity through multicasting and to exploit subscriber-side storage resources. Some implementations attempt to exploit any excess link resources at any time, while others exploit unused bandwidth only during certain times or when a certain threshold of resources is available. Various embodiments also provide content scoring and/or other prioritization techniques for optimizing exploitation of the delaycast queue.

Abstract: A computer-implemented method for classifying three-dimensional (3D) objects including obtaining a set of 3D objects. Each 3D object of the set has a signature representative of the morphology of the 3D object. The method also includes computing a multi-level clustering of the set of 3D objects. The multi-level clustering is a hierarchical tree structure of clusters of 3D objects of the set and has N hierarchical levels. The method also includes selecting, automatically or upon user interaction, one of the computed clusters of a level of the multi-level clustering thereby defining a current level. The method comprises displaying, to a user, 3D objects of the selected cluster in a first part of a display. The method further includes classifying, upon user interaction, the displayed 3D objects. The computer-implemented method improves the classification of 3D objects.

Abstract: The embodiments of the disclosure provide a computer system, comprising a plurality of computing devices, each computing device comprising a storage unit and at least one computing unit which are connected in parallel, the plurality of computing devices being divided into a plurality of nodes, and the plurality of nodes forming a network topology; a communication device comprising an autonomous domain building module and a first communication module, the first communication module being configured for connecting the plurality of computing devices in a communication manner; and a task processing device comprising an addressing module and a task processing module. Therefore, the solution of the present disclosure meets the explosive demand of massive data and large amount computing power caused by artificial intelligence and blockchain to a certain extent.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: A system and method for hybrid any-cast (unicast, multicast and anycast) routing in a mobile ad hoc communication network (MANET) is disclosed. In embodiments, each communication node of the MANET may implement on-demand routing functions whereby the node does not establish or maintain routes to destination nodes unless there is active communication, discovering routes via flooding of data packets in transit. Each communication node may select, or may transition from on-demand to, proactive routing functions. Proactive nodes first establish routes to clusters of other proactive nodes by flooding, and receiving acknowledgments from, the other proactive nodes. Each cluster of proactive nodes maintains routes within the cluster and establishes communication routes outside the cluster by flooding and relaying of routing status messages via clusterhead and gateway nodes.

Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for file management in a distributed file cache system. In some embodiments, a method is disclosed. According to the method, responsive to determining that at least one client node is obtaining a file of a first version stored at a storage node, one or more processors generate contact information indicating that the file of the first version is accessible from the storage node and the at least one client node and recorded the contact information into a distributed hash table. The storage node and the at least one client node are included in a plurality of nodes associated with the distributed hash table. Further, one or more processors generate first version information indicating that the file is of the first version and record the first version information into a blockchain associated with the plurality of nodes.

Abstract: Some embodiments provide a method for a forwarding element that receives a packet. The method determines whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets. When the packet does not match any flow entries in the first cache, the method determines whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets. The method executes a set of actions specified by a flow entry matched by the packet in one of the first and second caches.

Abstract: Systems and methods are provided for synchronizing uplink (UL) and downlink (DL) traffic. In particular, frames associated with Quality of Service (QoS}-sensitive traffic flows to be transmitted in a first direction are prioritized commensurate with frames to be transmitted in a second direction, different/opposite to that of the first direction. For example, UL traffic flows can be prioritized based on DL traffic flows, where the traffic flows belong to the same application flow, and vice versa, where DL traffic flows can be prioritized based on UL traffic flows for the same application flow. In this way, end-to-end QoS can be achieved.

Abstract: Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

Abstract: A network system includes a communication apparatus, and a control apparatus configured to control the communication apparatus. The communication apparatus includes a memory configured to store program instructions, and a processor configured to execute the instructions to receive an address of a destination virtual machine from the control apparatus, receive a packet from a source virtual machine, identify, based on the address of the destination virtual machine corresponding to the received packet, an identifier of an edge node connected to the destination virtual machine, and add the identifier of the edge node to the received packet.

Abstract: A system and method to adapt the grouping between a plurality of nodes in a data processing system. In one embodiment, a first leader node (320) in a data processing system (300) is configured to determine (815) a cost map within a first group of nodes (310), calculate (820) costs between the first leader node (320) and first member nodes (330) based on the cost map, determine (830) a candidate member node (330A) from the first member nodes (330), query (840) other leader nodes (350, 380) to accept a transfer of the candidate member node (330A), receive (850) a first transfer response from a second leader node (350) to accept the transfer to a second group of nodes (340), initiate (860) a transfer of and receive (865) an acknowledgement for the transfer of the candidate member node (330A) to the second group of nodes (340).

Abstract: A system and method for coherency gathering for rays in a ray tracing system. The ray tracing system uses a hierarchical acceleration structure comprising a plurality of nodes including upper level nodes and lower level nodes. For each instance where one of the lower level nodes is a child of one of the upper level nodes, an instance transform is defined, specifying the relationship between a first coordinate system of the upper level node and the second coordinate system for that instance of the lower level node. The system provides an instance transform cache for storing a plurality of these instance transforms while conducting intersection testing.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: A method for managing a computer network is provided, which comprises: performing data collection at at least one network node of the computer network belonging to a set of one or more network nodes corresponding to a first depth level of a routing tree that represents nodes of the computer network and edges respectively corresponding to neighboring relations between two nodes of the computer network, the data collection comprising: receiving first data collection configuration data generating second data collection configuration data for collecting data from at least one child node in the routing tree of the at least one network node of the computer network, wherein the second data collection configuration data comprises scheduling data for collecting data from each of the at least one child node, and collecting data from each of the at least one child node according to the second data collection configuration data.

Abstract: A DECT network clustering method includes sending, by a DECT host to a router, a multicast command that declares joining a specified multicast group; sending, by a DECT device to the router, a multicast probe message sent to a target multicast group; receiving, by the router, the multicast command and the multicast probe message, and sending, to the DECT host according to the multicast command, the multicast probe message; receiving, by the DECT host, the multicast probe message, and sending status declaration information to the DECT device; receiving, by the DECT device, the status declaration information, and initiating a TCP connection request to the DECT host in a point-to-point manner; and receiving, by the DECT host, the connection request from the DECT device, and establishing a TCP channel with the DECT device.

Abstract: A computer-implemented method determines a routing cost for routing data over a routing path between a first device in a first network and a second device, wherein the routing path has a path segment between a gateway device of the first network and a device in a second network, the gateway device being configured to establish a connection between the first and second networks. This method may include determining a routing cost for the path segment, the routing cost for the path segment having a default routing cost value that is based on capabilities of the gateway device and/or the communication technology; and determining the routing cost for the routing path based on the routing cost for the path segment. The invention furthermore relates to determining a route based on the routing cost, and to routing a data packet based on the route.

Abstract: The present disclosure relates to systems, methods, and products for identifying candidate molecule. The system includes a non-transitory memory storing instructions; and a processor in communication with the non-transitory memory. The processor executes the instructions to cause the system to receive drug data; convert the drug data into at least one point in a latent space using a grammar variational auto-encoder (VAE) model; receive a query for the at least one candidate molecule; select one or more points in the latent space; and create a k-dimensional tree graph based on the query for the at least one candidate molecule and the selected one or more points; determine a plurality of paths according to an interpolation technique; receive preference data; determine an optimum path; determine at least one candidate point on the optimum path; and determine a drug molecular structure using an inverse of the grammar VAE model.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: A wireless device is configured to receive scheduling information at a predetermined time interval from a wireless node. The scheduling information includes a plurality of reception definitions. Each reception definition indicates a reception start time, a reception duration, and assigned frequency information. Each reception definition is derived from a wireless device identification associated with the reception definition. The wireless device is configured to receive data associated with at least one of the reception definitions.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: Embodiments for a method of implementing multiple domains in a network switching device are disclosed. The method includes assigning a plurality of hardware ports to a plurality of domains. Ports are assigned to at least two of the plurality of domains, and none of the ports are concurrently assigned to multiple domains. The method also includes loading rules for forwarding packets between the plurality of ports into a data plane. The rules direct the data plane to forward only between ports in a common domain of the plurality of domains. The method also includes assuring that a packet received at any port assigned to a first domain is not sent in legible form from any port assigned to a second domain if an error causes the data plane to forward or request forwarding the packet to any port assigned to a second domain.

Abstract: Flow-zone switching provides for the switching of frames through a network, basing forwarding decisions on location and flow information encoded in the frames, such as in the source and destination addresses. Various address formats are disclosed, supporting transfer of packet data among data switches as well as among endpoints. Systems, apparatuses, and methods are disclosed.

Abstract: This application discloses a link-state advertisement LSA sending method, an apparatus, and a system, to reduce a quantity of LSA sending times. The method includes: generating, by a first router, a first path table based on level location information of the first router, level location information of a second router, and level location information of at least one third router; sending, by the first router, a first link state update LSU message to the second router; receiving, by the second router, the first link state update LSU message from the first router; updating, by the second router, a link state database LSDB of the second router based on a first LSA; and sending, by the second router, the first LSA to a router corresponding to an identifier in the first path table.

Abstract: A method of sorting an array of data elements, the method includes assigning values associated with a monotonic function to the data elements, and sorting the array of data elements by sorting the monotonic function values using a least significant digit (LSD) Radix sort.

Abstract: The invention relates to a method for analyzing an abnormal event in an industrial automation and control system, IACS, comprising the following steps: identifying the abnormal event; detecting a root cause of the abnormal event; and generating a notification if the root cause is not a user activity and, if the root cause is a user activity, evaluating the possible impact on the IACS caused by the abnormal event, and generating a notification if the evaluation of the possible impact does not match a predefined list of allowable behavior. The present invention also relates to a corresponding system and corresponding computer program product comprising one or more computer readable media having computer executable instructions for performing the steps of the method.

Abstract: An example non-transitory, computer-readable medium includes instructions that cause a device to determine, for uplinks of a branch gateway, a link health baseline. The instructions further cause the device to determine, for a set of criticality classes, a class link health baseline for each link health baseline, based on the link health baseline and a tolerance level of each criticality class. The instructions further cause the device to calculate, based in part on weighted parameters of the class link health baselines and an uplink cost, a path quality threshold score for each application category and for each uplink. The instructions further cause the device to select, for each application category, a primary uplink and a secondary uplink based on the path quality threshold scores. The instructions further cause the device to route network traffic through the primary uplink of the application category assigned to the network traffic.

Abstract: The disclosure sets forth techniques, devices, systems, and methods for measuring a packet residency time in a network device. In some aspects, a network flow measurement protocol includes data fields in flow data records exported to a traffic collector, including a packet ingress time and a packet egress time. The data fields allow the calculation of the packet residency time within a network device, as well as the time required for the packet to traverse between two network devices in the network. A filter can be installed on one or more network devices in a network. For packets that match the filter criteria, the network device records the times of packet arrival and packet departure, and, in some aspects, a packet residency time of the packet with the network device. The network device exports the flow data record pertaining to this packet to a traffic flow data collector.

Abstract: Requests are received by a routing circuit. A plurality of first round-robin arbitration circuits are coupled to the routing circuit. There are as many first round-robin arbitration circuits as there are possible priority levels for the requests. The routing circuit operates to transmit each received request to a number of first round-robin arbitration circuits determined according to the priority level of the request. A second round-robin arbitration circuit has inputs respectively connected to the outputs of the first round-robin arbitration circuits.

Abstract: Techniques for satisfying a plurality of service demands in a data communication network are disclosed. Aspects include identifying a first plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the first plurality of edges is associated with one of a plurality of unprotected service demands; generating a spanning tree comprising a second plurality of edges selected from the first plurality of edges, wherein the spanning tree connects all of the plurality of nodes that are connected by the first plurality of edges; and creating a set of service links based on the generated spanning tree.

Abstract: Techniques for utilizing Software-Defined Networking (SDN) controllers and network border leaf nodes of respective cloud computing networks to configure a data transmission route for a multicast group. Each border leaf node may maintain a respective external sources database, including a number of records indicating associations between a multicast data source, one or more respective border leaf nodes disposed in the same network as the multicast data source, and network capability information. A border leaf node, disposed in the same network as a multicast data source, may broadcast a local source discovery message to all border leaf nodes in remote networks to which it is communicatively coupled. A border leaf node may also communicate network capability information associated with one or more remote networks to a local SDN controller. The SDN controller may utilize the network capability information to configure a data transmission route to one or more destination nodes.

Abstract: Methods can include receiving a graphbase comprising a first plurality of nodes and a plurality of edges representing covering-covered relationships between the nodes. Each node can comprise a plurality of node parameters such as a NodeNumber, a Reachable Interval, and an OwnTree Interval. For a traversal ordering of nodes, nodes comprised within the OwnTree Interval are reachable from the node, nodes comprised within the Reachable Interval may be reachable from the node, and nodes comprised within neither interval are not reachable by the node. Methods can additionally include the steps of receiving a first and second sub-set of nodes, the sub-sets being a sub-set of the first plurality of nodes. Furthermore, a relationship between the first and second sub-set can be determined using the NodeNumber, the OwnTree Interval, and the Reachable Interval.

Abstract: Systems, methods, and instrumentalities are disclosed for enhancing performance of multi-path communications. Multi-path communication performance may be enhanced by determining whether multipath communications share a congested router. A multi-path real-time communication protocol may provide techniques to prevent, detect, communicate and respond to a shared congested router. A shared congested router may be prevented, and/or detected using one or more detection techniques.

Abstract: A method and system for streaming management information base data using simple network management protocol is disclosed. The system includes a manager device and an endpoint device, which runs a SNMP agent and SNMP proxy. The SNMP proxy retrieves MIB data from the SNMP Agent associated with the endpoint device, wherein the MIB data comprises a full MIB sub-tree and differential MIB sub-trees. MIB views comprising MIB variables of interest associated with a full MIB sub-tree and differential MIB sub-trees are created based on a predetermined configuration. The SNMP proxy stores the MIB views and corresponding MIB data in a data store and compresses the MIB views and MIB data into files. Compressed file of the MIB view with MIB data associated with full MIB sub-tree are sent to the manager device in an initial stream. Further, the endpoint device streams compressed file of the MIB views with MIB data associated with the differential MIB sub-tree to the manager device on receiving a request.

Abstract: A system for determining network device transiting data attributes includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to run a first script on all static ports of a network and run a second script on all known ports of the network. The system may parse the parameters returned from the first and second scripts to identify one or more identified ports of the known ports. The system may run a third script on the one or more identified ports to force one or more denials at the identified ports. Based on the one or more denials, the system may determine network device transiting data attributes including but not limited to allowed protocols and directionality for each of the one or more identified ports.

Abstract: A mesh network protocol, comprising: receiving a packet from a sender, identifying the sender, a prior sender, a flood mode, a time-to-live, and a sequence identifier; marking the recipient as critical if during a full flood period, the recipient is the same as the prior sender, and marking the recipient as non-critical if no packet is received with the recipient the same as the prior sender; rebroadcasting the packet, modified by updating sender with the recipient, and sender as prior sender, decrementing the time to live until expiration, and, the identity of the recipient is different from the identity of the prior sender in full flood mode; or the identity of the recipient is different from the prior sender, and the recipient is critical, in partial flood mode.

Abstract: In one embodiment, a first Protocol Independent Multicast (PIM) router includes port interfaces to receive multicast traffic from a first network and forward the traffic to at least one receiver, which is in a sub-network including other PIM routers, and a routing processor configured, in response to a decision for the first PIM router to relinquish being a designated router, to generate a PIM Hello message with a first option descriptor and a first priority, the first option descriptor indicating a staggered handoff process, and send the PIM Hello message, receipt of the PIM Hello message by the other PIM routers being operative to result in a designated router election electing a new designated router, the new designated router being operative to initiate the staggered handoff process causing the first PIM router to continue forwarding traffic until the new designated router has built a multicast routing tree.

Abstract: Embodiments of the present invention can use a protocol-independent, vendor-independent, efficient and scalable abstraction model for representing the forwarding functionality of networks. Such a model can be used for systematic analysis and verification of networks. Packet header values may be represented as groups of one or more wildcarded bit strings, where unspecified header values are assumed to be fully wildcarded. This representation can describe many combinations of packets in a space-efficient way, enables more efficient tracing and transformation operations, and can even represent traffic from large internet routing tables efficiently. As a result of the scalability benefits of this more effective way to store and operate on packet collections, network modeling can scale to some of the largest, most complicated networks—those where the benefits are the greatest.

Abstract: Systems and methods provide for monitoring a state of a network fabric utilizing user traffic. A fabric node (e.g., switch, router, or other network device) can receive user traffic from a node (e.g., network device, network appliance, or endpoint). The fabric node can match the user traffic to a tuple stored in a hardware counter matrix of the fabric node, the tuple corresponding to a count in the hardware counter matrix. The fabric node can increment the count. The fabric node can transmit an active probe to the node in response to the count not incrementing within a first time. The fabric node can transmit to a network management system data indicative of a disconnection between the fabric node and the node in response to the fabric node not receiving a response to the active probe within a second time.

Abstract: An authentication system for V2X communication systems includes a first node having a V2X communication module with a processor, a memory, and input/output ports communicating a request to join and periodically communicating a first data packet to the V2X communication system. The authentication system having a private blockchain including a plurality of participant nodes within a predefined optimized area of one another, the blockchain receiving and validating the request to join the V2X communication system, and upon successfully validating the request to join the V2X communication system, periodically sending a second data packet from the plurality of participant nodes to the first node. The input/output ports receiving the second data packet, the processor executing a first control logic stored in the memory to extract the second data packet and a second control logic selectively generating a notification based on the contents of the second data packet.

Abstract: A method of managing a network of calculation nodes interconnected by a plurality of interconnection devices, includes organizing the calculation nodes into groups of calculation nodes, for each group of calculation nodes, connecting the interconnection devices interconnecting the nodes of the group to a group management node, the management node being dedicated to the group of calculation nodes on each management node execution of an administration function by the implementation of independent management modules, each management module of a management node being able to communicate with the other management modules of the same management node.

Abstract: Aspects of the subject disclosure may include, for example, embodiments and a method. The method includes iteratively providing messages to each Node Processor. Each Node Processor represents a node of a group of nodes. The iteratively providing of the messages comprises providing first messages. Each first message includes a cost associated with a path of nodes visited by each first message. In addition, the method includes determining paths having common endpoints among a portion of the first messages, identifying a cost for each of the paths having common endpoints, identifying a lowest cost from among the group of common endpoint costs, identifying a selected path associated with the lowest cost. A next group of messages includes the selected path. The iteratively providing of the messages results in selected paths. Also, the method include determining a target path from a remaining path. Other embodiments are disclosed.