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

1. 发明申请

US20130091257A1 NETWORK RESOURCE CONSOLIDATION AND DECOMISSIONING ANALYSIS 有权
标题翻译：网络资源综合与放弃分析
公开(公告)号：US20130091257A1
公开(公告)日：2013-04-11
申请号：US13253474
申请日：2011-10-05
申请人： Nandagopal Venugopal , Thomas P. Newcomer , Agustin Pecorari
发明人： Nandagopal Venugopal , Thomas P. Newcomer , Agustin Pecorari
IPC分类号： G06F15/177
CPC分类号： H04L41/0826 , H04L41/0803 , H04L41/145
摘要： A method and system for providing a computing environment that permits simulations directed towards the consolidation and decommissioning of network elements associated with a network. The computing environment permits a user to designate a network element for decommission and exclude a network element from decommission and/or consolidation. The computing environment includes consolidation and decommission analytics that minimize a total operational cost of the network including leased network elements. The consolidation and decommission analytics includes accounting for penalties associated with early termination of leases and break-even values.
摘要翻译：一种用于提供允许针对与网络相关联的网络元件的合并和停用的模拟的计算环境的方法和系统。计算环境允许用户指定用于退出的网络元件，并且将网络元素排除在退出和/或合并之外。计算环境包括整合和停止分析，以最小化网络的总运营成本，包括租用的网络元素。整合和退役分析包括与提前终止租赁和盈亏平衡价值相关的处罚。

2. 发明授权

US08924555B2 Network resource consolidation and decommissioning analysis 有权
标题翻译：网络资源整合与退役分析
公开(公告)号：US08924555B2
公开(公告)日：2014-12-30
申请号：US13253474
申请日：2011-10-05
申请人： Nandagopal Venugopal , Thomas P. Newcomer , Agustin Pecorari
发明人： Nandagopal Venugopal , Thomas P. Newcomer , Agustin Pecorari
IPC分类号： H04L12/24
CPC分类号： H04L41/0826 , H04L41/0803 , H04L41/145
摘要： A method and system for providing a computing environment that permits simulations directed towards the consolidation and decommissioning of network elements associated with a network. The computing environment permits a user to designate a network element for decommission and exclude a network element from decommission and/or consolidation. The computing environment includes consolidation and decommission analytics that minimize a total operational cost of the network including leased network elements. The consolidation and decommission analytics includes accounting for penalties associated with early termination of leases and break-even values.
摘要翻译：一种用于提供允许针对与网络相关联的网络元件的合并和停用的模拟的计算环境的方法和系统。计算环境允许用户指定用于退出的网络元件，并且将网络元素排除在退出和/或合并之外。计算环境包括整合和停止分析，以最小化网络的总运营成本，包括租用的网络元素。整合和退役分析包括与提前终止租赁和盈亏平衡价值相关的处罚。

3. 发明授权

US08570875B2 Determining collocations with an access transport management system (ATMS) 失效
标题翻译：使用接入传输管理系统（ATMS）确定并置
公开(公告)号：US08570875B2
公开(公告)日：2013-10-29
申请号：US12413965
申请日：2009-03-30
申请人： Nandagopal Venugopal , Thomas P Newcomer
发明人： Nandagopal Venugopal , Thomas P Newcomer
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L41/0826 , H04Q3/0062
摘要： A device receives network configuration information from a network, determines a new capacity model of the network based on the network configuration information, and constructs a mixed integer programming (MIP) model based on the new capacity model. The device also calculates an optimal baseline solution, that minimizes network costs, using the mixed integer programming (MIP) model, performs a collocation optimization procedure on the optimal baseline solution to produce an optimal collocation solutions for the network, and provides the optimal network collocation solutions to the network for implementation.
摘要翻译：设备从网络接收网络配置信息，基于网络配置信息确定网络的新容量模型，并基于新的容量模型构建混合整数规划（MIP）模型。该设备还使用混合整数规划（MIP）模型，计算最佳基线解决方案，从而最大限度地减少网络成本，对最优基线解决方案进行配置优化程序，为网络产生最佳配置方案，并提供最佳网络搭配网络解决方案实施。

4. 发明授权

US08443079B2 Mixed integer programming model for minimizing leased access network costs 失效
标题翻译：混合整数规划模型，用于最大限度地减少租用的接入网络成本
公开(公告)号：US08443079B2
公开(公告)日：2013-05-14
申请号：US13095383
申请日：2011-04-27
申请人： Nandagopal Venugopal , Thomas P. Newcomer
发明人： Nandagopal Venugopal , Thomas P. Newcomer
IPC分类号： G06F15/177
CPC分类号： H04L41/0856 , H04L41/0806 , H04L41/0823
摘要： A device receives network configuration information from a network, determines a logical network based on the network configuration information, and constructs a mixed integer programming (MIP) model based on the logical network. The device also calculates an optimal solution, which minimizes network costs, using the mixed integer programming (MIP) model, performs a post-optimization mapping procedure on the optimal solution to produce an optimal network configuration mapping, and outputs the optimal network configuration mapping for implementation.
摘要翻译：设备从网络接收网络配置信息，基于网络配置信息确定逻辑网络，并构建基于逻辑网络的混合整数规划（MIP）模型。该设备还使用混合整数规划（MIP）模型计算出最优解决方案，从而最大限度地减少网络成本，对最优解进行优化后映射，以产生最佳的网络配置映射，并为实施。

5. 发明授权

US08027260B2 Mixed integer programming model for minimizing leased access network costs 失效
标题翻译：混合整数规划模型，用于最大限度地减少租用的接入网络成本
公开(公告)号：US08027260B2
公开(公告)日：2011-09-27
申请号：US12178165
申请日：2008-07-23
申请人： Nandagopal Venugopal , Thomas P Newcomer
发明人： Nandagopal Venugopal , Thomas P Newcomer
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L41/0856 , H04L41/0806 , H04L41/0823
摘要： A device receives network configuration information from a network, determines a logical network based on the network configuration information, and constructs a mixed integer programming (MIP) model based on the logical network. The device also calculates an optimal solution, which minimizes network costs, using the mixed integer programming (MIP) model, performs a post-optimization mapping procedure on the optimal solution to produce an optimal network configuration mapping, and outputs the optimal network configuration mapping for implementation.
摘要翻译：设备从网络接收网络配置信息，基于网络配置信息确定逻辑网络，并构建基于逻辑网络的混合整数规划（MIP）模型。该设备还使用混合整数规划（MIP）模型计算出最优解决方案，从而最大限度地减少网络成本，对最优解进行优化后映射，以产生最佳的网络配置映射，并为实施。

6. 发明授权

US06654354B1 System and method for planning multiple MUX levels in a fiber optic network simulation plan 失效
标题翻译：在光纤网络仿真计划中规划多个MUX级别的系统和方法
公开(公告)号：US06654354B1
公开(公告)日：2003-11-25
申请号：US09469691
申请日：1999-12-22
申请人： Kristen L. Watkins , Nandagopal Venugopal
发明人： Kristen L. Watkins , Nandagopal Venugopal
IPC分类号： H04B1008
CPC分类号： H04L41/145 , H04J3/085 , H04J2203/0055
摘要： A system and method for optimizing placement of network equipment and information load in a network over a period of time. A demand input structure having a plurality of demands organized by their time points and MUX levels is provided as an input to a model generator and an optimization processor associated therewith. Starting with the earliest demand with the highest MUX level to be serviced by the network, a directed graph network model is obtained by using appropriate transformation techniques. A MUX modularity constraint is imposed in order to obtain a filtered network model that can support a MUX level of a selected demand at a particular time point. A cost function associated with the filtered network model is constructed using a flow cost term and an equipment cost term. Appropriate constraints are imposed on the cost function for optimization. A solution set comprising network placement information and demand routing information is obtained for a MUX level at a current time point. When the next MUX level of the demand is taken up for optimization, the filtered network model and associated cost function are recursively updated by using the solution set obtained for the previous MUX level. The recursive optimization process takes place for each time point, covering all MUX levels at that time point, as provided in the demand input structure. Preferably, Priority 1 demands are optimized first. Thereafter, Priority 2 demands are optimized by employing a capacitated shortest path algorithm with respect to each Priority 2 demand presented in its order.
摘要翻译：一种在一段时间内优化网络设备和网络信息负载的布局的系统和方法。提供具有由其时间点和MUX等级组织的多个需求的需求输入结构作为模型生成器和与其相关联的优化处理器的输入。从网络服务的最高MUX级别的最早需求开始，通过使用适当的转换技术获得有向图网络模型。施加MUX模块化约束以获得可以在特定时间点支持所选需求的MUX级别的滤波网络模型。与过滤的网络模型相关联的成本函数使用流量成本术语和设备成本项来构建。对优化的成本函数施加适当的约束。针对当前时间点的MUX级别获得包括网络布置信息和需求路由信息的解集。当需求的下一个MUX级别用于优化时，通过使用为先前的MUX级别获得的解集来递归更新滤波的网络模型和相关的成本函数。递归优化过程发生在每个时间点，涵盖在该时间点的所有MUX级别，如需求输入结构中所提供的。优选地，优先级1要求首先被优化。此后，通过对其顺序中呈现的每个优先级2需求采用电容化最短路径算法来优化优先级2的要求。

7. 发明授权

US06763326B1 System and method for staggering time points for deployment of rings in a fiber optic network simulation plan 失效
标题翻译：用于在光纤网络仿真计划中部署环的交错时间点的系统和方法
公开(公告)号：US06763326B1
公开(公告)日：2004-07-13
申请号：US09469527
申请日：1999-12-22
申请人： Kristen L. Watkins , Nandagopal Venugopal
发明人： Kristen L. Watkins , Nandagopal Venugopal
IPC分类号： G06F944
CPC分类号： H04L41/145
摘要： A system and method for optimizing placement of network equipment and information load in a network over a period of time. A demand input structure having a plurality of demands organized by their time points is provided as an input to a model generator and an optimization processor associated therewith. Starting with the earliest demand set to be serviced by the network, a directed graph network model is obtained by using appropriate transformation techniques. A cost function associated with the network model is constructed using a flow cost term and an equipment cost term. Appropriate constraints are imposed on the cost function for optimization. A solution set comprising network placement information and demand routing information is obtained for a current time point. When the next demand set is taken up for optimization, the network model and associated cost function are recursively updated by using the solution set obtained for the demand set at a prior time point. The recursive optimization process takes place for each of the demand sets provided in the demand input structure in accordance with their time points. Preferably, Priority 1 demands are optimized first. Thereafter, Priority 2 demands are optimized by employing a capacitated shortest path algorithm with respect to each Priority 2 demand presented in its order.
摘要翻译：一种在一段时间内优化网络设备和网络信息负载的布局的系统和方法。提供具有由其时间点组织的多个需求的需求输入结构作为模型生成器和与其相关联的优化处理器的输入。从网络服务的最早需求开始，通过使用适当的转换技术获得有向图网络模型。与网络模型相关联的成本函数使用流量成本术语和设备成本项构建。对优化的成本函数施加适当的约束。针对当前时间点获得包括网络布置信息和需求路由信息的解集。当下一个需求集合被用于优化时，网络模型和相关联的成本函数通过使用在先前时间点为需求集获得的解集进行递归更新。根据需求输入结构中提供的每个需求集合，递归优化过程根据其时间点进行。优选地，优先级1要求首先被优化。此后，通过对其顺序中呈现的每个优先级2需求采用电容化最短路径算法来优化优先级2的要求。

8. 发明授权

US07318016B2 System and method for staggering time points for deployment of rings in a fiber optic network simulation plan 失效
标题翻译：用于在光纤网络仿真计划中部署环的交错时间点的系统和方法
公开(公告)号：US07318016B2
公开(公告)日：2008-01-08
申请号：US10778021
申请日：2004-02-17
申请人： Kristen L. Watkins , Nandagopal Venugopal
发明人： Kristen L. Watkins , Nandagopal Venugopal
IPC分类号： G06F9/44
CPC分类号： H04L41/145
摘要： A system and method for optimizing placement of network equipment and information load in a network over a period of time. A demand input structure having a plurality of demands organized by their time points is provided as an input to a model generator and an optimization processor associated therewith. Starting with the earliest demand set to be serviced by the network, a directed graph network model is obtained by using appropriate transformation techniques. A cost function associated with the network model is constructed using a flow cost term and an equipment cost term. Appropriate constraints are imposed on the cost function for optimization. A solution set comprising network placement information and demand routing information is obtained for a current time point. When the next demand set is taken up for optimization, the network model and associated cost function are recursively updated by using the solution set obtained for the demand set at a prior time point. The recursive optimization process takes place for each of the demand sets provided in the demand input structure in accordance with their time points. Preferably, Priority 1 demands are optimized first. Thereafter, Priority 2 demands are optimized by employing a capacitated shortest path algorithm with respect to each Priority 2 demand presented in its order.
摘要翻译：一种在一段时间内优化网络设备和网络信息负载的布局的系统和方法。提供具有由其时间点组织的多个需求的需求输入结构作为模型生成器和与其相关联的优化处理器的输入。从网络服务的最早需求开始，通过使用适当的转换技术获得有向图网络模型。与网络模型相关联的成本函数使用流量成本术语和设备成本项构建。对优化的成本函数施加适当的约束。针对当前时间点获得包括网络布置信息和需求路由信息的解集。当下一个需求集合被用于优化时，网络模型和相关联的成本函数通过使用在先前时间点为需求集获得的解集进行递归更新。根据需求输入结构中提供的每个需求集合，递归优化过程根据其时间点进行。优选地，优先级1要求首先被优化。此后，通过对其顺序中呈现的每个优先级2需求采用电容化最短路径算法来优化优先级2的要求。

9. 发明申请

US20050204033A1 Apparatus and method for designing ring covers 有权
标题翻译：环形罩设计及方法
公开(公告)号：US20050204033A1
公开(公告)日：2005-09-15
申请号：US10797029
申请日：2004-03-11
申请人： Nandagopal Venugopal , Aruna Apte
发明人： Nandagopal Venugopal , Aruna Apte
IPC分类号： G06F15/173
CPC分类号： H04L12/437 , H04L41/0668 , H04L41/147 , H04L45/48
摘要： A system and method are provided for designing ring cover candidates for a network. A ring cover candidate is generated based on configuration information and traffic demand information associated with the network. The ring cover candidate includes a group of rings, where each ring includes a group of network spans. In some implementations consistent with the principles of the invention, a report including characteristics of a ring cover candidate may be generated.
摘要翻译：提供了一种用于为网络设计环覆盖候选的系统和方法。基于与网络相关联的配置信息和业务需求信息生成环覆盖候选。环覆盖候选者包括一组环，其中每个环包括一组网络跨度。在与本发明的原理一致的一些实现中，可以生成包括环盖候选的特性的报告。

10. 发明授权

US06798747B1 System and method for time slot assignment in a fiber optic network simulation plan 失效
标题翻译：光纤网络仿真计划中时隙分配的系统和方法
公开(公告)号：US06798747B1
公开(公告)日：2004-09-28
申请号：US09470666
申请日：1999-12-22
申请人： Kristen L. Watkins , Nandagopal Venugopal
发明人： Kristen L. Watkins , Nandagopal Venugopal
IPC分类号： H04L1228
CPC分类号： H04J3/085 , H04J2203/0069
摘要： A system and method for providing Time Slot Assignment (TSA)-compatible routes that optimize demand transport in a network with optimal placement of network equipment. A demand input structure having a plurality of demands organized by their time points and MUX levels is provided as an input to a model generator and an optimization processor associated therewith. After recursively optimizing the network for each MUX level/time point combination, demand routes are analyzed to verify whether they are TSA-compatible. Where demands with TSA-blocked routes are found, blocking spans are identified and a cost associated therewith is increased during an iterative re-routing process with respect to each of such blocked demands. Accordingly, alternate spans are discovered that may allow TSA transport for the blocked demands. The iterative re-routing process is effectuated by using a capacitated shortest path algorithm, and may be bounded by a limit on the number of iterations or a timeout period.
摘要翻译：一种用于提供时隙分配（TSA）兼容路由的系统和方法，其优化网络中具有最佳布局的网络中的需求传输。提供具有由其时间点和MUX等级组织的多个需求的需求输入结构作为模型生成器和与其相关联的优化处理器的输入。在针对每个MUX级别/时间点组合递归优化网络后，分析需求路由以验证其是否与TSA兼容。当发现TSA阻塞路由的需求时，针对每个这样的被阻塞的需求，在迭代重路由过程期间，识别出阻塞跨度并且与其相关联的成本增加。因此，发现替代跨度可能允许TSA传输阻塞的需求。迭代重路由过程通过使用电容最短路径算法来实现，并且可能受到迭代次数或超时周期的限制的限制。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式