Subject: <draft-ietf-manet-tora-spec-02> comment

From: Joachim Koch <[email-masked]>
Date: Fri, 23 Jun 2000 18:15:58 +0200 (GMT+02:00)

[email-masked]
Content-Type: text/plain; charset="iso-8859-1"

Now with the document embedded instead as attachment for the archive.

----- Original Message -----
Von: [email-masked]
An: [email-masked]
Empfangen: 20.06.2000  16:00
Betreff: <draft-ietf-manet-tora-spec-02> comment

Dear Sirs and Ladies,

as you can see in the attachment, I have a comment to the TORA-Routing Algorithm. It's a specification of the Optimization Routes. As I got a message from Dr. Park, he also has a further spec of this (but no time to publish). Then there will be two versions of Optimization Routes that probably could be merged easily.

Yours sincerly

Joachim Koch
-- 
_

[email-masked]
Content-Type: text/plain; name=ment-tora.txt
Content-Transfer-Encoding: 7bit
Content-Disposition: attachment; filename=ment-tora.txt

comment to <draft-ietf-manet-tora-spec-02>
AUTHOR: 
Joachim Koch
Faculty Network-Adm.
Univ. Fulda
Germany
<[email-masked]>

3.5. Optimizing Routes

[instead of TBD.]

Optimization to low communication complexity results in a minimization of
the neighbour's reference_level=(tau[k],oid[k],r[k]), i.e. for each 
link(i,k) which is downstream and num_down>1, the downstream links(i,k) 
could be optimized by the lowest reference_level. If the reference_levels 
differ, these with r[k]=0 should be preferred.

If there are still some downstream links(i,k) remaining whose neighbour's 
reference_levels differ, these with tau[k]=Min. should be preferred.

Finally, if there are still different downstream links(i,k) with the same
neighbour's reference_level are remaining, then an optimization - as known
in distance-vector-routing protocols - by lowest hop-count could be 
supported: Then the downstream links(i,k) with the minimum of neighbour's
offset=(delta[i],i) should be taken. That is, delta[i]=Min. should be
preferred.

In summary, the optimization is a specific algorithm to minimize the height
of the neighbour HT_NEIGH[k]=(tau[i],oid[i],r[i],delta[i],i) by setting the
priority P(r[i]) > P(tau[i]) > P(delta[i]), where P(oid[i]) = P(i) = 0. 

[email-masked]

-- 
________________________________________________
redseven Community - Alleine war gestern
http://www.redseven.de
redseven freemail - der kostenlose eMail-Service
http://mail.redseven.de 

Join us now!

-- 
________________________________________________
redseven Community - Alleine war gestern
http://www.redseven.de
redseven freemail - der kostenlose eMail-Service
http://mail.redseven.de 

Join us now!