A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay an...A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth展开更多
Risk-disjoint routing is an efficient way to improve network survivability. In this article, a partial risk-disjoint routing algorithm based on link availability （PRDRA-LA） is proposed based on the complete risk-dis...Risk-disjoint routing is an efficient way to improve network survivability. In this article, a partial risk-disjoint routing algorithm based on link availability （PRDRA-LA） is proposed based on the complete risk-disjoint routing algorithm （CRDRA）. While calculating the protection path with PRDRA-LA, the links that share risks with the links in the working path are filtered by link availability. In addition, the risk disjoint degree between the protection path and the working path can be adjusted freely. Simulation results showed that when compared with CRDRA, routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.展开更多
基金This project was supported by the National Natural Science Foundation of China (90304018)and the Natural ScienceFoundation of Hubei Province of China (2004ABA023)
文摘A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth
基金This work is supported by the National Science Fund for Distinguished Young Scholars（60325104）；the National Natural Science Foundation of China （60572021）；the Hi-Tech Research and Development Program of China （2006AA01Z243）；the PCSIRT Project of M0E （IRT0609）；the International Cooperation Project of M0ST （2006DFA 11040）.
文摘Risk-disjoint routing is an efficient way to improve network survivability. In this article, a partial risk-disjoint routing algorithm based on link availability （PRDRA-LA） is proposed based on the complete risk-disjoint routing algorithm （CRDRA）. While calculating the protection path with PRDRA-LA, the links that share risks with the links in the working path are filtered by link availability. In addition, the risk disjoint degree between the protection path and the working path can be adjusted freely. Simulation results showed that when compared with CRDRA, routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.
