> > Shortest path may no longer win, but the path established locally based > upon global parameters provided by neighbors as well as a central authority. > > NEP does not uses the shortest path, it learns full topology information and > then decide which route (path) is the best at the moment based on the total > route bandwidth, total route delay, and the no. of hops, there is no need for > other protocols or a central authority. >
Hmm, sounds like the 'bees knees', as some else mentioned elsewhere, not too long ago. Sorry, I missed seeing the documentation on the algorithm. I am new to finding my way around. Where would I be able to find the latest notes and information on how this works? -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean. _______________________________________________ rtgwg mailing list [email protected] https://www.ietf.org/mailman/listinfo/rtgwg
