ietf
[Top] [All Lists]

RE: Last Call: <draft-betts-itu-oam-ach-code-point-03.txt>(Allocation of an Associated Channel Code Point for Use byITU-T Ethernet based OAM) to Informational RFC

2012-03-01 11:23:23
Hi Russ,
I am not K.Y., but to me it seems at the moment as a very theoretical
question.
If the document is stable and approved, we can re-issue an IETF LC for a
better version of draft-betts that resolves my and others' comments that
I sent earlier today and the IETF can make the decision then. 
At the moment, I cannot support the publication of draft-bett, for the
reasons please see my mail that was sent earlier today to the IETF list.
Best regards,
Nurit

-----Original Message-----
From: ietf-bounces(_at_)ietf(_dot_)org 
[mailto:ietf-bounces(_at_)ietf(_dot_)org] On Behalf Of
ext Russ Housley
Sent: Thursday, March 01, 2012 6:06 PM
To: Kyung-Yeop Hong (hongk)
Cc: ietf(_at_)ietf(_dot_)org
Subject: Re: Last Call:
<draft-betts-itu-oam-ach-code-point-03.txt>(Allocation of an Associated
Channel Code Point for Use byITU-T Ethernet based OAM) to Informational
RFC

KY:

Would you support the assignment to an approved G.8113.1?  That is, if
the document contained a normative reference to the approved G.8113.1,
then the document that makes the code point allocations would sit in the
RFC Editor queue until the ITU-T reaches consensus and approves
G.8113.1.

Russ


On Mar 1, 2012, at 10:14 AM, Kyung-Yeop Hong (hongk) wrote:

No/do not support.

One of the issues with G.8113.1 in LS370 is its stability and
maturity.
That was one of the reasons why it was not approved. 

The Ethernet based OAM protocol documented in the LS370 version is
intended to be deployed for MPLS networks. I think the IETF has a duty
to ensure that a solution is stable and works for MPLS networks before
the code point allocation. A number of concerns with the deployment of
this proposed protocol raised in
draft-spercher-mpls-tp-oam-considerations are critical to the Internet
and must be taken into consideration in this Last Call. 

KY


-----Original Message-----
From: ietf-announce-bounces(_at_)ietf(_dot_)org [mailto:ietf-announce-
bounces(_at_)ietf(_dot_)org] On Behalf Of The IESG
Sent: 22 February 2012 15:13
To: IETF-Announce
Subject: Last Call: <draft-betts-itu-oam-ach-code-point-03.txt>
(Allocation of
an
Associated Channel Code Point for Use by ITU-T Ethernet based OAM) to
Informational RFC


The IESG has received a request from an individual submitter to
consider
the following document:
- 'Allocation of an Associated Channel Code Point for Use by ITU-T
  Ethernet based OAM'
 <draft-betts-itu-oam-ach-code-point-03.txt> as an Informational RFC

The IESG plans to make a decision in the next few weeks, and solicits
final comments on this action. Please send substantive comments to
the
ietf(_at_)ietf(_dot_)org mailing lists by 2012-03-21. Exceptionally, comments
may
be
sent to iesg(_at_)ietf(_dot_)org instead. In either case, please retain the
beginning of the Subject line to allow automated sorting.

Abstract

  This document assigns an Associated Channel Type code point for
  carrying Ethernet based Operations, Administration, and Management
  messages in the MPLS Generic Associated Channel (G-ACh).

The file can be obtained via
http://datatracker.ietf.org/doc/draft-betts-itu-oam-ach-code-point/

IESG discussion can be tracked via
http://datatracker.ietf.org/doc/draft-betts-itu-oam-ach-code-point/


No IPR declarations have been submitted directly on this I-D.
_______________________________________________
IETF-Announce mailing list
IETF-Announce(_at_)ietf(_dot_)org
https://www.ietf.org/mailman/listinfo/ietf-announce

_______________________________________________
mpls mailing list
mpls(_at_)ietf(_dot_)org
https://www.ietf.org/mailman/listinfo/mpls
_______________________________________________
Ietf mailing list
Ietf(_at_)ietf(_dot_)org
https://www.ietf.org/mailman/listinfo/ietf

_______________________________________________
Ietf mailing list
Ietf(_at_)ietf(_dot_)org
https://www.ietf.org/mailman/listinfo/ietf

<Prev in Thread] Current Thread [Next in Thread>