Open AccessAddressing system and routing without tables in new generation networks
Author(s) -
Konstantin Lovtsov,
Samara Mayhoub,
Sofiia V. Timofeeva,
A. M. Sukhov,
M. S. Stengach
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1368/5/052005
Subject(s) - hierarchy , computer science , routing (electronic design automation) , component (thermodynamics) , hierarchical routing , routing table , hierarchical database model , hierarchical control system , distributed computing , computer network , service (business) , theoretical computer science , data mining , routing protocol , static routing , artificial intelligence , physics , control (management) , economy , economics , market economy , thermodynamics
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.