Computing Service Discovery and Scheduling Mechanism Based on Multidimensional Unified Identifier

The surge in ubiquitous computing resources has propelled the evolution of Computing-aware Networking. Nonetheless, the majority of existing computing service discovery and scheduling mechanisms suffer from deficiencies such as sub-optimal search efficiency and algorithmic shortcomings, leading to low solution quality and efficiency. In response, this paper proposes a computing service discovery and scheduling mechanism founded on multi-dimensional unified identifier. Initially, a computing service architecture rooted in multi-dimensional unified identifier is outlined. This architecture delineates computing service attributes using multi-dimensional descriptors, enabling service addressing predicated on mapped service identifier. Subsequently, the matching discovery mechanism for computing services is structured around the K-Dimensional Tree (K-D Tree) framework. Moreover, a computing service scheduling mechanism is devised, catering to both single-node and combined service scheduling scenarios. Finally, the experimental test evaluation results show that the discovery delay associated with computing services satisfies the requirements across various service request scenarios. Moreover, when contrasted with the nearby greedy strategy, the proposed computing service scheduling mechanism achieves a superior user satisfaction score.