Hi Peng, The inital purpose of this draft is written to provide use-case of CAN, since that CAN does not define specific protocol for routing between D-Router.
As you said, LISP has advantage for the mapping between SID and BID. For dynamicity and affinity, in this draft describe several possible solutions based on existing LISP WG works, but they are not fully covered CAN requirements. So, my first thought was that the LISP can support mapping and routing between them, but it needs to be interoperate with the computing resource management platform (I saw this entitiy in the slide of this BoF meeting) to gather the computing metric and make decision of optimal traffic path. From this aspect, this draft can be developed to provide use-case as centralized CAN approach. On the other hand, to be one of solution for CAN, I think this draft should purpose new specific methods for collecting metrics and distributing them across D-routers. It sould be competible with existing LISP principle, and it may be a good to make another draft in the LISP WG. hope this document makes useful discussions in the CAN and also LISP WG. I am always welcome from comments, feedbacks and also co-working this documents. Regards, KJ. =============================== Kyoungjae Sun (Researcher / Ph.D.) ICT Convergence Standards Research Section Standards & Open Source Research Division Electronics and Telecommunications Research Institute (ETRI) Office Address: 218 Gajeong-ro, Yuseong-Gu, Daejeon, 34129, KOREA Office Tel: +82-42-860-5749 E-mail: [email protected] <mailto:[email protected]> > On May 17, 2022, at 3:18 PM, [email protected] wrote: > > Hi Kyoungjae, > > Thanks for the update. We can see the effective mapping between SID and BID > by LISP, while there are some gaps of the dynamicity and affinity > requirements. I'd like to ask you the desired position on this draft. > > It could be the technical use case of CAN routing with LISP as you mentioned, > while the current version of use case draft is related to the application. > Considering the specific work, it also looks like the potential protocol > choice for centralized approach. Maybe some gap analysis of LISP could be > added/cited in the existing dyncast drafts. > > Regards, > Peng > [email protected] <mailto:[email protected]> > > From: 선경재 <mailto:[email protected]> > Date: 2022-05-16 13:08 > To: dyncast <mailto:[email protected]>; lisp <mailto:[email protected]> > CC: 김영한 <mailto:[email protected]> > Subject: [Dyncast] FW: New Version Notification for > draft-kjsun-lisp-dyncast-02.txt > Hi LISP WG and CAN BoF, > > I was uploaded draft about "LISP supprot for Dynamic Anycast Routing" in the > LISP WG. > > I think it can be one of use-case for applying CAN routing into the LISP > overlay network, which is naturally supported ID/Location separation of > service. > > From initial version, this document was focused to write how can LISP-based > approach meet dyncast requirements described in "draft-liu-dyncast-reqs" > including on-going drafts in LISP WG. > > Current version of document is updated with comments recieved from -00 > version (Thanks to DIno's review of -00 version) and minor modifications of > figure and sentence. > > Any comments and feedbacks are always welcome. > > Best regards, > > KJ > > ==================================================== > Kyoungjae Sun (Researcher / Ph.D.) > Electronics and Telecommunications Research Institute (ETRI) > ICT Convergence Standards Research Section > Standards & Open Source Research Division > 218 Gajeong-ro, Yuseong-Gu, Daejeon, 34129, KOREA > Office Tel: +82-42-860-5749 > E-mail: [email protected] > > -----Original Message----- > From: "" <[email protected]> > To: "Kyoungjae Sun" <[email protected]>; "Sun Kj" <[email protected]>; > "Younghan Kim" <[email protected]>; > Cc: > Sent: 2022-04-28 (목) 20:30:13 (UTC+09:00) > Subject: New Version Notification for draft-kjsun-lisp-dyncast-02.txt > > > A new version of I-D, draft-kjsun-lisp-dyncast-02.txt > has been successfully submitted by Kyoungjae Sun and posted to the > IETF repository. > > Name: draft-kjsun-lisp-dyncast > Revision: 02 > Title: LISP Support for Dynamic Anycast Routing > Document date: 2022-04-28 > Group: Individual Submission > Pages: 12 > URL: > https://www.ietf.org/archive/id/draft-kjsun-lisp-dyncast-02.txt > Status: https://datatracker.ietf.org/doc/draft-kjsun-lisp-dyncast/ > Html: > https://www.ietf.org/archive/id/draft-kjsun-lisp-dyncast-02.html > Htmlized: https://datatracker.ietf.org/doc/html/draft-kjsun-lisp-dyncast > Diff: https://www.ietf.org/rfcdiff?url2=draft-kjsun-lisp-dyncast-02 > > Abstract: > Dynamic Anycast (Dyncast) is a new routing approach to support > equivalent services running in distributed geolocations and connect > to them by considering both network-related metric and service- > related metric. In LISP, it is possible to support anycast EIDs and/ > or anycast RLOCs without any modification, so it is suitable for > providing dyncast routing. In this document, it describes the LISP- > based dyncast architecture and related standard works to meet dyncast > requirements. > > > > > > The IETF Secretariat > > > > -- > Dyncast mailing list > [email protected] <mailto:[email protected]> > https://www.ietf.org/mailman/listinfo/dyncast > <https://www.ietf.org/mailman/listinfo/dyncast>
_______________________________________________ lisp mailing list [email protected] https://www.ietf.org/mailman/listinfo/lisp
