Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity

Xie, Tao; Qin, Xiao

doi:10.1016/j.jpdc.2007.06.004

Cited by 40 publications

(23 citation statements)

References 26 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Xie and Qin [14] built three security overhead models for measuring execution time incurred by the security-critical tasks in clusters. Also the performance evaluations of security heterogeneity scheduling algorithm were studied in distributed computing systems [16]. Tang et al [17] used the differential equation to build system node trust model and proposed a security-driven scheduling architecture for directed acyclic graph (DAG) applications.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Energy cost minimization with job security guarantee in Internet data center

et al. 2017

Future Generation Computer Systems

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…This is due to the fact that the coefficient of Poisson probability distribution can be seen as the arrival rate of malicious attacks. Thus, the risk probability of a task with single security service can be represented by an exponential distribution [16,17]:…”

Section: Workload Shaping With Security Guaranteementioning

confidence: 99%

Energy cost minimization with job security guarantee in Internet data center

et al. 2017

Future Generation Computer Systems

View full text Add to dashboard Cite

“…Jhawar et al [5] model the security requirements of an application as additional constraints and present a greedy heuristic to perform VM allocation in cloud computing and minimize energy consumption. Similarly, Xie et al [6] and Xiong et al [7] define heuristics that balance security and performance.…”

Section: Related Workmentioning

confidence: 99%

Reliable mission deployment in vulnerable distributed systems

Albanese

Jajodia

Jhawar

et al. 2013

2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop (DSN-W)

View full text Add to dashboard Cite

Recent years have seen a growing interest in missioncentric operation of large-scale distributed systems. However, due to their complexity, these systems are prone to failures and vulnerable to a wide range of cyber-attacks. Current solutions focus either on the infrastructure itself or on mission analysis, but fail to consider information about the complex interdependencies existing between system components and mission tasks. In this paper, we take a different approach, and present a solution for deploying mission tasks in a distributed computing environment in a way that minimizes a mission's exposure to vulnerabilities by taking into account available information about vulnerabilities and dependencies. We model the mission deployment problem as a task allocation problem, subject to various dependability constraints. The proposed solution is based on the A * algorithm for searching the solution space, but we also introduce a heuristic to significantly improve the search performance. We validate our approach, and show that our algorithm scales linearly with the size of both missions and networks.Index Terms-Data-driven reliability, mission-centric computing, vulnerability analysis. I. INTRODUCTIONLarge-scale distributed systems are increasingly being adopted for a wide range of applications. The availability of dynamic and scalable pools of computational resources makes such systems particularly attractive for mission-critical applications. Despite the significant benefits, these systemsdue to their complexity -are prone to a number of failures and are vulnerable to a wide range of cyber-attacks, which may have a significant impact on the success of a mission. Therefore, it is critically important to assess the dependability of computing systems and deploy computational tasks taking dependability constraints into account.Traditional approaches to improve security include (i) designing networks with services such as intrusion detection systems, firewalls, and other network hardening tools; and (ii) developing mission tasks using security measures such as data obfuscation and memory management. However, complex interdependencies between network infrastructure, mission tasks, and residual vulnerabilities in the system are typically not taken into account. This implies that existing solutions fail to complement network and mission's security, and, as a consequence, they provide opportunities for attackers to penetrate the network and compromise a mission.

show abstract

“…[12] researched on scheduling algorithms for independent jobs over grid computing environments, and proposed a space-time genetic strategy. In [13], authors proposed a task assignment algorithm for heterogeneous distributed security-critical systems. A communication mechanism that maximizes the security protection of the internal communication in distributed real-time systems is presented in [14].…”

Section: Related Workmentioning

confidence: 99%

Resource Allocation of Security-Critical Tasks with Statistically Guaranteed Energy Constraint

Jiang

2012

2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

ABSTRACT-In this paper, we are interested in resource allocation for energy constrained and security-critical embedded systems. Tasks in such systems need to be successfully executed under certain energy budget and be robust against serious security threatens. Different to former energy minimal scheduling problem, we introduce a new optimization problem for a set of tasks with energy constraint and multiple security choices. We present a dynamic programming based approximation algorithm to minimize the security risk of the system while statistically guaranteeing energy consumption constraints for given energy slack ratio. The proposed algorithm is very efficient in both time and space dimensions, and achieves good solutions. Extensive simulations demonstrate the superiority of our algorithm over other approaches.

show abstract

Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity

Cited by 40 publications

References 26 publications

Energy cost minimization with job security guarantee in Internet data center

Energy cost minimization with job security guarantee in Internet data center

Reliable mission deployment in vulnerable distributed systems

Resource Allocation of Security-Critical Tasks with Statistically Guaranteed Energy Constraint

Contact Info

Product

Resources

About