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

1. 发明授权

US08750161B1 Metropolitan IP aggregation network design tool 失效
标题翻译：大都会IP聚合网络设计工具
公开(公告)号：US08750161B1
公开(公告)日：2014-06-10
申请号：US12972651
申请日：2010-12-20
申请人： David Matthews , Promod Kumar Bhagat , Robert Duncan Doverspike , John Gregory Klincewicz , Jian Li , Guangzhi Li , David Frederick Lynch , Moshe Segal , Dongmei Wang
发明人： David Matthews , Promod Kumar Bhagat , Robert Duncan Doverspike , John Gregory Klincewicz , Jian Li , Guangzhi Li , David Frederick Lynch , Moshe Segal , Dongmei Wang
IPC分类号： H04L12/28
CPC分类号： H04W40/02 , H04L45/12 , H04L45/64
摘要： In a tool for use by network planners in designing metropolitan IP aggregation networks, several optimization methods are integrated into a tool. A k-means algorithm is used to choose access packet switch locations. A dual-k-means algorithm is used to choose the backbone switch locations. Each access packet switch is dual homed to two backbone packet switches using two diverse paths. The diverse path configuration is found using a maxflow-mincost algorithm on a modified fiber map topology. The link topology connecting the backbone packet switches to each other is designed using a heuristic that creates a skeleton network topology and then adds express links one by one, testing each link to assure reduced overall network cost. The resulting network topology is then improved upon by local search.
摘要翻译：在网络规划者用于设计城域IP聚合网络的工具中，将几种优化方法集成到工具中。 k-means算法用于选择接入分组交换机的位置。双k均值算法用于选择主干交换机的位置。每个接入分组交换机被双重归属到两个主干分组交换机，使用两个不同的路径。在修改的光纤映射拓扑上使用maxflow-mincost算法找到不同的路径配置。将骨干分组交换机连接到彼此的链路拓扑结构使用启发式设计，创建骨架网络拓扑，然后逐个添加快速链接，测试每个链路以确保降低整体网络成本。然后通过本地搜索来改进所得到的网络拓扑。

2. 发明授权

US07583795B1 Switched-access network optimization methodology 有权
标题翻译：交换式网络优化方法
公开(公告)号：US07583795B1
公开(公告)日：2009-09-01
申请号：US11214410
申请日：2005-08-29
申请人： Mary Klavetter Florence , Sharon Gauert , David Frederick Lynch , Moshe Segal , Kenneth S. Wonnell
发明人： Mary Klavetter Florence , Sharon Gauert , David Frederick Lynch , Moshe Segal , Kenneth S. Wonnell
IPC分类号： H04M15/00 , H04M7/00
CPC分类号： H04Q3/0083 , H04M15/00 , H04M15/49 , H04M15/50 , H04M15/51 , H04M2215/46 , H04M2215/52 , H04M2215/54 , H04Q2213/13054 , H04Q2213/13099 , H04Q2213/13298 , H04Q2213/13342 , H04Q2213/1338 , H04Q2213/13383
摘要： A methodology for optimizing the access charges paid by a long distance carrier involves the use of a “sizing” operation to determine the optimal balance between direct trunks and access tandems (on a per LATA basis) so as to provide minimal access charges. Once the sizing has been completed, a mixed integer program is used to find the optimal MUX assignments for each LATA. The sizing operation is then re-visited, based on the MUX assignments, to determine if adjustments are required to reduce costs. Any changes in the sizing are then reviewed in the MUX assignment mixed integer program. The end result is a definition of the quantity of direct trunks, access tandem trunks and overflow minutes-of-use charges for each end office, as well as the number of high capacity facilities required for each MUX.
摘要翻译：用于优化长途运营商支付的接入费用的方法涉及使用“大小”操作来确定直接中继线和接入串联之间的最佳平衡（基于每个LATA），以便提供最小的接入费用。一旦完成了大小调整，就可以使用一个混合整数程序来找到每个LATA的最优MUX分配。然后，基于MUX分配重新访问上述大小操作，以确定是否需要调整以降低成本。然后在MUX分配混合整数程序中检查大小调整中的任何更改。最终结果是对每个终端机的直接中继线数量，访问串联中继线和溢出分钟使用费用的定义以及每个MUX所需的高容量设施的数量。

3. 发明授权

US07778893B2 Access network optimization methodology for leased switched and dedicated facilities 失效
标题翻译：访问租用交换和专用设施的网络优化方法
公开(公告)号：US07778893B2
公开(公告)日：2010-08-17
申请号：US12154174
申请日：2008-05-21
申请人： David Frederick Lynch , Moshe Segal
发明人： David Frederick Lynch , Moshe Segal
IPC分类号： G07B17/00
CPC分类号： H04L41/12 , G06Q10/04 , G06Q40/12
摘要： A methodology for optimizing the cost associated with access charges incurred by network service providers when leasing communications facilities from a local service provider has been developed that incorporates physical reconfiguration of the access network topology as a cost-saving measure, where and when appropriate. The methodology identifies opportunities to reduce access charges by performing the following functions: (1) moving T1 facilities from one hub location to another; (2) moving T1 facilities from one T3 facility to another (at the same hub location) in order to disconnect unneeded T3 facilities; and (3) adding new T3 facilities in order to reduce overall access expenses and/or to provide new capacity for future growth, including adding potential new hub locations. The methodology is appropriate for use with various types of network facilities, T1 and T3 being considered as exemplary only.
摘要翻译：已经开发了一种用于优化网络服务提供商在从本地服务提供商租赁通信设施时引起的接入费用的成本的方法，其将接入网络拓扑的物理重配置作为节省成本的措施，在何时并在适当时进行。该方法通过执行以下功能来确定减少接入费用的机会：（1）将T1设备从一个中心位置移动到另一个中心位置; （2）将T1设施从一个T3设施移动到另一个（位于同一枢纽位置），以便断开不需要的T3设施; （3）增加新的T3设施，以减少总体接入费用和/或提供未来增长的新能力，包括增加潜在的新中心位置。该方法适用于各种类型的网络设施，T1和T3仅被认为是典型的。

4. 发明申请

US20090292629A1 Access network optimization methodology for leased switched and dedicated facilities 失效
标题翻译：访问租用交换和专用设施的网络优化方法
公开(公告)号：US20090292629A1
公开(公告)日：2009-11-26
申请号：US12154174
申请日：2008-05-21
申请人： David Frederick Lynch , Moshe Segal
发明人： David Frederick Lynch , Moshe Segal
IPC分类号： G06Q10/00
CPC分类号： H04L41/12 , G06Q10/04 , G06Q40/12
摘要： A methodology for optimizing the cost associated with access charges incurred by network service providers when leasing communications facilities from a local service provider has been developed that incorporates physical reconfiguration of the access network topology as a cost-saving measure, where and when appropriate. The methodology identifies opportunities to reduce access charges by performing the following functions: (1) moving T1 facilities from one hub location to another; (2) moving T1 facilities from one T3 facility to another (at the same hub location) in order to disconnect unneeded T3 facilities; and (3) adding new T3 facilities in order to reduce overall access expenses and/or to provide new capacity for future growth, including adding potential new hub locations. The methodology is appropriate for use with various types of network facilities, T1 and T3 being considered as exemplary only.
摘要翻译：已经开发了一种用于优化网络服务提供商在从本地服务提供商租赁通信设施时引起的接入费用的成本的方法，其将接入网络拓扑的物理重配置作为节省成本的措施，在何时并在适当时进行。该方法通过执行以下功能来确定减少接入费用的机会：（1）将T1设备从一个中心位置移动到另一个中心位置; （2）将T1设施从一个T3设施移动到另一个（位于同一枢纽位置），以便断开不需要的T3设施; （3）增加新的T3设施，以减少总体接入费用和/或提供未来增长的新能力，包括增加潜在的新中心位置。该方法适用于各种类型的网络设施，T1和T3仅被认为是典型的。

5. 发明授权

US06498778B1 Optimizing restoration capacity 失效
标题翻译：优化恢复能力
公开(公告)号：US06498778B1
公开(公告)日：2002-12-24
申请号：US09215433
申请日：1998-12-17
申请人： Sebastian Cwilich , Mei Deng , David James Houck, Jr. , David Frederick Lynch , James Anthony Schmitt , Luiz Antonio Vitoria , Ken Ambs , Dicky Chi Kwong Yan
发明人： Sebastian Cwilich , Mei Deng , David James Houck, Jr. , David Frederick Lynch , James Anthony Schmitt , Luiz Antonio Vitoria , Ken Ambs , Dicky Chi Kwong Yan
IPC分类号： B01R3108
CPC分类号： H04L41/0654
摘要： A method and system are provided for computing an optimal restoration capacity and/or optimal restoration paths for a network to resolve a restoration scenario by solving a linear program (LP) model. The LP model includes decision variables corresponding to restoration capacity and restoration paths and constraints requiring restoration of traffic and conservation of capacity in the network. For example, the system determines a set of network paths that need to be restored in the network, preprocesses network data corresponding to the network to reduce LP processing workload and time; generates possible restoration paths and solves the LP model, preferably through column generation methods, to determine the optimal restoration capacity and/or the optimal restoration paths to resolve the restoration scenario; changes the LP solution into integer form, as necessary, and changes the LP solution in integer form to the original format of the network data or an equivalent thereof.
摘要翻译：提供了一种方法和系统，用于通过解决线性程序（LP）模型来计算网络的最佳恢复容量和/或最佳恢复路径以解决恢复场景。 LP模型包括对应于恢复能力和恢复路径的决策变量以及需要恢复流量和网络中容量节约的约束。例如，系统确定需要在网络中恢复的一组网络路径，预处理与网络相对应的网络数据，以减少LP处理工作量和时间; 生成可能的恢复路径并优选地通过列生成方法来解决LP模型，以确定最佳恢复容量和/或最佳恢复路径以解决恢复场景; 根据需要将LP解决方案更改为整数形式，并将整数形式的LP解决方案更改为网络数据的原始格式或其等价物。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式