36214906
New routing algorithms in trustworthy Internet
Since the lack of source IP address checking in today's Internet makes it easy for the attackers to spoof the source address, the mechanism of Source Address Validation Architecture (SAVA) is proposed for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In this paper, we study the routing selection in partial deployment of SAVA nodes in the trustworthy Internet. We propose and compare three routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). Beside analytical results, we run simulations which met our expectations.
16657537
Differentiated Domain Protection Algorithm Based on Virtual Topology Graph in Multi-Domain Optical Networks
This paper proposes a novel Differentiated Domain Protection (DDP) algorithm to address survivability in multi-domain optical networks. In order to ensure the principle of transparent management in multi-optical domains, DDP abstracts the multi-domain optical networks to Virtual Topology Graph (VTG) to solve the inter-domain routing. In order to satisfy the survivable requirements of different domains, DDP considers the differentiated protection in different domains. Compared with traditional algorithms, DDP not only has the performance trade-off ability but also has the better resource utilization ratio. Simulation results are shown to be promising.
9609952
A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks
In this paper, we propose a novel differentiated domain protection (DDP) scheme to address survivability in multi-domain optical networks. Survivable routing in multi-domain networks is a challenging algorithmic problem because it requires choosing links that provide adequate protection both between domains and within domains that may offer different protection services. To satisfy the survivability requirements of different domains, DDP considers differentiated protection schemes, i.e., dedicated protection, shared protection, or no protection in different domains. In order to respect the principle of transparent management in multiple domains, DDP abstracts a multi-domain optical network to a virtual topology graph (VTG) for solving routing between domains. Simulation results show that DDP, unlike traditional schemes, can provide trade-off between protection methods and also allows better resource utilization.
7343144
A New Recovery Escalation Algorithm with Load Balancing and Backup Resources Sharing in Path Protected WDM Optical Networks
This paper proposes a new survivable algorithm, enhanced shared-path protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save backup resources, and perform recovery escalation to carry the affected traffic. Compared with the conventional algorithm, ESPP has better resource utilization ratio, lower blocking probability and higher protection ability. Simulation results are shown to be promising.
15793976
A New Sub-path Protection Algorithm Based on Auxiliary Virtual Topology in WDM Optical Networks
This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. According to the protection-switching time constraint, SPAVT constructs the virtual topology. Then, it only needs to run one time of routing algorithm to find the feasible virtual route in virtual topology. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.
18823520
A Pursuit-Evasion Algorithm Based on Hierarchical Reinforcement Learning
This paper proposed a pursuit-evasion algorithm based on the Option method from hierarchical reinforcement learning and applied it into multi-robot pursuit-evasion game in 2D-Dynamic environment. The algorithm efficiency is studied by comparing it with Q-learning. We decompose the complex task with option method, and divide the learning process into two parts: High-level learning and Low-level learning, then design a new mechanism in order to make the learning process perform parallel. The simulation result shows the Option algorithm can efficiently reduce the complexity of pursuit-evasion task, avoid traditional reinforcement learning curse of dimensionality, and improve the learning result.
45332140
Semantic Web Development for Traditional Chinese Medicine
The present invention relates to an improved tool grinding mechanism for grinding single point diamond cutting tools to precise roundness and radius specifications. The present invention utilizes a tool holder which is longitudinally displaced with respect to the remainder of the grinding system due to contact of the tool with the grinding surface with this displacement being monitored so that any variation in the grinding of the cutting surface such as caused by crystal orientation or tool thickness may be compensated for during the grinding operation to assure the attainment of the desired cutting tool face specifications.
46276460
ACO Based QoS Routing Algorithm for Wireless Sensor Networks
In this paper, we proposed an approach for Quality of Service (QoS) routing algorithm of Wireless Sensor Networks (WSNs) based on Ant Colony Optimization (ACO). The special characteristics of WSNs need to reduce the computational complexity and energy consumption of the QoS routing algorithm especially. We note that ACO algorithm using collective intelligence of artificial ants as intelligent agents is very appropriate to solve the combinatorial optimization problems in a fully distributed way, so in this paper we use modified ACO approach to solve Delay Constraint Maximum Energy Residual Ratio (DCMERR) QoS routing problem of WSNs. The QoS routing solution proposed in this manuscript, which is named as ACO based QoS routing algorithm (ACO-QoSR), searches for the best paths, which are satisfied with the QoS requirements with intelligent artificial ants. To overcome the problem of limited energy in WSNs, there are some modifications to enhance ACO’s convergence rate. ACO-QoSR algorithm is the tradeoff between a certain guaranteed QoS requirements and acceptable computational complexity. The simulation results verify that ACO-QoSR algorithm can reduce the selected paths’ delay and improve the selected paths’ normalized energy residual ratio at the similar levels of routing overhead.
11500894
Using Reactive Deliberation for Real-Time Control of Soccer-Playing Robots
Soccer meets the requirements of the Situated Agent approach and as a task domain is sufficiently rich to support research integrating many branches of Al. Reactive deliberation is a robot architecture that combines responsiveness to the environment with intelligent decision making. Under Reactive Deliberation, the robot controller is partitioned into a deliberator and an executor; the distinction is primarily based on the different time scales of interaction. A controller for our team entry in the Robocup97 Simulation League, UBC Dynamo97, has been developed using the Reactive Deliberation architecture.
39739560
Optimal Motion Generation of Flexible Macro-micro Manipulator Systems Using Estimation of Distribution Algorithm
In this paper, a new approach for motion generation and optimization of the flexible macro-micro manipulator system is proposed based on Estimation of Distribution Algorithm (EDA). The macro-micro manipulator system is a redundant system, of which inverse kinematics remains challenging, with no generic solution to date. Here, the manipulator system configurations, or the optimal joint motions, are generated using the EDA algorithm base on Gaussian probability model. Compared with simple genetic algorithms (SGA), this approach uses fewer parameters and the time for motion optimization is remarkably reduced. The proposed approach shows excellent performance on motion generation and optimization of a flexible macro-micro manipulator system, as demonstrated by the simulation results.