Loading [a11y]/accessibility-menu.js
An efficient and scalable algorithm for policy compatibility in service virtualization | IEEE Conference Publication | IEEE Xplore

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 ...Show More

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.
Date of Conference: 13-15 October 2009
Date Added to IEEE Xplore: 11 December 2009
ISBN Information:

ISSN Information:

Conference Location: Banff, AB, Canada

References

References is not available for this document.