Time-deterministic multi-path routing method based on time expansion graph

Abstract

The invention discloses a time determinacy multi-path routing method based on a time expansion graph, and mainly solves the problem that a large amount of extra time delay is introduced when a traditional IP network guarantees reliable transmission of services. According to the scheme, the method comprises the following steps: 1) constructing a time slot time extension graph; 2) determining a path optimization target; 3) calculating a shortest path from a service source node to a destination node in the service, and judging whether the shortest path meets a path optimization target or not: if so, executing the step 4); otherwise, scheduling fails; 4) calculating a secondary short path P'relative to the shortest path; 5) judging whether a combination pair of P'and each known path meets a path optimization target or not: if so, taking a path in the combination pair as a transmission path and a backup path scheduling service; otherwise, taking P'as the shortest path and returning to the step 4). According to the method, the transmission path and the backup path can be quickly calculated, network congestion is avoided, the network resource utilization rate is improved, the service time certainty and the transmission reliability are guaranteed, and the method can be used for the Internet, the Internet of Things and mobile communication.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a time-deterministic multi-path routing method, which can be used in the Internet, the Internet of Things, and mobile communications. Background technique [0002] With the development of network technology, emerging network applications continue to emerge, such as industrial Internet, AR / VR, Internet of Vehicles, ultra-high-definition video, telemedicine, cloud games, etc. In these application scenarios, the requirements on the bandwidth, delay, and delay jitter of the transmission link are very strict, so exploring time-deterministic transmission methods for these applications has gradually become a research hotspot in the current communication field. [0003] In the IP network, the traditional IP network adopts the "best effort" routing and packet forwarding method, which faces great challenges in meeting the requirements of definite time and ultra-low jitter...

AI Technical Summary

Problems solved by technology

However, this algorithm does not consider the time determinism of the service path, so it cannot guarantee the end-to-end delay of service transmission

[0006] In the document Joint routing and scheduling for large-scale deterministic IP networks, Jonatan Krolikowski and others gave a time-deterministic routing algorithm for joint planning of path and service scheduling. An algorithm jointly planned with business scheduling. This algorithm arranges business data packets in units of time slots, and provides a transmission path with delay guarantee for business planning to ensure the time determinism of business transmission. However, the algorithm is due to Does not consider the reliability of the business in the transmission process, so it cannot deal with the loss of business due to congestion and equipment failure

Images