# US 2024/0205153 A1 · Distributed software-defined network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0205153 A1
- Document ID: US20240205153A1
- Status: Published application
- Kind: A1
- Application number: 18/418,000
- Filed: 2024-01-19
- Published: 2024-06-20
- Earliest claimed: 2022-04-25
- Assignees: Mimyr, LLC
- Applicants: Mimyr, LLC
- Inventors: Robert Kunc; Andrew Hung; David Wang; Michael Mavraganis
- Web page: https://patentgrep.com/patent/US20240205153A1

## CPC

- H04L 45/76: Routing in software-defined topologies, e.g. routing between virtual machines
- H04L 41/0226: Mapping or translating multiple network management protocols
- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 41/0816: the condition being an adaptation, e.g. in response to network events
- H04L 41/122: of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
- H04L 45/02: Topology update or discovery
- H04L 45/74: Address processing for routing
- H04L 69/08: Protocols for interworking; Protocol conversion
- H04L 69/22: Parsing or analysis of headers
- H04W 24/02: Arrangements for optimising operational condition
- H04W 40/02: Communication route or path selection, e.g. power-based or shortest path routing
- H04L 41/0823: characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02)
- H04L 41/0893: Assignment of logical groups to network elements
- H04L 41/0894: Policy-based network configuration management
- H04L 41/0895: Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
- H04L 43/0811: by checking connectivity
- H04L 43/0852: Delays
- H04L 43/0876: Network utilisation, e.g. volume of load or congestion level
- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 43/20: the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

This application relates to a distributed software-defined network (“DSDN”) for dynamically configuring and managing a wireless communication network. A plurality of DSDN nodes are connected to each other via a plurality of communication paths. Each communication path directly connects two DSDN nodes. Each DSDN node can provide DSDN configurations across diverse and disparate networks by normalizing its data plane network traffic through translation and packet encapsulation. Furthermore, the DSDN node can provide an architecture tolerant of network interruptions and network system fluctuations. For example, in the case of any one of the DSDN node's network interruptions from other DSDN nodes, the DSDN can provide network reconfiguration using network configuration rules stored in a control plane of each DSDN node. Therefore, various embodiments can increase network reliability by the multiple nodes within a software-defined network independently managing its control plane in response to changed network conditions.

## Claims

### Claim 1

A system for communicating data in a distributed software-defined network (DSDN), including a plurality of DSDN nodes, the system comprising:
a main DSDN node configured to be selected from the plurality of DSDN nodes, the main DSDN node comprising a plurality sets of routing information to transmit and receive a plurality sets of data between the plurality of DSDN nodes, the main DSDN node configured to:
designate a DSDN source node and a DSDN destination node from the plurality of DSDN nodes, wherein the designation is predefined based on at least one set of routing information of the plurality sets of routing information and a set of data of the plurality sets of data, wherein the set of data is configured to be transmitted and received between the DSDN source node and the DSDN destination node;
identify one or more available DSDN nodes from the plurality of DSDN nodes, wherein each DSDN node of the one or more available DSDN nodes is directly or indirectly connected to the DSDN source node and the DSDN destination node;
create one or more communication paths between the DSDN source node and the DSDN destination node via the identified one or more available DSDN nodes;
analyze a quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
select a first optimal communication path between the DSDN source node and the DSDN destination node among the created one or more communication paths based on analysis results of the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node; and
transmit the set of data of the plurality of sets of data from the DSDN source node to the DSDN destination node via the first optimal communication path.

### Claim 2 (depends on 1)

The system of claim 1, wherein the DSDN source node and the DSDN destination node are connected via the one or more available DSDN nodes within two hops.

### Claim 3 (depends on 1)

The system of claim 1, wherein each set of the plurality sets of routing information includes data routing planning information for each set of the plurality sets of data.

### Claim 4 (depends on 1)

The system of claim 1, wherein the main DSDN node is configured to analyze the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node based on at least one of a path cost, a bandwidth, a latency, a link aggregation, or a redundancy.

### Claim 5 (depends on 1)

The system of claim 1, wherein the main DSDN node is further configured to monitor the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node in real-time.

### Claim 6 (depends on 1)

The system of claim 1, wherein the main DSDN node is configured to cause the designated DSDN source node to generate the set of data in a standard IP format by:
obtaining primitive data having a data protocol from one or more devices communicatively coupled with the DSDN source node, wherein the data protocol has a non-standard internet protocol (IP);
extracting a destination node identifier, a data payload, and an additional data traffic management policy from a header of the data protocol;
replicating the destination node identifier, the data payload, and the additional data traffic management policy; and
inserting the replicated destination node identifier, the data payload, and the additional data traffic management policy into corresponding fields of the standard IP.

### Claim 7 (depends on 1)

The system of claim 1, wherein the main DSDN node is further configured to:
in response to detecting a degradation of the quality of the first optimal communication path, create a second optimal communication path by re-analyzing a quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
activate the second optimal communication path by deactivating one or more remaining communication paths; and
transmit the set of data from the DSDN source node to the DSDN destination node via the second optimal communication path.

### Claim 8 (depends on 1)

The system of claim 1, wherein the main DSDN node comprises an application layer, a transport layer, and a data layer.

### Claim 9 (depends on 8)

The system of claim 8, wherein the data layer is configured to store each set of routing information of the plurality sets of routing information in a form of a routing table.

### Claim 10 (depends on 1)

The system of claim 1, wherein the main DSDN node is further configured to activate the first optimal communication path by deactivating one or more remaining communication paths of the created one or more communication paths between the DSDN source node and the DSDN destination node.

### Claim 11 (depends on 1)

The system of claim 1, wherein the main DSDN node is further configured to:
determine a second optimal communication path between the DSDN source node and the DSDN destination node among the created one or more communication paths based on analysis results of the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
monitor a quality of the first optimal communication path while transmitting the set of data from the DSDN source node to the DSDN destination node via the first optimal communication path;
in response to monitoring results of the quality of the first optimal communication path indicating a communication path quality degradation, dynamically activate the second optimal communication path by deactivating the first optimal communication path; and
continuously transmit remaining data of the set of data from the DSDN source node to the DSDN destination node via the second optimal communication path.

### Claim 12

A method of communicating data in a distributed software-defined network (DSDN) including a plurality of DSDN nodes, the method comprising:
designating a DSDN source node and a DSDN destination node from the plurality of DSDN nodes, wherein the designation is predefined based on at least one set of routing information of a plurality sets of routing information stored in a main DSDN node selected from the plurality of DSDN nodes, and wherein the at least one set of routing information of the plurality sets of routing information include routing information of one or more sets of data to be transmitted and received between the DSDN source node and the DSDN destination node;
identifying one or more available DSDN nodes from the plurality of DSDN nodes, wherein each DSDN node of the one or more available DSDN nodes is directly or indirectly connected to the DSDN source node and the DSDN destination node;
creating one or more communication paths between the DSDN source node and the DSDN destination node via the identified one or more available DSDN nodes;
analyzing quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
selecting a first optimal communication path between the DSDN source node and the DSDN destination node among the created one or more communication paths based on analysis results of the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
activating the first optimal communication path by deactivating one or more remaining communication paths of the created one or more communication paths between the DSDN source node and the DSDN destination node; and
transmitting at least one set of data of the one or more sets of data from the DSDN source node to the DSDN destination node via the first optimal communication path.

### Claim 13 (depends on 12)

The method of claim 12, wherein the DSDN source node and the DSDN destination node are connected via the one or more available DSDN nodes within two hops.

### Claim 14 (depends on 12)

The method of claim 12, wherein the quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node is analyzed based on at least one of a path cost, a bandwidth, a latency, a link aggregation, or a redundancy.

### Claim 15 (depends on 12)

The method of claim 12, wherein the main DSDN node is further configured to monitor the quality of the first optimal communication path in real-time.

### Claim 16 (depends on 12)

The method of claim 12, wherein each set of data of the one or more sets of data include a standard IP format generated by:
obtaining primitive data having a data protocol from one or more devices communicatively coupled with the DSDN source node, wherein the data protocol has a non-standard internet protocol (IP);
extracting a destination node identifier, a data payload, and an additional data traffic management policy from a header of the data protocol;
replicating the destination node identifier, the data payload, and the additional data traffic management policy; and
inserting the replicated destination node identifier, the data payload, and the additional data traffic management policy into corresponding fields of the standard IP.

### Claim 17 (depends on 12)

The method of claim 12, the method further comprising:
in response to detecting a degradation of the quality of the first optimal communication path, creating a second optimal communication path by re-analyzing a quality of each communication path of the created one or more communication paths between the DSDN source node and the DSDN destination node;
activating the second optimal communication path by deactivating remaining one or more communication paths; and
transmitting the at least one set of data of the one or more sets of data from the DSDN source node to the DSDN destination node via the second optimal communication path.

### Claim 18 (depends on 12)

The method of claim 12, wherein the main DSDN node comprises an application layer, a transport layer, and a data layer.

### Claim 19 (depends on 18)

The method of claim 18, wherein the data layer is configured to store the plurality sets of routing information in a form of a routing table.

### Claim 20 (depends on 12)

The method of claim 12, wherein a full bandwidth is allocated to the first optimal communication path by deactivating the one or more remaining communication paths between the DSDN source node and the DSDN destination node.

### Claim 21 (depends on 12)

A non-transitory computer readable medium storing instructions, when executed by one or more processors, configured to perform the method of claim 12.
