In einer eMail vom 14.07.2008 17:17:46 Westeuropäische Normalzeit schreibt
Jul 13, 2008 at 6:31 PM, <HeinerHummel@aol.com> wrote:
way I described how to use Dijkstra enables a Dijkstra shortest path
tree which respects constraints like uni-directional forwarding. E.g.
> node N1 to N2 but not from N2 to N1. And even conditioned: .. but
> N2 to N1 unless N1 is the destination node.
It fails to respect one of the required system constraints:
that of transit
> I still do not understand what you try to teach
Your algorithm does not correctly enforce the permission
Thus it is unusable in an interdomain setting where the
constraint is a requirement.
Of course it would reflect this requirement: It reflects the
direction-specific attribute per link.
Hence yields the appropriate path.
I am aware that current BGP works based on distance vector, but current BGP
is not the clean-slate solution either.