Theo Ferreira Franco, Weldson Queiroz de Lima, Giancarlo Silvestrin, Rafael Corezola Pereira, M. Almeida, L. Tarouco, L. Granville, André Beller, Edgard Jamhour, M. Fonseca
{"title":"Substituting COPS-PR: an evaluation of NETCONF and SOAP for policy provisioning","authors":"Theo Ferreira Franco, Weldson Queiroz de Lima, Giancarlo Silvestrin, Rafael Corezola Pereira, M. Almeida, L. Tarouco, L. Granville, André Beller, Edgard Jamhour, M. Fonseca","doi":"10.1109/POLICY.2006.35","DOIUrl":"https://doi.org/10.1109/POLICY.2006.35","url":null,"abstract":"The COPS-PR protocol has been defined by the IETF to provide policy provisioning in networks managed through the policy-based network management approach. Although some network players already ship their devices with proper COPS-PR support, there is a trend in the industry and in the IETF of discontinuing COPS-PR as a policy protocol. Meanwhile, two other protocols, namely NETCONF and SOAP, have been seriously considered in the network management field. This paper proposes and evaluates both NETCONF and SOAP as substitutes for COPS-PR, presenting how these protocols can be used for policy provisioning. The performance evaluation of NETCONF and SOAP against COPS-PR addresses two main aspects: network usage as a result of protocol overhead, and protocol delay as a result of protocol message processing. This study shows that both NETCONF and SOAP are interesting and feasible replacements for COPS-PR, but require appropriate modeling when deployed in networks","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125336193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enforceability vs. accountability in electronic policies","authors":"T. Breaux, A. Antón, Clare-Marie Karat, J. Karat","doi":"10.1109/POLICY.2006.18","DOIUrl":"https://doi.org/10.1109/POLICY.2006.18","url":null,"abstract":"Laws, regulations, policies and standards are increasing the requirements complexity of software systems that ensure information resources are both available and protected. To motivate discussions as to how current policy models can address this problem, we surveyed several regulations, standards and organizational security policies to identify how elements in these documents affect both personnel responsibilities and software system security. We present a resulting taxonomy that distinguishes between enforceable and accountable policies and we discuss the value of both in achieving compliance","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128434991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using a policy language to control tuple-space synchronization in a mobile environment","authors":"Vorapol Jittamas, P. Linington","doi":"10.1109/POLICY.2006.38","DOIUrl":"https://doi.org/10.1109/POLICY.2006.38","url":null,"abstract":"Any sharing of information using a distributed platform carries the risk of disconnection because of loss of network access. This is particularly the case when considering mobile communication, either using base stations or by forming ad-hoc networks. Replication of shared data is one way to increase data availability in such an environment, but leads to the problem of inconsistency between copies of data, and so requires some means of data synchronization. This paper investigates how policies can be used to resolve data conflict in a way that can be tailored to meet the needs of different types of application in different situations. It discusses a range of application requirements, and describes a policy-based pervasive middleware to support the sharing of data using a tuple-space paradigm. Policies maintained within the middleware are used to trigger a wide range of synchronization options to restore the consistency of the data after periods of disconnected operation","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"42 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114111371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Kamienski, J. Fidalgo, D. Sadok, Jennifer Lima, Leonardo A. A. Pereira
{"title":"PBMAN: a Policy-based Management Framework for Ambient Networks","authors":"C. Kamienski, J. Fidalgo, D. Sadok, Jennifer Lima, Leonardo A. A. Pereira","doi":"10.1109/POLICY.2006.21","DOIUrl":"https://doi.org/10.1109/POLICY.2006.21","url":null,"abstract":"Ambient networks aim at providing new networking solutions to highly mobile users considering a mix of current and future wireless technologies. In the last years, policy-based approaches have been proposed as an effective way of managing large networks, e.g. the IETF policy framework. In this paper, we present the design and implementation of PBMAN, a Policy-based Management Framework for Ambient Networks. PBMAN is based on a P2P infrastructure, aimed at providing scalability and self-configuration features","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"35 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Inferring access-control policy properties via machine learning","authors":"Evan Martin, Tao Xie","doi":"10.1109/POLICY.2006.19","DOIUrl":"https://doi.org/10.1109/POLICY.2006.19","url":null,"abstract":"To ease the burden of implementing and maintaining access-control aspects in a system, a growing trend among developers is to write access-control policies in a specification language such as XACML and integrate the policies with applications through the use of a policy decision point (PDP). To assure that the specified polices reflect the expected ones, recent research has developed policy verification tools; however, their applications in practice are still limited, being constrained by the limited set of supported policy language features and the unavailability of policy properties. This paper presents a data-mining approach to the problem of verifying that expressed access-control policies reflect the true desires of the policy author. We developed a tool to investigate this approach by automatically generating requests, evaluating those requests to get responses, and applying machine learning on the request-response pairs to infer policy properties. These inferred properties facilitate the inspection of the policy behavior. We applied our tool on an access-control policy of a central grades repository system for a university. Our results show that machine learning algorithms can provide valuable insight into basic policy properties and help identify specific bug-exposing requests","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129505481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Baliosian, H. Oliver, A. Devitt, F. Sailhan, E. Salamanca, Boris Danev, G. Parr
{"title":"Self-configuration for radio access networks","authors":"J. Baliosian, H. Oliver, A. Devitt, F. Sailhan, E. Salamanca, Boris Danev, G. Parr","doi":"10.1109/POLICY.2006.28","DOIUrl":"https://doi.org/10.1109/POLICY.2006.28","url":null,"abstract":"The ongoing work presented in this paper is aimed at bringing self-configuration capabilities into next generation radio access networks. We present the main concepts and architecture of our prototype. We also introduce briefly a novel strategy for foreseeing the outcome of enforcing policies integrating behaviour discovery techniques and finite state calculus into the conflict detection and resolution process. The main objective of this approach is to avoid instability problems of a distributed rule-based system","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114245134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A basis for comparing characteristics of policy systems","authors":"S. Calo, Jorge Lobo","doi":"10.1109/POLICY.2006.1","DOIUrl":"https://doi.org/10.1109/POLICY.2006.1","url":null,"abstract":"Policy-based computing is being studied and applied in a number of different domains by industrial organizations and academia. Standards are also being pursued in many standards bodies (e.g., IETF, DMTF, OASIS, GGFand W3C). This has led to the creation of different policy languages and policy implementations. In this paper, we attempt to provide a framework for the classification and comparison of the different approaches that such languages and systems have taken. This is important because it helps in the understanding of the capabilities of policy systems, and in clarifying what they can and cannot do. It also identifies basic issues in translating policies from one language to another, and in transforming policies specified for a particular system implementation into policies that can be enforced by a different system implementation","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Domain-independent, composable Web services policy assertions","authors":"A. Anderson","doi":"10.1109/POLICY.2006.16","DOIUrl":"https://doi.org/10.1109/POLICY.2006.16","url":null,"abstract":"The current model for the predicates, or \"Assertions\", used in a WS-Policy instance is for each policy domain to design new schema elements for that domain's Assertions. Their semantics are defined in an associated specification and are domain-specific. This model leads to interoperability and maintenance problems and hinders dynamic service composition. WS-Policy constraints is a domain-independent language for writing Assertions that is based on the Web Services Policy Language subset of XACML; it differs in addressing only the Assertion layer. This paper describes problems with domain-specific Assertions, the WS-Policy constraints alternative, and problems encountered in the development of this language","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115024218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"End-to-end model driven policy based network management","authors":"David Raymer, J. Strassner, E. Lehtihet, S. Meer","doi":"10.1109/POLICY.2006.17","DOIUrl":"https://doi.org/10.1109/POLICY.2006.17","url":null,"abstract":"The continued movement towards converged networks changes the focus to building application services that enable customers to move between different types of service providers based on their needs. Policy management becomes paramount for the rapid deployment and management of these application services. This paper presents the concept of a policy continuum and discusses the importance of modeling and natural languages in the presence of the policy continuum, resulting in a novel architecture suitable for autonomic computing","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114817470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A distributed tabling algorithm for rule based policy systems","authors":"M. Alves, C. Damásio, W. Nejdl, D. Olmedilla","doi":"10.1109/POLICY.2006.4","DOIUrl":"https://doi.org/10.1109/POLICY.2006.4","url":null,"abstract":"Distributed peer-to-peer and grid infrastructure require distributed access control mechanisms. These mechanisms can be implemented in distributed trust management infrastructures and usually require reasoning on more than one peer, as soon as authority is delegated or requests involve several authorities. Building on previous work of the authors which formalized such a distributed trust management infrastructure based on distributed logic programs, we describe in this paper how reasoning can be implemented as distributed logic evaluation and how loops during this evaluation can be handled with. Our solution is based on a loop tolerant distributed tabling algorithm which includes in the process protection of sensitive policies and generation of proofs without increasing the complexity of the system","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}