首页> 外国专利> Method for finding shortest network routing paths subject to system constraints

Method for finding shortest network routing paths subject to system constraints

机译:查找受系统约束的最短网络路由路径的方法

摘要

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.
机译:公开了一种用于确定网络中的源节点和目的节点之间的最短路径的方法,其中所述路径满足施加的系统约束。根据本发明的方法,通过累积来自源节点的系统参数信息并将系统参数信息投影到目的地节点来评估候选路径。当候选路径的累积和投影系统参数信息满足施加的系统约束时,将保留候选路径以进行进一步评估。候选路径按顺序排序,以使最有可能具有最短长度并满足施加的系统约束的那些路径首先得到评估。在本发明的一个实施例中,将不满足强加的系统约束的候选路径从进一步的处理中去除。因此,仅进一步评估具有至少一个完整路径的候选路径,该完整路径满足所施加的系统约束。

著录项

  • 公开/公告号US6762997B1

    专利类型

  • 公开/公告日2004-07-13

    原文格式PDF

  • 申请/专利权人 LUCENT TECHNOLOGIES INC.;

    申请/专利号US20000537791

  • 发明设计人 GANG LIU;KAJAMALAI G. RAMAKRISHNAN;

    申请日2000-03-29

  • 分类号H04L125/60;

  • 国家 US

  • 入库时间 2022-08-21 23:18:54

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号