Re: OSPF and LDP Intricacies

First part: router A and B from some area may get disconnected for some
time, and the world goes on. When they reconnect (link up) part of the
DB could be up to date and part may be not. Exchanging just the DBD
enables a more efficient update, just the needed data is sent.

Makes sense ?
-Carlos

routingfreak @ 05/08/2013 11:37 -0300 dixit:
> Hi all
>
> I have certain questions on OSPF .
>
> 1. Why do we require Link State Request Packet. I mean as per Link State
> Routing Protocol, ur entire database has to be synchronised, then you
> should not request someone to get something, instead the neighbor should
> give you entire LSUs to you
>
> Why they have designed Link State Request packet in OSPF.
> Anyhow the neighbor will request for all the LSAs from the DBD, then why do
> they have Link State Request Packet in OSPF
>
> In LDP, There is a Loop Detection Mechanism which includes Hop Count TLV
> and Path Vector TLV, Can someone throw some light on how these two things
> are utilised,
> I have read the RFC and this is wat it says
>
> Loop Detection is a configurable option that provides a mechanism for
> finding looping LSPs and for preventing Label Request messages from looping
> in the presence of non-merge capable LSRs.
>
> Can someone explain me wat is called as Non-Merged LSRs
>
>

-- 
Carlos G Mendioroz  <tron_at_huapi.ba.ar>  LW7 EQI  Argentina
Blogs and organic groups at http://www.ccie.net