Re: BGP-4 changes

Yakov Rekhter <yakov@cisco.com> Sun, 01 September 1996 15:23 UTC

Received: from ietf.org by ietf.org id aa18456; 1 Sep 96 11:23 EDT
Received: from cnri by ietf.org id aa18452; 1 Sep 96 11:23 EDT
Received: from merit.edu by CNRI.Reston.VA.US id aa06901; 1 Sep 96 11:23 EDT
Received: (from daemon@localhost) by merit.edu (8.7.5/merit-2.0) id LAA24877 for idr-outgoing; Sun, 1 Sep 1996 11:03:52 -0400 (EDT)
Received: from interlock.ans.net (interlock.ans.net [147.225.5.5]) by merit.edu (8.7.5/merit-2.0) with SMTP id LAA24872 for <bgp@merit.edu>; Sun, 1 Sep 1996 11:03:50 -0400 (EDT)
Received: by interlock.ans.net id AA26909 (InterLock SMTP Gateway 3.0 for bgp@ans.net); Sun, 1 Sep 1996 11:03:48 -0400
Received: by interlock.ans.net (Internal Mail Agent-1); Sun, 1 Sep 1996 11:03:48 -0400
Message-Id: <199609011507.IAA17076@hubbub.cisco.com>
To: curtis@ans.net
Cc: bgp@ans.net
Subject: Re: BGP-4 changes
In-Reply-To: Your message of "Fri, 30 Aug 96 14:01:54 EDT." <199608301801.OAA09493@brookfield.ans.net>
Date: Sun, 01 Sep 96 08:03:48 PDT
Sender: ietf-archive-request@ietf.org
From: Yakov Rekhter <yakov@cisco.com>
X-Orig-Sender: owner-idr@merit.edu
Precedence: bulk

Curtis,

> This wording is clear and it is excellent if it a goal to word the
> spec using such that it describes the most inefficient algorithm
> possible, even if a very efficient algorithm exists that is easy to
> explain and understand.  

Would you please provide the text for "a very efficient algorithm... that
is easy to explain and understand".

> Regardless of what description is used, I'd like to see a description
> of the loop problems and the reasons for some of these rules in the
> selection process, to prevent someone from mistakenly thinks that
> comparing the current best route to the new route is an equivalent
> algorithm.  Would you prefer this in the route selection section, in
> an appendix, or a separate informational RFC.

I think that putting this into an appendix would be fine. Would
you consider drafting the text ?

Yakov.