# US 2026/0089708 A1 · Task scheduling method, electronic device, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0089708 A1
- Document ID: US20260089708A1
- Status: Published application
- Kind: A1
- Application number: 19/024,080
- Filed: 2025-01-16
- Published: 2026-03-26
- Earliest claimed: 2024-09-25
- Assignees: Beijing University of Posts and Telecommunications
- Applicants: Beijing University of Posts and Telecommunications
- Inventors: Xing ZHANG; Yang LI; Wenbo WANG
- Web page: https://patentgrep.com/patent/US20260089708A1

## CPC

- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- H04W 72/1263: Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F 9/5072: {Grid computing}
- H04L 41/0816: the condition being an adaptation, e.g. in response to network events
- H04L 41/0823: characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02)
- H04L 41/0896: Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities (flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76)
- H04L 41/147: for predicting network behaviour
- H04L 43/045: for graphical visualisation of monitoring data
- H04L 43/08: Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L 43/0876: Network utilisation, e.g. volume of load or congestion level
- H04L 47/83: based on usage prediction
- H04L 41/0895: Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
- H04L 41/142: using statistical or mathematical methods
- H04L 41/16: using machine learning or artificial intelligence
- H04L 43/20: the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
- H04W 88/08: Access point devices
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present disclosure provides a task scheduling method, electronic device, and storage medium. The method is performed by a central controller in a multi-region inter-connected edge network, including: receiving, from each of a plurality of network access points, first scheduling overhead, prediction information for task arrival, resource allocation information, and network status information; generating a computing power network graph based on the prediction information for task arrival, the resource allocation information, and the network state information of the plurality of network access points; determining a scheduling strategy for a next scheduling cycle based on the first scheduling overhead of the plurality of network access points and the computing power network graph; and sending the scheduling strategy to each of the plurality of network access points before the next scheduling cycle begins.

## Claims

### Claim 1

A task scheduling method, performed by a central controller in a multi-region inter-connected edge network, the multi-region inter-connected edge network further comprising a plurality of network access points respectively in a plurality of regions, the method comprising:
receiving, from each of the plurality of network access points, first scheduling overhead, prediction information for task arrival, resource allocation information, and network status information, wherein the first scheduling overhead represents a sum of scheduling overhead caused when the respective network access point scheduling a plurality of task requests for a service within a previous scheduling cycle;
generating a computing power network graph based on the prediction information for task arrival, the resource allocation information, and the network state information of the plurality of network access points;
determining a scheduling strategy for a next scheduling cycle based on the first scheduling overhead of the plurality of network access points and the computing power network graph, wherein the scheduling strategy comprises scheduling probabilities of forwarding a task request from one network access point to another network access point; and
sending the scheduling strategy to each of the plurality of network access points before the next scheduling cycle begins.

### Claim 2 (depends on 1)

The method of claim 1, wherein the determining comprises:
calculating a second scheduling overhead for the next scheduling cycle based on the first scheduling overhead and a pre-determined long-term-average scheduling overhead;
determining the scheduling strategy based on the second scheduling overhead and the computing power network graph.

### Claim 3 (depends on 2)

The method of claim 2, wherein the scheduling strategy is represented by a matrix of the scheduling probabilities, and the determining the scheduling strategy based on the second scheduling overhead and the computing power network graph comprises:
by assigning an initial class for each of the plurality of network access points according to a plurality of pre-determined classes, generating a set of candidate class vectors for the plurality of network access points, wherein the pre-determined classes comprise: a source node, a sink node, and an isolated node, the source node has only an out-degree and no in-degree, the sink node has only an in-degree and no out-degree, and the isolated node has neither an out-degree nor an in-degree;
configuring an objective function based on the second scheduling overhead, a scheduling probability, and the computing power network graph;
determining, for each of the set of candidate class vectors, the matrix of the scheduling probabilities by using the objective function; and
selecting an optimal matrix as the scheduling strategy, according to a value of the objective function when determining the matrix of the scheduling probabilities.

### Claim 4 (depends on 1)

The method of claim 1, wherein after receiving the scheduling strategy, each of the plurality of network access points determines, according to the scheduling strategy, a target network access point for a task request received from a user terminal, and forwards the task request to the target network access point.

### Claim 5 (depends on 4)

The method of claim 4, wherein each of the plurality of network access points determines whether a task request is received from another network access point, and in response to determining the task request is received from another network access point, sends the task request to an edge computing server in a same region to process the task request.

### Claim 6 (depends on 1)

The method in claim 1, wherein at the end of a current scheduling cycle, each of the plurality of network access points calculates the first scheduling overhead for each service and reports the first scheduling overhead to the central controller.

### Claim 7

An electronic device, comprising a memory, a processor, and a computer program stored in the memory that, when executed by the processor, causes the processor to:
receive, from each of a plurality of network access points, first scheduling overhead, prediction information for task arrival, resource allocation information, and network status information, wherein the first scheduling overhead represents a sum of scheduling overhead caused when the respective network access point scheduling a plurality of task requests for a service within a previous scheduling cycle;
generate a computing power network graph based on the prediction information for task arrival, the resource allocation information, and the network state information of the plurality of network access points;
determine a scheduling strategy for a next scheduling cycle based on the first scheduling overhead of the plurality of network access points and the computing power network graph, wherein the scheduling strategy comprises scheduling probabilities of forwarding a task request from one network access point to another network access point; and
send the scheduling strategy to each of the plurality of network access points before the next scheduling cycle begins.

### Claim 8

A non-transitory computer-readable storage medium, storing a computer program, causing a computer to execute a process, the process comprising:
receiving, from each of a plurality of network access points, first scheduling overhead, prediction information for task arrival, resource allocation information, and network status information, wherein the first scheduling overhead represents a sum of scheduling overhead caused when the respective network access point scheduling a plurality of task requests for a service within a previous scheduling cycle;
generating a computing power network graph based on the prediction information for task arrival, the resource allocation information, and the network state information of the plurality of network access points;
determining a scheduling strategy for a next scheduling cycle based on the first scheduling overhead of the plurality of network access points and the computing power network graph, wherein the scheduling strategy comprises scheduling probabilities of forwarding a task request from one network access point to another network access point; and
sending the scheduling strategy to each of the plurality of network access points before the next scheduling cycle begins.
