Professional Documents
Culture Documents
Blanchet
Request for Comments: 3531 Viagenie
Category:Informational April 2003
Copyright Notice
Abstract
Table of Contents
1. Rationale . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
3. Description of the Algorithm . . . . . . . . . . . . . . . . . 3
3.1 Leftmost . . . . . . . . . . . . . . . . . . . . . . . . . . 3
3.2 Rightmost . . . . . . . . . . . . . . . . . . . . . . . . . 3
3.3 Centermost . . . . . . . . . . . . . . . . . . . . . . . . . 4
4. Example . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
5. Security Considerations . . . . . . . . . . . . . . . . . . . 5
6. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . 5
References . . . . . . . . . . . . . . . . . . . . . . . . . . 6
Author’s Address . . . . . . . . . . . . . . . . . . . . . . . 6
Full Copyright Statement . . . . . . . . . . . . . . . . . . . 7
1. Rationale
RFC 1219 [1] describes an allocation scheme for IPv4 where address
space is kept unallocated between the leftmost bits of the subnet
part and the rightmost bits of the host part of the address. This
enables the network designer to change the subnet mask without
renumbering, for the central bits not allocated.
2. Scheme
+------+------+------+------+------+------+
| p1 | p2 | p3 | p4 | ... | pN |
+------+------+------+------+------+------+
<------- ipv6 or ipv4 address ------------>
3.1 Leftmost
Order Assignment
1 00000000
2 10000000
3 01000000
4 11000000
5 00100000
6 10100000
7 01100000
8 11100000
9 00010000
...
3.2 Rightmost
Order Assignment
1 00000000
2 00000001
3 00000010
4 00000011
5 00000100
6 00000101
7 00000110
8 00000111
9 00001000
...
3.3 Centermost
Order Assignment
1 00000000
2 00001000
3 00010000
4 00011000
5 00000100
6 00001100
7 00010100
8 00011100
9 00100000
...
1. The first round is to select only the middle bit (and if there is
an even number of bits pick the bit following the center)
2. Create all combinations using the selected bits that haven’t yet
been created.
3. Start a new round by adding one more bit to the set. In even
rounds add the preceding bit to the set. In odd rounds add the
subsequent bit to the set.
4. Example
10000000 : assigned to C1
01000000 : assigned to C2
11000000 : assigned to C3
00100000 : assigned to C4
...
5. Security Considerations
6. Acknowledgements
References
[1] Tsuchiya, P., "On the assignment of subnet numbers", RFC 1219,
April 1991.
[2] Bradner, S., "The Internet Standards Process -- Revision 3", BCP
9, RFC 2026, October 1996.
Author’s Address
Marc Blanchet
Viagenie
2875 boul. Laurier, bureau 300
Sainte-Foy, QC G1V 2M2
Canada
The limited permissions granted above are perpetual and will not be
revoked by the Internet Society or its successors or assigns.
Acknowledgement