首页> 外国专利> Explicit Routing Algorithms for MPLS Routers in IP Network

Explicit Routing Algorithms for MPLS Routers in IP Network

机译:IP网络中MPLS路由器的显式路由算法

摘要

PURPOSE: An explicit path setup method in an IP(Internet Protocol) network composed as an MPLS(Multi Protocol Label Switching) router is provided to set a suitable path in consideration of a network state and set a suitable LSP(Label Switched Path) for transmitting a packet following the set path. CONSTITUTION: If the setup request of an LSP which satisfies an average request bandwidth D of a traffic is inputted(S21), each link metric is assigned for reflecting the influence of a link about a current average request bandwidth D to each link metric(S22). Links in which the residual capacity of the link is less than the traffic request bandwidth D are removed and a network is composed again(S23). If an ingress-egress node is included in a topology(S24), The LSP is set up through a Dijkstra shortest path algorithm on the basis of the link metric(S26). When the LSP is set up in a valid topology, one or more redundant LSPs are set up for preparing the fault of the link(S27). A bandwidth which exists in the link after a protect path is set up is updated(S28). A traffic of a D unit is transmitted to the set LSP(S29).
机译:目的:提供一种由MPLS(多协议标签交换)路由器组成的IP(互联网协议)网络中的显式路径设置方法,以考虑网络状态设置合适的路径,并为以下各项设置合适的LSP(标签交换路径)按照设置的路径发送数据包。组成:如果输入了满足流量平均请求带宽D的LSP的建立请求(S21),则分配每个链路度量,以将链路对当前平均请求带宽D的影响反映到每个链路度量(S22) )。去除链路的剩余容量小于业务请求带宽D的链路,并再次组成网络(S23)。如果在拓扑中包括入口-出口节点(S24),则基于链路度量通过Dijkstra最短路径算法来建立LSP(S26)。当在有效拓扑中建立LSP时,建立一个或多个冗余LSP以准备链路的故障(S27)。设置保护路径之后,链路中存在的带宽被更新(S28)。 D单元的业务被发送到设置的LSP(S29)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号