期刊
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
卷 5, 期 1, 页码 22-37出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2009.2014055
关键词
Embedded real-time systems; optimization; security
类别
资金
- National Sciences and Engineering Research Council, Canada (NSERC)
- NSFC [60525202]
- PCSIRT Program [IRT0652]
- U.S. National Science Foundation [CCF-0742187, CNS-0757778, CNS-0831502, OCI-0753305, DUE-0621307, DUE-0830831]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [0917137, 0757778] Funding Source: National Science Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [0845257] Funding Source: National Science Foundation
- Division Of Undergraduate Education
- Direct For Education and Human Resources [837341] Funding Source: National Science Foundation
An increasing number of real-time applications like railway signaling control systems and medical electronics systems require high quality of security to assure confidentiality and integrity of information. Therefore, it is desirable and essential to fulfill security requirements in security-critical real-time systems. This paper addresses the issue of optimizing quality of security in real-time systems. To meet the needs of a wide variety of security requirements imposed by real-time systems, a group-based security service model is used in which the security services are partitioned into several groups depending on security types. While services within the same security group provide the identical type of security service, the services in the group can achieve different quality of security. Security services from a number of groups can be combined to deliver better quality of security. In this study, we seamlessly integrate the group-based security model with a traditional real-time scheduling algorithm, namely earliest deadline first (EDF). Moreover, we design and develop a security-aware EDF schedulability test. Given a set of real-time tasks with chosen security services, our scheduling scheme aims at optimizing the combined security value of the selected services while guaranteeing the schedulability of the real-time tasks. We study two approaches to solve the security-aware optimization problem. Experimental results show that the combined security values are substantially higher than those achieved by alternatives for real-time tasks without violating real-time constraints.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据