By Topic

Evaluation of performance concurrency control algorithm for secure firm real-time database systems via simulation model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Maysam Hedayati ; Islamic Azad University-Ghaemshahr branch, Iran ; Seyed Hossein Kamali ; Reza Shakerian ; Mohsen Rahmani

Real-time database systems can have security constraints in addition to timing constraints. Such real-time systems are typically contained in environments that exhibit hierarchical propagation of information, where mandatory access control for security is required. Conventional multi-level secure database models that implement mandatory access control are inadequate for time-critical applications and conventional real-time database models do not address security constraints. The objective of this work is to incorporate security constraints in real-time database systems in such a way that not only is security achieved, but achieving security does not degrade real-time performance significantly in terms of deadlines missed. We present concurrency control algorithm for secure real-time databases that the Secure OPT algorithm uses the properties of an optimistic concurrency protocol. We implement the algorithm and study their performance using a real-time database system simulation model. Our study covers both soft and firm real-time databases. Results show that the algorithm performs fairly well in terms of security and timeliness compared to a non-secure algorithm. We argue and show that achieving more security does not necessarily mean more sacrifice in real-time performance.

Published in:

2010 International Conference on Networking and Information Technology

Date of Conference:

11-12 June 2010