Fujitsu Corporation

Future Wei Technologies, Inc.

Weisheng Xie

Qingya She

Paparao Palacharla

Qiong Zhang

Tadashi Ikeuchi

Xi Wang

Kirsten Rundberget

Motoyoshi Sekiya

Wu Chou

Min Luo

Jiafeng Zhu

Nannan Wang

Changcheng Huang

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 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.

Distribution of computing resources of a radio access network

An exemplary cabling system includes a plurality of containers. A first container of the plurality of containers defines a first plurality of openings. The system includes a plurality of bolts with a first bolt operable to insert into the first plurality of openings. The first bolt defines a first conduit operable to receive a first cable of a plurality of cables. An exemplary telecommunications central office includes a container with a plurality of walls defining an interior of the container and an exterior of the container, an opening, a vault entrance, and a plurality of cable runways. An exemplary method for arranging cables includes cutting a wall of a first and second container to create a first and second opening, inserting flanges of bolts into the openings, receiving with a pipe the flanges, and routing a cable through the first and second opening into an interior of the second container.

Container cabling systems and methods

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

Embodiments of the present disclosure are directed to systems and methods for allocating spectrum of a flexible-grid optical network to a plurality of virtual links. Given a set of optical channels of different line rates and channel widths, a user can reserve one of the optical channels as a long-term reservation. The user can later elect to downgrade its optical channel to a smaller optical channel with lower line rate and less spectrum, for example, when the user's traffic demands decrease. The user may return (e.g., sell or de-allocate) an amount of unused spectrum to the carrier, and the carrier creates and manages a resource pool to gather unused spectrum from users. When the user's traffic increases, the user may obtain (e.g., purchase) additional spectrum from the carrier's resource pool and/or upgrade the user's optical channel to an optical channel having a higher line rate.

Hardware and software methodologies for dynamic resource allocation in virtualized flexible-grid optical networks

A method for routing and wavelength assignment for optical network resources required for a plurality of virtual network requests includes receiving the plurality of virtual network requests. The method further includes determining a number of virtual links for each virtual network request. The method includes sorting the plurality of virtual network requests based on the number of virtual links, and selecting a virtual network request from the plurality of virtual network requests and setting a number of allowable spans. Additionally, the method includes determining whether a valid virtual node mapping exists for the virtual network request on any of a plurality of wavelengths based on the allowable spans, and based on determining that no valid virtual node mapping exists on any of the plurality of wavelengths, incrementing the number of allowable spans.

Growing community of inventors

Plano, TX, United States of America

Weisheng Xie