Skip to main content

Deterministic Networking (DetNet) Controller Plane - VPFC Planning Information Model Based on VPFP in Scaling Deterministic Networks
draft-guo-detnet-vpfc-planning-03

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Daorong Guo , Guangliang Wen , Kehan Yao , Quan Xiong , Guoyu Peng , XUEJUN YOU , zhushiyin
Last updated 2024-07-08 (Latest revision 2024-01-05)
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 cycle-based queuing and forwarding mechanisms are an effective method to ensure that the transmission has a definite upper bound of jitter, as well as latency. The prerequisite for this method is to ensure that queuing resources do not conflict. In scaling deterministic networks, how to avoid the queuing resources conflict of this method is an open problem. This document proposes the information model of planning virtual periodic forwarding channel (VPFC) based on virtual periodic forwarding path (VPFP). The solution can solve the queuing resources conflict of cycle-specified queuing and forwarding in nonlinear topology domain, ensuring the bounded latency of DetNet flow in the same periodic forwarding domain.

Authors

Daorong Guo
Guangliang Wen
Kehan Yao
Quan Xiong
Guoyu Peng
XUEJUN YOU
zhushiyin

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)