DETERMINISTIC INFORMATION PULL AND AGGREGATION IN A DESTINATION-ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) TOPOLOGY

Techniques are presented herein that support a deterministic collection method in the form of a scheduled pull mechanism, whereby a collection point may compute a schedule and then distribute the same so that all of the collecting nodes and network nodes can optimally transmit, aggregate, and relay information to the collection point. Under aspects of the presented techniques, a distributed set may be organized as a Destination-Oriented Directed Acyclic Graph (DODAG) topology to the collection point. The above-described schedule may then be generated whereby the DODAG parents emit only after all of their children (and, recursively, all of their descendants) have emitted. Under such an approach, an application-aware parent can aggregate (or factorize) the data and consume minimal bandwidth. A second schedule may be generated just for missing data, accounting only for the sources where information was lost, so that retry operations comprise smaller schedules

OVERRIDING DETERMINISTIC FLOWS

Real aging is not desirable for Deterministic Network (DetNet) flows. Defined herein are new techniques that provide a similar service for DetNet flows. The new techniques involve: utilizing new Quality of Service (QoS) values to indicate a packet that is a normal DetNet packet versus a reclassified packet; reclassifying a DetNet packet to a higher priority to avoid discarding N contiguous packets of the flow; ensuring that a reclassified packet progresses through automatic repeat request (ARQ) methods; and declassifying a DetNet packet to a lower priority rather than discarding it using IP-in-IP encapsulation and a deadline header with a deadline that is computed on the fly based on the remaining time till the bounded time of delivery for the packet

TEMPORAL ROUTING IN DELAY TOLERANT NETWORKS

In conventional network environments, routing implies a stable world in which the vision of a next hop is consistent with the vision a forwarding node, so that a packet can progress, for example, in a greedy fashion that reduces a remaining cost at each hop, to a destination. However, in the world of mobile delay tolerant networking (DTN), nodes can move in any direction, nodes may forward packets when they meet a peer, and may move in between such actions. Thus, the relative position of nodes can change between meeting such that it can become difficult to compute a physical path based on a position of all nodes. Techniques presented herein propose a foundational routing to the future model for mobile DTN nodes that may enable predictable rendezvous among such nodes. During operation, a router can, for example, compute a route along rendezvous points while optimizing for the total latency, energy, and chances of delivery based on the probability of the rendezvous to effectively occur

RELIABLE WIRELESS SOLUTION FOR TIME-CRITICAL COMMUNICATIONS IN SMART UTILITY ENVIRONMENTS

The Generic Object Oriented Substation Event (GOOSE) protocol is a communication model that is defined by the International Electrotechnical Commission (IEC) 61850 standard which supports the sharing of time-critical information between Intelligent Electronic Devices (IEDs) within a substation. Due to strict requirements, GOOSE demands a fast, reliable, and deterministic network, which today is based on Ethernet networking technologies. Customers desire an alternative solution that is based on wireless radio technologies such as, for example, mesh-based networks. However, for a variety of reasons, it can be challenging to implement GOOSE over a wireless medium. Techniques are presented herein that support a reliable wireless solution for time-critical communication facilities such as GOOSE. Aspects of the presented techniques encompass using several radios coupled with an intelligent assignment of radio channels to avoid interference and employing duplication over such radios to carry critical information between IEDs. Use of the presented techniques yields an important level of determinism that allows critical information (such as GOOSE type 1A messages) to be carried over a wireless medium

ENHANCED NETWORK SLICING FOR INDUSTRIAL AND ENERGY PROTOCOLS

With the development of industry 4.0 and the recent evolution of the substation automation, as prescribed at least by the International Electrotechnical Commission (IEC) 61850 Standard, the network is becoming one of the key element of these trends. Network design and network architecture are becoming more and more complex and leading to challenging problems and issues, such as network security, multiplication of unmanaged broadcast domains, and bandwidth limitations. Recent tools have been introduced to help network engineers visualize different industrial Internet of Things (IIoT) protocol flows and characterizations for devices connected to the network. However, visualization is not enough and any help in the design and configuration of the network would be a great differentiator. Techniques herein provide for the ability to utilize sensors to build a network map of industrial and power data flows. The network map can then be used to configure different network slices with guaranteed bandwidth and flow isolation

SELECTIVE FORWARD ERROR CORRECTION WITH FULL DUPLEX FEEDBACK LOOP

Numerous techniques exist for detecting and correcting errors that are introduced during the transmission of information (e.g., a data frame) between two pieces of network equipment, including, for example, forward error correction (FEC), cyclic redundancy check (CRC), hybrid automatic repeat request (HARQ), etc. Use of such techniques carries a cost, often shared between the transmitter and the receiver, comprising increased latency, consumption of bandwidth, the use of computational resources for verification and correction, etc. Techniques are presented herein that support a new method for detecting and correcting errors that leverages a return channel of a bidirectional radio environment to provide a feedback loop through which FEC may be focused just on the areas of a frame that are poorly received, thereby avoiding the latency, bandwidth, etc. costs that would be associated with retransmission of areas of the frame that are well received. The techniques presented herein build on new capabilities of full duplex radios and apply to, for example, Wi-Fi® 6 and 7 and Third Generation Partnership Project (3GPP) Fifth Generation (5G) networks

ENHANCED HOST DISCOVERY IN SDN/FABRIC-BASED NETWORKS

Various solutions are provided herein to facilitate the efficient discovery of hosts in large network environments, such as software-defined networking (SDN) or fabric-based networks, utilizing several techniques. A first technique supports the ability to efficiently manage silent ports and silent media access control (MAC) addresses. This technique involves applying a novel heuristic to ports and MAC addresses, classifying such entities (as silent, quiet, and noisy), and intelligently polling such entities. A second technique supports a Multicast Listener Discovery (MLD)-based host discovery approach that is applicable to Internet Protocol (IP) version 4 (IPv4) and involves a host creating an IP version 6 (IPv6) address that embeds its IPv4 address, the addition of a well-known first byte to the three bytes in a Solicited-Node multicast address (SNMA), and the use of a form of unicast ping to confirm whether a host formed a derived address. A third technique involves using a service lookup for deterministic host discovery that involves the use of upper-layer discovery services to cause a host to expose its addresses in the replies to multicast discoveries

PRESENCE VALIDATION USING SECURED INTERNET PROTOCOL (IP) ADDRESS

Various presence-based validation technologies exist that provide for the ability add identity and presence validation to a laptop-based system. However, these technologies are primarily limited to computers (e.g., desktops and laptops) and do not include location validation. There is a need to extend these capabilities to other devices connected to a network and also to eliminate the need for a hardware-assisted solution. There is also a need to offer network location to avoid any type of attack from devices that are not connected to a local area network (LAN) or even to the same port. This proposal provides a technique to ensure that a device/person is present at a location by observing that the device/person performed an activity on-site, which can be observed by a trusted third-party

ON-PATH DEPLOYMENT OF CONTAINERS FOR LOW-LATENCY HIGH-AVAILABILITY RELIABLE AND AVAILABLE WIRELESS (RAW) COMMUNICATION

In an industrial environment, a manufacturing plant is composed of, among other things, sensors, actuators, and controllers that form control loops. Such elements are often referred to as a programmable logic controller (PLC). Techniques are presented herein that allow manufacturing plants to achieve decreased latency and increased reliability by placing the PLCs in a sensor-controller-actuator system closer to each other while minimizing the deployment cost to the extent possible. This is achieved by deploying PLCs as moving containers in an access point (AP) for, as an example, wireless manufacturing plants. Aspects of the presented techniques dynamically deploy PLC applications and roam them in locations such that the number of hops between a sensor’s output, the control logic (e.g., a PLC), and an actuator’s input may be kept at a minimum to achieve the lowest latency and jitter and the maximum reliability. Further aspects of the presented techniques leverage elements of the Internet Engineering Task Force (IETF) Reliable and Available Wireless (RAW) initiative, a Path Computation Element (PCE), a Path Selection Engine (PSE), etc

CLOUD-NATIVE IPV4 OVER A NATIVE IPV6 CLOUD

Techniques presented herein provide a variation of Internet Engineering Task Force (IETF) Request For Comments (RFC) 8505 to register stub prefixes to a fabric, and also of RFC 6877 to combine Network Address Translation (NATing) and Internet Protocol (IP) version 4 (v4) to v6 and also v6 to v4 translation. The new operation provides for the ability to transport IPv4 cloud-native application flows between applications and services over an IPv6-only fabric without a change in the containers running the applications and services. The techniques further provide for the ability to load-balance services over the Internet, using a variation of RFC 1794 to obtain a /96 route to the cluster location and RFC 2391 to distribute the load over service instances (e.g., pods)