Nokia Solutions and Networks Oy

Alcatel Lucent

Nokia of America Corporation

Nokia Technologies Oy

Alcatel-lucent USA Inc.

Sameerkumar V Sharma

Andrea Francini

Bruce Cilli

Bilgehan Erman

Edward Grinshpun

Ejder Bastug

David Faucher

Raymond Miller

Charles Payette

Theodore Sizer

Paul Albin Wilford

Cinzia Sartori

Stepan Kucera

Koen De Schepper

Vijay Kumar Gurbani

Olivier Tilmans

Larry Hsiao Chang

Marty Reiman

Koon Wah Yick

Rajeev Kumar

Ahmad Asghar

Mahmoud Ashour

Peter Andrews

Joseph D Beshay

Aspects described herein relate to various methods, systems and apparatuses that can be used to define a network slice based on descriptions of the computing functions involved in a network service, and to configure the network slice using resources that are associated with the descriptions. For example, a network slice may be defined based on whether the network service requires tunneling or data encryption. The network slice may be configured using resources that perform those tunneling and data encryption functions.

Configuring network slices

Various example embodiments for supporting multi-tier deterministic networking are presented. Various example embodiments for supporting multi-tier deterministic networking may be configured to support provisioning of deterministic flows in multi-tier deterministic networking. Various example embodiments for supporting multi-tier deterministic networking may be configured to support adaptive deterministic routing in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support score-based deterministic routing in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support adaptive deterministic routing and/or score-based deterministic routing in multi-tier deterministic networks based on analysis of a state representation for path and/or sub-path selection in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support hierarchical resource allocation and deallocation in multi-tier deterministic networking, optimal route finding in multi-tier deterministic networking, and so forth.

Multi-tier deterministic networking

Various embodiments relate to a path computation element (PCE) configured to control a network having ingress edge nodes, interior nodes, and egress edge nodes, including: a network interface configured to communicate with the network; a memory; and a processor coupled to the memory and the network interface, wherein the processor is further configured to: receive a request for a first continuous guaranteed latency (CGL) flow to be carried by the network; make routing and admission control decisions for the requested first CGL flow without provisioning of the first CGL flow and the configuration of schedulers in the interior nodes of the network; and provide flow shaping parameters to a flow shaper at an ingress edge node of the first CGL flow.

Software-defined guaranteed-latency networking

An application specific interface (AA-NAPI) associated with an application for the purpose of controlling the networking aspects of the application session is provided by communication service provider (CSP). Cost model of network service types associated with a specific application type is learned by using the AA-NAPI. For each service-point joining the session, network properties are queried by using the AA-NAPI. During continuous service quality monitoring, upon detection of quality degradation leading to the decision to upgrade session quality, network service-type associated with a specific server-point is changed by using the AA-NAPI. Network specific actions are taken to reconfigure the network so that the requested service type is received by the specific service-point. New network capability is activated to improve network service level by using the AA-NAPI. Network specific actions are taken by the network to install new network capabilities so that the specific service-point's service quality is improved as requested.

Method, an apparatus and a computer program product for network-as-a-service model

Various example embodiments for supporting queue management in communication systems are presented. Various example embodiments for supporting queue management in communication systems may be configured to support application-based queue management. Various example embodiments for supporting application-based queue management may be configured to support application-based congestion control. Various example embodiments for supporting application-based congestion control may be configured to support application-based congestion control based on use of trigger templates.

Application-based queue management

Various example embodiments for supporting dynamic node cluster discovery in a communication network are presented. Various example embodiments for supporting dynamic node cluster discovery in a communication network may be configured to support dynamic node cluster discovery based on circulation of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery based on the circulation of discovery messages within the communication network may be configured to support dynamic node cluster discovery based on probabilistic forwarding of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery based on the circulation of discovery messages within the communication network may be configured to support dynamic node cluster discovery based on updating and forwarding of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery in a communication network may be configured to support dynamic, multi-level node cluster discovery.

Dynamic node cluster discovery in an unknown topology graph

The method includes receiving first video data and network performance information from at least one first agent node associated with at least one first camera, determining event detection information based on the first video data and the network performance information, determining a slice configuration for at least one network slice based upon the first video data, network performance information and the event detection information, and controlling an operation of the communication network by instantiating the at least one network slice based on the slice configuration information.

Method and system for automated dynamic network slice deployment using artificial intelligence

Various example embodiments for supporting flow reliability in deterministic networking are presented. Various example embodiments for supporting flow reliability in deterministic networking may be configured to support flow reliability in deterministic networking based on control over frame replication and elimination for deterministic flows. Various example embodiments for supporting flow reliability in deterministic networking based on control over frame replication and elimination for deterministic flows may be configured to control replication and elimination of redundant flows providing redundancy for deterministic flows based on dynamic activation and deactivation of the redundant flows based on monitoring of flow continuity of the deterministic flows. Various example embodiments for supporting flow reliability in deterministic networking based on control over frame replication and elimination for deterministic flows may be configured to support flow reliability in deterministic networking for non-hierarchical networks or hierarchical networks.

Flow reliability in multi-tier deterministic networking

Various example embodiments for supporting scalable deterministic services in packet networks are presented. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees (e.g., finite end-to-end delay bounds) for a class of traffic flows referred to as guaranteed-delay (GD) traffic flows. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees for GD traffic flows of a network based on a queuing arrangement that is based on network outputs of the network, a packet scheduling method that is configured to support scheduling of packets of the GD traffic flows, and a service rate allocation rule configured to support delay guarantees for the GD traffic flows.

Scalable deterministic services in packet networks

Systems, methods, apparatuses, and computer program products for packet latency reduction in mobile radio access networks. One method may include, when a buffer of a first sublayer of a wireless access link is empty and there is a new data unit in the first sublayer or when the first sublayer buffer is not empty and a data unit leaves a second sublayer buffer, comparing the number of data units currently stored in the second sublayer buffer with a queue length threshold that defines a total amount of space in the second sublayer buffer. When the number of data units currently stored in the second sublayer buffer is less than the queue length threshold, the method may also include transferring the data unit from the first sublayer to the second sublayer.

Packet latency reduction in mobile radio access networks

Various example embodiments for supporting packet scheduling in packet networks are presented. Various example embodiments for supporting packet scheduling in packet networks may be configured to support scheduling-as-a-service. Various example embodiments for supporting packet scheduling in packet networks based on scheduling-as-a-service may be configured to support a virtualized packet scheduler which may be provided as a service over a general-purpose hardware platform, may be instantiated in customer hardware, or the like, as well as various combinations thereof. Various example embodiments for supporting packet scheduling in packet networks may be configured to support scheduling of packets of packet queues based on association of transmission credits with timeslots of a periodic service sequence used to provide service to the packet queues.

Packet scheduling

A method for routing traffic between a source node and a destination node in a network comprises: identifying a first group level at which a source group vector and a destination group vector differ; obtaining one or more first route segments between a first source group and a first destination group at the first group level; computing an end-to-end route between the source node and the destination node based on at least the one or more first route segments; and routing traffic between the source node and the destination node on the end-to-end route.

Cluster oriented dynamic routing

Various example embodiments relate generally to supporting queuing of packets in a communication network. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets based on a packet queuing memory space including a hash entry space configured to maintain a set of H hash entries and a packet queue space configured to maintain a set of Q packet queues, wherein H is greater than Q. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets in a manner for handling packet events (e.g., packet arrival events, packet departure events, or the like) while preventing or mitigating queue collisions of hash entries (where a queue collision occurs when multiple hash entries, and the respective network flows of those hash entries, are associated with a single packet queue).

Packet queuing

The method includes transmitting request messages to at least one first network node, the request messages each including at least a sampling time-window and a network slice identifier, the sampling time-window defining a duration of time, the network slice identifier identifying a designated network slice within the communication network, receiving packet reports from the at least one first network node, the packet reports including latency information for packets that are processed by the at least one first network node during the sampling time-window for the designated network slice, and controlling the operation of the communication network based on the latency information.

Growing community of inventors

Murray Hill, NJ, United States of America

Sameerkumar V Sharma