The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of th...The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.展开更多
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...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.展开更多
In order to establish a route supporting multi-constrained quality of service(QoS), increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving...In order to establish a route supporting multi-constrained quality of service(QoS), increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm(IAMQER) is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.展开更多
文摘The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.
文摘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.
基金supported by the National Natural Science Foundation of China(61101107)the Beijing Higher Education Young Elite Teacher Project
文摘In order to establish a route supporting multi-constrained quality of service(QoS), increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm(IAMQER) is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.