发明授权
US07215644B2 Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks 有权
用于支持互连多域光传输网络中分层路由的基于域间约束的最短路径第一技术

  • 专利标题: Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks
  • 专利标题(中): 用于支持互连多域光传输网络中分层路由的基于域间约束的最短路径第一技术
  • 申请号: US10392227
    申请日: 2003-03-19
  • 公开(公告)号: US07215644B2
    公开(公告)日: 2007-05-08
  • 发明人: Fuming WuFrederick H. Skoog
  • 申请人: Fuming WuFrederick H. Skoog
  • 申请人地址: FR Paris
  • 专利权人: Alcatel Lucent
  • 当前专利权人: Alcatel Lucent
  • 当前专利权人地址: FR Paris
  • 代理机构: Danamraj & Youst
  • 代理商 Jessica W. Smith; V. Lawrence Sewell
  • 主分类号: H04J1/16
  • IPC分类号: H04J1/16 H04J3/14 H04L1/00 H04L12/26
Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks
摘要:
Method and system for implementing an inter-domain constraint-based shortest path first (“IrD-CSPF”) technique for supporting hierarchical routing in interconnected multi-domain OTNs are described. In one embodiment, the invention is a method for calculating a network path in an interconnected multi-domain network. The method comprises receiving a path setup request message for a new traffic flow in the network identifying a source node in one domain of the network and a destination node in a second domain of the network; determining a common ancestor hierarchical routing domain that includes ancestor nodes of both the source and destination nodes; calculating an inter-domain path from one ancestor node to the other ancestor node that determines, for each lower-level domain, border nodes in the domain from the source node to the destination node; and for each bottom-level domain, calculating an intra-domain path between the border nodes that were determined for the domain.
信息查询
0/0