Abstract: Systems and methods for traffic congestion avoidance may use cooperative autonomous driving based on vehicle-to-vehicle communication to resolve deadlock conditions. The method may include automatically detecting, by a given autonomous vehicle, that the given vehicle is deadlocked, initiating, by the given vehicle, formation of a coordination group including the given vehicle, a front vehicle traveling in the same driving lane as the given vehicle, and an assistant autonomous vehicle traveling in a lane adjacent to the lane in which the given vehicle and the front vehicle are traveling, and sending, by the given vehicle using vehicle-to-vehicle communication, a cooperative driving task request to initiate actions by the autonomous vehicles in the coordination group to resolve the deadlock condition. The actions may include modifying a driving plan of an autonomous vehicle in the coordination group and initiating a speed negotiation with an autonomous vehicle in the coordination group.

Abstract: Systems and methods for identifying a service region that includes sub-regions; calculating, for each pair of neighboring sub-regions, traffic data of computing devices traveling between the pair of sub-region; generating a directed graph representing the service region, the directed graph including nodes representing the sub-regions and the links between the nodes representing the first and the second traffic data; partitioning the directed graph into graph partitions, each graph partition including sub-graphs; calculating, for each sub-graph of each graph partition, a net traffic flow for the sub-graph based on a difference of the first and the second traffic data of the sub-regions that correspond to the nodes of the sub-graph; calculating, for each graph partition, a net traffic flow for the graph partition based on a summation of the net traffic flow of each sub-graph of the graph partition; identifying a particular graph partition having a smallest net traffic flow.

Abstract: Systems and methods for mapping service function chains to physical network resources include receiving a service function chain request specifying multiple service functions including a service access point, generating a service graph including service links between consecutive service functions, receiving resource information describing capabilities of physical network resources and a topology of the physical network, generating a resource graph including infra links between pairs of connected physical network resources, creating, dependent on the service graph and the resource graph, multiple solutions for mapping the service functions to the physical network resources, and outputting one or more mapping solutions. Each of generating the service graph, generating the resource graph, and creating the mapping solutions may be performed by one or instances of respective microservices that operate in parallel.

Abstract: Systems and methods for identifying a mapping solution for a virtual network request are disclosed. A resource orchestrator may receive a virtual network request specifying resources required on physical nodes in a network and generate a mapping solution for the request. Generating the mapping solution may include identifying vertices at which a first resource is available, mapping each identified vertex to the first resource in a respective candidate chaining solution, determining, for each identified vertex, a number of messages including the candidate chaining solution to be forwarded to respective neighbor vertices, and forwarding the determined number of messages to the respective neighbor vertices. Determining the number of messages to be forwarded may include applying a message forwarding policy to reduce the total number of messages forwarded between vertices when generating the mapping solution. The policy may be dependent on the topology of the virtual network request.

Abstract: Systems and methods for identifying a pair of nodes of a plurality of nodes of a virtual optical network (VON); identifying i) an optical route between the pair of nodes and ii) a desired availability of the optical route; determining a probability density function (PDF) of a signal-to-noise ratio (SNR) of a signal of the optical route; determining a SNR threshold such that an integration of the PDF of the SNR of the signal above the SNR threshold corresponds to the desired availability of the optical route; determining a plurality of spectral efficiencies that corresponds to the SNR threshold, each spectral efficiency of the plurality of spectral efficiencies associated with a respective modulation format of a plurality of modulation formats; and identifying a particular modulation format of the plurality of modulation formats that corresponds to a maximum spectral efficiency of the plurality of spectral efficiencies.

Abstract: A resource orchestration framework may include vertices representing physical network nodes and a resource orchestrator. The resource orchestrator may obtain a service function chain specifying, for multiple service functions, mappings of the service functions to respective physical nodes along a specified forwarding path, and a first starting time at which to instantiate resources for a first service function in the chain on the first mapped physical node. The resource orchestrator may instantiate the resources for the first service function on the first mapped physical node at the first starting time, prior to arrival of a first packet in a packet flow for the service function chain at the first mapped physical node and, subsequently, instantiate resources for a second service function in the chain on the second mapped physical node at a second starting time, prior to arrival of the first packet at the second mapped physical node.

Abstract: A resource orchestration framework may include vertices representing physical network nodes and a resource orchestrator. The resource orchestrator may receive a service function chain request specifying service functions to perform on respective physical nodes and a first starting time for launching a first one of the service functions. The resource orchestrator may determine an ending time for performing the first service function that, with the first starting time, defines a time duration for the first service function, identify vertices at which the first service function is available during the time duration, map a first vertex to the first service function in a candidate service function chain, determine a second starting time for launching a second one of the service functions dependent on the first starting time, and provide the candidate service function chain, the first starting time, and the second starting time to a neighbor vertex of the first vertex.

Abstract: Systems and methods for constellation shaping of M-QAM modulation formats in optical transport networks may receive binary data to be transmitted as an optical signal and partition symbols of an M-QAM constellation in the complex plane into two non-overlapping subsets of symbols, The systems and methods may include assigning respective probabilities to each symbol in the first subset of symbols dependent on a target probability distribution for the first subset, mapping at least a portion of the received binary data to the symbols in the first subset, including generating a respective codeword for each symbol in the first subset, in a first symbol period, providing data representing the respective codewords mapped to the symbols in the first subset to an optical modulator for transmission, and refraining from providing any data representing codewords mapped to the symbols in the second subset to the optical modulator until a second symbol period.

Abstract: An intersection management system (IMS) may receive one or more traversing requests from one or more Connected Autonomous Vehicles (CAVs). The IMS may determine a solution space for each of the one or more traversing requests in a space-time resource model of the intersection, find a CAV trajectory allocation in the space-time resource model for each of the one or more traversing requests. The IMS may send an approved reservation to each CAV corresponding to each of the one or more CAV trajectory allocations that have been found. Each of the one or more CAVs may, when an approved reservation corresponding to the CAV may have been received from the IMS, move through the intersection zone as specified in the approved reservation.

Abstract: A method for VON service with guaranteed availability may use probability density functions (PDF) of Q-factor to determine availability of physical links assigned to a virtual link in the VON. Then, a VON mapping may be performed based on the determined availabilities, among other factors.

Abstract: A control system for spectral slot assignment in flexible grid optical networks determines, for a given optical path, a physical source node, a physical destination node, and physical intermediate nodes, determines the number of contiguous spectral slots to allocate for traffic on the path, identifies candidate combinations of spectral slots available for the traffic, and creates an auxiliary graph for the path. The auxiliary graph includes auxiliary links representing candidate combinations of spectral slots, virtual nodes representing pairs of neighboring physical nodes, and auxiliary links between each pair of virtual source-side and destination-side intermediate nodes representing either pass-through traffic or wavelength shifted traffic.

Abstract: In one or more embodiments, one or more systems, methods, and/or processes may determine one or more auxiliary edges that bypass at least one vertex of vertices that represent physical nodes of a network domain; evaluate at least one edge, that includes the one or more auxiliary edges and that interconnect the vertices, to evaluate a portion of the vertices that excludes the at least one vertex that was bypassed to identify at least one vertex that is associated with at least one service function of a service function chain request specifying service functions to be performed via at least a portion of physical nodes of network domains; and configure a first physical node of the physical nodes of the network domain and associated with the at least one vertex that is associated with the at least one service function to process data via the at least one service function.

Abstract: A method may include obtaining packet handling rules from at least one firewall in a network and at least one routing table in the network, and translating the packet handling rules to canonical data structures based on priority of rules at a given routing table or a given firewall. Each canonical data structure may represent a subset of packets affected by one or more corresponding packet handling rules such that each packet handling rule is covered by at least one canonical data structure. The method may also include generating a graph representation of the firewalls and the nodes corresponding to the routing tables in the network. The method may additionally include labeling vertices and edges in the graph representation based on the packet handling rules. The method may also include, using the graph representation, verifying one or more network properties to identify any network issues.

Abstract: A method and system for implementing a network service computation system uses distributed graph processing at a plurality of network controllers corresponding to a plurality of network domains. Each network controller may manage and maintain a network graph for its respective network domain. Each network controller many communicate with nodes (or vertices) in its respective network domain, while the network controllers may communicate with each other for path discovery and computation purposes.

Abstract: Systems and methods for identifying a pair of nodes of a plurality of nodes of a virtual optical network (VON); identifying i) an optical route between the pair of nodes and ii) a desired availability of the optical route; determining a probability density function (PDF) of a signal-to-noise ratio (SNR) of a signal of the optical route; determining a SNR threshold such that an integration of the PDF of the SNR of the signal above the SNR threshold corresponds to the desired availability of the optical route; determining a plurality of spectral efficiencies that corresponds to the SNR threshold, each spectral efficiency of the plurality of spectral efficiencies associated with a respective modulation format of a plurality of modulation formats; and identifying a particular modulation format of the plurality of modulation formats that corresponds to a maximum spectral efficiency of the plurality of spectral efficiencies.

Abstract: A method for VON service with guaranteed availability may use probability density functions (PDF) of Q-factor to determine availability of physical links assigned to a virtual link in the VON. Then, a VON mapping may be performed based on the determined availabilities, among other factors.

Abstract: In one or more embodiments, one or more systems, methods, and/or processes may receive a service function chain description that includes service functions associated with multiple domains, and rather than any of the domains ignoring or rejecting outside nodes, nodes may be configured to communicate with the outside nodes in implementing a service function chain associated with the service function chain description. For example, an arbiter (e.g., a central arbiter) may provide control information and/or configuration information, based on the service function chain description, to one or more systems of each domain. In one instance, the arbiter may provide the control information and/or the configuration information to a border node of each domain. In another instance, the arbiter may provide the control information and/or the configuration information to a domain controller of each domain.

Abstract: Systems and methods for performing distributed virtual network embedding are disclosed. A resource orchestrator may receive a virtual network request specifying a set of virtual nodes, a set of virtual links, each connecting two virtual nodes in a mesh topology, and resource requirements for some virtual nodes. The orchestrator may partition the virtual network request into multiple sub-requests, each specifying a linear topology for a subset of the virtual nodes and links within the mesh topology. The sub-requests may collectively include all virtual links within the mesh topology with no overlapping links. Resource orchestrators may collaborate to compute, independently for each sub-request, a respective chaining solution in which each virtual node is mapped to a physical node having resources sufficient to implementing the virtual node. A resource orchestrator may combine the respective chaining solutions for each of the sub-requests to generate a mapping solution for the virtual network request.

Abstract: Systems and methods for traffic congestion avoidance may use cooperative autonomous driving based on vehicle-to-vehicle communication to resolve deadlock conditions. The method may include automatically detecting, by a given autonomous vehicle, that the given vehicle is deadlocked, initiating, by the given vehicle, formation of a coordination group including the given vehicle, a front vehicle traveling in the same driving lane as the given vehicle, and an assistant autonomous vehicle traveling in a lane adjacent to the lane in which the given vehicle and the front vehicle are traveling, and sending, by the given vehicle using vehicle-to-vehicle communication, a cooperative driving task request to initiate actions by the autonomous vehicles in the coordination group to resolve the deadlock condition. The actions may include modifying a driving plan of an autonomous vehicle in the coordination group and initiating a speed negotiation with an autonomous vehicle in the coordination group.

Abstract: Methods and systems are provided for determining a shortest path with a constraint in an optical network. The method includes identifying a permitted number of events defined by the constraint. The method further includes creating virtual nodes for each node in the optical network, the virtual nodes corresponding with the permitted number of events. The method also includes traversing the virtual nodes from a source node to a destination node with a shortest path algorithm, wherein traversing the virtual nodes comprises creating virtual links between the virtual nodes when the constraint is not violated, the virtual link corresponding with a physical link; and identifying a shortest path between the source node and the destination node from the virtual links, the shortest path not violating the constraint.