Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of ...Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.展开更多
An improved heuristic algorithm is developed which can optimize the multicast routing under the condition that both delay and bandwidth are constrained. Performance analysis and computer simulation show that the routi...An improved heuristic algorithm is developed which can optimize the multicast routing under the condition that both delay and bandwidth are constrained. Performance analysis and computer simulation show that the routing mechanism can successfully solve the QoS problem in the case of many-to-many cast session. The scheme can make the cost of routing tree optimized and the bandwidth and end-to-end delay guaranteed. Because complexity of algorithm is limited, it is suitable to deal with networks of large size.展开更多
In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not sa...In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.展开更多
This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dy...This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dynamic memberships; （2） the cost of the tree is as small as possible at each node addition/removal event; （3） all of the path delay meet a fixed delay constraint; （4） minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf（Balancing Factor） for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm （GA） is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.展开更多
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented. The algorithm empl...The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented. The algorithm employs mobile agents to search feasible paths in parallel and requires limited network state information kept at each node. The simulations indicate that the presented solution provides better call acceptance probability and better fairness between short paths and long paths. And the algorithm can tolerate high degree of delay imprecision.展开更多
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 develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit （MS-LEO） network end...This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit （MS-LEO） network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm, referred to as the utility maximizing routing （UMR） algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is for- mulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algo- rithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate, and improving the network utility.展开更多
With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast...With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.展开更多
Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths on links and the consideration of wavelength conversion ...Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths on links and the consideration of wavelength conversion delay in WDM networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim’s MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that the proposed algorithm is suitable for online multicast connection establishment in WDM networks.展开更多
The problem of constructing minimum cost multicast trees with end to end delay and delay variation constraints to meet the quality of service requirements in high speed packet switched environments is studied in t...The problem of constructing minimum cost multicast trees with end to end delay and delay variation constraints to meet the quality of service requirements in high speed packet switched environments is studied in this paper. The routing problem of the bounded delay along the paths from the source to each destination and the bounded variation among the delays along these paths is disussed, and then a new algorithm based on Hopfield neural networks to optimize the multicast tree with delay and variation constraints is presented. The simulations show that the proposed algorithm achieves its best performance in high speed computer networks.展开更多
The use of communication networks in control loops has gained increasing attention in recent years due to its advantages and flexible applications. The network quality-of-service （QoS） in those socalled networked co...The use of communication networks in control loops has gained increasing attention in recent years due to its advantages and flexible applications. The network quality-of-service （QoS） in those socalled networked control systems always fluctuates due to changes of the traffic load and available network resources, This paper presents an intelligent scheduling controller design approach for a class of NCSs to handle network QoS variations, The sampling period and control parameters in the controller are simultaneously scheduled to compensate for the network QoS variations. The estimation of distribution algorithm is used to optimize the sampling period and control parameters for better performance. Compared with existing networked control methods, the controller has better ability to compensate for the network QoS variations and to balance network loads. Simulation results show that the plant setting time with the intelligent scheduling controller is reduced by about 64.0% for the medium network load and 49.1% for high network load and demonstrate the effectiveness of the proposed approaches.展开更多
文摘Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.
文摘An improved heuristic algorithm is developed which can optimize the multicast routing under the condition that both delay and bandwidth are constrained. Performance analysis and computer simulation show that the routing mechanism can successfully solve the QoS problem in the case of many-to-many cast session. The scheme can make the cost of routing tree optimized and the bandwidth and end-to-end delay guaranteed. Because complexity of algorithm is limited, it is suitable to deal with networks of large size.
文摘In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.
文摘This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dynamic memberships; （2） the cost of the tree is as small as possible at each node addition/removal event; （3） all of the path delay meet a fixed delay constraint; （4） minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf（Balancing Factor） for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm （GA） is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.
文摘The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented. The algorithm employs mobile agents to search feasible paths in parallel and requires limited network state information kept at each node. The simulations indicate that the presented solution provides better call acceptance probability and better fairness between short paths and long paths. And the algorithm can tolerate high degree of delay imprecision.
文摘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 National Natural Science Foundation of China (Nos. 61171069, 61231013)Innovative Research Groups of the Foundation of China (No. 60921001)
文摘This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit （MS-LEO） network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm, referred to as the utility maximizing routing （UMR） algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is for- mulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algo- rithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate, and improving the network utility.
文摘With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.
文摘Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths on links and the consideration of wavelength conversion delay in WDM networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim’s MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that the proposed algorithm is suitable for online multicast connection establishment in WDM networks.
文摘The problem of constructing minimum cost multicast trees with end to end delay and delay variation constraints to meet the quality of service requirements in high speed packet switched environments is studied in this paper. The routing problem of the bounded delay along the paths from the source to each destination and the bounded variation among the delays along these paths is disussed, and then a new algorithm based on Hopfield neural networks to optimize the multicast tree with delay and variation constraints is presented. The simulations show that the proposed algorithm achieves its best performance in high speed computer networks.
基金the National Key Basic Research and Development Program (973) of China (No. 2002cb312205)the National Natural Science Foundation for Key Technical Research of China (No. 60334020)the National Natural Science Foundation of China (Nos. 60574035 and 60674053)
文摘The use of communication networks in control loops has gained increasing attention in recent years due to its advantages and flexible applications. The network quality-of-service （QoS） in those socalled networked control systems always fluctuates due to changes of the traffic load and available network resources, This paper presents an intelligent scheduling controller design approach for a class of NCSs to handle network QoS variations, The sampling period and control parameters in the controller are simultaneously scheduled to compensate for the network QoS variations. The estimation of distribution algorithm is used to optimize the sampling period and control parameters for better performance. Compared with existing networked control methods, the controller has better ability to compensate for the network QoS variations and to balance network loads. Simulation results show that the plant setting time with the intelligent scheduling controller is reduced by about 64.0% for the medium network load and 49.1% for high network load and demonstrate the effectiveness of the proposed approaches.
