Skip to main content

A Compute Resources Oriented Scheduling Mechanism based on Dataplane Programmability

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Zhiqiang Li , Kehan Yao , Yang Li
Last updated 2022-04-26 (Latest revision 2021-10-23)
RFC stream (None)
Intended RFC status (None)
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:


With massive data growing in the internet, how to effectively use the compute resources has become a quite hot topic. In order to cool down the pressure in today's large data centers, some compute resources have been moved towards the edge, gradually forming a distributed Compute Force Network. Force is a physical cause which can change the state of a motion or an object. We refer the definition from physics and extend its philosophy to network that in future, the network can be a compute force which can facilitate the integration of different kinds of compute resources, no matter hardware or software, making the computation fast and effective. In this draft, we present a compute resources oriented scheduling mechanism based on dataplane programmability, which can effectively schedule and manage compute resources in the network.


Zhiqiang Li
Kehan Yao
Yang Li

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