A high performance UCON and semantic-based authorization framework for grid computing
Authorization infrastructures are an important and integral part of grid computing which facilitate access control functions to protect resources.This paper presents an authorization framework that combines the usage control (UCON) model with semantic web technology.To our knowledge, an authorizatio...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Utara Malaysia Press
2016
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/24078/1/JICT%2015%201%202016%20183%E2%80%93202.pdf http://repo.uum.edu.my/24078/ http://jict.uum.edu.my/index.php/previous-issues/148-journal-of-information-and-communication-technology-jict-vol-15-no1-june-2016 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Authorization infrastructures are an important and integral part of grid computing which facilitate access control functions to protect resources.This paper presents an authorization framework that combines the usage control (UCON) model with semantic web technology.To our knowledge, an authorization framework that combines both the UCON and semantic web technology in one framework has not yet been previously proposed.As the UCON model combines traditional access control, trust management and digital rights management in a grid authorization infrastructure, its adoption enhances the capability of the authorization. However, UCON-based authorization presents a problem in controlling the policy granularity and minimizing the authorization overhead due to complexity in the policies inherited from the UCON model.The growing number of users and resources in the grid makes this problem even worse.We use the semantic web technology to provide a way to automatically manage the rules in the policies, hence keeping the granularity under control. To minimize the authorization overhead, a new mechanism to reduce the number of policy checks is proposed in this paper. Our simulation result shows that the proposed mechanism provides a 63% reduction in rule checking compared to previous methods. |
---|