Paper Info
Title
Distributed Overlay Construction to Support Policy-Based Access Control
Abstract
Overlay networks have been studied extensively in recent years as a flexible means to improving the reliability, resiliency, and performance of many networking applications. In this paper we present a novel use of overlay networks and distributed mechanisms to construct them for handling information assurance issues in networking systems. The problem is explored in the context of constructing an overlay that satisfies a given set of access control policies in decentralized information sharing systems. We formulate a new graph-theoretic optimization problem of constructing a minimum policy-compatible graph, which is NP-complete. We provide efficient centralized and fully-distributed heuristics, and prove the convergence property of the distributed process. Our simulation study with synthetic and empirical data set shows that our methods result in the performance (in terms of total number of links) very close to the optimal case (within 3%) for small input, and that they can reduce the number by up to 30% compared to a method based on minimum spanning tree algorithm for larger data set.
Year
DOI
Venue
2011
10.1109/POLICY.2011.46
POLICY
Keywords
Field
DocType
optimisation,overlay construction,networking system,networking application,trees (mathematics),policy-based access control,computer network security,np-complete problem,graph-theoretic optimization problem,overlay network,minimum spanning tree algorithm,computational complexity,access control policy,total number,decentralized information,new graph-theoretic optimization problem,authorisation,distributed overlay network,larger data,minimum policy-compatible graph,information assurance issue,empirical data,access control,topology,minimum spanning tree,satisfiability,np complete problem,distributed processing,organizations,sensors,polynomials,cost function
Computer science,Network security,Computer network,Heuristics,Access control,Overlay,Optimization problem,Information sharing,Overlay network,Minimum spanning tree,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-4330-7
0
0.34
References 
Authors
7
4
Name
Order
Citations
PageRank
Bong Jun Ko1756.37
Starsky H. Y. Wong247830.23
Kang-Won Lee344531.99
Chi Kin Chau439037.20