Network path rapid calculation method based on multi-QoS constraints

The invention discloses a network path rapid calculation method based on multi-QoS constraints, which can effectively reduce the complexity of solving a path calculation problem under the multi-QoS constraints and provide support for path calculation under a rapid change topology. According to the m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: CHEN DINGHE, WANG DEMIN, LYU CUNPU, WAN FEI, ZHANG ZILONG, XU YIBIAO, CAO HAIYANG, CHENG SHUAI
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The invention discloses a network path rapid calculation method based on multi-QoS constraints, which can effectively reduce the complexity of solving a path calculation problem under the multi-QoS constraints and provide support for path calculation under a rapid change topology. According to the method, an original path optimization problem is obtained through selection and approximate conversion of an optimization target and partial constraint conditions, then a feasibility preliminary judgment method is designed, a certain infeasible original problem can be quickly judged, and the infeasible original problem is prevented from being solved. And on the basis, a mode of deleting low-priority task requirements is designed for the original problem which is subjected to feasibility preliminary judgment but still infeasible, so that the high-priority task requirements are met as much as possible. Compared with an iterative algorithm based on a genetic algorithm, an ant colony algorithm and the like, the path cal