[prev in list] [next in list] [prev in thread] [next in thread]
List: ms-ospf
Subject: Re: [Lsr] =?utf-8?q?draft-draft-peng-lsr-algorithm-related-adjacency?=
From: <peng.shaofu () zte ! com ! cn>
Date: 2021-03-12 2:49:23
Message-ID: 202103121049238996237 () zte ! com ! cn
[Download RAW message or body]
[Attachment #2 (multipart/related)]
[Attachment #4 (multipart/alternative)]
[Attachment #6 (text/plain)]
Hi Peter,
Agree, that is an important use case. We will add it to the next version.
Regards,
PSF
原始邮件
发件人：PeterPsenak
收件人：陈然00080434;tonysietf@gmail.com;
抄送人：lsr@ietf.org;
日 期 ：2021年03月11日 17:57
主 题 ：Re: [Lsr] draft-draft-peng-lsr-algorithm-related-adjacency-sid
Hi Ran, Tony,
I believe the primary use case for algorithm specific adj-SID is for the
protected Adj-SID. The backup path of such Adj-SID follows the algo
specific constraints.
thanks,
Peter
On 11/03/2021 09:51, chen.ran@zte.com.cn wrote:
> Hi Tony,
>
> Thanks for your comments. The reason why this draft is proposed is that:
>
> Currently, the current FA draft only defines that the algorithm
> identifier is included as part of a Prefix-SID advertisement,that maybe
> not satisfy some scenarios where multiple algorithm share the same link
> resource.
>
> For example, an SR-TE policy may be instantiated within specific
> Flex-algo plane, i.e.,the SID list requires to include algorithm related
> SIDs. An algorithm-unware Adjacency-SID included in the SID list can
> just steer the packet towards the link, but can not apply different QoS
> policy for different algorithm.
>
> Another example is that the TI-LFA backup path computed in
> Flex-algo plane may also contain an algorithm-unware Adjacency-SID,
> which maybe also used in other SR-TE instance that carries other service.
>
> This document complement that the algorithm identifier can be also
> included as part of an Adjacency-SID advertisement for SR-MPLS.
>
>
> Best Regards,
>
> Ran
>
>
_______________________________________________
Lsr mailing list
Lsr@ietf.org
https://www.ietf.org/mailman/listinfo/lsr
[Attachment #7 (text/html)]
<div class="zcontentRow"><p style="font-size:12px;font-family:sans-serif;"><br></p><p \
style="font-size:12px;font-family:sans-serif;"><span style="font-size: 18px;">Hi \
Peter,</span></p><p style="font-size:12px;font-family:sans-serif;"><span \
style="font-size: 18px;"><br></span></p><p \
style="font-size:12px;font-family:sans-serif;"><span style="font-size: 18px;">Agree, \
that is an important use case. We will add it to the next version.</span></p><p \
style="font-size:12px;font-family:sans-serif;"><span style="font-size: \
18px;"><br></span></p><p style="font-size:12px;font-family:sans-serif;"><span \
style="font-size: 18px;">Regards,</span></p><p \
style="font-size:12px;font-family:sans-serif;"><span style="font-size: \
18px;">PSF</span></p><p \
style="font-size:12px;font-family:sans-serif;"><br></p><p><br></p><div><div \
class="zhistoryRow" style="display:block"><div class="zhistoryDes" style="width: \
100%; height: 28px; line-height: 28px; background-color: #E0E5E9; color: #1388FF; \
text-align: center;" language-data="HistoryOrgTxt">原始邮件</div><div \
id="zwriteHistoryContainer"><div class="control-group zhistoryPanel"><div \
class="zhistoryHeader" style="padding: 8px; background-color: #F5F6F8;"><div><strong \
language-data="HistorySenderTxt">发件人：</strong><span \
class="zreadUserName">PeterPsenak<ppsenak=40cisco.com@dmarc.ietf.org></ppsenak=40cisco.com@dmarc.ietf.org></span></div><div><strong \
language-data="HistoryTOTxt">收件人：</strong><span class="zreadUserName" \
style="display: inline;">陈然00080434;tonysietf@gmail.com<tonysietf@gmail.com>;</tonysietf@gmail.com></span></div><div><strong \
language-data="HistoryCCTxt">抄送人：</strong><span class="zreadUserName" \
style="display: inline;">lsr@ietf.org<lsr@ietf.org>;</lsr@ietf.org></span></div><div><strong \
language-data="HistoryDateTxt">日 期 ：</strong><span class="">2021年03月11日 \
17:57</span></div><div><strong language-data="HistorySubjectTxt">主 题 \
：</strong><span class="zreadTitle"><strong>Re: [Lsr] \
draft-draft-peng-lsr-algorithm-related-adjacency-sid</strong></span></div></div><div \
class="zhistoryContent"><div>Hi Ran, Tony,<br><br>I believe the&nb \
sp;primary use case for algorithm specific adj-SID \
is for the <br>protected Adj-SID. The backup path&n \
bsp;of such Adj-SID follows the algo <br>specific c \
onstraints.<br><br>thanks,<br>Peter<br><br><br><br><br>On 11/03/2021 09:51,& \
nbsp;chen.ran@zte.com.cn wrote:<br>> Hi Tony,<br>> <br>>& \
nbsp; Thanks for your comments. The re \
ason why this draft is proposed is that:<br>>&nb \
sp;<br>> Currently, the current FA  \
;draft only defines that the algorithm <br>> ide \
ntifier is included as part of a Prefix-SID&n \
bsp;advertisement,that maybe <br>> not satisfy some s \
cenarios where multiple algorithm share the same li \
nk <br>> resource.<br>> <br>> &nb \
sp;For example, an SR-TE policy may be instantiated \
within specific <br>> Flex-algo plane, i.e.,the  \
;SID list requires to include algorithm related <br \
>> SIDs. An algorithm-unware Adjacency-SID included& \
> nbsp;in the SID list can <br>> just steer  \
> ;the packet towards the link, but can not ap \
> ply different QoS <br>> policy for different a \
> lgorithm.<br>> <br>> Another&nbs \
> p;example is that the TI-LFA backup path computed \
> in <br>> Flex-algo plane may also contain&nbs \
> p;an algorithm-unware Adjacency-SID, <br>> which maybe&n \
> bsp;also used in other SR-TE instance that carrie \
> s other service.<br>> <br>> \
> This document complement that the algorithm identifier \
> can be also <br>> included as par \
> t of an Adjacency-SID advertisement for SR-MPLS.<br>&g \
> t; <br>> <br>> Best Regards,<br>> <br>> Ra \
> n<br>> <br>> <br><br>_______________________________________________ \
> <br>Lsr mailing list<br>Lsr@ietf.org<br>https://www.ietf.org/mailman/listinfo/lsr<br></div></div></div></div></div></div><p><br></p></div>
>
_______________________________________________
Lsr mailing list
Lsr@ietf.org
https://www.ietf.org/mailman/listinfo/lsr
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic