Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extracti...Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extraction, constraint network construction andoperation, constraint chains are acquired, and then the conceptual design scheme can be got bydecoding the information stored in the design constraint chains, which provides a novelty method formechanical product design automation. Shearing mechanism of shearing machine has been designed bythis way.展开更多
This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and con...This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and conflict solution sequence.Considering pipe routing as an assembling process,a conflict detection approach for pipe routing in collaborative architectural design is proposed based on an aforementioned model.Constraint network is used to describe the relationship among pipe routing design parameters and constraints;design conflicts are detected by matching designers' input and constraint network;and detected design conflicts are reordered according to the number of pipe parameters in conflicts.In order to support the collaborative requirement of pipe routing design,a prototype system using browser/server architecture is developed.An illustrative example of water pipe routing in a room is used to show the effectiveness and efficiency of the approach.展开更多
We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subje...We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-hard and propose approximation algorithm proving the approximation ratio with lnm+1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation. Key words network - distributed monitoring - delay constraint - NP-hard CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60373023)Biography: LIU Xiang-hui(1973-), male, Ph. D. candidate, research direction: algorithm complexity analysis, QoS in Internet.展开更多
When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian...When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian networks. In this paper, a new monotonic constraint model is proposed to represent a type of common domain knowledge. And then, the monotonic constraint estimation algorithm is proposed to learn the parameters with the monotonic constraint model. In order to demonstrate the superiority of the proposed algorithm, series of experiments are carried out. The experiment results show that the proposed algorithm is able to obtain more accurate parameters compared to some existing algorithms while the complexity is not the highest.展开更多
In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of net...In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of networks varies significantly. This effect is thoroughly analyzed with a heuristic algorithm for different network topologies belonging to some European network operators. The main conclusion extracted is that limiting the transparent reach in such multi-layer networks can give a good tradeoff between CAPEX of IP/MPLS networks and WSON networks,and even lead to signifi cant savings in CAPEX when compared to longer lightpaths routing strategies.展开更多
This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transf...This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transformed from the NCSs, an augmented Lyapunov function containing more useful information is constructed. A less conservative sufficient condition is established such that the closed-loop systems stability and time-domain integral quadratic constraints （IQCs） are satisfied while both time-varying network- induced delays and packet losses are taken into account. The fuzzy tracking controllers design scheme is derived in terms of linear matrix inequalities （LMIs） and parallel distributed compensation （PDC）. Furthermore, robust stabilization criterion for nonlinear NCSs is given as an extension of the tracking control result. Finally, numerical simulations are provided to illustrate the effectiveness and merits of the proposed method.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The con...The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.展开更多
An effective modeling method of domain level constraints in the constraint network for concurrent engineering (CE) was developed. The domain level constraints were analyzed and the framework of modeling of domain leve...An effective modeling method of domain level constraints in the constraint network for concurrent engineering (CE) was developed. The domain level constraints were analyzed and the framework of modeling of domain level constraints based on simulation and approximate technology was given. An intelligent response surface methodology (IRSM) was proposed, in which artificial intelligence technologies are introduced into the optimization process. The design of crank and connecting rod in the V6 engine as example was given to show the validity of the modeling method.展开更多
Abstract--This paper provides a survey on modeling and theories of networked control systems （NCS）. In the first part, modeling of the different types of imperfections that affect NCS is discussed. These imperfectio...Abstract--This paper provides a survey on modeling and theories of networked control systems （NCS）. In the first part, modeling of the different types of imperfections that affect NCS is discussed. These imperfections are quantization errors, packet dropouts, variable sampling/transmission intervals, vari- able transmission delays, and communication constraints. Then follows in the second part a presentation of several theories that have been applied for controlling networked systems. These theories include： input delay system approach, Markovian system approach, switched system approach, stochastic system approach, impulsive system approach, and predictive control approach. In the last part, some advanced issues in NCS including decentral- ized and distributed NCS, cloud control system, and co-design of NCS are reviewed. Index Terms--Decentralized networked control systems （NCS）, distributed networked control systems, network constraints, net- worked control system, quantization, time delays.展开更多
Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the ef...Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size.展开更多
In this paper,an active fault accommodate strategy is proposed for the plant in the presence of actuator fault and input constraints,which is a combination of a direct adaptive control algorithm with multiple model sw...In this paper,an active fault accommodate strategy is proposed for the plant in the presence of actuator fault and input constraints,which is a combination of a direct adaptive control algorithm with multiple model switching.The μ-modification is introduced in the model reference architecture to construct the adaptive controller.The proof of stability is based on the candidate Lyapunov function,while appropriate switching of multiple models guarantees asymptotic tracking of the system states and the boundedness of all signals.Simulation results illustrate the efficiency of the proposed method.展开更多
In this paper,we present an optimal neuro-control scheme for continuous-time(CT)nonlinear systems with asymmetric input constraints.Initially,we introduce a discounted cost function for the CT nonlinear systems in ord...In this paper,we present an optimal neuro-control scheme for continuous-time(CT)nonlinear systems with asymmetric input constraints.Initially,we introduce a discounted cost function for the CT nonlinear systems in order to handle the asymmetric input constraints.Then,we develop a Hamilton-Jacobi-Bellman equation(HJBE),which arises in the discounted cost optimal control problem.To obtain the optimal neurocontroller,we utilize a critic neural network(CNN)to solve the HJBE under the framework of reinforcement learning.The CNN's weight vector is tuned via the gradient descent approach.Based on the Lyapunov method,we prove that uniform ultimate boundedness of the CNN's weight vector and the closed-loop system is guaranteed.Finally,we verify the effectiveness of the present optimal neuro-control strategy through performing simulations of two examples.展开更多
Bayesian networks (BNs) have become increasingly popular in recent years due to their wide-ranging applications in modeling uncertain knowledge. An essential problem about discrete BNs is learning conditional probabil...Bayesian networks (BNs) have become increasingly popular in recent years due to their wide-ranging applications in modeling uncertain knowledge. An essential problem about discrete BNs is learning conditional probability table (CPT) parameters. If training data are sparse, purely data-driven methods often fail to learn accurate parameters. Then, expert judgments can be introduced to overcome this challenge. Parameter constraints deduced from expert judgments can cause parameter estimates to be consistent with domain knowledge. In addition, Dirichlet priors contain information that helps improve learning accuracy. This paper proposes a constrained Bayesian estimation approach to learn CPTs by incorporating constraints and Dirichlet priors. First, a posterior distribution of BN parameters is developed over a restricted parameter space based on training data and Dirichlet priors. Then, the expectation of the posterior distribution is taken as a parameter estimation. As it is difficult to directly compute the expectation for a continuous distribution with an irregular feasible domain, we apply the Monte Carlo method to approximate it. In the experiments on learning standard BNs, the proposed method outperforms competing methods. It suggests that the proposed method can facilitate solving real-world problems. Additionally, a case study of Wine data demonstrates that the proposed method achieves the highest classification accuracy.展开更多
By comparison with constraint satisfaction networks, this paper presents an essential frame of the logical theory for continuous-state neural networks, and gives the quantitative analyzing method for contradiction. Th...By comparison with constraint satisfaction networks, this paper presents an essential frame of the logical theory for continuous-state neural networks, and gives the quantitative analyzing method for contradiction. The analysis indicates that the basic reason for the alternation of the logical states of the neurons is the existence of superior contradiction inside the networks. The dynamic process for a neural network to find a solution corresponds to eliminating the superior contradiction.展开更多
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.展开更多
文摘Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extraction, constraint network construction andoperation, constraint chains are acquired, and then the conceptual design scheme can be got bydecoding the information stored in the design constraint chains, which provides a novelty method formechanical product design automation. Shearing mechanism of shearing machine has been designed bythis way.
基金Supported by the National High Technology Research and Development Programme of China(No.2006AA04Z112)the National Natural Science Foundation of China(No.51175287)the National S&T Major Program(No.2009ZX02001-003)
文摘This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and conflict solution sequence.Considering pipe routing as an assembling process,a conflict detection approach for pipe routing in collaborative architectural design is proposed based on an aforementioned model.Constraint network is used to describe the relationship among pipe routing design parameters and constraints;design conflicts are detected by matching designers' input and constraint network;and detected design conflicts are reordered according to the number of pipe parameters in conflicts.In order to support the collaborative requirement of pipe routing design,a prototype system using browser/server architecture is developed.An illustrative example of water pipe routing in a room is used to show the effectiveness and efficiency of the approach.
文摘We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-hard and propose approximation algorithm proving the approximation ratio with lnm+1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation. Key words network - distributed monitoring - delay constraint - NP-hard CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60373023)Biography: LIU Xiang-hui(1973-), male, Ph. D. candidate, research direction: algorithm complexity analysis, QoS in Internet.
基金supported by the National Natural Science Foundation of China(6130513361573285)the Fundamental Research Funds for the Central Universities(3102016CG002)
文摘When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian networks. In this paper, a new monotonic constraint model is proposed to represent a type of common domain knowledge. And then, the monotonic constraint estimation algorithm is proposed to learn the parameters with the monotonic constraint model. In order to demonstrate the superiority of the proposed algorithm, series of experiments are carried out. The experiment results show that the proposed algorithm is able to obtain more accurate parameters compared to some existing algorithms while the complexity is not the highest.
基金jointly supported by Jiangsu Government Scholarship for Overseas studies,Chinathe open fund of State Key Laboratory of Advanced Optical Communication Systems and Networks, Shanghai Jiao Tong University,China(No. 2015GZKF03006)Research Center of Optical Communications Engineering & Technology,Jiangsu Province(No.ZSF0201)
文摘In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of networks varies significantly. This effect is thoroughly analyzed with a heuristic algorithm for different network topologies belonging to some European network operators. The main conclusion extracted is that limiting the transparent reach in such multi-layer networks can give a good tradeoff between CAPEX of IP/MPLS networks and WSON networks,and even lead to signifi cant savings in CAPEX when compared to longer lightpaths routing strategies.
基金supported by National Natural Science Foundation of China (No. 60574014, No. 60425310)Doctor Subject Foundation of China (No. 200805330004)+2 种基金Program for New Century Excellent Talents in University (No. NCET-06-0679)Natural Science Foundation of Hunan Province of China (No. 08JJ1010)Science Foundation of Education Department of Hunan Province (No. 08C106)
文摘This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transformed from the NCSs, an augmented Lyapunov function containing more useful information is constructed. A less conservative sufficient condition is established such that the closed-loop systems stability and time-domain integral quadratic constraints （IQCs） are satisfied while both time-varying network- induced delays and packet losses are taken into account. The fuzzy tracking controllers design scheme is derived in terms of linear matrix inequalities （LMIs） and parallel distributed compensation （PDC）. Furthermore, robust stabilization criterion for nonlinear NCSs is given as an extension of the tracking control result. Finally, numerical simulations are provided to illustrate the effectiveness and merits of the proposed method.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
基金supported by the National Natural Science Foundation of China(72071206).
文摘The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.
文摘An effective modeling method of domain level constraints in the constraint network for concurrent engineering (CE) was developed. The domain level constraints were analyzed and the framework of modeling of domain level constraints based on simulation and approximate technology was given. An intelligent response surface methodology (IRSM) was proposed, in which artificial intelligence technologies are introduced into the optimization process. The design of crank and connecting rod in the V6 engine as example was given to show the validity of the modeling method.
基金supported by the Deanship of Scientific Research(DSR) at KFUPM through Research Project(IN141048)
文摘Abstract--This paper provides a survey on modeling and theories of networked control systems （NCS）. In the first part, modeling of the different types of imperfections that affect NCS is discussed. These imperfections are quantization errors, packet dropouts, variable sampling/transmission intervals, vari- able transmission delays, and communication constraints. Then follows in the second part a presentation of several theories that have been applied for controlling networked systems. These theories include： input delay system approach, Markovian system approach, switched system approach, stochastic system approach, impulsive system approach, and predictive control approach. In the last part, some advanced issues in NCS including decentral- ized and distributed NCS, cloud control system, and co-design of NCS are reviewed. Index Terms--Decentralized networked control systems （NCS）, distributed networked control systems, network constraints, net- worked control system, quantization, time delays.
文摘Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size.
基金supported by the Aeronautics Science Foundation of China(No.2007ZC52039)the National Natural Science Foundation of China(No.90816023)
文摘In this paper,an active fault accommodate strategy is proposed for the plant in the presence of actuator fault and input constraints,which is a combination of a direct adaptive control algorithm with multiple model switching.The μ-modification is introduced in the model reference architecture to construct the adaptive controller.The proof of stability is based on the candidate Lyapunov function,while appropriate switching of multiple models guarantees asymptotic tracking of the system states and the boundedness of all signals.Simulation results illustrate the efficiency of the proposed method.
基金supported by the National Natural Science Foundation of China(61973228,61973330)
文摘In this paper,we present an optimal neuro-control scheme for continuous-time(CT)nonlinear systems with asymmetric input constraints.Initially,we introduce a discounted cost function for the CT nonlinear systems in order to handle the asymmetric input constraints.Then,we develop a Hamilton-Jacobi-Bellman equation(HJBE),which arises in the discounted cost optimal control problem.To obtain the optimal neurocontroller,we utilize a critic neural network(CNN)to solve the HJBE under the framework of reinforcement learning.The CNN's weight vector is tuned via the gradient descent approach.Based on the Lyapunov method,we prove that uniform ultimate boundedness of the CNN's weight vector and the closed-loop system is guaranteed.Finally,we verify the effectiveness of the present optimal neuro-control strategy through performing simulations of two examples.
基金supported by the National Natural Science Foundation of China(61573285)the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University,China(CX201619)
文摘Bayesian networks (BNs) have become increasingly popular in recent years due to their wide-ranging applications in modeling uncertain knowledge. An essential problem about discrete BNs is learning conditional probability table (CPT) parameters. If training data are sparse, purely data-driven methods often fail to learn accurate parameters. Then, expert judgments can be introduced to overcome this challenge. Parameter constraints deduced from expert judgments can cause parameter estimates to be consistent with domain knowledge. In addition, Dirichlet priors contain information that helps improve learning accuracy. This paper proposes a constrained Bayesian estimation approach to learn CPTs by incorporating constraints and Dirichlet priors. First, a posterior distribution of BN parameters is developed over a restricted parameter space based on training data and Dirichlet priors. Then, the expectation of the posterior distribution is taken as a parameter estimation. As it is difficult to directly compute the expectation for a continuous distribution with an irregular feasible domain, we apply the Monte Carlo method to approximate it. In the experiments on learning standard BNs, the proposed method outperforms competing methods. It suggests that the proposed method can facilitate solving real-world problems. Additionally, a case study of Wine data demonstrates that the proposed method achieves the highest classification accuracy.
基金Supported by the National Natural Science Foundation of Chinathe National Hightech Project of China(863)
文摘By comparison with constraint satisfaction networks, this paper presents an essential frame of the logical theory for continuous-state neural networks, and gives the quantitative analyzing method for contradiction. The analysis indicates that the basic reason for the alternation of the logical states of the neurons is the existence of superior contradiction inside the networks. The dynamic process for a neural network to find a solution corresponds to eliminating the superior contradiction.
文摘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.
