Skip to main content

Hierarchical segment routing solution of CAN

Document Type Replaced Internet-Draft (individual)
Expired & archived
Authors Daniel Huang , Zongpeng Du , Chen Zhang
Last updated 2023-01-08
Replaced by draft-huang-cats-two-segment-routing
RFC stream (None)
Intended RFC status (None)
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-huang-cats-two-segment-routing
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:


CAN (Computing Aware Network) is designed to enable the routing network to be aware of computing status thus deliver the service flow accordingly. Nevertheless, computing and networking is quite different in terms of resource granularity as well as its status stability. It would gain significant benefits to accommodate the computing status to that of networking by employing a hierarchical computing routing segment scheme. The network-accommodated computing status could be maintained at remote CAN nodes while the rest could reside at local CAN nodes. By enabling the network to schedule and route computing services in a compatible way with the current IP routing network, CAN would bring benefits to the industry by both efficiently pooling the computing resources and rendering services through perspective of converged networking and computing.


Daniel Huang
Zongpeng Du
Chen Zhang

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