File system-based lightweight traffic scheduling method and system

By adopting a lightweight service scheduling method based on the file system, the complex dependencies and robustness issues of task flow orchestration in high-reliability environments are resolved, and efficient and reliable task scheduling and self-healing capabilities are achieved on domestic ARM platforms and secure isolated networks.

CN121900922BActive Publication Date: 2026-06-16NINGBO DIGITAL TWIN (EASTERN UNIV OF TECH) RES INST
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
NINGBO DIGITAL TWIN (EASTERN UNIV OF TECH) RES INST
Filing Date
2026-03-26
Publication Date
2026-06-16

AI Technical Summary

⚠Technical Problem

Existing task flow orchestration methods suffer from problems such as strong environmental dependence, rigid scheduling logic, and poor robustness in environments with high reliability requirements. They are particularly difficult to deploy on domestic ARM platforms and secure isolated networks, and cannot dynamically perceive the dependencies between tasks, leading to cascading errors and difficulties in automated operation.

⚗Method used

A lightweight business scheduling method based on the file system is adopted. By creating globally unique identifier files and dependency files, and using file existence checks to check dependencies, combined with time window priority sorting rules, dynamic scheduling and self-healing capabilities of tasks are achieved, avoiding dependence on complex middleware.

🎯Benefits of technology

It achieves highly reliable task scheduling in constrained environments, is lightweight, highly adaptable to different environments, and easy to maintain. It dynamically senses task status, avoids cascading errors, and has built-in failure recovery capabilities, simplifying operation and maintenance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121900922B_ABST
    Figure CN121900922B_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of task scheduling, and particularly relates to a lightweight service scheduling method and system based on a file system. The method comprises: creating, for each task, an identification file comprising a file name for encoding task state information and file content, to form a file system; a collection of identification files of all tasks forms a task list file, and a dependency relationship file for listing all preceding tasks is separately created for each task; a dependency check rule based on file existence is used to periodically determine whether the dependency of a task is satisfied, when the dependency of the task is determined to be satisfied, the file system is scanned, a priority sorting rule based on a time window is used to determine a to-be-executed task list from the task that satisfies the dependency and execute in order, and the identification file of the task is updated based on the execution result of the task. While not losing the core scheduling capability in a restricted environment, the lightweight, high environmental adaptability, strong robustness and easy maintainability of scheduling are realized.
Need to check novelty before this filing date? Find Prior Art