Addressing system and routing without tables in new generation networks
Abstract
The article proposes a new method of bit hierarchical addressing. To record the component of the hierarchical address, two bits of service information are used which show the number of blocks of standard length. To search for a route in hierarchical address environments, the complex method of greedy forwarding with two centers of hierarchy is proposed.
- Publication:
-
Journal of Physics Conference Series
- Pub Date:
- November 2019
- DOI:
- 10.1088/1742-6596/1368/5/052005
- Bibcode:
- 2019JPhCS1368e2005L