Title
An efficient and scalable algorithm for policy compatibility in service virtualization
Abstract
More and more companies are adopting the emerging business model usually referred as ??service virtualization??. In service virtualization scenario, resource providers can host third-party services, as long as their resource and security requirements are compatible with those of service providers. XACML is a standard language for access control specification. We propose a complete support system for any number of resource and service providers 1) to specify their access control and resource requirements and 2) to check the compatibility between any set of resource providers and that of service providers. We describe our algorithms and show the efficiency and scalability of our system via testing on simulated policies and policies from Margrave and Fedora Core. Our experimental results show that our performance is fast enough to support realtime resource scheduling.
Year
DOI
Venue
2009
10.1109/GRID.2009.5353068
GRID
Keywords
Field
DocType
scheduling,xml,xacml,business model,access control specification,service provider,authorisation,realtime resource scheduling,third-party service,service virtualization,resource requirement,policy compatibility,security requirements,resource provider,formal specification,computational modeling,data mining,meteorology,access control,job shop scheduling
Service virtualization,Mobile QoS,Scheduling (computing),Computer science,Computer network,Real-time computing,XACML,Service provider,Access control,Resource Provider,Scalability,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4244-5148-7
0
0.34
References 
Authors
3
3
Name
Order
Citations
PageRank
Eunjin Jung112513.06
Bruno Crispo21829237.11
Lasantha Ranaweera300.34