Ask Your Question
0

BGPCEP build ERO for LSP

asked 2015-04-14 06:28:01 -0700

anonymous user

Anonymous

Hi,

After getting the LSDB with BGP-LS, assuming it works similar to CSPF

  1. Can i get ERO Path (List of nodes) from Tailend to Headend.
  2. For any Source and destination Router Loopbacks, can I get list of transit routers .
edit retag flag offensive close merge delete

2 answers

Sort by » oldest newest most voted
0

answered 2015-09-15 01:16:34 -0700

changhe188 gravatar image

LSDB is only the IGP topology with TE database. You need to write your own algorithm like CSPF to calculate the path or something you want like the transit routers.

edit flag offensive delete publish link more
0

answered 2015-09-16 08:06:19 -0700

cgaspari gravatar image

The OpenDaylight BGP plugin typically acts as a "BGP Listener" and learns routes (IPv4, IPv6 and LinkState) from a BGP neighbour (typically a route reflector). BGP plugin also implements a "BGP Speaker" which can advertise routes over BGP.

So ass long as you implement the application the application which provides the CSPF, ISIS, etc.. using the information provided by the LSDB, you will be able to get the required information, but taking in account the limits of the protocol.

FYI: An interior gateway protocol (IGP) is a type of protocol used for exchanging routing information between devices within an autonomous system (AS). Based on the method of computing the best path to a destination, the IGPs are divided into two categories:

Link-state protocols—Advertise information about the network topology (directly connected links and the state of those links) to all routers using multicast addresses and triggered routing updates until all the routers running the link-state protocol have identical information about the internetwork. The best path to a destination is calculated based on constraints such as maximum delay, minimum available bandwidth, and resource class affinity. OSPF and IS-IS are examples of link-state protocols.

Distance vector protocols—Advertise complete routing table information to directly connected neighbors using a broadcast address. The best path is calculated based on the number of hops to the destination network. RIP is an example of a distance vector protocol.

edit flag offensive delete publish link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

[hide preview]

Stats

Asked: 2015-04-14 06:28:01 -0700

Seen: 175 times

Last updated: Sep 16 '15