Re: [decade] Updated DECADE Charter again

Richard Alimi <richard.alimi@yale.edu> Thu, 18 March 2010 17:52 UTC

Return-Path: <richard.alimi@gmail.com>
X-Original-To: decade@core3.amsl.com
Delivered-To: decade@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id 5EFCB3A691C for <decade@core3.amsl.com>; Thu, 18 Mar 2010 10:52:36 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: 0.256
X-Spam-Level:
X-Spam-Status: No, score=0.256 tagged_above=-999 required=5 tests=[AWL=-0.875, BAYES_50=0.001, DNS_FROM_OPENWHOIS=1.13]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id u3nW-R1ETad5 for <decade@core3.amsl.com>; Thu, 18 Mar 2010 10:52:35 -0700 (PDT)
Received: from mail-fx0-f213.google.com (mail-fx0-f213.google.com [209.85.220.213]) by core3.amsl.com (Postfix) with ESMTP id C45033A6900 for <decade@ietf.org>; Thu, 18 Mar 2010 10:52:34 -0700 (PDT)
Received: by fxm5 with SMTP id 5so2458395fxm.29 for <decade@ietf.org>; Thu, 18 Mar 2010 10:52:43 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:sender:from:to:subject:date :user-agent:references:in-reply-to:mime-version:content-type :content-transfer-encoding:message-id; bh=BkaktPJMUGWHoDz7OvZRISrP0WE5deLki1Ag9GRmICo=; b=L43hFGmDw1gnACkMs5k9Dc3Gct8pcGr0jbKFovqn4KSBINTigetr2bkPjAODQ9IHLf 62vvBU8/jN2ncn1gJ942m6R5sO8CMjhjbhEtHLHY9NxlRhKYaUiWqev7p8fyRo6+NuHy MDIbgFKdJvYsMN8Uheq9f76EzihN5QeVGU86Q=
DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=sender:from:to:subject:date:user-agent:references:in-reply-to :mime-version:content-type:content-transfer-encoding:message-id; b=o0V6pPwgOtK1rn899ThuhrPbPPUR3OaiF7RxMziyLQbQ5aiIxXeN/6VWFEvY/4CDSX K4XpD92OWvQLgsWmIAInzhx6UXU7bEMmVI+mRr53XbDxgP3ePbJXvrL9ggR2gQ/ViqmQ o93LIDLLJieob3SUyjGn5rQ5ueD2G8djmuF8g=
Received: by 10.86.236.26 with SMTP id j26mr847112fgh.77.1268934762926; Thu, 18 Mar 2010 10:52:42 -0700 (PDT)
Received: from p4p-7.localnet (p4p-7.cs.yale.edu [128.36.233.97]) by mx.google.com with ESMTPS id l12sm4057840fgb.12.2010.03.18.10.52.40 (version=SSLv3 cipher=RC4-MD5); Thu, 18 Mar 2010 10:52:41 -0700 (PDT)
Sender: Richard Alimi <richard.alimi@gmail.com>
From: Richard Alimi <richard.alimi@yale.edu>
To: decade@ietf.org
Date: Thu, 18 Mar 2010 13:52:37 -0400
User-Agent: KMail/1.13.1 (Linux/2.6.31-gentoo-r6; KDE/4.4.1; x86_64; ; )
References: <201003102225103593794@huawei.com>
In-Reply-To: <201003102225103593794@huawei.com>
MIME-Version: 1.0
Content-Type: Text/Plain; charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
Message-Id: <201003181352.38052.richard.alimi@yale.edu>
Subject: Re: [decade] Updated DECADE Charter again
X-BeenThere: decade@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: "To start the discussion on DECoupled Application Data Enroute, to discuss the in-network data storage for p2p applications and its access protocol" <decade.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/decade>, <mailto:decade-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/decade>
List-Post: <mailto:decade@ietf.org>
List-Help: <mailto:decade-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/decade>, <mailto:decade-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 18 Mar 2010 17:52:36 -0000

Hi All,

The following is an updated of the charter with a few revisions, including a 
revised timeline and updated language concerning the relationship between WG 
consensus for the requirements and architecture documents and rechartering (if 
necessary).

==============================================================

DECoupled Application Data Enroute

Description of Working Group:

Peer-to-Peer (P2P) applications, including both P2P streaming and P2P
file-sharing applications, make up a large fraction of traffic in
the Internet today. One way to reduce access network and/or cross-domain
bandwidth usage by P2P applications is to introduce storage capabilities
in the networks. Allowing P2P applications to store and retrieve data
from inside networks can reduce traffic on the last-mile uplink, as
well as backbone and transit links.

Existing P2P caches often implement the specific P2P application
protocols to operate transparently or act as super peers to provide
in-network storage. However, it is challenging for P2P cache vendors to
support a variety of evolving protocols. Also, for P2P applications,
closed P2P caching systems limit effective utilization of in-network
storage. Some P2P protocols may be entirely unsupported by a particular
caching system. Additionally, applications may be better-equipped to
decide how in-network storage is used to meet their specific
requirements (e.g., data placement, access control and resource
control).

Both of these challenges can be effectively addressed by using an open,
standard protocol to access in-network storage. P2P applications can
store and retrieve content in the in-network storage, as well as control
resources (e.g., bandwidth, connections) consumed by peers in a P2P
application. As a simple example, a peer can choose to store content in
the in-network storage, and direct other peers to retrieve from that
location, reducing last-mile link usage.  Furthermore, since a P2P
client may have multiple peers, it can control resources used by each
peer to store and retrieve content.  Though there are existing data
access protocols (e.g., HTTP, NFS, WebDAV), they might be lacking
capabilities for fine-grained access and resource control (e.g.,
bandwidth and connections) that are essential for today's advanced P2P
applications.

The Working Group (WG) will have three primary tasks. First, the WG will
identify target applications to appropriately scope the problem and
requirements. P2P applications are the primary target, but suitability
to other applications with similar requirements may be considered
depending on additional complexity required to support such
applications.

Second, the WG will identify the requirements to enable target
applications to utilize in-network storage. Requirements will include
the ability for an application to (1) store, retrieve, and manage data,
(2) indicate access control policies for storing and retrieving data
suitable to an environment with users across multiple administrative and
security domains (e.g., in a P2P environment), and (3) indicate resource
control policies for storing and retrieving data.

Third, the WG will develop an architecture within which the DECADE
protocol can be specified. This architecture will identify DECADE's
relationship to existing IETF protocols and where (if any) new protocol
is needed or extensions to existing protocols need to be made. The
architecture will not specify a protocol or extension; if development of
a new protocol is needed, the WG will seek to recharter for this purpose
or might ask an existing WG to work on such extensions.

The WG will focus on the following work items:

- A "problem statement" document. This document provides a description
  of the problem and common terminology.

- A requirements document. This document lists the requirements for the
  in-network storage service (e.g., supported operations) and the
  protocol to support it. The service will include storing, retrieving,
  and managing data as well as specifying both access control and
  resource control policies in the in-network storage pertaining to that
  data.

- A survey document. This document will survey existing related
  mechanisms and protocols (e.g., HTTP, NFS, and WebDAV), and evaluate
  their applicability to DECADE.

- An architecture document. This document will identify DECADE's
  relationship with existing IETF protocols.  Existing protocols will be
  used wherever possible and appropriate to support DECADE's
  requirements.  In particular, data storage, retrieval, and management
  may be provided by an existing IETF protocols.  The WG will not limit
  itself to a single data transport protocol since different protocols
  may have varying implementation costs and performance tradeoffs.
  However, to keep interoperability manageable, a small number of
  specific, targeted, data transport protocols will be identified and
  used.

- An document describing the integration of DECADE with existing P2P
  applications (e.g., integration with BitTorrent).

If new protocol development (and hence, rechartering) is deemed
necessary, it is not expected that all work items will be ready for IESG
review by that point. However, WG consensus must show that documents
directing eventual protocol development (Requirements and Architecture
document) have stabilized. This permits adjustments to such documents as
necessary to maintain consistency as protocol development is done.

The following issues are considered out-of-scope for the WG:

- Implementation of policies regarding copyright-protected or illegal
  content. For example, one possibility is that that an in-network
  storage system may have system-wide ingress and egress filters to
  implement policies related to copyrighted and illegal content.  This
  is outside the scope of this working group.

- Locating the "best" in-network storage location from which to retrieve
  content if there are more than one location can provide the same
  content.

- Developing a new protocol for data transport between P2P applications
  and in-network storage.

Goals and Milestones:

Aug 2010  Working Group Last Call for Problem Statement 
Nov 2010  Submit Problem Statement to IESG as Informational 
Nov 2010  Working Group Last Call for Survey document 
Feb 2011  Submit Survey document to IESG as Informational 
Feb 2011  Working Group Last Call for Requirements document 
Feb 2011  Working Group Last Call for Architecture document 
Mar 2011  Identify need for rechartering 
May 2011  Submit Requirements document to IESG as Informational 
Jul 2011  Submit Architecture document to IESG as Informational


==============================================================


-- 
Richard Alimi
Department of Computer Science
Yale University