Addressing system and routing without tables in new generation networks

K. N. Lovtsov; S. Mayhoub; S. V. Timofeeva; A. M. Sukhov; M. S. Stengach

doi:10.1088/1742-6596/1368/5/052005

Addressing system and routing without tables in new generation networks

K. N. Lovtsov
, S. Mayhoub
, S. V. Timofeeva
, A. M. Sukhov
, M. S. Stengach

Samara National Research University
V.I. Vernadsky Crimean Federal University

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English
Article number	052005
Journal	Journal of Physics: Conference Series
Volume	1368
Issue number	5
DOIs	https://doi.org/10.1088/1742-6596/1368/5/052005
Publication status	Published - 27 Nov 2019
Event	5th International Conference on Information Technology and Nanotechnology, ITNT 2019 - Samara, Russian Federation Duration: 21 May 2019 → 24 May 2019

Bibliographical note

Publisher Copyright:
© 2019 IOP Publishing Ltd. All rights reserved.

Access to Document

10.1088/1742-6596/1368/5/052005

Cite this

@article{0de4074fd485449aa37193d393efb3d0,

title = "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.",

author = "Lovtsov, \{K. N.\} and S. Mayhoub and Timofeeva, \{S. V.\} and Sukhov, \{A. M.\} and Stengach, \{M. S.\}",

note = "Publisher Copyright: {\textcopyright} 2019 IOP Publishing Ltd. All rights reserved.; 5th International Conference on Information Technology and Nanotechnology, ITNT 2019 ; Conference date: 21-05-2019 Through 24-05-2019",

year = "2019",

month = nov,

day = "27",

doi = "10.1088/1742-6596/1368/5/052005",

language = "English",

volume = "1368",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

number = "5",

}

TY - JOUR

T1 - Addressing system and routing without tables in new generation networks

AU - Lovtsov, K. N.

AU - Mayhoub, S.

AU - Timofeeva, S. V.

AU - Sukhov, A. M.

AU - Stengach, M. S.

PY - 2019/11/27

Y1 - 2019/11/27

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85077325918

UR - https://iopscience.iop.org/article/10.1088/1742-6596/1368/5/052005

U2 - 10.1088/1742-6596/1368/5/052005

DO - 10.1088/1742-6596/1368/5/052005

M3 - Conference article

SN - 1742-6588

VL - 1368

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

IS - 5

M1 - 052005

T2 - 5th International Conference on Information Technology and Nanotechnology, ITNT 2019

Y2 - 21 May 2019 through 24 May 2019

ER -

Addressing system and routing without tables in new generation networks

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this