Fujitsu Corporation

Qiong Zhang

Paparao Palacharla

Xi Wang

Motoyoshi Sekiya

Tadashi Ikeuchi

Inwoong Kim

Takao Naito

Qingya She

Weisheng Xie

Chengyi Gao

Martin Bouda

Fredrick Gruman

Mohammad Masud Hasan

Olga I Vassilieva

Min He

Virgil Vladescu

Nannan Wang

Kevin Zhu

Kirsten Rundberget

Paparao Palacharia

Srinivas Vobilisetti

Victor Mehmeri

An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.

Path routing with delay constraints

Systems and methods for allocating edge computing resources may receive a predicted user route defining multiple wireless access points available along the route at respective time points and an assured delay constraint, determine, for each wireless access point, datacenters in the network meeting the assured delay constraint when accessed through the wireless access point, and construct an auxiliary graph dependent on the predicted user route and the determined datacenters. Each determined datacenter is represented by at least one node in the graph and each path in the graph defines a sequence of datacenters and a corresponding sequence of wireless access points through which they are accessible. A lowest cost path in the graph is determined and the sequences of datacenters and wireless access points defined by the lowest cost path are provided to a resource orchestrator that allocates edge computing resources for a mobile user traversing the predicted user route.

Monitoring-based edge computing service with delay assurance

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.

Cooperative autonomous driving for traffic congestion avoidance

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.

Efficient message forwarding for distributed resource orchestration

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.

Just-enough-time provisioning of service function chain resources

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.

Service function chaining based on resource availability in the time dimension

A method and system for designing Ethernet ring protection services in a network is used to identify a major ring and sub-rings for a dual hub and spoke network architecture.

Network design method for ethernet ring protection switching

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.

Virtual optical network service with guaranteed availability

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.

Cross-domain orchestration of switch and service functions

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.

Network service computation system

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.

Seamless service function chaining across domains

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.

Distributed virtual network embedding

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.

Shortest path search with constraints in networks

In one or more embodiments, one or more systems of a physical optical network that may implement and/or manage a virtual optical network (VON) that interconnects multiple data centers. Virtual nodes based the multiple data centers to be interconnected may be determined, and each of the virtual nodes may be mapped to at least two physical nodes of the physical optical network. Virtual links for pairs of the virtual nodes may be determined, and each virtual link may be mapped to at least one optical network connection of the physical optical network. At least one of a physical node impairment and an optical network connection impairment that is associated with a first physical node implementing a first virtual node may be detected, and the first virtual node may be implemented via a second physical node.

Resilient virtual optical switches over less reliable optical networks

Methods and systems for determining optical network utilization efficiency include generating a random demand set and calculating a demand fill ratio (DFR) based on the random demand set. The random demand set includes network demands for a given optical network topology that provide 100% of the wavelength slots in the optical network topology. The DFR may be calculated using different wavelength assignment algorithms, such as a first fit wavelength assignment algorithm, from the randomly generated demands in the random demand set. The DFR may be calculated without and with wavelength conversion nodes.

Growing community of inventors

Plano, TX, United States of America

Qiong Zhang