comments on the architecture document

[Tony Li <[e-mail]>]

   Also, on average, all hop-by-hop LS transient loops will disappear
   faster than some DV transient loops. This is one of the advantages
   of LS (identified in the original BBN report #3803, April 1978,
   page 159). LS algorithms stabilize in a short, very bounded time
   (basically a flood time plus a tree recompute time). DV algorithms
   (even with EI-N detection, such as BGP) may take a shorter or
   longer time, the time depending on the topology and the exact
   change. There is thus a wider dispersion of stabilization times in
   DV systems.

Please see the work by J.J. Garcia on new DV algorithms.  They
converge with less time, less bandwidth consumption than LS and do not
induce transient loops.  

   In my view it is an explicit feature of a routing
   architecture for a very large internet that it can grow to handle
   new capabilities in an incremental way. 

Please tell me how IDPR can do this.  How do I introduce a new atom
for a policy term incrementally?

Tony