Re: [Teas] Poll on making draft-liu-teas-yang-te-topo-01 a WG document

[Igor Bryskin <[e-mail]>]

Sue,

I think you are exactly right. The model supports arbitrary number of TE topologies. Some of them are bound  in hierarchies. There could be multiple independent hierarchies.
For example, topologies cooked by provider on per- client or VPN is an example of independent topologies. Topology overlay/underlay relationships form topology hierarchies. For example, a topology cooked for a particular client (overlay) is supported by provider native topology (underlay), and this is an example of a hierarchy.

Cheers,
Igor

From: Teas [mailto:[e-mail]] On Behalf Of Susan Hares
Sent: Tuesday, April 21, 2015 10:12 PM
To: 'Dieter Beller'; 'Lou Berger'; 'TEAS WG'
Subject: Re: [Teas] Poll on making draft-liu-teas-yang-te-topo-01 a WG document

Dieter:

Thank you for answer the hierarchy question.   Your abstract topologies reates arbitrary number of levels in a hierarchy.

The question for the wide-topologies can be restated at Layer 3 as multiple VPNS.   In IP, You can create 1-N number of VPNs.  This is n-wide topologies. Does this fit into your abstract topologies?

Sue

From: Dieter Beller [mailto:[e-mail]]
Sent: Tuesday, April 21, 2015 8:55 AM
To: Susan Hares; 'Lou Berger'; 'TEAS WG'
Subject: Re: [Teas] Poll on making draft-liu-teas-yang-te-topo-01 a WG document

Hi Sue, all,
On 20.04.2015 07:47, Susan Hares wrote:
Dieter:

Do you think the arbitrary number of TE topologies are arbitrary in a hierarchy (1-N levels) or a wide topologies (1-N topologies).
I am having some difficulties to really understand your question. Let me try to clarify what I meant with my comment:

An abstract topology is according to my understanding composed of links and vertices (nodes) and a vertex could be an abstract
node that represents an underlying abstract topology. This underlying abstract topology can be decomposed again into links and
vertices (nodes) when you zoom into an abstract node.

Based on this principle of recursion, you can create a hierarchy that can have arbitrary levels and a further decomposition is possible
until you have not reached the physical node level (bottom of the hierarchy).

I hope this helps.


Thanks,
Dieter


Sue

From: Teas [mailto:[e-mail]] On Behalf Of Dieter Beller
Sent: Friday, April 17, 2015 3:00 PM
To: Lou Berger; TEAS WG
Subject: Re: [Teas] Poll on making draft-liu-teas-yang-te-topo-01 a WG document

Hi Lou, all,

yes/support - however, other than +1 to comments from Paul, Young, and Xian, I would like to emphasize again what I commented
during the discussion in Dallas:

An introduction and a description of the information model (similar to that in draft-ietf-i2rs-yang-network-topo-00) is needed in the
beginning of the document that explains the YANG data model. This section would describe the relationships of the managed entities
(objects) and their attributes with references to the YANG model tree structure and the model definition.

Moreover, for example in the context of ACTN, the model also needs to describe how it can support an arbitrary number of TE
topology hierarchies.  I have seen that the current model already provides some means for that, but this should be described in
more detail and some examples should be provided.


Thanks,
Dieter

On 13.04.2015 20:08, Lou Berger wrote:

All,



This is start of a two week poll on making

draft-liu-teas-yang-te-topo-01 a TEAS working group document. Please

send email to the list indicating "yes/support" or "no/do not support".

If indicating no, please state your technical reservations with the

document.  If yes, please also feel free to provide comments you'd like

to see addressed once the document is a WG document.



This document is the product of the TE Topology YANG Model Design Team

and the intent is for this work to serve as the foundation for the WG's

normal activities in this area, i.e., the document is the starting point

for the WG -- not a finished product.  The DT will be closed once we

have a WG document on this topic.



The poll ends Monday April 27th

Thanks,

Lou (and Pavan, who is a co-author)



_______________________________________________

Teas mailing list

[e-mail]<mailto:[e-mail]>

https://www.ietf.org/mailman/listinfo/teas



_______________________________________________

Teas mailing list

[e-mail]<mailto:[e-mail]>

https://www.ietf.org/mailman/listinfo/teas