专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

41. 发明授权

US09912435B2 Nonlinear penalty estimation using spectral inversion in optical transport networks 有权
公开(公告)号：US09912435B2
公开(公告)日：2018-03-06
申请号：US15015880
申请日：2016-02-04
申请人： Fujitsu Limited
发明人： Inwoong Kim , Olga Vassilieva , Paparao Palacharla , Motoyoshi Sekiya
IPC分类号： H04B10/08 , H04B17/00 , H04B10/12 , H04B10/00 , H04J14/02 , H04B10/079 , H04B10/2543
CPC分类号： H04J14/0271 , H04B10/07953 , H04B10/2543 , H04J14/0257
摘要： Methods and systems may estimate nonlinear penalties for optical paths using spectral inversion in optical transport networks. Certain values of nonlinear transfer functions for nonlinear penalty estimation may be pre-calculated for optical paths between given nodes. When an optical path computation for using spectral inversion between a given source node and a given destination node is desired, the pre-calculated values may be concatenated for improved computational efficiency.

42. 发明申请

US20170346719A1 SHORTEST PATH SEARCH WITH CONSTRAINTS IN NETWORKS 审中-公开
公开(公告)号：US20170346719A1
公开(公告)日：2017-11-30
申请号：US15169313
申请日：2016-05-31
申请人： Fujitsu Limited
发明人： Inwoong Kim , Xi Wang , Qiong Zhang , Paparao Palacharla , Tadashi Ikeuchi
IPC分类号： H04L12/721 , H04Q11/00
CPC分类号： H04L45/124 , H04L45/62 , H04Q11/0066 , H04Q2011/0073
摘要： 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.

43. 发明申请

US20170104847A1 VERTEX-CENTRIC SERVICE FUNCTION CHAINING IN MULTI-DOMAIN NETWORKS 有权
公开(公告)号：US20170104847A1
公开(公告)日：2017-04-13
申请号：US15175940
申请日：2016-06-07
申请人： Fujitsu Limited
发明人： Qiong Zhang , Paparao Palacharla , Xi Wang , Inwoong Kim , Tadashi Ikeuchi
IPC分类号： H04L29/08
CPC分类号： H04L67/327 , H04L67/1004
摘要： Systems and methods for performing vertex-centric service function chaining in multi-domain networks are disclosed. A resource orchestration framework of a multi-domain network may include vertices representing physical nodes and edges representing physical links in the network. A sole resource orchestrator (in a centralized system) or multiple resource orchestrators (each associated with a respective domain in a distributed system) may coordinate execution of a common compute function on multiple vertices to identify candidate service function chain solutions to a service function chain request. The request may specify a fixed-ordered chain or a flexible-ordered chain. The compute function may, during each of multiple supersteps, determine whether a partially mapped chain can be extended on a given vertex, send a controller message to a neighbor vertex with which it has a qualified link, or return a completed chain, which may be selected for execution, dependent on applicable policies.

44. 发明申请

US20170104668A1 NETWORK SERVICE COMPUTATION SYSTEM 审中-公开
公开(公告)号：US20170104668A1
公开(公告)日：2017-04-13
申请号：US14882217
申请日：2015-10-13
申请人： Fujitsu Limited
发明人： Qiong Zhang , Xi Wang , Paparao Palacharla , Motoyoshi Sekiya
IPC分类号： H04L12/727 , H04L12/751 , H04L12/801
CPC分类号： H04L45/121 , H04L45/02 , H04L47/12 , H04L47/785
摘要： 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.

45. 发明授权

US09565101B2 Risk mitigation in data center networks 有权
标题翻译：数据中心网络中的风险减轻
公开(公告)号：US09565101B2
公开(公告)日：2017-02-07
申请号：US14102313
申请日：2013-12-10
申请人： Fujitsu Limited
发明人： Qiong Zhang , Qingya She , Xi Wang , Paparao Palacharla , Motoyoshi Sekiya
IPC分类号： H04L12/715 , H04L12/24
CPC分类号： H04L45/64 , H04L41/042 , H04L41/145
摘要： A method employing resource orchestration algorithms may find a fewest number of working data centers (DCs) to guarantee K-connect survivability using an overlay network representing a physical optical network. The overlay network may not include certain topological features of the physical optical network. A risk-based algorithm may result in fewer working DCs for K-connect survivability. A delay-based algorithm may be more suitable for delay-sensitive cloud applications.
摘要翻译：使用资源编排算法的方法可以使用代表物理光网络的覆盖网络来找到最少数量的工作数据中心（DC）以保证K连接生存性。覆盖网络可能不包括物理光网络的某些拓扑特征。基于风险的算法可能导致更少的工作DC用于K-connect生存性。基于延迟的算法可能更适合延迟敏感的云应用。

46. 发明授权

US09503367B2 Risk mitigation in data center networks using virtual machine sharing 有权
标题翻译：使用虚拟机共享的数据中心网络中的风险减轻
公开(公告)号：US09503367B2
公开(公告)日：2016-11-22
申请号：US14470265
申请日：2014-08-27
申请人： Fujitsu Limited
发明人： Qiong Zhang , Xi Wang , Paparao Palacharla , Motoyoshi Sekiya
IPC分类号： H04L12/715 , H04L12/24 , G06F9/50 , H04L12/741
CPC分类号： H04L45/64 , G06F9/5027 , H04L41/042 , H04L41/142 , H04L45/745
摘要： A method employing resource orchestration algorithms may find a fewest number of working data centers (DCs) to guarantee K-connect survivability and a fewest number of virtual machines (VMs) among the DCs using an overlay network representing a physical optical network. The overlay network may exclude certain topological features of the physical optical network. An intra-request VM sharing method may share VMs among DCs allocated for an aggregation request. An intra-request VM sharing method may share VMs among DCs represented in the overlay network and among multiple aggregation requests.
摘要翻译：使用资源编排算法的方法可以使用代表物理光网络的覆盖网络，找到最少数量的工作数据中心（DC）以保证DC中的K-connect生存能力和最少数量的虚拟机（VM）。覆盖网络可以排除物理光网络的某些拓扑特征。内部请求VM共享方法可以在为聚合请求分配的DC之间共享VM。内部请求VM共享方法可以在覆盖网络中表示的DC之间以及多个聚合请求中共享VM。

47. 发明申请

US20160316283A1 NONLINEAR PENALTY ESTIMATION USING SPECTRAL INVERSION IN OPTICAL TRANSPORT NETWORKS 有权
标题翻译：使用光传输网络中的频谱反演的非线性罚则估计
公开(公告)号：US20160316283A1
公开(公告)日：2016-10-27
申请号：US15015880
申请日：2016-02-04
申请人： Fujitsu Limited
发明人： Inwoong Kim , Olga Vassilieva , Paparao Palacharla , Motoyoshi Sekiya
IPC分类号： H04Q11/00
CPC分类号： H04J14/0271 , H04B10/07953 , H04B10/2543 , H04J14/0257
摘要： Methods and systems may estimate nonlinear penalties for optical paths using spectral inversion in optical transport networks. Certain values of nonlinear transfer functions for nonlinear penalty estimation may be pre-calculated for optical paths between given nodes. When an optical path computation for using spectral inversion between a given source node and a given destination node is desired, the pre-calculated values may be concatenated for improved computational efficiency.
摘要翻译：方法和系统可以使用光传输网络中的频谱反演估计光路的非线性惩罚。可以为给定节点之间的光路径预先计算非线性罚球估计的非线性传递函数的某些值。当期望在给定源节点和给定目的地节点之间使用频谱反演的光路计算时，预先计算的值可以被级联以提高计算效率。

48. 发明授权

US09197542B2 Systems and methods of network reconfiguration 有权
标题翻译：网络重构的系统和方法
公开(公告)号：US09197542B2
公开(公告)日：2015-11-24
申请号：US13755967
申请日：2013-01-31
申请人： Fujitsu Limited
发明人： Qiong Zhang , Paparao Palacharla , Chengyi Gao , Xi Wang , Motoyoshi Sekiya
IPC分类号： G06F13/00 , H04L12/707 , H04L12/24
CPC分类号： H04L45/22 , H04L41/04 , H04L41/0896
摘要： The present disclosure may include a method of reconfiguring a network. The method includes collecting a plurality of network demands, each of the plurality of network demands having a possible resource release by rerouting the network demand from its current path to a new path. The method further includes selecting a subset of the plurality of network demands that, if rerouted, has the highest resource release without resource contention. The method additionally includes rerouting the subset of the plurality of network demands, and, in response to rerouting the subset of the plurality of network demands, releasing resources no longer used by rerouted demands. The present disclosure may further include associated systems and apparatuses.
摘要翻译：本公开可以包括重新配置网络的方法。该方法包括收集多个网络需求，通过将网络需求从其当前路径重新路由到新路径，多个网络需求中的每一个具有可能的资源释放。该方法还包括选择多个网络需求的子集，如果重新路由，则其具有最高的资源释放而没有资源争用。该方法还包括重新路由多个网络需求的子集，并且响应于重新路由多个网络需求的子集，释放不再被重新路由的需求使用的资源。本公开还可以包括相关联的系统和装置。

49. 发明申请

US20140215032A1 SYSTEMS AND METHODS OF NETWORK RECONFIGURATION 有权
标题翻译：网络重构的系统与方法
公开(公告)号：US20140215032A1
公开(公告)日：2014-07-31
申请号：US13755967
申请日：2013-01-31
申请人： FUJITSU LIMITED
发明人： Qiong Zhang , Paparao Palacharla , Chengyi Gao , Xi Wang , Motoyoshi Sekiya
IPC分类号： H04L12/24
CPC分类号： H04L45/22 , H04L41/04 , H04L41/0896
摘要： The present disclosure may include a method of reconfiguring a network. The method includes collecting a plurality of network demands, each of the plurality of network demands having a possible resource release by rerouting the network demand from its current path to a new path. The method further includes selecting a subset of the plurality of network demands that, if rerouted, has the highest resource release without resource contention. The method additionally includes rerouting the subset of the plurality of network demands, and, in response to rerouting the subset of the plurality of network demands, releasing resources no longer used by rerouted demands. The present disclosure may further include associated systems and apparatuses.
摘要翻译：本公开可以包括重新配置网络的方法。该方法包括收集多个网络需求，通过将网络需求从其当前路径重新路由到新路径，多个网络需求中的每一个具有可能的资源释放。该方法还包括选择多个网络需求的子集，如果重新路由，则其具有最高的资源释放而没有资源争用。该方法还包括重新路由多个网络需求的子集，并且响应于重新路由多个网络需求的子集，释放不再被重新路由的需求使用的资源。本公开还可以包括相关联的系统和装置。

50. 发明申请

US20130272693A1 SYSTEM AND METHOD FOR SHARED MESH RESTORATION IN OPTICAL NETWORKS 有权
标题翻译：光网络共享恢复系统与方法
公开(公告)号：US20130272693A1
公开(公告)日：2013-10-17
申请号：US13658587
申请日：2012-10-23
申请人： Fujitsu Limited
发明人： Qiong Zhang , Paparao Palacharla , Xi Wang , Motoyoshi Sekiya
IPC分类号： H04B10/08
CPC分类号： H04J14/0284 , H04J14/0212 , H04J14/0217 , H04J14/0268
摘要： A method for shared mesh restoration includes configuring a switch to allow sharing of a plurality of backup line cards across a plurality of node degrees associated with a reconfigurable optical add/drop multiplexer (ROADM). The switch is communicatively coupled to the ROADM. The method further includes configuring a number of backup line cards coupled to the switch. The number of backup line cards is based on determining a number of active backup lightpaths for each of a plurality of network failures associated with each of the plurality of node degrees of the ROADM, identifying which node degree and failure has the largest number of active backup lightpaths for all of the plurality of node degrees of the ROADM and for each of the plurality of network failures, and determining the number of backup line cards to configure based on the identified largest number of active backup lightpaths.
摘要翻译：一种用于共享网格恢复的方法包括配置交换机以允许在与可重配置光分插复用器（ROADM）相关联的多个节点度上共享多个备用线卡。交换机通信耦合到ROADM。该方法还包括配置耦合到交换机的多个备用线路卡。备用线路卡的数量基于确定与ROADM的多个节点度中的每一个相关联的多个网络故障中的每一个的主动备用光路的数量，识别哪个节点度和故障具有最大数量的主动备份用于ROADM的所有多个节点度数和多个网络故障中的每一个的光路，以及基于所识别的最大数量的主动备用光路确定要配置的备用线路卡的数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式