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

1. 发明申请

US20110080846A1 Determining Paths In A Network With Asymmetric Switches 有权
标题翻译：确定不对称交换机网络中的路径
公开(公告)号：US20110080846A1
公开(公告)日：2011-04-07
申请号：US12574972
申请日：2009-10-07
申请人： Min He , Kevin Zhu , Srinivas Vobilisetti , Takao Naito , Paparao Palacharla , Xi Wang , Qiong Zhang
发明人： Min He , Kevin Zhu , Srinivas Vobilisetti , Takao Naito , Paparao Palacharla , Xi Wang , Qiong Zhang
IPC分类号： H04L12/28 , G06T11/20
CPC分类号： H04L12/462 , H04L45/00 , H04L45/12 , H04L45/128 , H04L45/22 , H04Q3/66 , H04Q2213/13141 , H04Q2213/13148
摘要： According to particular embodiments, determining paths in a network with asymmetric switches includes receiving a graph representing the network. Each asymmetric switch has defined degree connectivity between one or more pairs of degrees of the asymmetric switch. The graph is transformed to yield a transformed graph that accounts for the asymmetric switches. A routing process is applied to the transformed graph to yield one or more paths through the network.
摘要翻译：根据特定实施例，使用非对称交换机确定网络中的路径包括接收表示网络的图形。每个非对称开关已经限定了非对称开关的一对或多对度之间的程度连接。转换图形以产生解释非对称开关的变换图。将路由过程应用于变换图，以产生通过网络的一个或多个路径。

2. 发明申请

US20110206374A1 System and Method for Demand Aggregation in Optical Networks Employing Shared Ring Protection 有权
标题翻译：使用共享环保护的光网络中的需求聚合的系统和方法
公开(公告)号：US20110206374A1
公开(公告)日：2011-08-25
申请号：US13022128
申请日：2011-02-07
申请人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
发明人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
IPC分类号： H04B10/20
CPC分类号： H04J14/0283 , H04J14/0257 , H04J14/0267 , H04J14/0295
摘要： In accordance with embodiments of the present disclosure, a method for demand aggregation is provided. The method may include routing demands in a ring network such that a length for each routed demand does not exceed a route length maximum, and a load imbalance at each node in the ring network is minimized. The method may also include maximizing optical line card sharing by assigning routed demands sharing common ends to the same wavelength.
摘要翻译：根据本公开的实施例，提供了一种用于需求聚合的方法。该方法可以包括在环形网络中的路由需求，使得每个路由需求的长度不超过路由长度最大值，并且环形网络中每个节点处的负载不平衡被最小化。该方法还可以包括通过将共享共同端点的路由需求分配到相同波长来最大化光线路卡共享。

3. 发明申请

US20100329120A1 Determining Disjoint Paths With An Optimized Number Of Regenerators 有权
标题翻译：确定具有优化数量的再生器的不相交路径
公开(公告)号：US20100329120A1
公开(公告)日：2010-12-30
申请号：US12494397
申请日：2009-06-30
申请人： Qiong Zhang , Xi Wang , Paparao Palacharla , Takao Naito
发明人： Qiong Zhang , Xi Wang , Paparao Palacharla , Takao Naito
IPC分类号： G08C15/00
CPC分类号： H04L45/00 , H04L45/123 , H04L45/124 , H04L45/128
摘要： According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators.
摘要翻译：根据特定实施例，确定不相交路径包括接收表示包括节点和链路的网络的图。图形被变换，使得路径的中间节点的数量表示路径的再生器的数量。生成从变换图的源节点到目标节点的一组种子路径。对于每个种子路径，确定从源节点到目的地节点的最短路径以产生从源节点到目的地节点的一对或多对不相交路径。选择优化的一对不相交路径，其中优化的一对不相交路径具有优化的再生器数量。

4. 发明授权

US08699518B2 Dynamic circuit adjustment 有权
标题翻译：动态电路调整
公开(公告)号：US08699518B2
公开(公告)日：2014-04-15
申请号：US12905147
申请日：2010-10-15
申请人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
发明人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
IPC分类号： H04J3/16
CPC分类号： H04J14/0267 , H04J14/0241 , H04J14/0257
摘要： A system and method are provided for dynamically reconfiguring an optical circuit between a first node and a second node of a communication network. The system and method may include establishing a scheduling window for receiving a plurality of optical traffic demands, classifying the plurality of optical traffic demands into at least a set of bandwidth adjustable demands and a set of fixed bandwidth demands, provisioning a first set of provisioned wavelengths from the plurality of wavelengths to carry the set of fixed bandwidth demands during the scheduling window, allocating the bandwidth remaining on the first set of provisioned wavelengths to the set of bandwidth adjustable demands, and if necessary, provisioning a second set of provisioned wavelengths from the plurality of wavelengths to carry the bandwidth required by the set of bandwidth adjustable demands that could not be allocated to the first set of provisioned wavelengths.
摘要翻译：提供了一种用于在通信网络的第一节点和第二节点之间动态重新配置光电路的系统和方法。该系统和方法可以包括建立用于接收多个光学业务需求的调度窗口，将多个光学业务需求分类为至少一组带宽可调节需求和一组固定带宽需求，提供第一组供应波长从所述多个波长在所述调度窗口期间携带所述固定带宽需求集合，将所述第一组所设置的波长上剩余的带宽分配给所述带宽可调节需求集合，并且如果需要，从所述多个波长中提供第二组所提供的波长多个波长以承载不能分配给第一组所配置的波长的一组带宽可调节需求所需的带宽。

5. 发明授权

US08634715B2 System and method for demand aggregation in optical networks employing shared ring protection 有权
标题翻译：采用共享环保护的光网络中的需求聚合的系统和方法
公开(公告)号：US08634715B2
公开(公告)日：2014-01-21
申请号：US13022128
申请日：2011-02-07
申请人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
发明人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
IPC分类号： H04B10/00
CPC分类号： H04J14/0283 , H04J14/0257 , H04J14/0267 , H04J14/0295
摘要： In accordance with embodiments of the present disclosure, a method for demand aggregation is provided. The method may include routing demands in a ring network such that a length for each routed demand does not exceed a route length maximum, and a load imbalance at each node in the ring network is minimized. The method may also include maximizing optical line card sharing by assigning routed demands sharing common ends to the same wavelength.
摘要翻译：根据本公开的实施例，提供了一种用于需求聚合的方法。该方法可以包括在环形网络中的路由需求，使得每个路由需求的长度不超过路由长度最大值，并且环形网络中每个节点处的负载不平衡被最小化。该方法还可以包括通过将共享共同端点的路由需求分配到相同波长来最大化光线路卡共享。

6. 发明申请

US20120093507A1 Dynamic Circuit Adjustment 有权
标题翻译：动态电路调整
公开(公告)号：US20120093507A1
公开(公告)日：2012-04-19
申请号：US12905147
申请日：2010-10-15
申请人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
发明人： Xi Wang , Qiong Zhang , Paparao Palacharla , Takao Naito
IPC分类号： H04B10/20
CPC分类号： H04J14/0267 , H04J14/0241 , H04J14/0257
摘要： A system and method are provided for dynamically reconfiguring an optical circuit between a first node and a second node of a communication network. The system and method may include establishing a scheduling window for receiving a plurality of optical traffic demands, classifying the plurality of optical traffic demands into at least a set of bandwidth adjustable demands and a set of fixed bandwidth demands, provisioning a first set of provisioned wavelengths from the plurality of wavelengths to carry the set of fixed bandwidth demands during the scheduling window, allocating the bandwidth remaining on the first set of provisioned wavelengths to the set of bandwidth adjustable demands, and if necessary, provisioning a second set of provisioned wavelengths from the plurality of wavelengths to carry the bandwidth required by the set of bandwidth adjustable demands that could not be allocated to the first set of provisioned wavelengths.
摘要翻译：提供了一种用于在通信网络的第一节点和第二节点之间动态重新配置光电路的系统和方法。该系统和方法可以包括建立用于接收多个光学业务需求的调度窗口，将多个光学业务需求分类为至少一组带宽可调节需求和一组固定带宽需求，提供第一组供应波长从所述多个波长在所述调度窗口期间携带所述固定带宽需求集合，将所述第一组所设置的波长上剩余的带宽分配给所述带宽可调节需求集合，并且如果需要，从所述多个波长中提供第二组所提供的波长多个波长以承载不能分配给第一组所配置的波长的一组带宽可调节需求所需的带宽。

7. 发明授权

US08144626B2 Determining disjoint paths with an optimized number of regenerators 有权
标题翻译：确定具有优化数量的再生器的不相交路径
公开(公告)号：US08144626B2
公开(公告)日：2012-03-27
申请号：US12494397
申请日：2009-06-30
申请人： Qiong Zhang , Xi Wang , Paparao Palacharla , Takao Naito
发明人： Qiong Zhang , Xi Wang , Paparao Palacharla , Takao Naito
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/123 , H04L45/124 , H04L45/128
摘要： According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators.
摘要翻译：根据特定实施例，确定不相交路径包括接收表示包括节点和链路的网络的图。图形被变换，使得路径的中间节点的数量表示路径的再生器的数量。生成从变换图的源节点到目标节点的一组种子路径。对于每个种子路径，确定从源节点到目的地节点的最短路径以产生从源节点到目的地节点的一对或多对不相交路径。选择优化的一对不相交路径，其中优化的一对不相交路径具有优化的再生器数量。

8. 发明申请

US20110243030A1 SYSTEMS AND METHODS FOR DETERMINING PROTECTION PATHS IN A MULTI-DOMAIN NETWORK 有权
标题翻译：用于确定多域网络中的保护程序的系统和方法
公开(公告)号：US20110243030A1
公开(公告)日：2011-10-06
申请号：US12751599
申请日：2010-03-31
申请人： Qiong Zhang , Mohammad Masud Hasan , Xi Wang , Paparao Palacharla , Takao Naito , Fredrick S. Gruman
发明人： Qiong Zhang , Mohammad Masud Hasan , Xi Wang , Paparao Palacharla , Takao Naito , Fredrick S. Gruman
IPC分类号： H04L12/28
CPC分类号： H04L45/04 , H04L45/128 , H04L45/22 , H04L45/24 , H04L45/28
摘要： Systems and methods for determining multiple paths in a multi-domain network are provided. In some embodiment, a method for determining multiple paths in a network is provided. The method may include determining a first path between a source node and a destination node and determining a second path disjoint from the first path. In some embodiments, to determine the second path includes determining which ingress nodes are available in a domain that includes the destination node, where the available ingress nodes are not part of the first path, and implementing a disjoint path algorithm for each of the available ingress nodes. To determine the first path includes implementing forward path calculations.
摘要翻译：提供了用于确定多域网络中的多个路径的系统和方法。在一些实施例中，提供了一种用于确定网络中的多个路径的方法。该方法可以包括确定源节点和目的地节点之间的第一路径并确定与第一路径不相交的第二路径。在一些实施例中，为了确定第二路径包括确定哪些入口节点在包括目的地节点的域中是可用的，其中可用入口节点不是第一路径的一部分，并且为每个可用入口实现不相交路径算法节点。确定第一条路径包括实现前向路径计算。

9. 发明申请

US20110167183A1 Minimizing Interconnections In A Multi-Shelf Switching System 有权
标题翻译：最小化多层交换系统中的互连
公开(公告)号：US20110167183A1
公开(公告)日：2011-07-07
申请号：US12683504
申请日：2010-01-07
申请人： Qiong Zhang , Paparao Palacharla , Xi Wang , Takao Naito
发明人： Qiong Zhang , Paparao Palacharla , Xi Wang , Takao Naito
IPC分类号： G06F13/14 , G06F13/00
CPC分类号： H04L47/10 , H04L41/12
摘要： In certain embodiments, minimizing interconnections in a multi-shelf switching system includes receiving a map describing the switching system, where the switching system comprises shelves and input/output (I/O) points. The map is transformed to yield a graph comprising nodes and edges. A node represents an I/O point, and a node weight represents a number of interface cards of the I/O point represented by the node. An edge between a node pair represents traffic demand between the I/O points represented by the node pair, and an edge weight represents the amount of the traffic demand represented by the edge. The graph is partitioned to yield a groups that minimize interconnection traffic among the shelves, where each group represents a shelf of the multi-shelf switching system.
摘要翻译：在某些实施例中，最小化多货架交换系统中的互连包括接收描述交换系统的映射，其中交换系统包括货架和输入/输出（I / O）点。该图被变换以产生包括节点和边的图。节点表示I / O点，节点权重表示由节点表示的I / O点的接口卡数量。节点对之间的边缘表示由节点对表示的I / O点之间的业务需求，边缘权重表示由边缘表示的业务量需求量。该图被分割以产生使架之间的互连流量最小化的组，其中每个组表示多货架交换系统的货架。

10. 发明授权

US08831012B2 Determining paths in a network with asymmetric switches 有权
标题翻译：确定具有非对称开关的网络中的路径
公开(公告)号：US08831012B2
公开(公告)日：2014-09-09
申请号：US12574972
申请日：2009-10-07
申请人： Min He , Kevin Zhu , Srinivas Vobilisetti , Takao Naito , Paparao Palacharla , Xi Wang , Qiong Zhang
发明人： Min He , Kevin Zhu , Srinivas Vobilisetti , Takao Naito , Paparao Palacharla , Xi Wang , Qiong Zhang
IPC分类号： H04L12/28 , H04L12/46 , H04L12/701 , H04L12/721 , H04L12/735 , H04L12/707 , H04Q3/66
CPC分类号： H04L12/462 , H04L45/00 , H04L45/12 , H04L45/128 , H04L45/22 , H04Q3/66 , H04Q2213/13141 , H04Q2213/13148
摘要： According to particular embodiments, determining paths in a network with asymmetric switches includes receiving a graph representing the network. Each asymmetric switch has defined degree connectivity between one or more pairs of degrees of the asymmetric switch. The graph is transformed to yield a transformed graph that accounts for the asymmetric switches. A routing process is applied to the transformed graph to yield one or more paths through the network.
摘要翻译：根据特定实施例，使用非对称交换机确定网络中的路径包括接收表示网络的图形。每个非对称开关已经限定了非对称开关的一对或多对度之间的程度连接。转换图形以产生解释非对称开关的变换图。将路由过程应用于变换图，以产生通过网络的一个或多个路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式