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

1. 发明授权

US08842984B2 Methods of protection sharing for multi-protected optical demands in large-scale WDM mesh networks 有权
标题翻译：大规模WDM网状网络中多重保护光学需求的保护共享方法
公开(公告)号：US08842984B2
公开(公告)日：2014-09-23
申请号：US12169204
申请日：2008-07-08
申请人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
发明人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
IPC分类号： H04B10/08 , H04J14/02 , H04L12/24 , H04L12/707
CPC分类号： H04J14/0284 , H04J14/028 , H04J14/0295 , H04L41/0663 , H04L45/22 , H04L45/28
摘要： A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.
摘要翻译：一种用于识别和可选地管理保护资源共享机会的方法和系统，例如在大规模波分多路复用（WDM）网状网络内。

2. 发明授权

US08913481B2 Method and system for efficient provisioning of multiple services for multiple failure restoration in multi-layer mesh networks 有权
标题翻译：用于多层网状网络中多重故障恢复的多业务高效配置的方法和系统
公开(公告)号：US08913481B2
公开(公告)日：2014-12-16
申请号：US11772143
申请日：2007-06-30
申请人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
发明人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
IPC分类号： G01R31/08 , H04L12/24 , H04J14/02 , H04L12/911 , H04L12/927 , H04L12/54 , H04L12/703 , H04L12/707 , H04L12/801 , H04Q11/00
CPC分类号： H04Q11/0062 , H04J14/0284 , H04J14/0289 , H04J14/0293 , H04L41/0663 , H04L41/0681 , H04L41/12 , H04L45/22 , H04L45/28 , H04L47/10 , H04L47/70 , H04L47/728 , H04L47/805 , H04Q2011/0073 , H04Q2011/0079 , H04Q2011/0081 , H04Q2011/0084 , H04Q2011/0086
摘要： A method and system for efficiently provisioning a multiple service, multiple layer mesh network in a manner enabling restoration from multiple failures.
摘要翻译：一种用于以能够从多个故障恢复的方式有效地配置多业务多层网状网络的方法和系统。

3. 发明申请

US20090263124A1 METHODS OF PROTECTION SHARING FOR MULTI-PROTECTED OPTICAL DEMANDS IN LARGE-SCALE WDM MESH NETWORKS 有权
标题翻译：大规模WDM网络中多光纤保护方案的保护方法
公开(公告)号：US20090263124A1
公开(公告)日：2009-10-22
申请号：US12169204
申请日：2008-07-08
申请人： Ahmet A Akyamac , Gary W. Atkinson , Ramesh Nagarajan
发明人： Ahmet A Akyamac , Gary W. Atkinson , Ramesh Nagarajan
IPC分类号： H04B10/08
CPC分类号： H04J14/0284 , H04J14/028 , H04J14/0295 , H04L41/0663 , H04L45/22 , H04L45/28
摘要： A method and system for identifying and, optionally, managing protection resource sharing opportunities, such as within a large-scale wavelength-division multiplexing (WDM) mesh network.
摘要翻译：一种用于识别和可选地管理保护资源共享机会的方法和系统，例如在大规模波分多路复用（WDM）网状网络内。

4. 发明申请

US20090003211A1 Method and System for Efficient Provisioning of Multiple Services for Multiple Failure Restoration in Multi-Layer Mesh Networks 有权
标题翻译：多层网状网络多故障恢复多业务高效配置的方法与系统
公开(公告)号：US20090003211A1
公开(公告)日：2009-01-01
申请号：US11772143
申请日：2007-06-30
申请人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
发明人： Ahmet A. Akyamac , Gary W. Atkinson , Ramesh Nagarajan
IPC分类号： G08C15/00
CPC分类号： H04Q11/0062 , H04J14/0284 , H04J14/0289 , H04J14/0293 , H04L41/0663 , H04L41/0681 , H04L41/12 , H04L45/22 , H04L45/28 , H04L47/10 , H04L47/70 , H04L47/728 , H04L47/805 , H04Q2011/0073 , H04Q2011/0079 , H04Q2011/0081 , H04Q2011/0084 , H04Q2011/0086
摘要： A method and system for efficiently provisioning a multiple service, multiple layer mesh network in a manner enabling restoration from multiple failures.
摘要翻译：一种用于以能够从多个故障恢复的方式有效地配置多业务多层网状网络的方法和系统。

5. 发明授权

US07643408B2 Restoration time in networks 有权
标题翻译：网络恢复时间
公开(公告)号：US07643408B2
公开(公告)日：2010-01-05
申请号：US10815123
申请日：2004-03-31
申请人： Gary W. Atkinson , Michael L. Craner , Ramesh Nagarajan
发明人： Gary W. Atkinson , Michael L. Craner , Ramesh Nagarajan
IPC分类号： H04L1/22
CPC分类号： H04L41/0668 , H04L41/0896 , H04L43/0811
摘要： A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.
摘要翻译：恢复路径规划器通过减少在单个元件发生故障时必须在网络中执行的最坏情况的交叉连接数来满足网络的恢复时间限制，从而最大限度地降低成本。计划员涉及到优化，其识别网络内的需求的主要和恢复路径计划，使得网络内任何节点处的最坏情况数量的交叉连接最小和/或限制。实施例进一步限制路径规划的成本。在一个实施例中，恢复时间是有限的并且成本被放宽直到找到解决方案。在另一个实施例中，将恢复时间限制放宽到极限，同时存储路径计划及其成本。这些计划可以随后在所需的成本和恢复时间之间进行选择。使网络成本最小化的至少一种方法涉及最大化恢复路径规划中的共享。

6. 发明授权

US08670309B2 Method and apparatus for preventing activation of a congestion control process 有权
标题翻译：用于防止拥塞控制过程激活的方法和装置
公开(公告)号：US08670309B2
公开(公告)日：2014-03-11
申请号：US11239765
申请日：2005-09-30
申请人： Gary W. Atkinson , Ramesh Nagarajan , Shyam P. Parekh
发明人： Gary W. Atkinson , Ramesh Nagarajan , Shyam P. Parekh
IPC分类号： H04L12/26
CPC分类号： H04L69/16 , H04L1/1671 , H04L47/10 , H04L47/11 , H04L47/30 , H04L47/32 , H04L69/163
摘要： The invention comprises a method and apparatus that prevents the activation of a congestion controlling process that would otherwise be activated in response any packet loss condition. The congestion controlling process is inhibited when a congestion parameter associated indicates that the packet loss condition is not caused by congestion.
摘要翻译：本发明包括一种方法和装置，其防止在响应任何分组丢失状况的情况下激活的拥塞控制过程的激活。当相关的拥塞参数指示分组丢失状况不是由拥塞引起的，拥塞控制过程被禁止。

7. 发明授权

US07346277B2 Joint-layer restoration in packet-over-optical networks 失效
标题翻译：分组光网络中的联合层恢复
公开(公告)号：US07346277B2
公开(公告)日：2008-03-18
申请号：US10899496
申请日：2004-07-26
申请人： Gary W. Atkinson , Chunxiao Chigan , Ramesh Nagarajan
发明人： Gary W. Atkinson , Chunxiao Chigan , Ramesh Nagarajan
IPC分类号： G02F1/00
CPC分类号： H04L41/0668 , H04J14/0227 , H04J14/0241 , H04J14/0284 , H04L69/16 , H04L69/168 , H04Q11/0071 , H04Q2011/0081
摘要： A joint “packet-optical” layer restoration mechanism protects against single, packet-layer router failures by managing network resources from both the packet layer and the optical transport layer in a synergistic manner. It reuses packet-layer router service-ports and/or transport-layer service wavelengths associated with optical switch-ports instead of reserving additional standby packet-layer router service-ports. It can reuse resources from primary paths that are unaffected by router failures and paths that exist for link-failure protection at the optical layer. Embodiments feature a modified node structure that includes both an IP router and a dynamically reconfigurable OXC, which dynamically establishes connectivity between IP-router ports and transport-layer optical fibers. The joint-layer router provides fine-granularity grooming at the IP layer and full-fledged wavelength networking via dynamic wavelength switching and/or wavelength translation at the optical layer. The latter can change the wavelength cross-connections on-demand to perform restoration or to modify the connectivity between IP routers in the network.
摘要翻译：联合的“分组光”层恢复机制通过以协同方式管理来自分组层和光传输层的网络资源来保护单一的分组路由器故障。它重用与光交换机端口相关联的分组层路由器服务端口和/或传输层服务波长，而不是预留额外的备用分组层路由器服务端口。它可以重用来自不受路由器故障影响的主路由的资源和存在于光层的链路故障保护的路径。实施例具有修改的节点结构，其包括IP路由器和动态可重配置OXC，其动态地建立IP路由器端口和传输层光纤之间的连接。联合层路由器通过光层的动态波长切换和/或波长转换，在IP层和全波长网络中提供细粒度整理。后者可以根据需要改变波长交叉连接以执行恢复或修改网络中IP路由器之间的连接。

8. 发明授权

US08509098B2 Method and apparatus for identifying network connectivity changes in dynamic networks 失效
标题翻译：用于识别动态网络中网络连接变化的方法和装置
公开(公告)号：US08509098B2
公开(公告)日：2013-08-13
申请号：US11414126
申请日：2006-04-28
申请人： Gary W. Atkinson , Xiang Liu , Ramesh Nagarajan , Shyam P. Parekh
发明人： Gary W. Atkinson , Xiang Liu , Ramesh Nagarajan , Shyam P. Parekh
IPC分类号： G01R31/08 , H04W4/00
CPC分类号： H04W40/24 , H04L45/02 , H04W84/18
摘要： The invention comprises a method and apparatus for determining a network connectivity in a network having a plurality of nodes. In particular, one embodiment of the method includes generating a candidate link for each of a plurality of node pairs, predicting a performance of each candidate link by evaluating an expected impact of at least one condition on each candidate link, and determining the network topology using the predicted performances of the candidate links. The performance of each candidate link may be predicted by identifying at least one condition, determining the expected impact of the at least one condition on the candidate link, and predicting the performance of the candidate link by adjusting an expected performance of the candidate link using the expected impact of the at least one condition on the candidate link.
摘要翻译：本发明包括一种用于确定具有多个节点的网络中的网络连接性的方法和装置。特别地，该方法的一个实施例包括为多个节点对中的每一个生成候选链路，通过评估至少一个条件对每个候选链路的预期影响来预测每个候选链路的性能，以及使用候选人链接的预测表现。每个候选链路的性能可以通过识别至少一个条件，确定至少一个条件对候选链路的预期影响以及通过使用该候选链路调整候选链路的预期性能来预测候选链路的性能来预测至少一个条件对候选链接的预期影响。

9. 发明授权

US07646706B2 Restoration time in mesh networks 有权
标题翻译：网状网络中的恢复时间
公开(公告)号：US07646706B2
公开(公告)日：2010-01-12
申请号：US10673056
申请日：2003-09-26
申请人： Abdo Y. Alfakih , Gary W. Atkinson , Carol L. Janczewski , Kamala Murti , Ramesh Nagarajan
发明人： Abdo Y. Alfakih , Gary W. Atkinson , Carol L. Janczewski , Kamala Murti , Ramesh Nagarajan
IPC分类号： G01R31/08 , H04L12/26
CPC分类号： H04L41/0668 , H04L43/0811
摘要： A restoration path planner that minimizes the worst-case number of cross-connections that must be performed in a network in the event of a single element failure involves a two-phase optimization. The first phase involves finding two node-disjoint paths for each service demand within a network such that the maximum link bandwidth in the network is minimized and the link bandwidths within the network are leveled. The second phase involves identifying the primary and restoration paths for each service demand within the network such that the worst-case number of cross-connections at any node within the network is minimized across all possible single-event failures. Embodiments also consider service demand-bundling that groups service demands with the same source-destination node pairs and routes them along identical primary and restoration paths, and banding, which consolidates multiple low-rate demands into a high-rate demand and consequently decreases cross-connections required in the event of a failure.
摘要翻译：在单个单元故障的情况下，最小化必须在网络中执行的最坏情况数量的交叉连接的恢复路径规划涉及两阶段优化。第一阶段涉及为网络内的每个服务需求找到两个节点不相交路径，使得网络中的最大链路带宽最小化，并且网络内的链路带宽被调平。第二阶段涉及识别网络中每个服务需求的主路径和恢复路径，使得网络中任何节点处的最坏情况数量的交叉连接在所有可能的单个事件故障中最小化。实施例还考虑服务需求捆绑，其将服务需求与相同的源 - 目的地节点对进行分组，并将它们沿着相同的主和恢复路径和条带进行路由，并将多个低速率需求合并为高速率需求，发生故障时所需的连接。

10. 发明授权

US10084856B2 Method and apparatus for locating services within peer-to-peer networks 有权
公开(公告)号：US10084856B2
公开(公告)日：2018-09-25
申请号：US12640072
申请日：2009-12-17
申请人： Thomas P. Chu , Ramesh Nagarajan
发明人： Thomas P. Chu , Ramesh Nagarajan
IPC分类号： G06F17/30 , H04L29/08
CPC分类号： H04L67/104 , H04L67/1065 , H04L67/107 , H04L67/16
摘要： A capability is provided for supporting a service location capability in a peer-to-peer network (P2P), such as a Chord network or other P2P network. In one embodiment, a method for locating a service within a P2P network is provided. The P2P network includes a plurality of nodes, including a target node which performs the method for locating the service within the P2P network. The target node includes a search table including a plurality of entries identifying a respective plurality of nodes of the P2P network. The method includes detecting a request to search for the service within the P2P network and initiating, toward at least one of the nodes of the search table, a service search request. The service search request is a request to identify at least one node of the P2P network that supports the service. The service search request includes information indicative of the service and a search range for use by the node receiving the service search request.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式