The MPLS-OPS Archive

[Spice Sylvia <falsesylvia@yahoo.co.uk>]

John,

>Sylvia,

>> If one can represnt the routing algorithm's
decision
>> process as a function F(input_at_time_t) at each
node,
>> and 
>> a. has the ability to modify the input function(may
>> not be impulse)
>> b. choose the function F (which is the same at each
>> node)

>Am afraid i missed this one.

Nevermind John, You saw it now. :)

>> 
>> can one do away with principals like Count to
Infinity
>> in RIP and get a way that the topology will
converge
>> to stability when any input is applied at R1?
>> 

>I think we have already come out with solutions which
>obviates the need for principals
>like count to infinity, etc. As a consequence we have
>now done away with a protocol like
>RIP.

Can you please tell me what are the best solutions to
such a class of problems? 

I believe here is one I have seen:
Are you saying we "tag the source of the information"
along with the information and ensure that if the
"loop" occurs we look at the source of the information
and drop the "feedback"?
In essence what you are saying is that topologically
from the routing viewpoint, we are making a "tree"
though we may have a wire connecting the point of
input and the point of feedback?

Would we not need to make these information source
identifiers to be unique "within a network"  in some
manner?

-Sylvia




	
	
		
___________________________________________________________
Yahoo! Messenger - Communicate instantly..."Ping" 
your friends today! Download Messenger Now 
http://uk.messenger.yahoo.com/download/index.html

-------
The MPLS-OPS Mailing List
Subscribe/Unsubscribe:  http://www.mplsrc.com/mplsops.shtml
Archive: http://www.mplsrc.com/mpls-ops_archive.shtml