Intel Corporation

Marcin Spoczynski

Francesc Guim Bernat

Kshitij Arun Doshi

Nageen Himayat

Michael J Nolan

Michael J McGrath

Ned M Smith

Srikathyayani Srikanteswara

Alexander Bachmutsky

Keith A Ellis

Hao Feng

S M Iftekharul Alam

Yi Zhang

Brian A Keating

David Coates

Rajesh Poornachandran

Kapil Sood

Satish Chandra Jha

Rahul Khanna

Sanjay Bakshi

Maruti Gupta Hyde

Lokpraveen B Mosur

Mona Vij

Vesh Raj Sharma Banjade

Ravikumar Balakrishnan

Nilesh K Jain

Thijs Metsch

Christopher D Lucero

Trevor Cooper

Mustafa Akdeniz

Adrian C Hoban

Annie Ibrahim Rana

Radhika Loomba

Ben McCahill

Leonard Feehan

Daire Healy

Stiofáin Fordham

Sharon Ruane

Paul O'Neill

Dáire Healy

In one embodiment, a node of a data centric network (DCN) may receive a first service request interest packet from another node of the DCN, the first service request interest packet indicating a set of functions to be performed on source data to implement a service. The node may determine that it can perform a particular function of the set of functions, and determine, based on a backlog information corresponding to the particular function, whether to commit to performing the particular function or to forward the service request interest packet to another node. The node may make the determination further based on service delivery information indicating, for each face of the node, a service delivery distance for implementing the set of functions.

Queuing control for distributed compute network orchestration

System and techniques for geographic routing are described herein. A node receives a data packet that includes map data, a sequence of geographic areas to a requestor, and a target geographic area. The node may then determine that it is within the target geographic area and start a transmit timer based on a next-hop geographic area. Here, the next-hop geographic area is determined from the sequence of geographic areas in the data packet. The node may then counts how many other nodes from the geographic area sent data packets while the transmit timer is running. When the transmit timer expires, the node may transmit a modified data packet when the number of data packets is less than a predefined threshold. Here, the modified data packet is the data packet updated to include local map data and the next-hop geographic area.

Geographic routing

System and techniques for storage node recruitment in an information centric network (ICN) are described herein. An ICN node receives a storage interest packet that includes an indication differentiating the storage interest from other ICN interests. The ICN node forwards the storage interest packet and receives a storage data packet in response. Here, the storage data packet includes an indication that the storage data packet is not to be cached along with node information for a node that created the storage data packet. The ICN node may then transmit the storage data packet in accordance with a pending interest table (PIT) entry corresponding to the storage interest packet.

Storage node recruitment in an information centric network

A method of implementing distributed AI or ML learning for autonomous vehicles is disclosed. An AI or ML model specific to a location or a type of the location is generated at a vehicle. In response to a detection that the vehicle is within a proximity to a road side unit (RSU) associated with the location or the type of the location or the vehicle is within a proximity to an additional vehicle that is present or anticipated to be present at the location or the type of the location, causing an AI or ML model transmission to the additional vehicle or the RSU. Based on the causing the AI or ML model reception, causing deployment of an additional AI or ML model in the vehicle to optimize the vehicle for the location or the type of the location.

Distributed learning to learn context-specific driving patterns

An apparatus is disclosed to compress packets, the apparatus comprising; a data analyzer to identify a new destination address and a protocol identifier of an input packet corresponding to a new destination node and a communication system between the new destination node and a source node; a compression engine to utilize a plurality of compression functions based on the new destination address and the protocol identifier and reduce a size of the input packet; a compression analyzer to identify a reduced packet and a compression function identifier corresponding to the reduced packet, the compression function identifier associated with one of the compression functions; and a source modifier to construct a packet to include the compression function identifier by modifying unregistered values of a protocol identifier by a difference associated with the compression function identifier, the packet to inform the new destination node of a compression function.

Methods and apparatus to compress packets in a computing environment

Various approaches for implementing platform resource management are described. In an edge computing system deployment, an edge computing device includes processing circuitry coupled to a memory. The processing circuitry is configured to obtain, from an orchestration provider, an SLO (or SLA) that defines usage of an accessible feature of the edge computing device by a container executing on a virtual machine within the edge computing system. A computation model is retrieved based on at least one key performance indicator (KPI) specified in the SLO. The defined usage of the accessible feature is mapped to a plurality of feature controls using the retrieved computation model. The plurality of feature controls is associated with platform resources of the edge computing device that are pre-allocated to the container. The usage of the platform resources allocated to the container is monitored using the plurality of feature controls.

Automated platform resource management in edge computing environments

Methods, apparatus, systems and articles of manufacture to determine provenance for data supply chains are disclosed. Example instructions cause a machine to at least, in response to data being generated, generate a local data object and object metadata corresponding to the data; hash the local data object; generate a hash of a label of the local data object; generate a hierarchical data structure for the data including the hash of the local data object and the hash of the label of the local data object; generate a data supply chain object including the hierarchical data structure; and transmit the data and the data supply chain object to a device that requested access to the data.

Methods and apparatus to determine provenance for data supply chains

A method for distributing at least one computational process amongst shared resources is proposed. At least two shared resources capable of performing the computational process are determined. According to the method, a workload characteristic for each of the shared resources is predicted. The workload characteristic accounts for at least two subsystems of each shared resource. One of the at least two shared resources is selected based on the predicted workload characteristics.

Method for distributing a computational process, workload distribution device and system for distributing a computational process

A non-transitory computer-readable storage medium, an apparatus, and a computer-implemented method to select respective physical infrastructure devices of an edge computing system to implement services requested by respective service-requesting clients. The computer-readable storage medium includes computer-readable instructions that, when executed, cause at least one processor to perform operations comprising, for each candidate physical infrastructure device, calculating a utility score corresponding to each of the services requested, wherein: the utility score corresponds to one of each of the respective service-requesting clients or each subgroup of a plurality of subgroups of the respective service-requesting clients. The utility score is based on location-related attributes and resource-related attributes of said each candidate physical infrastructure device, resource-related attributes of said each of the services requested, and location-related attributes and movement-related attributes of one of said each of the respective service-requesting clients or said each subgroup of the plurality of subgroups of the respective service-requesting clients.

Computer-readable storage medium, an apparatus and a method to select access layer devices to deliver services to clients in an edge computing system

A non-transitory computer-readable storage medium, an apparatus, and a computer-implemented method. The computer-readable storage medium is of an edge computing system and is to identify a target edge node for deployment of a workload thereon. The computer-readable storage medium further comprises computer-readable instructions that, when executed, cause at least one processor to perform operations comprising: determining whether respective ones of candidate target edge nodes of a set of candidate target edge nodes of the edge computing system support workload determinism key performance indicators (KPIs) of the workload; in response to a determination that one or more candidate target edge nodes support the workload determinism KPIs, selecting a target edge node from the one or more candidate edge nodes; and causing the workload to be deployed at the target edge node.

Method, system and product to implement deterministic on-boarding and scheduling of virtualized workloads for edge computing

Example methods, apparatus, systems and articles of manufacture (e.g., physical storage media) to change a time sensitive networking schedule implemented by a softswitch are disclosed. Example apparatus disclosed herein to change a time sensitive networking schedule implemented by a first softswitch on a compute node include a network node configurator to deploy a second softswitch on the compute node based on a first configuration specification associated with the first softswitch, configure the second softswitch to implement an updated time sensitive networking schedule different from the time sensitive networking schedule implemented by the first softswitch, and replace the first softswitch with the second softswitch in response to a determination that a first set of constraints is met for simulated network traffic processed by the second softswitch based on the updated time sensitive networking schedule. Disclosed example apparatus also include a simulator to apply the simulated network traffic to the second softswitch.

Changing a time sensitive networking schedule implemented by a softswitch

Growing community of inventors

Lexilip, Ireland

Marcin Spoczynski