首页> 外国专利> Computing paths with ordered abstract hops

Computing paths with ordered abstract hops

机译:使用有序抽象跃点计算路径

摘要

A network device receives configuration information defining one or more abstract hops for which membership is defined as those network devices that satisfy a logical combination of one or more constituent attributes. The network device determines based on network topology information, for each of the defined abstract hops, a set of network devices that qualify for membership in the abstract hop. The network device receives a request to establish a label switched path (LSP) from an ingress network device to an egress network device, wherein the request specifies, as a constraint for the LSP, a plurality of hops in a defined order, including the one or more abstract hops. The network device selects a path from the ingress network device to the specified egress network device based on the ordered abstract hop constraint, and establishes the LSP along the selected path according to the defined order of the request.
机译:网络设备接收定义一个或多个抽象跃点的配置信息,其成员资格定义为满足一个或多个组成属性的逻辑组合的那些网络设备。网络设备基于网络拓扑信息,为每个定义的抽象跃点确定一组符合抽象跃点成员资格的网络设备。网络设备接收从入口网络设备到出口网络设备建立标签交换路径(LSP)的请求,其中,该请求将已定义的多个跃点(包括一个跃点)指定为LSP的约束。或更多抽象啤酒花。网络设备基于排序的抽象跃点约束选择从入口网络设备到指定出口网络设备的路径,并根据所定义的请求顺序沿所选路径建立LSP。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号