[Olsr-cvs] olsrd-current CHANGELOG,1.61,1.62

[Bernd Petrovitsch]

Update of /cvsroot/olsrd/olsrd-current
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv28283

Modified Files:
	CHANGELOG 
Log Message:
added the SPF refactoring from Hannes Gredler <(spam-protected)>:

1. use of an AVL tree as a min-heap implementation

   as a means for efficient sorting.
   (the etx metric is used as the key in the candidate tree)

2. next-hop propagation

   rather than tracking the previous node in olsr_relax()
   i have changed that model and pre-populate all one-hop neighbors
   with their own IP adress as 'next-hop' and pull that
   pointer up once new paths are explored.

   as a result no walker for counting hops and extracting next-hops
   is required - it turns out at this is slighly more efficient
   than the existing behaviour (even with the cache applied).


Index: CHANGELOG
===================================================================
RCS file: /cvsroot/olsrd/olsrd-current/CHANGELOG,v
retrieving revision 1.61
retrieving revision 1.62
diff -C2 -d -r1.61 -r1.62
*** CHANGELOG	2 Jul 2007 11:05:48 -0000	1.61
--- CHANGELOG	5 Jul 2007 22:43:46 -0000	1.62
***************
*** 5,11 ****
  
  MISC
! Upgrade to olsr-bmf 1.5
  
! latitude/longitude support is now in the nameservice plugin
  
  CLEANUPS
--- 5,32 ----
  
  MISC
! Upgrade to olsr-bmf 1.5 from Erik Tromp <(spam-protected)>
  
! latitude/longitude support is now in the nameservice plugin done by
! Sven-Ola Tuecke <(spam-protected)>
! 
! added the spf refactoring patch from  Hannes Gredler <(spam-protected)> whicht saves
! a noteworthy amount of CPU time. To quite him:
! ----  snip  ----
! 1. use of an AVL tree as a min-heap implementation
! 
!    as a means for efficient sorting.
!    (the etx metric is used as the key in the candidate tree)
! 
! 2. next-hop propagation
! 
!    rather than tracking the previous node in olsr_relax()
!    i have changed that model and pre-populate all one-hop neighbors
!    with their own IP adress as 'next-hop' and pull that
!    pointer up once new paths are explored.
! 
!    as a result no walker for counting hops and extracting next-hops
!    is required - it turns out at this is slighly more efficient
!    than the existing behaviour (even with the cache applied).
! ----  snip  ----
  
  CLEANUPS