[Nsi-wg] NSI Path/Connection manipulation and decomposition semantics (short)

[Guilherme Fernandes]

Wouldn't it be possible for A>M to end be terminated at a different layer
(L1) than the entry layer L2 for M>Z, and M not have the adaptation
function
L1->L2?

In that case, the first implication does not hold, and would need
Concatenation to be conditional.

(Sorry if this doesn't follow NSI terminology)

Guilherme

>
> Can I propose some connection decomposition and manipulation
> semantics?   Try these:
>
> Definition:  A Service Termination/Transit Point  "STP" identifies a
> location in the topology.   STPs primarily denote a lowest level
> component of the topology where a service instance may begin, end, or
> transit.   An STP may also identify a higher level topological construct
> where a service instance may begin, end, or transit.   In the case of a
> higher level construct, the service instance may touch any sub-component
> to meet the termination or transit constraint.
>
> Definition:  Given STPs A and Z,  "A>Z" denotes a unidirectional Path
> beginning at A and ending at Z;
>
> Rule 1:  Equivalence:    Given two STPs J and K,    If J==K ("J is
> topologically equivalent to K"), then K==J, and both identify the same
> location (object) in the topology.
>
> Rule 2: Concatenation:    Given STPs A,M,N,,Z, a Connection C1:=(A>M),
> and a Connection C2:=(N>Z),
>                     then   C1:C2 == (A>M):(N>Z) == (A>M>N>Z)       "C1
> concatenated with C2 is equivalent to ..."
>
> Implications:
>
> -  If Connection A>M exists, and a Connection M>Z exists,  Then by
> concatenation a Connection A>M>Z exists, and by implication A>Z exists.
> -  Given J==K, then A>J == A>K;   and  (J>K)==J==K;
> - Given STPs A, M, N, and Z,   If M==N, then (A>M):(N>Z) == A>M>N>Z ==
> A>M>Z ==A>N>Z;
>
> Thoughts?
> Jerry
>
>
>
> _______________________________________________
> nsi-wg mailing list
> nsi-wg at ogf.org
> http://www.ogf.org/mailman/listinfo/nsi-wg
>