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

1. 发明申请

US20120002550A1 GLOBAL PROVISIONING OF ZERO-BANDWIDTH TRAFFIC ENGINEERING LABEL SWITCHED PATHS 有权
标题翻译：零带宽交通工程标签开关板的全球规定
公开(公告)号：US20120002550A1
公开(公告)日：2012-01-05
申请号：US13254871
申请日：2009-05-14
申请人： Filippo Cugini , Annikki Welin , Luca Valcarenghi , Piero Castoldi , Francesco Paolucci
发明人： Filippo Cugini , Annikki Welin , Luca Valcarenghi , Piero Castoldi , Francesco Paolucci
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L45/12 , H04L45/24 , H04L45/302 , H04L45/38 , H04L45/50 , H04L45/507
摘要： A method of load balancing zero-bandwidth Traffic Engineering Label Switching Paths (0-bw TE LSPs) in a communication network having a plurality of network nodes and a plurality of network links connecting the nodes. The method may be implemented in a centralized Path Computation Element (PCE) or in an ingress router. Each equal cost path from a source node to a destination node is identified from network topology information. A probability of selecting each equal cost shortest path is determined using an iterative Global Load balancing Algorithm (GLA) and each 0-bw TE LSP is provisioned with a specific probability such that the 0-bw TE LSPs are uniformly distributed over all network links.
摘要翻译：在具有多个网络节点的通信网络和连接节点的多个网络链路的负载平衡零带宽流量工程标签交换路径（0-bw TE LSP）的方法。该方法可以在集中式路径计算元件（PCE）或入口路由器中实现。从源节点到目的地节点的每个相等的成本路径是从网络拓扑信息中识别出来的。使用迭代全局负载平衡算法（GLA）确定选择每个相等成本最短路径的概率，并且以特定概率提供每个0-bw TE LSP，使得0-bw TE LSP均匀地分布在所有网络链路上。

2. 发明授权

US08576720B2 Global provisioning of zero-bandwidth traffic engineering label switched paths 有权
标题翻译：零带宽流量工程标签交换路径的全局配置
公开(公告)号：US08576720B2
公开(公告)日：2013-11-05
申请号：US13254871
申请日：2009-05-14
申请人： Filippo Cugini , Annikki Welin , Luca Valcarenghi , Piero Castoldi , Francesco Paolucci
发明人： Filippo Cugini , Annikki Welin , Luca Valcarenghi , Piero Castoldi , Francesco Paolucci
IPC分类号： H04W4/00 , H04J3/16 , H04J3/22
CPC分类号： H04L45/00 , H04L45/12 , H04L45/24 , H04L45/302 , H04L45/38 , H04L45/50 , H04L45/507
摘要： A method of load balancing zero-bandwidth Traffic Engineering Label Switching Paths (0-bw TE LSPs) in a communication network having a plurality of network nodes and a plurality of network links connecting the nodes. The method may be implemented in a centralized Path Computation Element (PCE) or in an ingress router. Each equal cost path from a source node to a destination node is identified from network topology information. A probability of selecting each equal cost shortest path is determined using an iterative Global Load balancing Algorithm (GLA) and each 0-bw TE LSP is provisioned with a specific probability such that the 0-bw TE LSPs are uniformly distributed over all network links.
摘要翻译：在具有多个网络节点的通信网络和连接节点的多个网络链路的负载平衡零带宽流量工程标签交换路径（0-bw TE LSP）的方法。该方法可以在集中式路径计算元件（PCE）或入口路由器中实现。从源节点到目的地节点的每个相等的成本路径是从网络拓扑信息中识别出来的。使用迭代全局负载平衡算法（GLA）确定选择每个相等成本最短路径的概率，并且以特定概率提供每个0-bw TE LSP，使得0-bw TE LSP均匀地分布在所有网络链路上。

3. 发明授权

US08644325B2 Method and apparatus for path computation element and routing controller cooperation 有权
标题翻译：用于路径计算元素和路由控制器协作的方法和装置
公开(公告)号：US08644325B2
公开(公告)日：2014-02-04
申请号：US13394220
申请日：2010-08-23
申请人： Paola Iovanna , Giulio Bottari , Annikki Welin , Francesco Paolucci , Filippo Cugini , Piero Castoldi
发明人： Paola Iovanna , Giulio Bottari , Annikki Welin , Francesco Paolucci , Filippo Cugini , Piero Castoldi
IPC分类号： H04L12/56
CPC分类号： H04Q11/0062 , H04L45/00 , H04L45/10 , H04L45/121 , H04L45/123 , H04L45/42 , H04L45/62 , H04Q2011/0073
摘要： A system, method, and node for a Routing Controller (RC) to obtain from a Path Computation Element (PCE), network resource path metrics across a plurality of domains in a communication network in which each domain includes a plurality of Border Nodes (BNs). The RC sends to the PCE, a first message requesting a first path computation between each pair of BNs. The first message contains a maximum metric-value that a path computation must not exceed for a Path Computation Client (PCC) to consider the path computation acceptable. The RC then sends a second message requesting the PCE to compute a subsequent path computation for each BN pair for which the first path computation did not exceed the maximum metric-value. The second message contains a minimum metric-value that a path metric must exceed for the PCC to consider the path metric acceptable. The RC then receives the computed subsequent path computation.
摘要翻译：路由控制器（RC）的系统，方法和节点，用于从路径计算元素（PCE）获得在通信网络中的多个域中的网络资源路径度量，其中每个域包括多个边界节点（BN））。 RC向PCE发送请求在每对BN之间进行第一路径计算的第一消息。第一条消息包含一个路径计算不能超过路径计算客户端（PCC）的最大度量值，以考虑可接受的路径计算。然后，RC然后发送请求PCE的第二消息，以计算第一路径计算未超过最大度量值的每个BN对的后续路径计算。第二条消息包含路由度量值必须超过PCC以考虑可接受的路径度量的最小度量值。 RC然后接收计算的后续路径计算。

4. 发明申请

US20120163390A1 METHOD AND APPARATUS FOR PATH COMPUTATION ELEMENT AND ROUTING CONTROLLER COOPERATION 有权
标题翻译：路径计算元件与路由控制器合作的方法与装置
公开(公告)号：US20120163390A1
公开(公告)日：2012-06-28
申请号：US13394220
申请日：2010-08-23
申请人： Paola Iovanna , Giulio Bottari , Annikki Welin , Francesco Paolucci , Filippo Cugini , Piero Castoldi
发明人： Paola Iovanna , Giulio Bottari , Annikki Welin , Francesco Paolucci , Filippo Cugini , Piero Castoldi
IPC分类号： H04L12/56
CPC分类号： H04Q11/0062 , H04L45/00 , H04L45/10 , H04L45/121 , H04L45/123 , H04L45/42 , H04L45/62 , H04Q2011/0073
摘要： A system, method, and node for a Routing Controller (RC) to obtain from a Path Computation Element (PCE), network resource path metrics across a plurality of domains in a communication network in which each domain includes a plurality of Border Nodes (BNs). The RC sends to the PCE, a first message requesting a first path computation between each pair of BNs. The first message contains a maximum metric-value that a path computation must not exceed for a Path Computation Client (PCC) to consider the path computation acceptable. The RC then sends a second message requesting the PCE to compute a subsequent path computation for each BN pair for which the first path computation did not exceed the maximum metric-value. The second message contains a minimum metric-value that a path metric must exceed for the PCC to consider the path metric acceptable. The RC then receives the computed subsequent path computation.
摘要翻译：路由控制器（RC）的系统，方法和节点，用于从路径计算元素（PCE）获得在通信网络中的多个域中的网络资源路径度量，其中每个域包括多个边界节点（BN））。 RC向PCE发送请求在每对BN之间进行第一路径计算的第一消息。第一条消息包含一个路径计算不能超过路径计算客户端（PCC）的最大度量值，以考虑可接受的路径计算。然后，RC然后发送请求PCE的第二消息，以计算第一路径计算未超过最大度量值的每个BN对的后续路径计算。第二条消息包含路由度量值必须超过PCC以考虑可接受的路径度量的最小度量值。 RC然后接收计算的后续路径计算。

5. 发明申请

US20120102228A1 INTER-DOMAIN ADVERTISEMENTS IN MULTI-DOMAIN NETWORKS 审中-公开
标题翻译：多域网络中的域间广告
公开(公告)号：US20120102228A1
公开(公告)日：2012-04-26
申请号：US13256764
申请日：2009-04-28
申请人： Filippo Cugini , Piero Castoldi , Annikki Welin
发明人： Filippo Cugini , Piero Castoldi , Annikki Welin
IPC分类号： G06F15/173
CPC分类号： H04L45/12 , H04L45/04 , H04L45/22 , H04L45/42 , H04L45/44 , H04L45/50
摘要： In a multi-domain network each domain, or Autonomous System (AS), has a route calculation entity (PCE A) which is responsible for computing paths between domains on behalf of clients. The route calculation entity (PCE A) sends advertisement messages to a route calculation entity (PCE B) in another domain. The advertisement message carries at least one of: inter-domain resource information and aggregated intra-domain information, such as simplified topology information or cumulative traffic engineering (TE) metrics. The inter-domain resource information can be inter-domain route or reachability information which is normally discarded by a routing protocol such as the Border Gateway Protocol (BGP) and can include inter-domain Traffic Engineering (TE) information such as reservable bandwidth.
摘要翻译：在多域网络中，每个域或自治系统（AS）具有路由计算实体（PCE A），其负责代表客户端的域之间的计算路径。路由计算实体（PCE A）向另一个域中的路由计算实体（PCE B）发送广播消息。广告消息中携带以下至少一种：域间资源信息和聚合域内信息，如简化拓扑信息或累积流量工程（TE）度量。域间资源信息可以是通常由边界网关协议（BGP）等路由协议丢弃的域间路由或可达性信息，并且可以包括诸如可预留带宽之类的域间流量工程（TE）信息。

6. 发明申请

US20110229122A1 RESTORATION SCHEME FOR AN OPTICAL NETWORK AND METHOD OF USING SUCH A SCHEME 有权
标题翻译：光网络的恢复方案和使用这种方案的方法
公开(公告)号：US20110229122A1
公开(公告)日：2011-09-22
申请号：US13119520
申请日：2008-09-19
申请人： Piero Castoldi , Filippo Cugini , Nicola Sambo , Isabella Cerutti , Alessio Giorgetti , Luca Valcarenghi
发明人： Piero Castoldi , Filippo Cugini , Nicola Sambo , Isabella Cerutti , Alessio Giorgetti , Luca Valcarenghi
IPC分类号： H04B10/00
CPC分类号： H04Q11/0062 , H04J14/0227 , H04J14/0246 , H04J14/025 , H04J14/0279 , H04J14/0284 , H04Q2011/0073 , H04Q2011/0081 , H04Q2011/0086
摘要： A method of restoration for an optical network, the network comprising a plurality of nodes (40, 50) interconnected with each other by optical links (130), a subset of the nodes (40) each comprising a regenerator, the method comprising: storing (160) a quality of transmission parameter and a regenerator availability at each of the plurality of nodes (40, 50); notifying (170) a branch node (110) in response to detecting a failure (140) within a link (130) forming part of the path between a source node (20) and a destination node (30), wherein the branch node (110) is the neighbouring upstream node (40, 50) upstream of the link failure (140), the branch node (110) having a regenerator; the branch node (110) computing (190) a restoration segment (100) to a merge node (120) having a regenerator which is a neighbouring downstream node which is downstream of the link failure (140), the restoration path (100) being based on the quality of transmission parameter and regenerator availability information; restoring (180) the path between the source node (20) and the destination node (30) using the restoration segment (100).
摘要翻译：一种用于光网络的恢复方法，所述网络包括通过光链路（130）彼此互连的多个节点（40,50），每个节点（40）的子集包括再生器，所述方法包括：存储（160）在所述多个节点（40,50）中的每个节点处的传输参数的质量和再生器可用性; 响应于检测到形成源节点（20）和目的地节点（30）之间的路径的一部分的链路（130）内的故障（140），通知（170）分支节点（110），其中分支节点 110）是链路故障（140）上游的相邻上游节点（40,50），分支节点（110）具有再生器; 所述分支节点（110）向具有作为在所述链路故障（140）的下游的相邻下游节点的再生器的合并节点（120）计算（190）恢复段（100），所述恢复路径（100）基于传输参数和再生器可用性信息的质量; 使用恢复段（100）恢复（180）源节点（20）和目的地节点（30）之间的路径。

7. 发明授权

US08855483B2 Restoration scheme for an optical network and method of using such a scheme 有权
标题翻译：光网络的恢复方案和使用这种方案的方法
公开(公告)号：US08855483B2
公开(公告)日：2014-10-07
申请号：US13119520
申请日：2008-09-19
申请人： Piero Castoldi , Filippo Cugini , Nicola Sambo , Isabella Cerutti , Alessio Giorgetti , Luca Valcarenghi
发明人： Piero Castoldi , Filippo Cugini , Nicola Sambo , Isabella Cerutti , Alessio Giorgetti , Luca Valcarenghi
IPC分类号： H04B10/00 , H04J14/02 , H04Q11/00
CPC分类号： H04Q11/0062 , H04J14/0227 , H04J14/0246 , H04J14/025 , H04J14/0279 , H04J14/0284 , H04Q2011/0073 , H04Q2011/0081 , H04Q2011/0086
摘要： A method of restoration for an optical network, the network comprising a plurality of nodes (40, 50) interconnected with each other by optical links (130), a subset of the nodes (40) each comprising a regenerator, the method comprising: storing 160) a quality of transmission parameter and a regenerator availability at each of the plurality of nodes (40, 50); notifying (170) a branch node (110) in response to detecting a failure (140) within a link (130) forming part of the path between a source node (20) and a destination node (30), wherein the branch node (110) is the neighbouring upstream node (40, 50) upstream of the link failure (140), the branch node (110) having a regenerator; the branch node (110) computing (190) a restoration segment (100) to a merge node (120) having a regenerator which is a neighbouring downstream node which is downstream of the link failure (140), the restoration path (100) being based on the quality of transmission parameter and regenerator availability information; restoring (180) the path between the source node (20) and the destination node (30) using the restoration segment (100).
摘要翻译：一种用于光网络的恢复方法，所述网络包括通过光链路（130）彼此互连的多个节点（40,50），每个节点（40）的子集包括再生器，所述方法包括：存储 160）多个节点（40,50）中的每个节点的传输参数的质量和再生器可用性; 响应于检测到形成源节点（20）和目的地节点（30）之间的路径的一部分的链路（130）内的故障（140），通知（170）分支节点（110），其中分支节点 110）是链路故障（140）上游的相邻上游节点（40,50），分支节点（110）具有再生器; 所述分支节点（110）向具有作为在所述链路故障（140）的下游的相邻下游节点的再生器的合并节点（120）计算（190）恢复段（100），所述恢复路径（100）基于传输参数和再生器可用性信息的质量; 使用恢复段（100）恢复（180）源节点（20）和目的地节点（30）之间的路径。

8. 发明申请

US20140328587A1 PATH COMPUTATION IN WAVELENGTH SWITCHED OPTICAL NETWORKS 有权
标题翻译：波长切换光网络中的路径计算
公开(公告)号：US20140328587A1
公开(公告)日：2014-11-06
申请号：US14343545
申请日：2011-11-03
申请人： Roberto Magri , Piero Castoldi , Filippo Cugini , Francesco Paolucci , Nicola Sambo
发明人： Roberto Magri , Piero Castoldi , Filippo Cugini , Francesco Paolucci , Nicola Sambo
IPC分类号： H04Q11/00 , H04L12/721 , H04B10/079 , H04J14/02
CPC分类号： H04Q11/0066 , H04J14/0257 , H04J14/0258 , H04J14/026 , H04J14/0269 , H04J14/0271 , H04L45/42 , H04L45/62 , H04Q2011/0073 , H04Q2011/0083
摘要： A path computation client (PCC) can request a path computation element (PCE) to compute a path across a wavelength switched optical network. PCC sends a request which identifies end nodes. The end nodes can support a plurality of possible values of a transmission parameter, such as modulation format or Forward Error Correction (FEC) type. The PCE computes a path between the end nodes and sends a reply to the PCC. The reply identifies the path between the end nodes and identifies a selected value of the transmission parameter for the computed path. The reply can comprise a spectrum assignment for the path. The reply can be a PCE Communication Protocol (PCEP) Reply message.
摘要翻译：路径计算客户机（PCC）可以请求路径计算元件（PCE）来计算穿过波长交换光网络的路径。 PCC发送一个标识终端节点的请求。端节点可以支持传输参数的多个可能值，例如调制格式或前向纠错（FEC）类型。 PCE计算端节点之间的路径，并向PCC发送回复。回复标识了结束节点之间的路径，并标识了所计算的路径的传输参数的选定值。答复可以包括路径的频谱分配。该回复可以是PCE通信协议（PCEP）回复消息。

9. 发明授权

US09485553B2 Path computation in wavelength switched optical networks 有权
标题翻译：波长交换光网络中的路径计算
公开(公告)号：US09485553B2
公开(公告)日：2016-11-01
申请号：US14343545
申请日：2011-11-03
申请人： Roberto Magri , Piero Castoldi , Filippo Cugini , Francesco Paolucci , Nicola Sambo
发明人： Roberto Magri , Piero Castoldi , Filippo Cugini , Francesco Paolucci , Nicola Sambo
IPC分类号： H04B10/00 , H04Q11/00 , H04L12/721 , H04J14/02
CPC分类号： H04Q11/0066 , H04J14/0257 , H04J14/0258 , H04J14/026 , H04J14/0269 , H04J14/0271 , H04L45/42 , H04L45/62 , H04Q2011/0073 , H04Q2011/0083
摘要： A path computation client (PCC) can request a path computation element (PCE) to compute a path across a wavelength switched optical network. PCC sends a request which identifies end nodes. The end nodes can support a plurality of possible values of a transmission parameter, such as modulation format or Forward Error Correction (FEC) type. The PCE computes a path between the end nodes and sends a reply to the PCC. The reply identifies the path between the end nodes and identifies a selected value of the transmission parameter for the computed path. The reply can comprise a spectrum assignment for the path. The reply can be a PCE Communication Protocol (PCEP) Reply message.
摘要翻译：路径计算客户机（PCC）可以请求路径计算元件（PCE）来计算穿过波长交换光网络的路径。 PCC发送一个标识终端节点的请求。端节点可以支持传输参数的多个可能值，例如调制格式或前向纠错（FEC）类型。 PCE计算端节点之间的路径，并向PCC发送回复。回复标识了结束节点之间的路径，并标识了所计算的路径的传输参数的选定值。答复可以包括路径的频谱分配。该回复可以是PCE通信协议（PCEP）回复消息。

10. 发明授权

US09768904B2 Method and apparatus for allocating slots for transmission of data 有权
公开(公告)号：US09768904B2
公开(公告)日：2017-09-19
申请号：US14345020
申请日：2011-12-07
申请人： Giulio Bottari , Piero Castoldi , Filippo Cugini , Paola Iovanna , Nicola Sambo
发明人： Giulio Bottari , Piero Castoldi , Filippo Cugini , Paola Iovanna , Nicola Sambo
IPC分类号： H04J14/02
CPC分类号： H04J14/023 , H04J14/0256 , H04J14/0257 , H04J14/0258
摘要： Slots (311) for transmission of data of a particular transmission type over an optical network are allocated by selecting a first available slot (313_2) at an ordinal position corresponding to a multiple of n and allocating the selected first available slot and the next n−1 consecutive slots (313_4, 313_5) from the selected first available slot (313_3), if all n−1 consecutive slots (313_4, 313_5) are available, for transmission of data of the particular transmission type. The data is transmitted over an optical network comprising a plurality of nodes (305, 327) interconnected by optical sections (301, 309, 329, 331) the nodes (305, 327) supporting a plurality of transmission types, wherein transmission of data of the particular transmission type requires a predetermined number n of consecutive slots. Alternatively the slots may be divided in groups (333, 335, 337) and slots are allocated to a group in which all slots are available.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式