H04L45/48

WIRELESS AD HOC NETWORK ASSEMBLY USING NETWORK CODING
20180007728 · 2018-01-04 · ·

A method of setting up a wireless ad hoc network includes constructing an initial network graph by a source device. The network graph represents the source device, at least one intermediate device, and at least one communication path between the source device and the intermediate device. The initial network graph is sent from the source device to the intermediate device along with an update request. The source device receives a second network graph from the intermediate device in response to sending the initial network graph, and determines an updated network graph by performing a union of the initial network graph and the second network graph. The process is performed by each intermediate device required to reach a destination device.

Controller, computer program and method for calculating host specific network paths
11711295 · 2023-07-25 · ·

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.

METHOD FOR A SWITCH-INITIATED SDN CONTROLLER DISCOVERY AND ESTABLISHMENT OF AN IN-BAND CONTROL NETWORK

Controller(s) in a software defined network (SDN) are able to determine a control path towards each network switch by performing a switch-originated discovery and using an in-band control network that is an overlay on the data network. A topology tree is maintained, where each controller being the root of the tree, and where messages from the root to any switch may pass through neighboring switches to reach that switch (and vice-versa). Each switch in the SDN attempts to connect to the controller when it does not have a readily configured control connection towards the controller. Once the controller learns about the presence of a new switch and at least one or more paths to reach that switch through a novel discovery process, it can select, adjust and even optimize the control path's route towards that switch.

Network protocol for battery powered devices within a wireless network

A network system includes a main network implementing a conventional network protocol and a BPD subtree implementing a custom network protocol. The main network comprises a plurality of MPD nodes, the conventional network protocol being configured for MPD nodes. The BPD subtree comprises a plurality of BPD nodes, the custom network protocol being configured for BPD nodes. The custom network protocol defines smaller and simpler subtrees relative to the conventional network protocol. As a result, the custom network protocol defines less complex functions relative to the conventional network protocol, including functions for discovery, messaging, and loop management. A root node of the BPD subtree is connected with an MPD node of the main network and one or more descendant nodes of the BPD subtree. The root node implements the conventional network protocol and the custom network protocol.

Network protocol for battery powered devices within a wireless network

A network system includes a main network implementing a conventional network protocol and a BPD subtree implementing a custom network protocol. The main network comprises a plurality of MPD nodes, the conventional network protocol being configured for MPD nodes. The BPD subtree comprises a plurality of BPD nodes, the custom network protocol being configured for BPD nodes. The custom network protocol defines smaller and simpler subtrees relative to the conventional network protocol. As a result, the custom network protocol defines less complex functions relative to the conventional network protocol, including functions for discovery, messaging, and loop management. A root node of the BPD subtree is connected with an MPD node of the main network and one or more descendant nodes of the BPD subtree. The root node implements the conventional network protocol and the custom network protocol.

Server-assisted routing in network communications
11711296 · 2023-07-25 · ·

A network node device and method of determining a communication route to one or more other network nodes through a network. The method includes sending current routing information to a network management server (NMS), and receiving new or supplemental routing information from the NMS, this supplemental routing information determined by the NMS based on the current routing information of the network node and the other network node(s). The supplemental routing information may include lateral route information identifying designated routing nodes that form lateral band(s) of nodes that span the network. Each lateral band may include gate node(s) as entrances/exits to the lateral band. The method further includes determining, based on the supplemental routing information, a route to one or more of the other network nodes, which may include an optimal path and/or alternate path(s) from the network node to one or more of the other network nodes.

Server-assisted routing in network communications
11711296 · 2023-07-25 · ·

A network node device and method of determining a communication route to one or more other network nodes through a network. The method includes sending current routing information to a network management server (NMS), and receiving new or supplemental routing information from the NMS, this supplemental routing information determined by the NMS based on the current routing information of the network node and the other network node(s). The supplemental routing information may include lateral route information identifying designated routing nodes that form lateral band(s) of nodes that span the network. Each lateral band may include gate node(s) as entrances/exits to the lateral band. The method further includes determining, based on the supplemental routing information, a route to one or more of the other network nodes, which may include an optimal path and/or alternate path(s) from the network node to one or more of the other network nodes.

Host Routed Overlay with Deterministic Host Learning and Localized Integrated Routing and Bridging

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

Host Routed Overlay with Deterministic Host Learning and Localized Integrated Routing and Bridging

Systems, methods, and devices for improved routing operations in a network computing environment. A system includes a virtual customer edge router and a host routed overlay comprising a plurality of host virtual machines. The system includes a routed uplink from the virtual customer edge router to one or more of the plurality of leaf nodes. The system is such that the virtual customer edge router is configured to provide localized integrated routing and bridging (IRB) service for the plurality of host virtual machines of the host routed overlay.

Systems and methods for routing and topology management of computer networks with steerable beam antennas

This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.