An initial version of this paper has been published in the Proceedings of Lecture Notes in Computer Science (LNCS) series, Vol. 5529. Springer: Berlin, April 2009; 69–78.
1099-1190/asset/NEM_left.gif?v=1&s=308f1d44414cd01094dab20dd5f8ec4c77df1db2)
1099-1190/asset/NEM_right.gif?v=1&s=1eb8da68374761728d91699e61c689be4cd5fc45)
Research Article
An architecture and a dynamic scheduling algorithm of grid for providing security for real-time data-intensive applications†
Article first published online: 25 JAN 2011
DOI: 10.1002/nem.765
Copyright © 2011 John Wiley & Sons, Ltd.
Issue
International Journal of Network Management
Volume 21, Issue 5, pages 402–413, September/October 2011
Additional Information
How to Cite
Islam, M. R., Hasan, M. T. and Ashaduzzaman, G. M. (2011), An architecture and a dynamic scheduling algorithm of grid for providing security for real-time data-intensive applications. Int. J. Network Mgmt., 21: 402–413. doi: 10.1002/nem.765
- †
Publication History
- Issue published online: 19 SEP 2011
- Article first published online: 25 JAN 2011
- Manuscript Accepted: 3 AUG 2010
- Manuscript Revised: 19 JUL 2010
- Manuscript Received: 4 FEB 2010
- Abstract
- Article
- References
- Cited By
Abstract
Real-time data-intensive applications with security concerns are arising in many disciplines of science and engineering. Scheduling algorithms play an important role in the design of real-time data-intensive applications. However, conventional real-time scheduling algorithms are inappropriate to fulfill the security requirements of real-time data-intensive applications. In this paper we have proposed a security-attentive dynamic real-time scheduling algorithm named SARDIG for scheduling real-time data-intensive applications. We have proposed a grid architecture which describes the scheduling framework of real-time data-intensive applications. In addition, we have introduced a mathematical model for providing security of the real-time data-intensive applications and a security gain function to quantitatively measure the security enhancement for applications running in the grid sites. We have also proved that the SARDIG algorithm always provides optimum security for real-time data-intensive applications. The time complexity of the SARDIG algorithm has been analyzed to show the efficiency of the algorithm. Simulation results show that the SARDIG algorithm provides better performance and security than other existing scheduling algorithms. Copyright © 2011 John Wiley & Sons, Ltd.