LDN CYCLE MAPPING LEARNING PROCESS
draft-zhu-detnet-ldn-mapping-00
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Xiangyang Zhu , Yu jinghai , Chenqiang Gao , Quan Xiong | ||
Last updated | 2023-05-25 | ||
Replaced by | draft-zhu-detnet-cycle-mapping-learning | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-zhu-detnet-cycle-mapping-learning | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The Large-scale Deterministic Network(LDN) technology based on cyclic queuing and scheduling is expected to solve the scalability problem of DetNet, and is hoped to extend the adaptive domain of DetNet to wide area network or even backbone network. One of the keys of this technology is to accurately obtain the cyclic mapping relationship between adjacent nodes, based on which DetNet packets can be end-to- end deterministically forwarded . This draft proposes a method for LDN nodes to learn the cycle mapping relationship through sending learning messages.
Authors
Xiangyang Zhu
Yu jinghai
Chenqiang Gao
Quan Xiong
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)