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. A selected path is obtained from each node having a lowest cost of a group of common endpoint costs for paths having common endpoints. 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.

A wireless sensor network node selection that efficiently manages active nodes using a Tabu heuristic coupled with minimum spanning tree routing protocol (TNS-MST) is presented. Nodal energy consumption is balanced to ensure all nodes are operating at the same energy level. To balance the energy consumption, nodes with high energy depletion are removed from routing by placing on them a Tabu list, which prevents the most used nodes, such as nodes close to a base station, from draining before their neighbors. The nodes in the Tabu lists are dynamically active according to the energy level of neighboring nodes. The Tabu list combined with Minimum Spanning Tree routing protocol, TNS-MST, greatly increases network lifetime by optimally balancing the energy of the sensor nodes.

A method and apparatus for adjusting network flow are provided. An embodiment of the method may include: in response to the server meeting a network flow adjustment condition, acquiring network flow-related information of the server; determining network flow adjustment operations based on the network flow-related information, wherein the network flow adjustment operations indicate to determine at least one level of downlink flow from a plurality of levels of downlink flows according to an ascending order of the plurality of levels of downlink flows, to perform network flow downregulation on the determined at least one level of downlink flow, the at least one level not comprising a highest level in the plurality of levels, and in any two levels of downlink flows, a value of a downlink flow of a higher level being greater than a value of a downlink flow of a lower lever; and performing, according to a sequential order of operations in the network flow adjustment operations, at least one operation in the network flow adjustment operations.

In randomized traffic selection in a IPsec network, a source node sends a packet to a destination node. The packet is encapsulated with an application specific metadata header and the source node encapsulates the packet in a transport protocol header (UDP/TCP). The application specific metadata header includes information such as a final destination node, a configured number of hops, a current hop count. A security association associated with an intermediate node is randomly selected by a randomized traffic selector algorithm. The security association is randomly selected from the list of security associations. Upon receiving the packet at the intermediate node, a current hop count is incremented. It is determined that the current hop count is equal to the configured number of hops. The packet is sent to the destination node via the intermediate node based on the randomly selected security association.

In one embodiment, an apparatus includes one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors. The one or more computer-readable non-transitory storage media include instructions that, when executed by the one or more processors, cause the apparatus to perform operations including receiving a first type-length-value (TLV) associated with a winning flexible algorithm definition (FAD) from a first element of a network. The operations also include determining a security level for the winning FAD based on the TLV. The operations further include determining a data transmission route through a plurality of elements of the network based on the security level for the winning FAD.

A wireless sensor network node selection that efficiently manages active nodes using a Tabu heuristic coupled with minimum spanning tree routing protocol (TNS-MST) is presented. Nodal energy consumption is balanced to ensure all nodes are operating at the same energy level. To balance the energy consumption, nodes with high energy depletion are removed from routing by placing on them a Tabu list, which prevents the most used nodes, such as nodes close to a base station, from draining before their neighbors. The nodes in the Tabu lists are dynamically active according to the energy level of neighboring nodes. The Tabu list combined with Minimum Spanning Tree routing protocol, TNS-MST, greatly increases network lifetime by optimally balancing the energy of the sensor nodes.

A communication device is provided that makes a single or a plurality of functions desired by a service user act on a packet desired by the service user in a service for transferring a packet in a network. A communication device is provided that includes a communication unit that communicates with another node and a control unit that controls the communication by the communication unit, in which the control unit generates path information with a target node, and in the path information with the target node, at least information regarding communication with at least a single relay node that exists between the communication device and the target node, information regarding a function to be performed by the relay node, and content of processing according to the function execution result by the relay node are written.

A data processing method, a device, and a system, for performing different processing on data packets of varying degrees of importance in a same service flow, where the data processing method includes: A first device receiving a first data packet from a third device, where the first data packet carries transmission requirement indication information of the first data packet, where the first device is any intermediate device between a source device and a target device that correspond to the first data packet, and where the third device is a previous-hop device adjacent to the first device on a transmission path from the source device to the target device; the first device determining, based on the transmission requirement indication information of the first data packet, a processing policy corresponding to the first data packet; and the first device processing the first data packet according to the processing policy.

A network path selection method and a network node device using the same are disclosed. The network path selection method includes: determining whether a first uplink time parameter table is received from the first relay node device and whether a second uplink time parameter table is received from the second relay node device; when the first uplink time parameter table is received from the first relay node device and the second uplink time parameter table is received from the second relay node device, calculating a first estimated uplink time parameter according to the first uplink time parameter table and a second estimated uplink time parameter according to the second uplink time parameter table; and determining to connect to a gateway via one of the first relay node device and the second relay node device according to the first estimated uplink time parameter and the second estimated uplink time parameter.

An integrated circuit includes, a network on chip (NOC) that includes a plurality of processing elements and a plurality of NOC nodes, interconnected to the plurality of processing elements. The integrated circuit includes logic that is configured to: increment by one, a virtual channel identifier to produce an incremented destination VC identifier, the virtual channel (VC) identifier associated with at least portion of a packet stored in at least one virtual channel buffer; determine that a destination virtual channel buffer corresponding to the incremented destination VC identifier in a destination NOC node in the NOC is available to store the portion of the packet; and in response to the determination, send the portion of the packet and the incremented destination VC identifier to the destination NOC node.