发明名称 BACKWARD-RECURSIVE PATH COMPUTATION USING RSVP-TE
摘要 One or more nodes, in a network, are configured to transmit a message, for computing diverse paths through the network from a first domain to a second domain using a Resource Reservation Protocol—Traffic Engineering (RSVP-TE) signaling protocol; generate at least one data structure that identifies multiple diverse entry points to the second domain; transmit the at least one data structure toward the first domain; complete the at least one data structure to form at least one completed data structure; use a first data structure, of the at least one completed data structure, to compute a primary path from the first domain to the second domain; and use a second data structure, of the at least one completed data structure, to compute a secondary path from the first domain to the second domain.
申请公布号 US2014156751(A1) 申请公布日期 2014.06.05
申请号 US201313849138 申请日期 2013.03.22
申请人 BARDALAI Snigdho Chandra;RAO Rajan;MOORWOOD Andrew 发明人 BARDALAI Snigdho Chandra;RAO Rajan;MOORWOOD Andrew
分类号 H04L12/707 主分类号 H04L12/707
代理机构 代理人
主权项 1. A method comprising: transmitting a message, for computing diverse paths through a network that includes a plurality of domains, using a Resource Reservation Protocol—Traffic Engineering (RSVP-TE) signaling protocol, the message being transmitted from a first node in a first domain, of the plurality of domains, to a second node in a second domain of the plurality of domains; generating, by the second node in the second domain, at least one data structure that identifies multiple diverse entry points to the second domain; transmitting the at least one data structure toward the first node in the first domain; completing, by the first node in the first domain, the at least one data structure to form at least one completed data structure, the at least one completed data structure identifying multiple diverse exit points from the first domain and the multiple diverse entry points to the second domain; causing, using a first data structure of the at least one completed data structure, a primary path from the first domain to the second domain to be established, the primary path including a first exit point, of the multiple diverse exit points from the first domain, and a first entry point of the multiple diverse entry points to the second domain; and causing, using a second data structure of the at least one completed data structure, a secondary path from the first domain to the second domain to be established, the secondary path including a second exit point, of the multiple diverse exit points from the first domain, and a second entry point of the multiple diverse entry points to the second domain.
地址 San Ramon CA US