Flexible Candidate Path Selection of SR Policy
draft-liu-spring-sr-policy-flexible-path-selection-06
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| Authors | Yisong Liu , Changwang Lin , Shuping Peng , Gyan Mishra , Yuanxiang Qiu | ||
| Last updated | 2024-12-01 (Latest revision 2024-05-30) | ||
| RFC stream | (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
This document proposes a flexible SR policy candidate path selection method. Based on the real-time resource usage and forwarding quality of candidate paths, the head node can perform dynamic path switching among multiple candidate paths in the SR policy.
Authors
Yisong Liu
Changwang Lin
Shuping Peng
Gyan Mishra
Yuanxiang Qiu
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)