• DocumentCode
    2673549
  • Title

    An efficient and scalable algorithm for policy compatibility in service virtualization

  • Author

    Eunjin Jung ; Crispo, B. ; Ranaweera, L.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Iowa, Iowa City, IA, USA
  • fYear
    2009
  • fDate
    13-15 Oct. 2009
  • Firstpage
    58
  • Lastpage
    65
  • 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.
  • Keywords
    XML; authorisation; formal specification; scheduling; XACML; access control specification; business model; policy compatibility; realtime resource scheduling; resource provider; resource requirement; security requirements; service provider; service virtualization; third-party service; Access control; Cities and towns; Companies; Computational modeling; Computer science; Job shop scheduling; Processor scheduling; Resource virtualization; Scalability; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Grid Computing, 2009 10th IEEE/ACM International Conference on
  • Conference_Location
    Banff, AB
  • Print_ISBN
    978-1-4244-5148-7
  • Type

    conf

  • DOI
    10.1109/GRID.2009.5353068
  • Filename
    5353068