Return
An Evolutionary Network Layer for Future Network MIN Architecture
DOI:10.1109/TNSE.2025.3583568.png)
Abstract
En 中文
The traditional network, designed around the TCP/IP protocol, achieves simple and efficient inter-connectivity between various protocols at the lower and upper layers through the thin-waist stack. However, the IP protocol primarily focuses on facilitating mutual communication between two terminal nodes. With the emergence of new network services and application scenarios, there has been an increasing demand for data services. Consequently, the traditional network architecture is no longer suitable for current and future users. In this paper, focusing on the multi-identifier scenarios, we propose MIN-ENL, an evolutionary network layer for future network, for communication, which includes an extensible multi-identifier management scheme and a general addressing scheme based on extensible identifier structure. Firstly, based on the standard definitions of identifiers and their related concepts, we design an extension identifier management scheme that supports the co-existence of multiple identifiers. Then, we design a general addressing scheme, which includes an identifier detection mechanism and a candidate identifier sorting algorithm. This scheme detects relationships between multiple identifiers in the form of a graph and selects an effective identifier for addressing. It allows for the continuous expansion and evolution of identifiers and communication modes in the network layer. The complete functionality of the identifier extension mechanism is implemented through the development of a network topology and a physical testbed in commercial operators' networks based on TCP/IP. The experimental results of prototypes demonstrate that the proposed scheme achieves backward compatibility and forward evolution, with acceptance performance cost.
Keywords:
Multi-identifier network
identifier extension
network evolution
prototype system
ndnSIM simulation
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K

