The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The ...The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.展开更多
This paper investigates a consensus design problem for continuous-time first-order multiagent systems with uniform constant communication delay.Provided that the agent dynamic is unstable and the diagraph is undirecte...This paper investigates a consensus design problem for continuous-time first-order multiagent systems with uniform constant communication delay.Provided that the agent dynamic is unstable and the diagraph is undirected,sufficient conditions are derived to guarantee consensus.The key technique is the adoption of historical input information in the protocol.Especially,when agent's own historical input information is used in the protocol design,the consensus condition is constructed in terms of agent dynamic,communication delay,and the eigenratio of the network topology.Simulation result is presented to validate the effectiveness of the theoretical result.展开更多
文摘The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.
基金supported by the Taishan Scholar Construction Engineering by Shandong Government,the National Natural Science Foundation of China under Grant Nos.61120106011 and 61203029
文摘This paper investigates a consensus design problem for continuous-time first-order multiagent systems with uniform constant communication delay.Provided that the agent dynamic is unstable and the diagraph is undirected,sufficient conditions are derived to guarantee consensus.The key technique is the adoption of historical input information in the protocol.Especially,when agent's own historical input information is used in the protocol design,the consensus condition is constructed in terms of agent dynamic,communication delay,and the eigenratio of the network topology.Simulation result is presented to validate the effectiveness of the theoretical result.
