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

1. 发明授权

US6073248A Distributed precomputation of signal paths in an optical network 失效
标题翻译：光网络中信号路径的分布预计算
公开(公告)号：US6073248A
公开(公告)日：2000-06-06
申请号：US960462
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： H04J14/02 , H04Q11/00 , G06F11/00 , H04B10/20
CPC分类号： H04Q11/0062 , H04J14/0227 , H04J14/0241 , H04J14/0278 , H04J14/0284 , H04Q2011/0086
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

2. 发明授权

US6151304A Distributed precomputation of network signal paths with improved performance through parallelization 失效
标题翻译：分布式预先计算网络信号路径，通过并行化提高性能
公开(公告)号：US6151304A
公开(公告)日：2000-11-21
申请号：US959809
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： G06F17/10 , H04J14/02 , G01R31/08
CPC分类号： H04J14/0227 , G06F17/10 , H04J14/0241 , H04J14/0278 , H04J14/0284
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

3. 发明授权

US06021113A Distributed precomputation of network signal paths with table-based link capacity control 失效
标题翻译：基于表的链路容量控制的网络信号路径的分布式预计算
公开(公告)号：US06021113A
公开(公告)日：2000-02-01
申请号：US960569
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： H04J14/02 , H04Q11/00 , G01R31/08
CPC分类号： H04Q11/0005 , H04J14/0227 , H04J14/0241 , H04J14/0284 , H04Q2011/005 , H04Q2011/0081
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

4. 发明授权

US6130875A Hybrid centralized/distributed precomputation of network signal paths 失效
标题翻译：网络信号路径的混合集中/分布式预计算
公开(公告)号：US6130875A
公开(公告)日：2000-10-10
申请号：US959800
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： G01R31/08 , H04J1/16 , H04J3/14 , G06F11/01
CPC分类号： H04J14/0227 , H04J14/0241 , H04L41/0659 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/302 , H04L45/42 , H04L45/44 , H04L45/62 , H04Q11/0062 , H04J14/0278 , H04J14/0284 , H04L41/12 , H04Q2011/0073 , H04Q2011/0081 , H04Q2011/0086
摘要： Precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. A hybrid centralized/distributed approach is provided in which certain information used in distributed precomputation is downloaded from a central controller of the network. The downloaded information is used as an input to a distributed precomputation algorithm implemented by the network nodes in order to provide improved performance. The central controller makes use of its knowledge of global network topology in computing the information to be downloaded to the nodes. The downloaded information generally represents network information which changes with less frequency than other network information processed by the nodes as part of the distributed precomputation algorithm. The information downloaded from the central controller may include, for example, network connectivity information, capacities for at least a subset of the links in the network, a subset of all possible routes between a source node and a destination node in the network arranged in an appropriate initial search order, a link contention index for each of the links in the network, and indices assigned to one or more of the nodes and links of the network, wherein the indices are used to determine an order of processing operations involving the one or more nodes and links of the network.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的预计算技术。提供了一种混合集中/分布式方法，其中从分布式预计算中使用的某些信息从网络的中央控制器下载。下载的信息被用作由网络节点实现的分布式预计算算法的输入，以提供改进的性能。中央控制器利用其全球网络拓扑知识计算要下载到节点的信息。所下载的信息通常表示作为分布式预计算算法的一部分而以节点处理的其他网络信息的频率更少的网络信息。从中央控制器下载的信息可以包括例如网络连通性信息，网络中链路的至少一个子集的容量，网络中的源节点和目的地节点之间的所有可能路由的子集，适当的初始搜索顺序，网络中每个链路的链路争用索引以及分配给网络中的一个或多个节点和链路的索引，其中，索引用于确定涉及该一个或多个网络的处理操作的顺序更多的网络节点和链接。

5. 发明授权

US06215763B1 Multi-phase process for distributed precomputation of network signal paths 失效
标题翻译：网络信号路径分布式预计算的多阶段过程
公开(公告)号：US06215763B1
公开(公告)日：2001-04-10
申请号：US08960463
申请日：1997-10-29
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： G01R3108
CPC分类号： H04J14/0227 , H04J14/0241 , H04J14/0278 , H04J14/0284 , H04Q11/0005 , H04Q2011/005 , H04Q2011/0081
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

6. 发明授权

US06205117B1 Distributed precomputation of network signal paths with table-based link capacity control 有权
标题翻译：基于表的链路容量控制的网络信号路径的分布式预计算
公开(公告)号：US06205117B1
公开(公告)日：2001-03-20
申请号：US09448266
申请日：1999-11-24
申请人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
发明人： Bharat Tarachand Doshi , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Yufei Wang
IPC分类号： G01R3108
CPC分类号： H04Q11/0005 , H04J14/0227 , H04J14/0241 , H04J14/0284 , H04Q2011/005 , H04Q2011/0081
摘要： Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.
摘要翻译：用于确定光或电网络中的主路径和/或恢复路径的分布式预计算技术。本发明提供了许多部分和完全异步的分布式预计算算法，其可以例如由全光网络的节点来实现，其中网络链路在光信号波长和故障隔离方面受到约束。给定的分布式预计算算法可以包括第一阶段，在第一阶段中，在不解决争用的情况下尽可能地分配用于容量需求的路径，以及解决相同容量的需求之间的争用的第二阶段。第一阶段可以实施争用锁定机制，其锁定给定需求的主要路径以防止其他需求竞争相同的容量;以及链路容量控制机制，其涉及将链路状态表存储在一个或多个节点处，所述链路状态表列出了受到故障影响的一些具体故障和需求。分布式预先计算算法的第二阶段重新路由先前分配给一个或多个需求的路径，以便释放另一个需求所需的容量，从而优化整体网络容量利用率。

7. 发明授权

US06662308B1 Dual-homing select architecture 有权
标题翻译：双归选择架构
公开(公告)号：US06662308B1
公开(公告)日：2003-12-09
申请号：US09468714
申请日：1999-12-21
申请人： Stefano Baroni , Bharat Tarachand Doshi , Paramasiviah Harshavardhana , Muhammed Akber Qureshi , Antonio Rodriguez-Moral , David Sugarmen
发明人： Stefano Baroni , Bharat Tarachand Doshi , Paramasiviah Harshavardhana , Muhammed Akber Qureshi , Antonio Rodriguez-Moral , David Sugarmen
IPC分类号： G06F1100
CPC分类号： H04L45/02 , H04L45/22 , H04L69/40
摘要： A network architecture comprised of nodes and a transport network capable of recovering from failures within the network. The network architecture incorporates select functions into the nodes for managing the data flow between individual edge routers and their connection through core routers to the transport network. The select function allows an individual node to recover independently without signaling other nodes over the transport network. Utilizing the select function, the failure of a single core router can be recovered locally without recovery signaling over the transport network.
摘要翻译：由节点和能够从网络内的故障中恢复的传输网络组成的网络架构。网络架构将选择功能集成到节点中，用于管理各个边缘路由器之间的数据流以及通过核心路由器到传输网络的连接。选择功能允许单个节点独立地恢复，而不需要通过传输网络发送其他节点。利用选择功能，可以在本地恢复单核心路由器的故障，而无需通过传输网络进行恢复信令。

8. 发明授权

US5995612A Telecommunications system architecture 失效
标题翻译：电信系统架构
公开(公告)号：US5995612A
公开(公告)日：1999-11-30
申请号：US780065
申请日：1996-12-23
申请人： Bharat Tarachand Doshi , Norman Farber , Thomas S. Giuffrida , Paramasiviah Harshavardhana , Mahalakshmi Jairam , Pravin Kumar Johri , Arik Kashper , Steven S. Katz
发明人： Bharat Tarachand Doshi , Norman Farber , Thomas S. Giuffrida , Paramasiviah Harshavardhana , Mahalakshmi Jairam , Pravin Kumar Johri , Arik Kashper , Steven S. Katz
IPC分类号： H04Q3/00 , H04M7/00 , H04M3/00
CPC分类号： H04Q3/0016 , H04Q3/0062 , H04Q2213/13097 , H04Q2213/13103 , H04Q2213/13106 , H04Q2213/13141 , H04Q2213/13176 , H04Q2213/13222 , H04Q2213/13282 , H04Q2213/13296 , H04Q2213/13342 , H04Q2213/13345 , H04Q2213/13349 , H04Q2213/1338 , H04Q2213/13527
摘要： The efficiency of a telecommunications network is enhanced by associating each of the communication switches forming the network with an external connection control processor and forming the switches into respective groups of communication switches. The communication switches forming a respective group of switches are fully interconnected to one another and then each of the communications switches forming a respective one of the groups is connected at least one other group of telecommunication switches as a way of interconnecting the groups with one another.
摘要翻译：通过将形成网络的每个通信交换机与外部连接控制处理器相关联并将交换机组成相应的通信交换机组来增强电信网络的效率。形成相应组的交换机的通信交换机彼此完全互连，并且然后形成组中的相应一个的每个通信交换机连接至少一个其他组的电信交换机，作为将组彼此互连的一种方式。

9. 发明授权

US06909700B1 Network topology optimization methods and apparatus for designing IP networks with performance guarantees 失效
标题翻译：网络拓扑优化方法和设备，用于设计具有性能保证的IP网络
公开(公告)号：US06909700B1
公开(公告)日：2005-06-21
申请号：US09198728
申请日：1998-11-24
申请人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
发明人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
IPC分类号： G06F17/50 , H04L12/24 , H04L12/28 , H04J3/14
CPC分类号： H04L41/145
摘要： Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.
摘要翻译：提供了与现有IP网络（例如，以尽力而为标准设计的那些网络）相比，用于设计具有显着改善的性能的IP网络的方法和装置。特别地，本发明包括用于：计算最坏情况和乐观链路能力要求的方法和装置; 优化网络拓扑; 并确定网络中的路由器布局。

10. 发明授权

US06795399B1 Link capacity computation methods and apparatus for designing IP networks with performance guarantees 失效
标题翻译：链路容量计算方法和设备，用于设计具有性能保证的IP网络
公开(公告)号：US06795399B1
公开(公告)日：2004-09-21
申请号：US09198727
申请日：1998-11-24
申请人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
发明人： Lotfi Benmohamed , Subrahmanyam Dravida , Paramasiviah Harshavardhana , Wing Cheong Lau , Ajay Kumar Mittal
IPC分类号： H04L500
CPC分类号： H04L47/10
摘要： Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.
摘要翻译：提供了与现有IP网络（例如，以尽力而为标准设计的那些网络）相比，用于设计具有显着改善的性能的IP网络的方法和装置。特别地，本发明包括用于：计算最坏情况和乐观链路能力要求的方法和装置; 优化网络拓扑; 并确定网络中的路由器布局。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式