会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same
    • 快速和可扩展的近似方法,用于通过共享恢复策略找到最低成本流量,并使用系统
    • US07280526B2
    • 2007-10-09
    • US10053079
    • 2002-01-17
    • Lisa Karen FleischerIraj SanieeFrederick Bruce ShepherdAravind Srinivasan
    • Lisa Karen FleischerIraj SanieeFrederick Bruce ShepherdAravind Srinivasan
    • H04L12/28H04J3/16G01R31/08
    • H04L45/50H04L45/00H04L45/123H04L45/28H04Q11/0062H04Q2011/0073H04Q2011/0077H04Q2011/0081H04Q2011/0086
    • Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value. If the function is less than a predetermined value, then the commodity selection, and flow and cost adjustments are again performed. If the function is greater than the predetermined amount, then the network routing problem is solved to within a predetermined amount from an optimal network routing.
    • 广泛地,公开了在预定误差内解决网络路由的技术。 这些技术可以应用于支持专用储备容量的网络,其中网络上的链路上的保留容量专用于特定商品(通常是源和计算机对),以及共享恢复,其中共享链路上的预留容量 两种以上的商品。 这些技术使用迭代过程来确定网络中每个链路上的流量。 为每个商品设置成本,并初始化主要和次要(即备份)流。 选择商品,并通过最短路径路由商品的需求。 每个潜在的故障模式都会更新成本。 对于每种商品,流量和成本都会更新。 一旦所有流量和成本被更新,则确定功能是否小于预定值。 如果功能小于预定值,则再次执行商品选择,流量和成本调整。 如果该功能大于预定量,则将网络路由问题从最佳网络路由解决到预定量内。