Hierarchical and Clustering-Based Timely Information Announcement Mechanism in the Computing Networks

Information announcement is the process of propagating and synchronizing the information of Computing Resource Nodes (CRNs) within the system of the Computing Networks. Accurate and timely acquisition of information is crucial to ensuring the efficiency and quality of subsequent task scheduling. However, existing announcement mechanisms primarily focus on reducing communication overhead, often neglecting the direct impact of information freshness on scheduling accuracy and service quality. To address this issue, this paper proposes a hierarchical and clustering-based announcement mechanism for the wide-area Computing Networks. The mechanism first categorizes the Computing Network Nodes (CNNs) into different layers based on the type of CRNs they interconnect to, and a top-down cross-layer announcement strategy is introduced during this process; within each layer, CNNs are further divided into several domains according to the round-trip time (RTT) to each other; and in each domain, inspired by the “Six Degrees of Separation” concept from social propagation, a RTT-aware fast clustering algorithm canopy is employed to partition CNNs into multiple overlap clusters. Intra-cluster announcements are modeled as a Traveling Salesman Problem (TSP) and optimized to accelerate updates, while inter-cluster propagation leverages overlapping nodes for global dissemination. Experimental results demonstrate that, by exploiting shortest path optimization within clusters and overlapping-node-based inter-cluster transmission, the mechanism is significantly superior to the comparison scheme in key indicators such as convergence time, Age of Information (AoI), and communication data volume per hop. The mechanism exhibits strong scalability and adaptability in large-scale network environments, providing robust support for efficient and rapid information synchronization in the Computing Networks.