Expression Tree-based Policy Conflict Detection Algorithm

Author(s):  
Xue Wang ◽  
Hao Zhang ◽  
Kaijun Wu
2019 ◽  
Vol 15 (5) ◽  
pp. 155014771984471 ◽  
Author(s):  
You Lu ◽  
Qiming Fu ◽  
Xuefeng Xi ◽  
Zhenping Chen ◽  
Encen Zou ◽  
...  

As the network environment expands and becomes more complex, the deficiencies of decision-making capabilities in the single-controller software-defined network architecture are increasingly exposed. Currently, software-defined networks have gradually adopted a multi-controller-based architecture. However, in this architecture, multiple controllers may cause conflicts in the flow policies, which may cause failures such as security and route conflicts. Most of the existing detection methods are only aimed at specific types of conflicts. Aiming at the above insufficiency, this article proposes a policy conflict detection mechanism for multi-controller software-defined network. First, it quantifies and classifies the software-defined policy conflict itself to provide the basis for detection mechanism; then, it proposes a conflict detection model and its deployment scheme for multi-controller software-defined networks; finally, based on the software-defined flow policy’s structure, a multi-branch tree-based policy conflict detection algorithm is proposed to accurately detect the universal types of conflicts. The experimental results under the campus network environment prove that our method can effectively detect the conflict of flow policies existing in the multi-controller software-defined network and has advantages over the existing methods in the integrity, accuracy, and efficiency of the detection.


Author(s):  
Avgoustos Tsinakos ◽  
Ioannis Kazanidis

<p>Student testing and knowledge assessment is a significant aspect of the learning process. In a number of cases, it is expedient not to present the exact same test to all learners all the time (Pritchett, 1999). This may be desired so that cheating in the exam is made harder to carry out or so that the learners can take several practice tests on the same subject as part of the course.</p><p><br />This study presents an e-testing platform, namely PARES, which aims to provide assessment services to academic staff by facilitating the creation and management of question banks and powering the delivery of nondeterministically generated test suites. PARES uses a conflict detection algorithm based on the vector space model to compute the similarity between questions and exclude questions which are deemed to have an unacceptably large similarity from appearing in the same test suite. The conflict detection algorithm and a statistical evaluation of its accuracy are presented. Evaluation results show that PARES succeeds in detecting question types at about 90% and its efficiency can be further increased through continuing education and enrichment of the system’s correlation vocabulary.<br /><br /></p><p> </p>


2014 ◽  
Vol 602-605 ◽  
pp. 3416-3420
Author(s):  
Wen Peng Zhai ◽  
Hao Wu ◽  
Lan Ma

Free flight is a method to resolve airspace congestion problem, but raise safety problem. In this paper, with the influence of wind and the presence of positioning error, the model of conflict detection based on particle filter algorithm is presented. According to the flight kinematic model with the influence of random factors, the target trajectory is generated. The particle filter algorithm is used for estimating the real flight trajectory. The flight collision risk probability is calculated. By simulation calculation, the conflict detection with particle filter algorism improves the accuracy of collision risk probability estimation. The results show that the particle filter conflict detection algorithm reduces the estimation and conflict detection error caused by random perturbation. The method can be applied to identify conflict in the early stage in the study of flight free flight.


2011 ◽  
Vol 20 (02) ◽  
pp. 297-312 ◽  
Author(s):  
MONIKA SCHUBERT ◽  
ALEXANDER FELFERNIG

When interacting with constraint-based recommender applications, users describe their preferences with the goal of identifying the products that fit their wishes and needs. In such a scenario, users are repeatedly adapting and changing their requirements. As a consequence, situations occur where none of the products completely fulfils the given set of requirements and users need a support in terms of an indicator of minimal sets of requirements that need to be changed in order to be able to find a recommendation. The identification of such minimal sets relies heavily on the existence of (minimal) conflict sets. In this paper we introduce BFX (Boosted FastXplain), a conflict detection algorithm which exploits the basic structural properties of constraint-based recommendation problems. BFX shows a significantly better performance compared to existing conflict detection algorithms. In order to demonstrate the performance of BFX, we report the results of a comparative performance evaluation.


CICTP 2014 ◽  
2014 ◽  
Author(s):  
Shuai Liu ◽  
Tao Zhu ◽  
Yingying Zhang ◽  
Danya Yao

Sign in / Sign up

Export Citation Format

Share Document