A Time Deterministic Multipath Routing Method Based on Time Expansion Graph

Abstract

The invention discloses a time deterministic multi-path routing method based on a time expansion graph, which mainly solves the problem that a large amount of extra delay is introduced when the traditional IP network guarantees reliable service transmission. The scheme is as follows: 1) construct a slotted time expansion diagram 2) determine the path optimization goal; 3) calculate the shortest path from the service source node to the destination node in , and judge whether the path optimization goal is satisfied: if so, execute 4); otherwise, schedule Failure; 4) Calculate the next-shortest path P' relative to the shortest path; 5) Determine whether the combined pair of P' and each known path satisfies the path optimization objective: if so, use the combined path as the transmission path and the backup path to schedule services ; otherwise return P' as the shortest path 4). The invention can quickly calculate the transmission path and the backup path, avoid network congestion, improve the utilization rate of network resources, ensure the certainty of business time and transmission reliability, and can be used in the Internet, the Internet of Things and mobile communications.

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 communication. 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 bandwidth, delay, and delay jitter of the transmission link are very demanding. Therefore, 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 coping with time-determined and ultra-low jitter requirements. In partic...

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