会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Method and apparatus for eliminating unprotectable paths from consideration during computation of a protectable shortest path tree
    • 用于在可保护的最短路径树的计算期间消除不可保护路径的方法和装置
    • US06765880B1
    • 2004-07-20
    • US09487366
    • 2000-01-18
    • David A. HillardAnix Anbiah
    • David A. HillardAnix Anbiah
    • H04L1228
    • H04L45/28H04L45/12H04L45/22
    • The invention comprises a method for computing the shortest protectable paths in communication networks, and a method for establishing and defining protected paths. The invention utilizes a new algorithm to exclude from consideration as the “shortest path” between two network elements, a path for which adequate protection cannot be established. Such an unprotectable path will contain one or more unprotectable links. These unprotectable links can be identified and excluded based upon whether or not the link is a member of a loop. Because there are several more computational steps in defining the protected paths, after the shortest path has been found, the initial exclusion of unprotectable path segments from consideration eliminates the potential waste of computational resources leading to a more rapid and efficient routing and provisioning of reliable network paths and circuits.
    • 本发明包括一种用于计算通信网络中最短可保护路径的方法,以及一种用于建立和定义受保护路径的方法。 本发明利用一种新的算法排除在考虑之外,作为两个网元之间的“最短路径”,即不能建立足够保护的路径。 这样一个不受保护的路径将包含一个或多个不可保护的链接。 可以根据链路是否是循环的成员来识别和排除这些不可保护的链接。 由于在定义受保护路径方面还有更多的计算步骤,在找到最短路径之后,不考虑路由段的考虑的初始排除消除了计算资源的潜在浪费,从而导致可靠网络的更快速和更有效的路由和供应 路径和电路。