Internet Engineering Task Force K. Kadavill, Ed. Internet-Draft 6 July 2023 Intended status: Standards Track Expires: 7 January 2024 Internet Protocol version 11 draft-rfcxml-general-ipv11-standard-00 Abstract Standard for IPv11 address format and routing theory 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 https://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 7 January 2024. Copyright Notice Copyright (c) 2023 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 (https://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 include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License. Kadavill Expires 7 January 2024 [Page 1] Internet-Draft Abbreviated Title July 2023 Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1. Requirements Language . . . . . . . . . . . . . . . . . . 2 2. IPv11 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Address Format . . . . . . . . . . . . . . . . . . . . . 2 2.2. IPv11 Assignment . . . . . . . . . . . . . . . . . . . . 3 2.3. Broadcast address . . . . . . . . . . . . . . . . . . . . 4 2.4. Routing . . . . . . . . . . . . . . . . . . . . . . . . . 4 3. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 4 4. Security Considerations . . . . . . . . . . . . . . . . . . . 4 5. References . . . . . . . . . . . . . . . . . . . . . . . . . 4 5.1. Normative References . . . . . . . . . . . . . . . . . . 4 5.2. Informative References . . . . . . . . . . . . . . . . . 5 Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 5 1. Introduction 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. 1.1. Requirements Language 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 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here. 2. IPv11 The Internet Protocol Version 11 2.1. Address Format 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 Kadavill Expires 7 January 2024 [Page 2] Internet-Draft Abbreviated Title July 2023 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. +=========================+=========================================+ | | IP Address | +=========================+=========================================+ | Host Part of | 0BXX:XXXX:XXXX:XXXX:XXXX:XXXX:XXHH:HHHH | | address | | +-------------------------+-----------------------------------------+ | Parent network | 0BPP:PPPP:NNNN:NNCC:CCCC:XXXX:XXXX:XXXX | | address, network | | | address and | | | child network | | | address of host | | +-------------------------+-----------------------------------------+ | Parent network | 0BXX:XXXX:PPPP:PPNN:NNNN:CCCC:CCXX:XXXX | | address, network | | | address and | | | child network | | | address of host | | +-------------------------+-----------------------------------------+ Table 1 2.2. IPv11 Assignment 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. +=========================+=========================================+ | | IP Address | +=========================+=========================================+ | First network | 0B::100:0000 | | to assign | | +-------------------------+-----------------------------------------+ | Last network | 0BEF:FFFF:FFFF:FFFF:FFFF:FFFF:FF00:0000 | | to assign | | +-------------------------+-----------------------------------------+ Table 2 Kadavill Expires 7 January 2024 [Page 3] Internet-Draft Abbreviated Title July 2023 2.3. Broadcast address 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 +===================+=========================================+ | | IP Address | +===================+=========================================+ | Broadcast address | 0B::1FF:FFFF | | of first network | | +-------------------+-----------------------------------------+ | Broadcast address | 0BEF:FFFF:FFFF:FFFF:FFFF:FFFF:FFFF:FFFF | | of last network | | +-------------------+-----------------------------------------+ Table 3 2.4. Routing 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 3. IANA Considerations This memo includes no request to IANA. 4. Security Considerations This document should not affect the security of the Internet. 5. References 5.1. Normative References Kadavill Expires 7 January 2024 [Page 4] Internet-Draft Abbreviated Title July 2023 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, . [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, May 2017, . 5.2. Informative References [Wikipedia] Wikipedia, "Wikipedia", 2023, . Author's Address Kiran Kadavill (editor) #34, Goshree Garden,Arattuvazhi Road Njarakkal 682505 KERALA 682505 India Phone: +91 9633068829 Email: kin.kad@gmail.com Kadavill Expires 7 January 2024 [Page 5]