Methods, systems, and devices for wireless communications are described that provide for hop-count indication in an integrated access and backhaul (IAB) network. An IAB-node may adopt and indicate multiple values for hop-count. The hop-count may be conveyed by a number of different reference signals and channels. A resource pattern and/or a slot pattern may also be associated with the hop-count to simply signaling. By associating the patterns with the hop-count, an IAB-node may be able to infer the resource pattern used by another IAB-node.

Methods, systems, and devices for wireless communications are described that provide for hop-count indication in an integrated access and backhaul (IAB) network. An IAB-node may adopt and indicate multiple values for hop-count. The hop-count may be conveyed by a number of different reference signals and channels. A resource pattern and/or a slot pattern may also be associated with the hop-count to simply signaling. By associating the patterns with the hop-count, an IAB-node may be able to infer the resource pattern used by another IAB-node.

Various example embodiments for supporting an in-band control plane are presented. Various example embodiments for supporting an in-band control plane may be configured to support an in-band control plane in a Multiprotocol Label Switching (MPLS) network. Various example embodiments for supporting an in-band control plane in an MPLS network may be configured to support an in-band control plane in an MPLS network by supporting exchange of control protocol packets of control protocols as MPLS packets, such that the control protocol messaging is in-band along the MPLS data plane itself. Various example embodiments for supporting an in-band control plane in an MPLS network may be configured to support an in-band control plane in an MPLS network by supporting communication of MPLS packets that encapsulate control protocol messages of control protocols with an MPLS label which indicates that the payloads of the MPLS packets carry the control protocol messages of the control protocols.

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

An example method for dynamic packet routing using prioritized groups includes: receiving, by a processing device, routing information specifying a plurality of paths to a network destination, wherein each path is associated with a respective cost metric value; associating a first subset of the plurality of paths with a first priority routing group for the network destination, wherein each path of the first subset satisfies a first cost criterion based on a cost metric value of the path; associating a second subset of the plurality of paths with a second priority routing group for the network destination, wherein each path of the second subset satisfies a second cost criterion; and storing, in a forwarding information data structure, a first definition of the first priority routing group and a second definition of a second priority routing group.

User traffic is processed in a virtualised network. First and second VNFs are initialised in the same network namespace as each other in user space in a host and have access to a shared memory region of the host. The first VNF processes user traffic and the second VNF provides a user plane service in relation to user traffic processed by the first VNF. The first VNF is used to establish a point-to-point, shared-memory interface between the first and second VNFs and is used to classify incoming user traffic. In response to the first VNF determining based on the classifying, that the incoming user traffic is to be subject to the user plane service, the first VNF is used to store the incoming user traffic in the shared memory region of the host to enable the second VNF to provide the user plane service in relation to the incoming trier traffic.

Systems and methods for establishing routing information between software containers or other virtualized environments within a network, and providing inter-container routing between the software services operating on the network, are disclosed herein. The system utilizes an existing routing protocol such as Open Shortest Path First (OSPF) and establishes an overlay network that provides end-to-end connectivity between services of a customer operating in an Infrastructure as a Service (IaaS) network, while maintaining isolation from the traffic of other customers of the IaaS network. The system uses OSPF to learn aspects of the routes between containers in the network, and further builds a customer-specific overlay network based on IP-to-IP encapsulation of the OSPF messages.

Systems and methods for establishing routing information between software containers or other virtualized environments within a network, and providing inter-container routing between the software services operating on the network, are disclosed herein. The system utilizes an existing routing protocol such as Open Shortest Path First (OSPF) and establishes an overlay network that provides end-to-end connectivity between services of a customer operating in an Infrastructure as a Service (IaaS) network, while maintaining isolation from the traffic of other customers of the IaaS network. The system uses OSPF to learn aspects of the routes between containers in the network, and further builds a customer-specific overlay network based on IP-to-IP encapsulation of the OSPF messages.

The present invention provides a cable planning method based a fast marching method applied with simulated annealing (FMM/SA) algorithm. In the FMM/SA algorithm-based cable planning method, the FMM used to obtain the optimal submarine cable path with the lowest life-cycle cost, and the SA algorithm is used to continuously adjust the weight of each design consideration with the aim to achieve an optimal cable path that is as close as possible to a real-life cable path which has a history of cost-effectiveness and resilience. The set of weights contributed to the optimal cable path is then used as an optimal set of weights of design considerations for cable path planning. The FMM/SA algorithm-based cable planning method can provide a computationally effective approach which has lower computation costs and better performance in generating cable paths with optimal life-cycle cost and reliability.