关于网络安全管理中的策略冲突检测与解决

本文通过对策略冲突进行系统研究,找到其中的主要因素,按照“策略冲突发生时策略的状态”和“策略冲突发生时策略作用对象之间的关系”给出了策略冲突的两种分类,通过这两种分类解决了“何时检测冲突”和“如何检测冲突”的问题.而后进一步阐述了如何应用冲突数据库来判别策略冲突类型的方法.     

Priorities and preferences in conflict resolution

In this study the planning process is applied to a conflict resolution problem by structuring a well known conflict (the Northern Ireland problem) using the levels of a conceptual hierarchy. The parties to the conflict form the first level, the objectives of these parties form the second level, and possible political solutions to the problem are at the third and final level.This present model is an update of an earlier analysis, carried out in 1976 and 1977, in which it was shown that the outcome which would to the greatest possible extent satisfy the aspirations of all parties would be legislative independence for Northern Ireland. The current analysis takes into account changes which have taken place since the earlier work was performed. It is shown that the most satisfactory outcome is still one of legislative independence. However, the results suggest a short-term compromise solution. An assembly, subordinate to the British government, would also satisfy most of the basic needs of the parties, provided that such an Assembly is given a wide range of powers and a large measure of autonomy.The method used here, the Analytic Hierarchy Technique (Saaty, 1977, 1980), is easy to understand and to use, and provides an efficient method for evaluating possible solutions to a conflict.     

基于网元的策略冲突解决方法

策略冲突的解决是基于策略的网络管理系统正常运行的前提之一。论文提出了一种基于网元的策略冲突解决方法,以网元为单位构造策略优先级关系矩阵,用以解决与该网元相关的策略冲突问题。该方法避免了大矩阵的计算处理,从而减少了基于策略的网络管理系统的计算成本。经实验验证,该方法可以有效地解决基于策略的网络管理系统中存在的策略冲突问题。     

Evolutionary mechanism of conflict resolution

Conclusions Despite the accumulated evidence, many of the investigators as of quite recently have failed to understand that behavioral strategy or decision rules can be inherited and evolve and that they are subject to certain constraints that cannot be surmounted other than by natural selection. For example, in [9, p. 422] we read: The evolutionary pressure cannot act upon the relative contents of social interactions favoring certain individuals over others. The present study shows that the following scheme of conflict, which favors those individuals that conform to it with a better accuracy, can be evolutionary stable. On the basis of the information they receive, the partners estimate the role situation and the equilibrium pair of elementary strategies and use their strategies. If the role situations of the partners are coordinated, the partners cooperate in reducing the conflict and define its result according to AIS. If AIS are not coordinated, they cooperate in reducing the conflict if its expected loss for each is greater than the expected payoff; they escalate the against those that have a lesser set of elementary strategies but also against those that have a less accurate mechanism of AIS recognition. A poor accuracy of recognition mechanism would replace a strictly equilibrium ESS with a mixed strategy.From the point of view of behavioral control, the multilevel conflict model shows that generally for controlling the choices at a certain level actions of an equally high level are necessary. It is impossible, for example, to accomplish certain economic choices by using only informational actions.Translated from Kibernetika, No. 1, pp. 90–98, January–February, 1988.     

Emphasizing conflict resolution versus conflict avoidance during schedule generation

Classical planning systems attempt to solve a planning problem by avoiding possible conflicts before the actions are put on a timeline. This is computationally very expensive and the search for all possible future conflicts may be prohibitive. A conflict resolution approach can check for immediate conflicts and try conflict resolution strategies as each activity is put on a timeline without regard for possible future conflicts. A more practical approach is to use a combination of conflict avoidance and conflict resolution based upon heuristics which limit the amount of search required when either is used. Because humans are not good at solving problems which require complex lookahead, this combined approach, with emphasis on conflict resolution, is what human schedulers actually use when they develop schedules. A system which simulates this human approach to scheduling has been developed at NASA's Goddard Space Flight Center for scheduling satellite activities. This system, which includes the Planning And Resource Reasoning (PARR) shell, allows expert schedulers to specify conflict resolution strategies as well as conflict avoidance strategies to be used during the scheduling process. PARR has been used since May 1987 to schedule the Tracking and Data Relay Satellite System services for the Earth Radiation Budget Satellite. PARR will also be used to schedule platform resources on the Explorer Platform, scheduled for launch in early 1992. This paper describes the advantages of using a combined conflict avoidance and resolution approach in a satellite scheduling system.     

Preference uncertainty in the graph model for conflict resolution

A new preference structure is introduced into the graph model for conflict resolution. This structure can handle a decision-maker's (DM) strict preference for one state or scenario over another, equal preference for states, and uncertain or unknown preference in the comparison of two states. Built upon this preference structure, four types of solution definitions modeling human behavior under conflict are extended to accommodate uncertainty in preferences. Four distinct ways to consider uncertain preference information are identified, producing sixteen extended stability definitions. Interrelationships of these definitions within and across the four definition sets are investigated. Illustrative examples of two-DM and multi-DM conflict models are presented to show how the new solution concepts can be applied in practice.     

Normative conflict resolution in multi-agent systems

Norms (permissions, obligations and prohibitions) offer a useful and powerful abstraction with which to capture social constraints in multi-agent systems. Norms should exclude disruptive or antisocial behaviour without prescribing the design of individual agents or restricting their autonomy. An important challenge, however, in the design and management of systems governed by norms is that norms may, at times, conflict with one another; e.g, an action may be simultaneously prohibited and obliged for a particular agent. In such circumstances, agents no longer have the option of complying with these norms; whatever they do or refrain from doing will lead to a social constraint being broken. In this paper, we present mechanisms for the detection and resolution of normative conflicts. These mechanisms, based on first-order unification and constraint solving techniques, are the building blocks of more sophisticated algorithms we present for the management of normative positions, that is, the adoption and removal of permissions, obligations and prohibitions in societies of agents. We capture both direct and indirect conflicts between norms, formalise a practical concept of authority, and model conflicts that may arise as a result of delegation. We are able to formally define classic ways for resolving conflicts such as lex superior and lex posterior.     

Memory conflict resolution in vector supercomputers

This paper presents a simulation study of several conflict-handling methods in shared-memory vector processors. These methods differ with respect to (1) the way memory sections are accessed, (2) the types of conflicts that may occur, (3) whether a conflict halts the vector stream or not, and (4) buffering of pending requests. In the first method, access privilege to a particular section of memory is exclusively granted to each vector stream in its own time phase. This static control strategy prevents contention in the memory interconnect at the expense of a limited capability to adapt to dynamic situations. Two dynamic methods are also considered, in which simultaneous bank conflicts and line conflicts may occur and are resolved at run time. A fourth method helps to identify the relative contribution of the different types of memory conflicts. We also study linked conflicts that occur due to buffering in the time-phased strategy.     

Distributed conflict resolution among cooperating expert systems

Abstract: Cooperating experts approach attempts to integrate and coordinate the activities of multiple specialised problem solvers that come together to solve complex tasks such as design, medical diagnosis, business management and so on. Due to the different goals, knowledge and viewpoints of agents, conflicts may arise at any phase of the problem-solving process. Managing diverse expertise requires well-organised models of conflict resolution. In this paper, a model for cooperating experts is described which openly supports multi-agent conflict detection and resolution. The model is based on the idea that each agent has its own conflict knowledge which is separated from its domain level knowledge, and each agent has its own conflict resolution knowledge which is not accessible and known by others. Furthermore, there are no globally known conflict resolution strategies. Each agent involved in a conflict chooses a resolution scheme according to its self interest. The model is described by using an example in the domain of office design and it is compared with other systems.     

A runtime resolution scheme for priority boost conflict in implicit coscheduling

High-performance parallel and scientific applications are composed of multiple processes running on distinct CPUs that communicate frequently. Due to the synchronization needs of such applications, performance is greatly hampered if their processes are not scheduled simultaneously on the CPUs. Implicit coscheduling (ICS) is a well-known technique to address this problem in multi-programmed clusters, however, traditional ICS schemes do not incorporate steps to adequately deal with priority boost conflicts, leading to significantly degraded performance. In this paper, we propose the use of runtime difference in contention across nodes to provide more sophisticated coscheduling decisions in response to the conflicts. We also present a novel coscheduling scheme termed PROC (Process ReOrdering-based Coscheduling) that adaptively regulates the scheduling sequence of conflicting processes based on the rescheduling latency of their correspondents in remote nodes. We perform extensive simulation-based experiments using both synthetic and realistic workloads to analyze the performance of PROC compared to alternatives such as local scheduling, a widely used batch scheduling, gang scheduling, and existing ICS schemes. The results show that all ICS schemes commonly experience priority boost conflicts, and that the proposed PROC significantly outperforms other ICS alternatives (or batch scheduling) by up to 50.4% (or 72.5%) in the average job response time. This improvement is achieved by reducing wasted idle time and spinning time without sacrificing fairness.

Reducing conflict resolution time for solving graph problems in broadcast communications

In this paper, we propose some algorithms to solve the topological ordering problem, the breadth-first search problem and the connected component problem under the broadcast communication model. The basic idea of our algorithms is to divide a graph into several layers. Only after all vertices in one layer are processed, we begin to process the vertices in another layer. Thus, the number of broadcast conflicts is reduced. We also propose a randomized conflict resolution scheme to resolve conflicts. We show that the average time complexity of our algorithms is Θ(n), where n is the number of available processors and also the number of vertices in the graph.     

基于Petri网的分布式系统冲突消解

针对分布式系统在共享资源冲突和消解的复杂性问题,综合考虑时间、空间、约束条件等因素,在混合Petri网同时具备描述离散系统和连续系统的能力的基础上,加入时间约束条件、测试孤,从而形成一个能够描述更复杂分布式系统的Petri网模型.利用Petri网描述系统的基本思想,经过扩展得出新模型,变迁使能、变迁触发和变迁冲突检测的定义.结合实例,对模型进行了仿真分析,给出了实例中系统冲突的消解方案,表明了模型的可行性.     

The effect of gender and communication mode on conflict resolution

This paper examines the effect of gender and conflict on the process and outcomes of people using various forms of communication media. Of interest in the study is the effect which gender exerts on the evaluation of the capability of the communication environment to provide relational support under conditions of conflict. It was predicted that members of female-only and male-only dyads would demonstrate satisfaction differences and variances in their ratings of the communication environment as a function of their gender distinctions. The results indicate that there were no differences in performance levels across media and gender composition. However, there was an interaction between media and gender concerning evaluations of the communication environment's ability to support affection, domination, similarity, and trust.     

A hybrid distributed-centralized conflict resolution approach for multi-aircraft based on cooperative co-evolutionary

Conflict resolution （CR） plays a crucial role in safe air traffic management （ATM）. In this paper, we propose a new hybrid distributed-centralized tactical CR approach based on cooperative co-evolutionary named the CCDG （cooperative co-evolutionary with dynamic grouping） strategy to overcome the drawbacks of the current two types of approaches, the totally centralized approach and distributed approach. Firstly, aircraft are divided into several sub-groups based on their interdependence. Besides, a dynamic grouping strategy is proposed to group the aircraft to better deal with the tight coupling among them. The sub-groups are adjusted dynamically as new conflicts appear after each iteration. Secondly, a fast genetic algorithm （GA） is used by each sub-group to optimize the paths of the aircraft simultaneously. Thirdly, the aircraft＇s optimal paths are obtained through cooperation among different sub-groups based on cooperative co-evolutionary （CC）. An experimental study on two illustrative scenarios is conducted to compare the CCDG method with some other existing approaches and it is shown that CCDG which can get the optimal solution effectively and efficiently in near real time, outperforms most of the existing approaches including Stratway, the fast GA, a general evolutionary path planner, as well as three well-known cooperative co-evolution algorithms.     

CONCENSUS: multi-party negotiation support for conflict resolution in concurrent engineering design

Advances in telematics have led many manufacturing companies in particular to explore the adoption of groupware technology to improve communication between team members. However, complex activities such as conflict resolution are still predominantly facilitated through face-to-face negotiation meetings. Intelligent software agents technology is being applied to support computer-mediated conflict resolution activities, such as information search and retrieval, recording negotiation process history and task allocation – whilst the creative negotiation activities such as generating new solutions, preventing and detecting conflicts are still left to the human experts. This paper describes the development of a framework for the support of multi-party negotiation for multi-agent systems, which will be introduced through a general overview of the requirements of multi-agent negotiation. Finally, the current architecture of the developed prototype for a CONCurrent Engineering Negotiation SUpport System (CONCENSUS) is presented.     

一种新的SaaS离线应用多用户冲突的解决模型

SaaS离线应用是SaaS技术研究的一个新兴方向,提供了离线状态下对SaaS平台的支持,进一步拓展了SaaS平台,而多用户冲突正是SaaS离线应用中的最重要的研究方面和难点之一.针对该问题,本文提出了一种新的SaaS离线应用中多用户冲突的解决模型,提出并改进了数据版本管理策略、用户策略、关键数据谨慎等相关策略,结合现有web离线应用技术与SaaS平台特点,解决了多个不同用户离线修改数据造成服务器数据不一致的问题.该模型适用于大部分现有SaaS平台,但由于SaaS平台的多样性,可根据具体SaaS平台特点加以改进.     

Mechanism of conflict resolution under conditions of imperfect competition

This paper presents an approach and a corresponding mechanism for adjusting resource use strategies under conditions of uncertainty. Situations of competition between two economic agents are considered in which individual agents can affect the general characteristics of resources (particularly, the price). The proposed approach allows one to choose strategies depending on one’s interests regardless of the behavior of other agents as in the case of perfect competition.     

改进蚁群算法在飞行冲突求解问题中的应用

改进的蚁群算法可以用于空中交通飞行冲突问题的求解.对空中交通飞行冲突问题的研究背景以及研究现状进行系统概述,简要介绍了人工势场法和蚁群算法.建立了相关的数学模型,将空中交通飞行冲突问题转化为有约束的非线性整数规划问题,并且把人工势场法和蚁群算法相结合,设计了将人工势场法的规划结果作为蚁群优化算法先验知识的求解思路.最后的仿真计算表明了该方法能加快蚁群算法的收敛速度,在短时间内提供理想的冲突解决方案.     

改进蚁群算法的飞机冲突解脱路径规划方法

冲突解脱是空中交通防撞系统中一个关键问题.提出了一种基于改进蚁群算法的冲突解脱路径规划方法.该方法通过优化蚁群算法初始搜索角度,减少了盲目搜索的时间.此外,在搜索过程中引入“精英策略”,对当前时刻寻找的最优解给予额外的信息素增强,使得算法的搜索具有一定的方向性,从而得到更优的规划路径,缩短算法的搜索时间.通过仿真验证,改进后的算法可以得到更优的冲突解脱路径,算法效率更高,在空中交通防撞系统中具有较好的发展前景.