Cycle Mapping Learning Method for Scaling DetNet
draft-zhu-detnet-cycle-mapping-learning-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Xiangyang Zhu , Yu jinghai , Chenqiang Gao , Quan Xiong | ||
| Last updated | 2025-04-17 (Latest revision 2024-10-14) | ||
| Replaces | draft-zhu-detnet-ldn-mapping | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| 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 scaling DetNet (Deterministic Networking) technology based on cyclic queuing and scheduling is expected to solve the scalability problem of DetNet. One of the key technologies is to accurately obtain the cyclic mapping relationship between adjacent nodes and the packets can achieve the end-to-end deterministic forwarding. This draft describes the method for 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.)