The routing algorithms for maximum probability paths under degree constraints in networks

Abstract

ABSTRACT Driven by the rapid development of information technology, the network has been researched extensively and the efficient routing design has become particularly important and valuable. Since the data transmission in networks is mainly based on the establishment of communication, the instability of links and the capacity of nodes should be considered. Motivated by this, considering the routing optimization under the degree constraints, we formulate the problem of designing paths with maximum probability in the network from a single source node to all other nodes. Then we propose five polynomial-time algorithms for this problem by using the technical methods of bidirectional optimization, probability first strategy, the selection of the node with the maximum number of degrees and the restriction of the depth. In addition, the simulations and comparative analysis show that the algorithms have obvious advantages in practice.