Game-based models of grid user’s decisions in security-aware scheduling

Large Scale Network-Centric Distributed Systems

Volumn , Issue , 2013, Pages 431-462

  Kolodziej, Joanna ^a   Khan, Samee U ^b   Wang, Lizhe ^c   Chen, Dan ^d  

^a CRACOW UNIVERSITY OF TECHNOLOGY   (Poland)

^b North Dakota State University   (United States)

^c CENTER FOR EARTH OBSERVATION AND DIGITAL EARTH   (China)

^d CHINA UNIVERSITY OF GEOSCIENCES   (China)

Author keywords

Computational modeling

Indexed keywords

EID: 84962146706     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781118640708.ch18     Document Type: Chapter

References (36)

1. A. Abraham, R. Buyya, and B. Nath. “Nature’s heuristics for scheduling jobs on computational grids.” In Proc. of the 8th IEEE International Conference on Advanced Computing and Communications. India, pp. 45-52, 2000.
2. S. Ali, H.J. Siegel, M. Maheswaran, S. Ali, and D. Hensgen. “Task execution time modeling for heterogeneous computing systems.” In Proc. of the Workshop on Hetemgeneous Cornputing, pp. 185-199,2000.
3. F. Azzedin and M. Maheswaran. “Integrating trust into grid resource management systems.” In Proc. Int. Coni Parallel Processing, 2002.
4. T. Baçsar and G.J. Olsder. Dynamic Non-cooperative Game Theory. Academic Press, London, 2nd edition, 1995.
5. M. Bogdañski, J. Kołodziej, and F. Xhafa. “Supporting the security awareness of ga-based grid schedulers by artificial neural networks.” In Proc. of International Conference on Complex. Intelligent, and Software Intensive Systems (CISIS 2011), Seoul, 30.06-2. 07.2011, pp. 277-284. IEEE Soc. Press, Los Alamitos.
6. E. Cody, R. Sharman, R. H. Rao, and S. Upadhyaya. “Security in grid computing: A review and synthesis.” Decision Support Systems, Vol. 44: 749-764, 2008.
7. L.E. Edlefsen and C.B. Millham. “On a formulation of discrete n-person non-cooperative games.” Metrika, Vol. 18, No 1:31-34, 1972.
8. Y. Gao, H. Rong, and J.Z. Huang. “Adaptive grid job scheduling with genetic algorithms.” Future Generation Computer Systems, Vol. 21, No. 1:151-161,2005.
9. S.K. Garg, R. Buyya, and H.J. Segel. “Scheduling parallel aplications on utility grids: Time and cost trade-off management.” In Proc. 32nd Australasian Computer Science Conference (ACSC) (2009), Wellington, & NZ, 2009.
10. P. Ghosh. N. Roy. K Basu. and S.K Das. A game theory based pricing strategy for job allocation in mobile grids. In Proc. of’the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS 04), Santa Fe, New Mexico, 2004.
11. R. L. Graham, E. L. Lawler, J. K Lenstra, and A.H. G. Rinnooy Kan. “Optimization and approximation in deterministic sequencing and scheduling: a survey.” Annals of’Discrete Mathematics, Vol. 5:287-326, 1979.
12. S. Hotovy. “Workload evolution on the cornell theory center IBM SP2. " In Proc. of’the Workshop on Job Scheduling Strategies f’or Parallel, IPPS’96, pp. 27-40, 1996.
13. M. Humphrey and M.R. Thompson. “Security implications of typical grid computing usage scenarios.” In Proc. of’the Coni on High Performance Distributed Computing, 2001.
14. J. Kacprzyk. Multistage Decision Making under Fuzziness. Verlag TUV, R heinland, Cologne, 1983.
15. S. U. Khan and I. Ahmad. “A cooperative game theoretical technique for joint optimization of energy consumption and response time in computational grids.” IEEE Trail.on Parallel and Distributed Systems, Vol. 20, No. 3:346-360, 2009.
16. S. U. Khan and I. Ahmad. “Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation.” In Proceedings of’International Parallel and Distributed Proceedings Symposium (IPDPS 2006), pp. 101-104, 2006.
17. J. Kołodziej and F. Xhafa. “A game-theoretic and hybrid genetic meta-heuristic model for security-assured scheduling of independent jobs in computational grids.” In Proc. of’ CISIS 2010, Cracow, 15-18.02.2010, in L. Bamlli, F Xhaf’a and S. Venticinque eds., pp. 93-100, 2010.
18. J. Kołodziej and F. Xhafa. “Enhancing the genetic-based scheduling in computational grids by a structured hierarchical population.” Future Generation Computer Systems, 27: 1035-1046, 2011.
19. J. Kołodziej and F. Xhafa. “Meeting security and user behaviour requirements in grid scheduling.” Simulation Modelling Practice and Theory, Vol. 19, No. 1:213-226,2011.
20. J. Kołodziej and F. Xhafa. “Modern approaches to modelling user requirements on resource and task allocation in hierarchical computational grids.” Int. J on Appled Mathematics and Computer Science, Vol. 21, No. 2:243-257, 2011.
21. Y-K Kwok, K Hwang, and S. Song. “Selfish grids: Game-theoretic modeling and nas/psa benchmark evaluation.” IEEE Tran. on Parallel and Distributing Systems, Vol. 18, No. 5:1-16,2007.
22. G. Laccetti and G. Schmidb. “A framework model for grid security.” Future Generation Computer Systems, Vol. 23 (2007):702-713, 2007.
23. P. S. Mann. Intmductory Statistics, 7th ed. John Wiley & Sons, 2010.
24. I. Olivier, D. Smith, and J. Holland. “A study of permutation crossover operators on the travelling salesman problem.” In Proc. of’the ICGA 1987, Cambridge, MA, pp. 224-230, 1987.
25. N.G. Pavlidis, KE. Parsopoulos, and M.N. Vrahatis. “Computing nash equilibria through computational intelligence methods. " Journal of’ Computational and Applied Mathematics, Vol. 175: 113-136, 2005.
26. A. Pedrycz. “Finite cut-based approximation of fuzzy sets and its evolutionary optimization.” Fuzzy Sets and Systems, Vol. 160, No. 24, 2009.
27. W. Pedrycz. “Statistically grounded logic operators in fuzzy sets.” European Journal of’ Operational Research, Vol. 193, No. 2:520-529, 2009.
28. T. Roughgarden. “Stackelberg scheduling strategies.” SIAM Journal on Computing, Vol. 33, No. 2:332-350, 2004.
29. S. Song, K. Hwang, and YK. Kwok. “Trusted grid computing with security binding and trust integration.” J of Grid Computing, Vol. 3, No. 1-2:53-73,2005.
30. S. Song, K. Hwang, and YK. Kwok. “Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling.” IEEE Tran. on Computers, Vol. 55, No. 6:703-719, 2006.
31. P.D. Straffin. Game Theory and Strategy. Mathematical Association of America Textbooks, 1996.
32. E-G. Talbi. Metaheuristics: From Design to Implementation. John Wiley & Sons, 2009.
33. C.-C. Wu and R-Y Sun. “An integrated security-aware job scheduling strategy for largescale computational grids.” Future Generation Computer Systems, Vol. 26 (2010): 198-206, 2010.
34. F. Xhafa and A. Abraham. “Computational models and heuristic methods for grid scheduling problems.” Future Generation Computer Systems, Vol. 26 (2010):608-621, 2010.
35. F. Xhafa, J.J. Carretero, and A. Abraham. “Genetic algorithm based schedulers for grid computing systems.” Int. J of’Innovative Computing, Information and Control, Vol. 3, No.5: 1053-1071,2007.
36. F. Xhafa, J.Carretero, L. Barolli, and A. Durresi. “Requirements for an event-based simulation package for grid systems.” Journal of Interconnection Networks, Vol.8, No. 2:163-178,2007.