School of Computing

Co-ordination between Distributed PDPs

D.W. Chadwick, L. Su, O. Otenko, and R. Laborde

In Proceedings of the 7th IEEE International Workshop on Policies for Didstributed Systems and Networks, pages 182-196, June 2006.

Abstract

For distributed applications, using a centralised policy decision point (PDP) with a common policy allows coordination between multiple resources that are being accessed. But the central PDP is a bottleneck to performance because every request needs to be diverted to it. Having a set of distributed PDPs co-located with resources can overcome the performance bottleneck, but any form of coordination is then lost. Furthermore, even a centralised PDP sometimes needs to coordinate its access control decision making over time. Therefore, coordination between decision making, for both centralised and distributed PDPs, is needed. This paper addresses issues of coordination between distributed or centralised decision making, by examining when coordination is needed, providing a conceptual model for coordination, defining policy elements that can control coordination, and rules for the refinement of coordination policies The paper provides a detailed example of coordination policy refinement, and provides an outline of how we are implementing the model in our system.

Download publication 188 kbytes (PDF)

Bibtex Record

@inproceedings{2411,
author = {Chadwick, D.W. and Su, L. and Otenko, O. and Laborde, R.},
title = {Co-ordination between {D}istributed {PDP}s},
month = {June},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2411},
    publication_type = {inproceedings},
    submission_id = {10064_1155646499},
    booktitle = {Proceedings of the 7th IEEE International Workshop on Policies for Didstributed Systems and Networks},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014