The Community for Technology Leaders
Grid Computing, IEEE/ACM International Workshop on (2009)
Banff, AB Canada
Oct. 13, 2009 to Oct. 15, 2009
ISBN: 978-1-4244-5148-7
pp: 58-65
Eunjin Jung , Dept. of Comput. Sci., Univ. of Iowa, Iowa City, IA, USA
B. Crispo , Dept. of Eng. & Comput. Sci., Univ. of Trento, Trento, Italy
L. Ranaweera , Dept. of Comput. Sci., Vrije Univ. Amsterdam, Amsterdam, Netherlands
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.
INDEX TERMS
Access control, Computer science, Companies, Scalability, Job shop scheduling, Cities and towns, Resource virtualization, System testing, Computational modeling, Processor scheduling
CITATION
Eunjin Jung, B. Crispo, L. Ranaweera, "An efficient and scalable algorithm for policy compatibility in service virtualization", Grid Computing, IEEE/ACM International Workshop on, vol. 00, no. , pp. 58-65, 2009, doi:10.1109/GRID.2009.5353068
93 ms
(Ver 3.3 (11022016))