Embodiments of this application disclose an information reporting method, an information processing method, an apparatus, and a device. The method in embodiments of this application includes the network device obtains a routing prefix included in local routing information, and information about a neighboring peer set corresponding to the routing prefix, and sends a local route monitoring message including the routing prefix and the information about the neighboring peer set to a first device. The neighboring peer set includes a source peer set and/or a destination peer set, the source peer set includes one or more source peers, the source peer is a peer that advertises original routing information including the routing prefix to the network device, the destination peer set includes one or more destination peers, and the destination peer is a peer to which the network device advertises destination routing information including the routing prefix.

A method (100) of route selection in a wireless communication system and a control system (40) is provided. The method includes selecting a route between a first node (1) and a second node (2) and comprises: —evaluating (110) a plurality of possible routes (R1, R2, R3, R4), at least one route (R2, R3, R4) including a third node (3, 4) between the first and the second node; and —selecting (160) the route that has the lowest latency among the possible routes. Especially the method (100) includes: —selecting (120) parameter settings for each link of the possible routes, said selecting (120) comprising; —selecting (130) the length of the cyclic prefix, —evaluating (140) combinations of the selected cyclic prefix and different settings of the at least one further parameter of the physical layer; —selecting (150) the parameter settings that has lowest estimated latency and fulfils at least one communication quality criterion.

Techniques are described herein that are capable of load-balancing establishment of connections among groups of connector servers in a public computer network by performing operations that include receiving a connection request from a connector client in a private computer network, requesting establishment of a connection between the connector client and one of the connector servers in the public computer network. A number of connections between the private computer network and each group is determined. An identified group is selected from the groups based at least in part on a number of connections between the private computer network and the identified group being less than or equal to a number of connections between the private computer network and each other group. The connection request is provided toward the identified group, which enables establishment of the connection between the connector client and a connector server in the identified group.

A solution for route selection includes receiving, by a network repository, from a first network function (NF), a query related to a target NF; querying, by the network repository, a route selection node for a shortest path to the target NF; receiving, by the network repository, from the route selection node, an indication of the shortest path to the target NF; and based on at least receiving the indication of the shortest path to the target NF, transmitting, by the network repository, to the first NF, a route to the target NF. In some examples, the shortest path has at least one of: a minimum number of hops, a minimum latency, a minimum jitter, and a minimum weighted transport score. In some examples, the route selection node is co-located with the network repository, which may be a network repository function (NRF).

Systems and methods for creating loopback packets for transmission through a section of a network for the purpose of testing the operability of links and nodes in this section of the network are provided. A method, according to one implementation, includes a step of obtaining information, by a Network Element (NE), about the topology of the network related to at least the nodes in direct communication with a peer node. The method also includes a step of generating one or more loopback packets, where each loopback packet includes at least a header having a path list including one or more nodes of the plurality of nodes in the network. Each path list defines an order of nodes through which the respective loopback packet is to be transmitted.

A system and method for distributing packets in a network arc disclosed. The method comprises a step of receiving at least one data packet at a first node front a second node. The method also comprises a step of determining a current set of weights which are applied by the second node to distribute data packets across the first plurality of links. The received data packets are analysed to determine if the current set of weights are to be adjusted (step S102). When it is determined that the current set of weights is to be adjusted, an adjusted set of weights is generated by determining an adjustment factor (step S104). The adjustment factor is applied to the current weight for the selected link and at least one other current w eight in the current set of w eights.

A hierarchical wireless network is provided with a mesh backbone network portion and a switching tree network portion, The mesh backbone network portion includes first tier nodes each having at least one wireless link to another first tier node, The first tier nodes execute a link-state protocol for routing packets, The switching tree network portion includes second tier nodes each having a single wireless link to one first tier node and at least one wireless link to one third tier node, and third tier nodes each having a single wireless link to one second tier node. The second tier and the third tier nodes execute switching rules for switching packets,

A method of calculating a new route for a media data traffic flow on a computer network when a device is connected to the network, the network comprising a first and a second network switch connected by a link, the method comprising: determining whether media data traffic already flows between the first and second network switch over the link; applying a weighting to the link whose value is based on whether media data traffic already flows over the link; and determining the new route for media data traffic by using a least cost path generation algorithm using the weighting.

Systems and methods of mesh network communication enabling a relay node to autonomously select a packet propagation mechanism. Upon receiving a packet, which may carry an indication for flooding propagation as set by the edge node originating the packet, or carry no specification for any propagation mode, the relay node determines whether the packet is eligible for routing-propagation based on a number of factors, such as whether there is an existent valid route from the source node to the destination node, whether the packet is originated from a friend edge node, and whether a route discovery process has been initiated. Accordingly, the relay node may change the indication to routing propagation and forward it by routing-relaying. Thus, the packet can be propagated over the mesh network by routing propagation, despite the initial setting for flooding propagation as specified by the edge node or no setting by the edge node.

In some embodiments, a method receives a set of packets for a flow and determines a set of features for the flow from the set of packets. A classification of an elephant flow or a mice flow is selected based on the set of features. The classification is selected before assigning the flow to a network resource in a plurality of network resources. The method assigns the flow to a network resource in the plurality of network resources based on the classification for the flow and a set of classifications for flows currently assigned to the plurality of network resources. Then, the method sends the set of packets for the flow using the assigned network resource.