Algorithm for multi-constrained path selection based on experimental analysis

1. INTRODUCTION It is a challenging problem to provide quality-of-servi- ce (QoS) guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. The problem of routing optimization for different QoS requirements has attracted more and more attention and has becomes a hot issue in this field[1~6]. The QoSR problem deals with the metric parameters including bandwidth, delay, delay jitter, loss probability, reliability and hop count. Based o…

Algorithm for multi-constrained path selection based on experimental analysis

It is a challenging problem to provide quality-of-service (QoS) guarantees in next generation high-speed network, and the QoS routing is one of the key issues of the problem. For the problem of multi-constrained QoS routing in high-speed network, especially under the inaccurate link state information, the success ratio of the different constraint combination is analyzed statistically, and a constraint analysis method based on the computer simulation is proposed. Furthermore, the approximately equal loose-tight order relation between each two constraints is constructed, and then an algorithm based on the experimental analysis is presented. Finally, the simulation result demonstrates that the algorithm has the higher success ratio, and the theoretical analysis proves its correctness and universality.