<?xml version="1.0" encoding="utf-8"?>
<!-- 
     draft-rfcxml-general-template-standard-00
  
     This template includes examples of the most commonly used features of RFCXML with comments 
     explaining how to customize them. This template can be quickly turned into an I-D by editing 
     the examples provided. Look for [REPLACE], [REPLACE/DELETE], [CHECK] and edit accordingly.
     Note - 'DELETE' means delete the element or attribute, not just the contents.
     
     Documentation is at https://authors.ietf.org/en/templates-and-schemas
-->
<?xml-model href="rfc7991bis.rnc"?>  <!-- Required for schema validation and schema-aware editing -->
<!-- <?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?> -->
<!-- This third-party XSLT can be enabled for direct transformations in XML processors, including most browsers -->


<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<!-- If further character entities are required then they should be added to the DOCTYPE above.
     Use of an external entity file is not recommended. -->

<rfc
  xmlns:xi="http://www.w3.org/2001/XInclude"
  category="std"
  docName="draft-rfcxml-general-ipv11-standard-00"
  ipr="trust200902"
  obsoletes=""
  updates=""
  submissionType="IETF"
  xml:lang="en"
  version="3">
<!-- [REPLACE] 
       * docName with name of your draft
     [CHECK] 
       * category should be one of std, bcp, info, exp, historic
       * ipr should be one of trust200902, noModificationTrust200902, noDerivativesTrust200902, pre5378Trust200902
       * updates can be an RFC number as NNNN
       * obsoletes can be an RFC number as NNNN 
-->

  <front>
    <title abbrev="Abbreviated Title">Internet Protocol version 11 </title>
    <!--  [REPLACE/DELETE] abbrev. The abbreviated title is required if the full title is longer than 39 characters -->

    <seriesInfo name="Internet-Draft" value="draft-rfcxml-general-ipv11-standard-00"/>
   
    <author fullname="Kiran Kadavill" initials="K" role="editor" surname="Kadavill">
      <!-- [CHECK]
             * initials should not include an initial for the surname
             * role="editor" is optional -->
    <!-- Can have more than one author -->
      
    <!-- all of the following elements are optional -->
      
      <address>
        <postal>
          <!-- Reorder these if your country does things differently -->
          <street>#34, Goshree Garden,Arattuvazhi Road </street>
          <city>Njarakkal</city>
          <region> KERALA 682505 </region>
          <code>682505</code>
          <country>IN</country>
          <!-- Uses two letter country code -->
        </postal>        
        <phone>+91 9633068829 </phone>
        <email>kin.kad@gmail.com </email>  
        <!-- Can have more than one <email> element -->
        <uri></uri>
      </address>
    </author>
   
    <date year="2023" month="July" day="06"/>
    <!-- On draft subbmission:
         * If only the current year is specified, the current day and month will be used.
         * If the month and year are both specified and are the current ones, the current day will
           be used
         * If the year is not the current one, it is necessary to specify at least a month and day="1" will be used.
    -->

    <area>General</area>
    <workgroup>Internet Engineering Task Force</workgroup>
    <!-- "Internet Engineering Task Force" is fine for individual submissions.  If this element is 
          not present, the default is "Network Working Group", which is used by the RFC Editor as 
          a nod to the history of the RFC Series. -->

    <keyword>IPv11</keyword>
    <!-- [REPLACE/DELETE]. Multiple allowed.  Keywords are incorporated into HTML output files for 
         use by search engines. -->

    <abstract>
      <t> Standard  for  IPv11 address format and routing theory </t>
    </abstract>
 
  </front>

  <middle>
    
    <section>
      <name>Introduction</name>
      <t>IPv6 has been routing packets by forwarding packets to gateways after gateways until it reaches its destination network .   BGP Networks seem to be working on a bus or Ring topology network. This happened because IPv6 addresses were bland and had no networking information in them. We plan to right these wrongs with IPv11. A 128 bit address with 24 bit chunks ancestors and host. Since 24 chunks means just 16,777,216 clients per child network or hosts so they are easy to manage. </t>

      <section>
        <name>Requirements Language</name>
        <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL",
          "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT
          RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be
          interpreted as described in BCP 14 <xref target="RFC2119"/>
          <xref target="RFC8174"/> when, and only when, they appear in
          all capitals, as shown here.</t>
      </section>
      <!-- [CHECK] The 'Requirements Language' section is optional -->

    </section>

     <section>
      	<name>IPv11</name>
      	<t> The Internet Protocol Version 11</t>  
	<section>
		<name>Address Format </name>
		<t> The format for an IPv11 address starts with an Octet and its value is  a constant hexadecimal number 0x0B which tells the device that it is an IPv11 IP address.
 
The next 24 bits is the first ancestor of the ip address.If any ancestor is 0x000000 it means there is no network assigned to this part of the network address.

The next 24 bits are its child network of the client address.The next child (network network )is 24 bits and so on until the last 24 bits.

The host ip address is always the last 24 bits of the IP address .IPv11  IP address is of the format: 0BXX:XXXX:XXXX:XXXX:XXXX:XXXX:XXHH:HHHH.</t>  
<table>
        <thead>
        <!-- [REPLACE/DELETE] a table header is optional -->
          <tr><th></th><th>IP Address</th></tr>
        </thead>
        <tbody>
          <tr>
		<td>Host Part of address</td>
<td>0BXX:XXXX:XXXX:XXXX:XXXX:XXXX:XXHH:HHHH </td>
</tr>
 		<tr>
		<td> Parent network address, network address and child network address of host</td>
<td>0BPP:PPPP:NNNN:NNCC:CCCC:XXXX:XXXX:XXXX </td>
</tr>
<tr>
		<td> Parent network address, network address and child network address of host</td>
<td>0BXX:XXXX:PPPP:PPNN:NNNN:CCCC:CCXX:XXXX </td>
</tr>

        </tbody>
      </table>
</section>
<section>
		<name>IPv11 Assignment</name>
<t>IP addresses are assigned sequentially to network AA(autonomous authorities)  starting at the first address from the last 24bit child network  i.e. the first network address is  0B::100:0000. </t>  
<table>
        <thead>
        <!-- [REPLACE/DELETE] a table header is optional -->
          <tr><th></th><th>IP Address</th></tr>
        </thead>
        <tbody>
          <tr>
		<td>First network to assign</td>
<td>0B::100:0000</td>
</tr>
 <tr>
	<td> Last network to assign</td>
<td>0BEF:FFFF:FFFF:FFFF:FFFF:FFFF:FF00:0000</td>
</tr>

        </tbody>
      </table>
</section>
<section>
	<name>Broadcast address </name>
<t> Any network can be  broadcasted to by filling in the ancestor part of the address and masking the rest part of the networks (and host address) with the value F .

This will send data to child network AAs (or host). An example of a broadcast address is 0BXX:XXXX:FFFF:FFFF::FFFF:FFFF:FFFF:FFFF this will broadcast to next 16,777,216  child networks of OBXX:XXXX:: network</t>  

<table>
        <thead>
        <!-- [REPLACE/DELETE] a table header is optional -->
          <tr><th></th><th>IP Address</th></tr>
        </thead>
        <tbody>
          <tr>
		<td>Broadcast address of first network</td>
<td>0B::1FF:FFFF </td>
</tr>
 <tr>
	<td> Broadcast address of last network</td>
<td>0BEF:FFFF:FFFF:FFFF:FFFF:FFFF:FFFF:FFFF </td>
</tr>

        </tbody>
      </table>
</section>
<section>
<name>Routing</name>
<t>Routing is accomplished by  first finding how many 24 bits match in the source and the destination IP address.
Then querying child AA’s for the next 24 bit address.this process is repeated for every network.
 Each AA’s network tables contain all known immediate children (a max of 16777216) the best route to the next child network in the path. 
Routes can be optimized later by lookin for shortcut pathways to networks on route to the destination. This can be accomplished by looking for matching sibling gateways to child networks in the pathway to the destination</t>  
</section>

  


    </section>






    <section anchor="IANA">
    <!-- All drafts are required to have an IANA considerations section. See RFC 8126 for a guide.-->
      <name>IANA Considerations</name>
      <t>This memo includes no request to IANA.</t>
    </section>
    
    <section anchor="Security">
      <!-- All drafts are required to have a security considerations section. See RFC 3552 for a guide. -->
      <name>Security Considerations</name>
      <t>This document should not affect the security of the Internet. </t>
    </section>
    
    <!-- NOTE: The Acknowledgements and Contributors sections are at the end of this template -->
  </middle>

  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml"/>
        <xi:include href="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml"/>
        <!-- The recommended and simplest way to include a well known reference -->
        
      </references>
 
      <references>
        <name>Informative References</name>
       
       

        <reference anchor="Wikipedia" target="https://www.wikipedia.org/">
        
          <front>
            <title>Wikipedia</title>
            <author>
<organization>Wikipedia</organization>
            </author>
            <date year="2023"/>
            <!-- [CHECK] -->
          </front>
        </reference>       
       
      </references>
    </references>
 </back>
</rfc>










