专利名称：Parallel constraint based path computation
using path vector
发明人：Peter Ashwood-Smith,Darek Skalecki,Gary
McKenna
申请号：US11239111申请日：20050930公开号：US07639631B2公开日：20091229
专利附图：
摘要：Methods of computing a path through a network between a source node and adestination node. At the source node, an explore message is launched into at least one
link hosted by the source node. The explore message includes a path vector containing anode identifier of the source node. At a node intermediate the source node and thedestination node, the explore message is received, and each link hosted by the node thatcan be operably added to the path is identified. A respective node identifier of the nodeis added to the path vector of the explore message, which is then forwarded througheach identified link. At the destination node, the respective path vector is extracted fromat least one received explore message.
申请人：Peter Ashwood-Smith,Darek Skalecki,Gary McKenna
地址：Hull CA,Kanata CA,Kanata CA
国籍：CA,CA,CA
代理机构：Ogilvy Renault LLP
更多信息请下载全文后查看
因篇幅问题不能全部显示，请点此查看更多更全内容