35,858 research outputs found

    Information sharing and security in dynamic coalitions

    Get PDF

    MYSEA Testbed

    Get PDF
    The technical vision of the emerging net-centric Global Information Grid (GIG) encompasses support for high assurance authentication and multilevel security (MLS) as well as flexible, dynamic security policies. The GIG is intended to address the inefficient exchange of information in current military and intelligence operations that utilize a variety of specialized (so-called "stove-piped") systems. In this context, secure information access problems are exacerbated by the need to share information from networks at different classifications (e.g., Unclassified, Secret, and Top Secret) and within multinational coalitions in episodic, ad hoc situations. These challenges provide the impetus for the creation of the Monterey Security Architecture (MYSEA) Testbed. The purpose of this Testbed is to support research in high assurance multilevel security (MLS) [1, 2] and dynamic security, two areas that are critical to the realization of the GIG's assured information sharing vision.Approved for public release; distribution is unlimited

    Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions

    Full text link
    The concept of dynamic coalitions (also virtual organizations) describes the temporary interconnection of autonomous agents, who share information or resources in order to achieve a common goal. Through modern technologies these coalitions may form across company, organization and system borders. Therefor questions of access control and security are of vital significance for the architectures supporting these coalitions. In this paper, we present our first steps to reach a formal framework for modeling and verifying the design of privacy-sensitive dynamic coalition infrastructures and their processes. In order to do so we extend existing dynamic coalition modeling approaches with an access-control-concept, which manages access to information through policies. Furthermore we regard the processes underlying these coalitions and present first works in formalizing these processes. As a result of the present paper we illustrate the usefulness of the Abstract State Machine (ASM) method for this task. We demonstrate a formal treatment of privacy-sensitive dynamic coalitions by two example ASMs which model certain access control situations. A logical consideration of these ASMs can lead to a better understanding and a verification of the ASMs according to the aspired specification.Comment: In Proceedings FAVO 2011, arXiv:1204.579

    Cartel Stability under an Optimal Sharing Rule

    Get PDF
    Previous work on the formation and stability of cartels has focused on the case of identical players. This assumption is very restrictive in many economic environments. This paper analyses stability of cartels in games with heterogeneous players and spillovers to non-members. I introduce a sharing rule for coalition payoffs, called "optimal sharing" which stabilises all cartels that are possibly stable under any rule. Under optimal sharing the grand coalition is the unique stable cartel if spillovers are negative. I introduce a new property, called "non-essentiality" and determine the set of stable cartels under optimal sharing if spillovers are positive and if the non-essentiality property applies. Finally I analyse cartel stability under optimal sharing in simple public goods game with heterogeneous players. My results show – in contrast to earlier findings for identical players – that large coalitions may well be stable.Cartel stability, Coalition formation games with spillovers, Partition function approach, Optimal sharing rule

    A Taxonomy for Management and Optimization of Multiple Resources in Edge Computing

    Full text link
    Edge computing is promoted to meet increasing performance needs of data-driven services using computational and storage resources close to the end devices, at the edge of the current network. To achieve higher performance in this new paradigm one has to consider how to combine the efficiency of resource usage at all three layers of architecture: end devices, edge devices, and the cloud. While cloud capacity is elastically extendable, end devices and edge devices are to various degrees resource-constrained. Hence, an efficient resource management is essential to make edge computing a reality. In this work, we first present terminology and architectures to characterize current works within the field of edge computing. Then, we review a wide range of recent articles and categorize relevant aspects in terms of 4 perspectives: resource type, resource management objective, resource location, and resource use. This taxonomy and the ensuing analysis is used to identify some gaps in the existing research. Among several research gaps, we found that research is less prevalent on data, storage, and energy as a resource, and less extensive towards the estimation, discovery and sharing objectives. As for resource types, the most well-studied resources are computation and communication resources. Our analysis shows that resource management at the edge requires a deeper understanding of how methods applied at different levels and geared towards different resource types interact. Specifically, the impact of mobility and collaboration schemes requiring incentives are expected to be different in edge architectures compared to the classic cloud solutions. Finally, we find that fewer works are dedicated to the study of non-functional properties or to quantifying the footprint of resource management techniques, including edge-specific means of migrating data and services.Comment: Accepted in the Special Issue Mobile Edge Computing of the Wireless Communications and Mobile Computing journa

    Optimal Transfers and Participation Decisions in International Environmental Agreements

    Get PDF
    The literature on international environmental agreements has recognized the role transfers play in encouraging participation in international environmental agreements (IEAs), but the few results achieved so far are overly specific and do not exploit the full potential of transfers for successful treaty-making. Therefore, in this paper, we develop a framework that enables us to study the role of transfers in a more systematic way. We propose a design for transfers using both internal and external financial resources and making “welfare optimal agreements” self-enforcing. To illustrate the relevance of our transfer scheme for actual treaty-making, we use a well-known integrated assessment model of climate change to show how appropriate transfers may be able to induce almost all countries into signing a self-enforcing climate treaty.Self-enforcing international environmental agreements, Climate policy, Transfers

    Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach

    Full text link
    Device-to-Device (D2D) communications, which allow direct communication among mobile devices, have been proposed as an enabler of local services in 3GPP LTE-Advanced (LTE-A) cellular networks. This work investigates a hierarchical LTE-A network framework consisting of multiple D2D operators at the upper layer and a group of devices at the lower layer. We propose a cooperative model that allows the operators to improve their utility in terms of revenue by sharing their devices, and the devices to improve their payoff in terms of end-to-end throughput by collaboratively performing multi-path routing. To help understanding the interaction among operators and devices, we present a game-theoretic framework to model the cooperation behavior, and further, we propose a layered coalitional game (LCG) to address the decision making problems among them. Specifically, the cooperation of operators is modeled as an overlapping coalition formation game (CFG) in a partition form, in which operators should form a stable coalitional structure. Moreover, the cooperation of devices is modeled as a coalitional graphical game (CGG), in which devices establish links among each other to form a stable network structure for multi-path routing.We adopt the extended recursive core, and Nash network, as the stability concept for the proposed CFG and CGG, respectively. Numerical results demonstrate that the proposed LCG yields notable gains compared to both the non-cooperative case and a LCG variant and achieves good convergence speed.Comment: IEEE Wireless Communications and Networking Conference 201

    The Frontera Asset Building Network: Building Strong Partnerships for Community Change Along the Southwest Border

    Get PDF
    Describes a learning community of local coalitions that create and promote asset-building vehicles, including individual development accounts, microenterprise opportunities, and homeownership programs. Discusses approaches, partnerships, and impact

    Large-scale Complex IT Systems

    Get PDF
    This paper explores the issues around the construction of large-scale complex systems which are built as 'systems of systems' and suggests that there are fundamental reasons, derived from the inherent complexity in these systems, why our current software engineering methods and techniques cannot be scaled up to cope with the engineering challenges of constructing such systems. It then goes on to propose a research and education agenda for software engineering that identifies the major challenges and issues in the development of large-scale complex, software-intensive systems. Central to this is the notion that we cannot separate software from the socio-technical environment in which it is used.Comment: 12 pages, 2 figure

    Coalition Formation under Uncertainty: The Stability Likelihood of an International Climate Agreement

    Get PDF
    Results derived from empirical analyses on the stability of climate coalitions are usually very sensitive to the large uncertainties associated with the benefits and costs of climate policies. This paper provides the methodology of Stability Likelihood that links uncertainty about benefits and costs of climate change to the stability analysis of coalitions in a stochastic, empirical setting. We show that the concept of Stability Likelihood improves upon the robustness and interpretation of stability analysis. Our numerical application is based on a modified version of the climate model STACO. It turns out that the only non-trivial coalition structure with a relatively high Stability Likelihood (around 25 percent) is a coalition between the European Union and Japan, though quantitative results depend especially on the variance in regional benefits from abatement.Climate change, Coalition formation, International environmental agreements, Uncertainty
    • 

    corecore