MIME-Version: 1.0
References: 
 <176208327789.584.12251043684986317503@dt-datatracker-5df8666cb-7l4w5>
In-Reply-To: 
 <176208327789.584.12251043684986317503@dt-datatracker-5df8666cb-7l4w5>
From: Robert Raszuk <robert@raszuk.net>
Date: Sun, 2 Nov 2025 14:01:41 +0100
Message-ID: 
 <CAOj+MMGVPzrohgRmO_VGgqcA5moRnG2k+PzL3E5py115DD_-NQ@mail.gmail.com>
To: "idr@ietf. org" <idr@ietf.org>
Content-Type: multipart/alternative; boundary="000000000000e1099606429c339c"
Message-ID-Hash: S4366P6GF3XQG4S6DCFP6QITG4XAY2AM
Precedence: list
Subject: =?utf-8?q?=5BIdr=5D_Fwd=3A_I-D_Action=3A_draft-lp-idr-bgp-algorithm-00=2Etxt?=
Archived-At: 
 <https://mailarchive.ietf.org/arch/msg/idr/bKYpvhHFzVmjA-8iIXlNNOtcGRU>

--000000000000e1099606429c339c
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Dear authors,

I have two basic observations in respect to your proposal:

#1 - The notion of loopbacks of node 8 are lost at EBGP boundaries for
service/overlay routes hence propagating any information describing which
flexible algorithm given loopback is or should be part of between domains
is of very little value.

#2 - We have had months if not years of debate in the form of CAR/CT
proposals to solve the issue you are bringing up via abstracting the notion
of preferred forwarding to colors/classes. So perhaps you could elaborate
on that a bit in your document - at least comparing those three approaches.

Kind regards,
Robert


---------- Forwarded message ---------
From: <internet-drafts@ietf.org>
Date: Sun, Nov 2, 2025 at 12:34=E2=80=AFPM
Subject: I-D Action: draft-lp-idr-bgp-algorithm-00.txt
To: <i-d-announce@ietf.org>


Internet-Draft draft-lp-idr-bgp-algorithm-00.txt is now available.

   Title:   Advertisement of Algorithm in BGP
   Authors: Liu Yao
            Peng Shaofu
   Name:    draft-lp-idr-bgp-algorithm-00.txt
   Pages:   6
   Dates:   2025-11-02

Abstract:

   This document proposes extensions to BGP to support algorithm-based
   end-to-end path establishment.

The IETF datatracker status page for this Internet-Draft is:
https://datatracker.ietf.org/doc/draft-lp-idr-bgp-algorithm/

There is also an HTMLized version available at:
https://datatracker.ietf.org/doc/html/draft-lp-idr-bgp-algorithm-00

Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts


_______________________________________________
I-D-Announce mailing list -- i-d-announce@ietf.org
To unsubscribe send an email to i-d-announce-leave@ietf.org

--000000000000e1099606429c339c
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>Dear authors,</div><div><br></div><div>I have two bas=
ic observations in respect to your proposal:</div><div><br></div><div>#1 - =
The notion of loopbacks of node 8 are lost at EBGP boundaries for service/o=
verlay routes hence propagating any information describing which flexible a=
lgorithm given loopback is or should be part of between domains is of very =
little value.=C2=A0</div><div><br></div><div>#2 - We have had months if not=
 years of debate in the form of CAR/CT proposals to solve the issue you are=
 bringing up via abstracting the notion of preferred=C2=A0forwarding to col=
ors/classes. So perhaps you could elaborate on that a bit in your document =
- at least comparing those three approaches.=C2=A0</div><div><br></div><div=
>Kind regards,</div><div>Robert</div><br><br><div class=3D"gmail_quote gmai=
l_quote_container"><div dir=3D"ltr" class=3D"gmail_attr">---------- Forward=
ed message ---------<br>From: <span dir=3D"auto">&lt;<a href=3D"mailto:inte=
rnet-drafts@ietf.org">internet-drafts@ietf.org</a>&gt;</span><br>Date: Sun,=
 Nov 2, 2025 at 12:34=E2=80=AFPM<br>Subject: I-D Action: draft-lp-idr-bgp-a=
lgorithm-00.txt<br>To:  &lt;<a href=3D"mailto:i-d-announce@ietf.org">i-d-an=
nounce@ietf.org</a>&gt;<br></div><br><br>Internet-Draft draft-lp-idr-bgp-al=
gorithm-00.txt is now available.<br>
<br>
=C2=A0 =C2=A0Title:=C2=A0 =C2=A0Advertisement of Algorithm in BGP<br>
=C2=A0 =C2=A0Authors: Liu Yao<br>
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 Peng Shaofu<br>
=C2=A0 =C2=A0Name:=C2=A0 =C2=A0 draft-lp-idr-bgp-algorithm-00.txt<br>
=C2=A0 =C2=A0Pages:=C2=A0 =C2=A06<br>
=C2=A0 =C2=A0Dates:=C2=A0 =C2=A02025-11-02<br>
<br>
Abstract:<br>
<br>
=C2=A0 =C2=A0This document proposes extensions to BGP to support algorithm-=
based<br>
=C2=A0 =C2=A0end-to-end path establishment.<br>
<br>
The IETF datatracker status page for this Internet-Draft is:<br>
<a href=3D"https://datatracker.ietf.org/doc/draft-lp-idr-bgp-algorithm/" re=
l=3D"noreferrer" target=3D"_blank">https://datatracker.ietf.org/doc/draft-l=
p-idr-bgp-algorithm/</a><br>
<br>
There is also an HTMLized version available at:<br>
<a href=3D"https://datatracker.ietf.org/doc/html/draft-lp-idr-bgp-algorithm=
-00" rel=3D"noreferrer" target=3D"_blank">https://datatracker.ietf.org/doc/=
html/draft-lp-idr-bgp-algorithm-00</a><br>
<br>
Internet-Drafts are also available by rsync at:<br>
rsync.ietf.org::internet-drafts<br>
<br>
<br>
_______________________________________________<br>
I-D-Announce mailing list -- <a href=3D"mailto:i-d-announce@ietf.org" targe=
t=3D"_blank">i-d-announce@ietf.org</a><br>
To unsubscribe send an email to <a href=3D"mailto:i-d-announce-leave@ietf.o=
rg" target=3D"_blank">i-d-announce-leave@ietf.org</a><br>
</div></div>

--000000000000e1099606429c339c--