Boot server support in an enterprise fabric network may be provided. A border device may forward, to a configuration server, a discovery message associated with a client device and the border device may forward, to a pre-boot server, the discovery message associated with a client device. The border device may then encapsulate, in response to receiving a reply to the discovery message from the configuration server and in response to receiving a reply to the discovery message from the pre-boot server, the reply to the discovery message from the pre-boot server using a Routing Locator (RLOC) from the reply to the discovery message from the configuration server. The encapsulated reply to the discovery message from the pre-boot server may include boot information. The border device may then forward the encapsulated reply to the discovery message from the pre-boot server to an edge device associated with the client device.

Boot server support in an enterprise fabric network may be provided. A border device may forward, to a configuration server, a discovery message associated with a client device and the border device may forward, to a pre-boot server, the discovery message associated with a client device. The border device may then encapsulate, in response to receiving a reply to the discovery message from the configuration server and in response to receiving a reply to the discovery message from the pre-boot server, the reply to the discovery message from the pre-boot server using a Routing Locator (RLOC) from the reply to the discovery message from the configuration server. The encapsulated reply to the discovery message from the pre-boot server may include boot information. The border device may then forward the encapsulated reply to the discovery message from the pre-boot server to an edge device associated with the client device.

A device includes a microcontroller and communications logic to identify data to be sent to another device and encapsulate the data in a data link layer frame of a wireless data link layer protocol. The data link layer frame includes a particular field and the particular field encapsulates Internet Protocol (IP) packet data, and the data is encapsulated in the IP packet data. The device further includes a transmitter to send the data to the other device over a one-hop radio link according to a low power wide area (LPWA) protocol, and the data link layer frame is sent in a physical layer frame of the LPWA protocol.

A communication method implemented by a first router of an autonomous system using an interior gateway protocol. The method includes determining at least one flow control parameter for sending messages of the interior gateway protocol to the first router, the at least one flow control parameter being determined based on capacity of the first router to process the messages of the interior gateway protocol; and announcing, in a message of the interior gateway protocol, the at least one control parameter to at least a second router of the autonomous system, which is a neighbor of the first router.

Techniques are described for supporting multiple virtual networks over an underlay network. The techniques may provide support for network slicing and enhanced virtual private networks (VPNs) over the underlay network. In general, the techniques include allocating a subset of resources (e.g., nodes and/or links) of the underlay network to a particular virtual network, and advertising the subset of resources to provider edge (PE) routers that are participating in the virtual network. A network controller device may advertise the subset of resources for the virtual network to the respective PE routers using BGP-LS (Border Gateway Protocol-Link State). Based on the advertisements, each of the PE routers generates a restricted view of the full underlay network topology for the virtual network and, thus, only uses the subset of resources in the restricted view to generate routing and forwarding tables for the virtual network.

Described are techniques for efficiently traversing a tree data structure to determine responses to queries by first dividing the tree data structure into linear chains of nodes. Linear chains may be formed by beginning at an initial node, including the child node of the initial node that has the largest number of descendant nodes, and proceeding to include child nodes associated with the largest number of descendant nodes until a node lacking child nodes is reached. Additional chains may then be formed by beginning at an initial node not included in previous linear chains and repeating the process. Responsive to a received query, traversal of each linear chain encountered along a query path may be performed more efficiently than other traversal algorithms that traverse a tree data structure until an end node is reached.

Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols. Various example embodiments for supporting sparse link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols by supporting distributed establishment of a sparse link-state flooding topology. Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols based on processes for enabling routers to identify and clamp onto a sparse link-state flooding topology. Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols based on use of an anchor node for a sparse link-state flooding topology and based on processes for enabling routers to identify and clamp onto a sparse link-state flooding topology based on identification of paths to the anchor node for the sparse link-state flooding topology.

Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols. Various example embodiments for supporting sparse link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols by supporting distributed establishment of a sparse link-state flooding topology. Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols based on processes for enabling routers to identify and clamp onto a sparse link-state flooding topology. Various example embodiments for supporting link-state flooding for routing protocols may be configured to support sparse link-state flooding for routing protocols based on use of an anchor node for a sparse link-state flooding topology and based on processes for enabling routers to identify and clamp onto a sparse link-state flooding topology based on identification of paths to the anchor node for the sparse link-state flooding topology.

The computer implemented invention provides a method, corresponding systems and arrangement within a network for detecting changes in the topology, ordering those changes by occurrence and constructing a new topology reflecting the changes. The invention addresses problems with keeping the knowledge of the network topology at each network node current, particularly when the network topology is dynamic, i.e. when links fail and recover at arbitrary times. The topology updating is event driven, as it is activated when some change in the network, particularly with nodes and links occurs. Events cause topology changes to be reported to other nodes in the network. Timestamping of messages allows the messages to be correctly applied as the most recent update or discarded. An algorithm is provided that allows each merchant node to maintain a correct view of the network topology despite link and node failures.

A method for distributing network function (NF) topology information among proxy nodes and for using the NF topology information for inter-proxy node message routing includes configuring a first proxy node as a leader service communications proxy (SCP). The method further includes configuring a plurality of second proxy nodes as worker proxy nodes. The method further includes registering the worker proxy nodes with the leader SCP. The method further includes subscribing, by the worker proxy nodes and with the leader SCP, to receive NF topology information from the leader SCP. The method further includes, at the leader SCP, receiving NF topology information from the worker proxy nodes and communicating the NF topology information to the worker proxy nodes subscribed to receive the NF topology information. The method further includes, at the worker proxy nodes, using the NF topology information to route messages to proxy nodes serving destination NFs.