发明授权
US07590067B2 Method and apparatus for deriving allowable paths through a network with intransitivity constraints
失效
通过具有不确定性限制的网络导出允许路径的方法和装置
- 专利标题： Method and apparatus for deriving allowable paths through a network with intransitivity constraints
- 专利标题（中）： 通过具有不确定性限制的网络导出允许路径的方法和装置
-
申请号： US10691517申请日： 2003-10-24
-
公开(公告)号： US07590067B2公开(公告)日： 2009-09-15
- 发明人: Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
- 申请人： Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
- 申请人地址： CA St. Laurent, Quebec
- 专利权人： Nortel Networks Limtied
- 当前专利权人： Nortel Networks Limtied
- 当前专利权人地址： CA St. Laurent, Quebec
- 代理机构： Ogilvy Renault LLP
- 主分类号： G01R31/08
- IPC分类号： G01R31/08
摘要：
A method of computing allowable routes through a data network that includes a subnetwork that introduces a subnet intransitivity constraint on allowable paths through the network involves using an abstracted network map to construct a directed graph that compensates for the subset intransitivity constraint by removing all unallowable paths. The abstracted network map may be used to compute least cost allowable paths through the network. The directed graph represents the same network, and is constructed by representing bi-directional links between the subnetwork elements with two directed edges, and representing the subnetwork elements as paired ingress and egress nodes. A method for constructing the directed graph representing an abstracted map of a network that exhibits subset intransitivity is also described.
公开/授权文献
信息查询
