会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method for finding shortest network routing paths subject to system constraints
    • 用于查找受到系统约束的最短网络路由路径的方法
    • US06762997B1
    • 2004-07-13
    • US09537791
    • 2000-03-29
    • Gang LiuKajamalai G. Ramakrishnan
    • Gang LiuKajamalai G. Ramakrishnan
    • H04L1256
    • H04L45/12H04L45/121H04L45/302
    • A method is disclosed for determining the shortest paths between a source node and a destination node in a network wherein the paths satisfy imposed system constraints. In accordance with the method of the invention, candidate paths are evaluated by accumulating system parameter information from a source node and projecting the system parameter information ahead to the destination node. When the accumulated and projected system parameter information for the candidate path satisfies the imposed system constraints, the candidate path is saved for further evaluation. The candidate paths are sorted in the order such that those paths most-likely to have the shortest lengths and satisfy the imposed system constraint are evaluated first. In one embodiment of the invention, candidate paths that fail to satisfy the imposed system constraints are removed from further processing. Thus, only candidate paths that have at least one complete path that satisfies the imposed system constraints are evaluated further.
    • 公开了一种用于确定网络中的源节点和目的地节点之间的最短路径的方法,其中路径满足强制的系统约束。 根据本发明的方法,通过从源节点累积系统参数信息并将系统参数信息提前到目的地节点来评估候选路径。 当候选路径的累积和投影系统参数信息满足施加的系统约束时,保存候选路径用于进一步评估。 候选路径按顺序排序,以便首先评估最有可能具有最短长度并满足施加的系统约束的那些路径。 在本发明的一个实施例中,不能满足施加的系统约束的候选路径被从进一步处理中去除。 因此,仅进一步评估具有满足施加的系统约束的至少一个完整路径的候选路径。