2770
EXPERIMENTAL

GLOP Addressing in 233/8 (Obsoleted)

Authors: D. Meyer, P. Lothberg
Date: February 2000
Area: ops
Working Group: mboned
Stream: IETF
Obsoleted by: RFC 3180

Abstract

This describes an experimental policy for use of the class D address space using 233/8 as the experimental statically assigned subset of the class D address space. This memo defines an Experimental Protocol for the Internet community.

RFC 2770: GLOP Addressing in 233/8 [RFC Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page]

Obsoleted by: 3180 EXPERIMENTAL
Network Working Group                                         D. Meyer
Request for Comments: 2770                               Cisco Systems
Category: Experimental                                     P. Lothberg
                                                                Sprint
                                                         February 2000


                        <span class="h1">GLOP Addressing in 233/8</span>

Status of this Memo

   This memo defines an Experimental Protocol for the Internet
   community.  It does not specify an Internet standard of any kind.
   Discussion and suggestions for improvement are requested.
   Distribution of this memo is unlimited.

Copyright Notice

   Copyright (C) The Internet Society (2000).  All Rights Reserved.

Abstract

   This describes an experimental policy for use of the class D address
   space using 233/8 as the experimental statically assigned subset of
   the class D address space. This new experimental allocation is in
   addition to those described on [<a href="#ref-IANA">IANA</a>] (e.g. [<a href="./rfc2365" title=""Administratively Scoped IP Multicast"">RFC2365</a>]).

   This memo is a product of the Multicast Deployment Working Group
   (MBONED) in the Operations and Management Area of the Internet
   Engineering Task Force. Submit comments to <mboned@ns.uoregon.edu> or
   the authors.

<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Problem Statement</span>

   Multicast addresses have traditionally been allocated by a dynamic
   mechanism such as SDR [<a href="#ref-SAP" title=""SAP: Session Announcement Protocol"">SAP</a>]. However, many current multicast
   deployment models are not amenable to dynamic allocation. For
   example, many content aggregators require group addresses which are
   fixed on a time scale which is not amenable to allocation by a
   mechanism such as described in [<a href="#ref-SAP" title=""SAP: Session Announcement Protocol"">SAP</a>]. Perhaps more seriously, since
   there isn't general consensus by providers, content aggregators, or
   application writers as to the allocation mechanism, the Internet is
   left without a coherent multicast address allocation scheme.








<span class="grey">Meyer & Lothberg              Experimental                      [Page 1]</span>

<span id="page-2" ></span>
<span class="grey"><a href="./rfc2770">RFC 2770</a>                GLOP Addressing in 233/8           February 2000</span>


   The MALLOC working group is looking at a specific strategy for global
   multicast address allocation [MADCAP, MASC]. This experiment will
   proceed in parallel. MADCAP may be employed within AS's, if so
   desired.

   This document proposes an experimental method of statically
   allocating multicast addresses with global scope. This experiment
   will last for a period of one year, but may be extended as described
   in <a href="#section-6">section 6</a>.

<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Address Space</span>

   For purposes of the experiment described here, the IANA has allocated
   233/8. The remaining 24 bits will be administered in a manner similar
   to that described in <a href="./rfc1797">RFC 1797</a>:

       0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
      +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
      |      233      |           16 bits AS          |  local bits   |
      +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+

<span class="h3"><a class="selflink" id="section-2.1" href="#section-2.1">2.1</a>. Example</span>

   Consider, for example, AS 5662. Written in binary, left padded with
   0s, we get 0001011000011110. Mapping the high order octet to the
   second octet of the address, and the low order octet to the third
   octet, we get 233.22.30/24.

<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Allocation</span>

   As mentioned above, the allocation proposed here follows the <a href="./rfc1797">RFC 1797</a>
   (case 1) allocation scheme, modified as follows: the high order octet
   has the value 233, and the next 16 bits are a previously assigned
   Autonomous System number (AS), as registered by a network registry
   and listed in the RWhois database system. This allows a single /24
   per AS.

   As was the case with <a href="./rfc1797">RFC 1797</a>, using the AS number in this way allows
   the experiment to get underway quickly in that it automatically
   allocates some addresses to each service provider and does not
   require a registration step.

<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Private AS Space</span>

   The address space mapped to the private AS space [<a href="./rfc1930" title=""Guidelines for creation, selection, and registration of an Autonomous System (AS)"">RFC1930</a>] is
   reserved for future allocation.





<span class="grey">Meyer & Lothberg              Experimental                      [Page 2]</span>

<span id="page-3" ></span>
<span class="grey"><a href="./rfc2770">RFC 2770</a>                GLOP Addressing in 233/8           February 2000</span>


<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Transition from GLOP to Other Address Allocation Schemes</span>

   It may not be necessary to transition from the address allocation
   scheme described here to a more dynamic approach (see, e.g., [<a href="#ref-MASC" title=""The Multicast Address-Set Claim (MASC) Protocol"">MASC</a>]).
   The reasoning here is that the statically assigned addresses taken
   from 233/8 may be sufficient for those applications which must have
   static addressing, and any other addressing can come from either a
   dynamic mechanism such as [<a href="#ref-MASC" title=""The Multicast Address-Set Claim (MASC) Protocol"">MASC</a>], the administratively scoped address
   space [<a href="./rfc2365" title=""Administratively Scoped IP Multicast"">RFC2365</a>], or the Single-source address space [<a href="#ref-SS">SS</a>].

<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Security Considerations</span>

   The approach described here may have the effect of reduced exposure
   to denial of space attacks based on dynamic allocation. Further,
   since dynamic assignment does not cross domain boundaries, well known
   intra-domain security techniques can be applied.

<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. IANA Considerations</span>

   IANA has allocated 233/8 for experimental assignments. This
   assignment should timeout one year after the assignment is made. The
   assignment may be renewed at that time. It should be noted that the
   experiment described here is in the same spirit the experiment
   described in [<a href="./rfc1797" title=""Class A Subnet Experiment"">RFC1797</a>].

<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Acknowledgments</span>

   This idea originated with Peter Lothberg's idea that we use the same
   allocation (AS based) as described in <a href="./rfc1797">RFC 1797</a> in the class D address
   space. Randy Bush and Mark Handley contributed many insightful
   comments.

<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. References</span>

   [<a id="ref-RFC2730">RFC2730</a>] Hanna, S., Patel, B. and M. Shah, "Multicast Address
             Dynamic Client Allocation Protocol (MADCAP)", <a href="./rfc2730">RFC 2730</a>,
             December 1999.

   [<a id="ref-MASC">MASC</a>]    D. Estrin, et al., "The Multicast Address-Set Claim (MASC)
             Protocol", Work in Progress.

   [<a id="ref-MSDP">MSDP</a>]    D. Farinacci et al., "Multicast Source Discovery Protocol
             (MSDP)", Work in Progress.

   [<a id="ref-IANA">IANA</a>]    www.isi.edu/in-notes/iana/assignments/multicast-addresses






<span class="grey">Meyer & Lothberg              Experimental                      [Page 3]</span>

<span id="page-4" ></span>
<span class="grey"><a href="./rfc2770">RFC 2770</a>                GLOP Addressing in 233/8           February 2000</span>


   [<a id="ref-RFC1797">RFC1797</a>] IANA, "Class A Subnet Experiment", <a href="./rfc1797">RFC 1797</a>, April 1995.

   [<a id="ref-RFC1930">RFC1930</a>] Hawkinson, J. and T. Bates, "Guidelines for creation,
             selection, and registration of an Autonomous System (AS)",
             <a href="./rfc1930">RFC 1930</a>, March 1996.

   [<a id="ref-RFC2365">RFC2365</a>] Meyer, D., "Administratively Scoped IP Multicast", <a href="./rfc2365">RFC</a>
             <a href="./rfc2365">2365</a>, July 1998.

   [<a id="ref-RFC2374">RFC2374</a>] Hinden, R., O'Dell, M. and S. Deering, "An IPv6
             Aggregatable Global Unicast Address Format", <a href="./rfc2374">RFC 2374</a>, July
             1998.

   [<a id="ref-SAP">SAP</a>]     Handley, M., <a style="text-decoration: none" href='https://www.google.com/search?sitesearch=datatracker.ietf.org%2Fdoc%2Fhtml%2F&q=inurl:draft-+%22SAP%3A+Session+Announcement+Protocol%22'>"SAP: Session Announcement Protocol"</a>, Work in
             Progress.

   [<a id="ref-SS">SS</a>]      www.isi.edu/in-notes/iana/assignments/single-source-
             multicast

<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. Authors' Addresses</span>

   David Meyer
   Cisco Systems, Inc.
   170 W. Tasman Drive
   San Jose, CA 95134-1706
   United States

   EMail: [email protected]


   Peter Lothberg
   Sprint
   VARESA0104
   12502 Sunrise Valley Drive
   Reston VA, 20196

   EMail: [email protected]














<span class="grey">Meyer & Lothberg              Experimental                      [Page 4]</span>

<span id="page-5" ></span>
<span class="grey"><a href="./rfc2770">RFC 2770</a>                GLOP Addressing in 233/8           February 2000</span>


<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. Full Copyright Statement</span>

   Copyright (C) The Internet Society (2000).  All Rights Reserved.

   This document and translations of it may be copied and furnished to
   others, and derivative works that comment on or otherwise explain it
   or assist in its implementation may be prepared, copied, published
   and distributed, in whole or in part, without restriction of any
   kind, provided that the above copyright notice and this paragraph are
   included on all such copies and derivative works.  However, this
   document itself may not be modified in any way, such as by removing
   the copyright notice or references to the Internet Society or other
   Internet organizations, except as needed for the purpose of
   developing Internet standards in which case the procedures for
   copyrights defined in the Internet Standards process must be
   followed, or as required to translate it into languages other than
   English.

   The limited permissions granted above are perpetual and will not be
   revoked by the Internet Society or its successors or assigns.

   This document and the information contained herein is provided on an
   "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING
   TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING
   BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION
   HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF
   MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.

Acknowledgement

   Funding for the RFC Editor function is currently provided by the
   Internet Society.



















Meyer & Lothberg              Experimental                      [Page 5]

Additional Resources