Skip to main content

Cycle Mapping Learning Method for Scaling DetNet
draft-zhu-detnet-cycle-mapping-learning-01

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Xiangyang Zhu , Yu jinghai , Chenqiang Gao , Quan Xiong
Last updated 2024-06-28 (Latest revision 2023-12-26)
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, 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 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.)