An Access Algorithm of Time-Sensitive Services In Space Information Network

Focus on the problems of limited resources in space information networks and the vulnerability of time-sensitive services to the influence of other services and overall network load conditions. This paper proposes a method of time-sensitive service access algorithm based on dynamic reservation. This method adopts a multi-priority preemptive access strategy with mixed queuing, performs real-time estimation of node traffic changes in the time dimension, and completes dynamic adjustment of reserved resources. It can satisfy the flexible access requirements of multiple services under dynamic changes in traffic. Simulation results show that this algorithm significantly reduces the access blocking probability of time-sensitive services while striving to ensure the performance of non-time-sensitive service access, thereby enhancing the overall access performance of the system.