datatracker.ietf.org
Sign in
Version 5.6.2.p2, 2014-07-24
Report a bug

Analysis of Algorithms For Deriving Port Sets
draft-tsou-softwire-port-set-algorithms-analysis-04

Document type: Active Internet-Draft (individual)
Document stream: ISE
Last updated: 2013-06-05 (latest revision 2013-05-17)
Intended RFC status: Unknown
Other versions: plain text, xml, pdf, html

ISE State: In ISE Review
Awaiting Reviews
Document shepherd: No shepherd assigned

IESG State: I-D Exists
Responsible AD: (None)
Send notices to: No addresses provided

Internet Engineering Task Force                             T. Tsou, Ed.
Internet-Draft                                 Huawei Technologies (USA)
Intended status: Informational                               T. Murakami
Expires: November 18, 2013                                   IP Infusion
                                                            S. Perreault
                                                                Viagenie
                                                            May 17, 2013

             Analysis of Algorithms For Deriving Port Sets
          draft-tsou-softwire-port-set-algorithms-analysis-04

Abstract

   This memo analyzes some port set definition algorithms used for
   stateless IPv4 to IPv6 transition technologies.  The transition
   technologies using port set algorithms can be divided into two
   categories: fully stateless approach and binding approach.  Some
   algorithms can work for both approaches.

Status of this Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on November 18, 2013.

Copyright Notice

   Copyright (c) 2013 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must

Tsou, et al.            Expires November 18, 2013               [Page 1]
Internet-Draft         Port Set Algorithm Analysis              May 2013

   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  3
   2.  Terminology  . . . . . . . . . . . . . . . . . . . . . . . . .  4
   3.  Various Types of Algorithms  . . . . . . . . . . . . . . . . .  4
     3.1.  Binding Approach Algorithms  . . . . . . . . . . . . . . .  4
       3.1.1.  Mask/Value Algorithm . . . . . . . . . . . . . . . . .  4
       3.1.2.  Cryptographic Algorithm  . . . . . . . . . . . . . . .  7
     3.2.  Fully Stateless: the Generalized Modulus Algorithm
           (GMA)  . . . . . . . . . . . . . . . . . . . . . . . . . .  8
       3.2.1.  MAP-E  . . . . . . . . . . . . . . . . . . . . . . . .  8
       3.2.2.  4rd-U  . . . . . . . . . . . . . . . . . . . . . . . . 10
       3.2.3.  MAP-T  . . . . . . . . . . . . . . . . . . . . . . . . 11
       3.2.4.  Evaluation . . . . . . . . . . . . . . . . . . . . . . 11
   4.  Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . 12
   5.  IANA Considerations  . . . . . . . . . . . . . . . . . . . . . 13
   6.  Security Considerations  . . . . . . . . . . . . . . . . . . . 13
   7.  References . . . . . . . . . . . . . . . . . . . . . . . . . . 13
     7.1.  Normative References . . . . . . . . . . . . . . . . . . . 13
     7.2.  Informative References . . . . . . . . . . . . . . . . . . 13
   Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 14

Tsou, et al.            Expires November 18, 2013               [Page 2]
Internet-Draft         Port Set Algorithm Analysis              May 2013

1.  Introduction

   IPv6 transition technologies with address sharing can be divided into
   three categories as suggested in [I-D.softwire-unified-cpe]:

   o  Fully stateful approach, e.g.  [RFC6333].  Stateful solutions do
      not make use of port sets, and are out of scope for this memo.

   o  Binding approach, with per-subscriber state, e.g.,
      [I-D.softwire-lw4over6].  This type of algorithm does not embed
      port set information and IPv4 address in the IPv6 address when
      doing translation or encapsulation, so a mapping entry is required
      in the border router.  This type of solution gives flexibility in
      address planning because the IPv4 address is not statically bound

[include full document text]