Service Request Approach for e-Governance using Federation of Cloud

Authors

  • Gupta A Banasthali University & Associate Professor, Sir Padampat Singhania University, Udaipur, Rajasthan
  • Dhyani P Dept Computer Science, Banasthali University, Banasthali, Rajasthan, India
  • Rishi OP Department of CSE, University of Kota, Kota, Rajasthan, India
  • Pathak V Birla Institute of Technology, Jaipur Campus, Jaipur, Rajasthan, India

DOI:

https://doi.org/10.26438/ijcse/v6i5.597601

Keywords:

Cloud computing, Job scheduling, Cloud federation, Cloud service broker

Abstract

Job scheduling is one of the major task in the federated cloud computing environment. In this paper a method using the existing job sequencing with deadline algorithm is proposed. The presented model including the existing job sequencing with deadline algorithm, sequences the jobs according to the optimization criterion of minimum energy consumption by the data center server, with the constraint to complete the jobs within deadline. The study mainly emphasizes to develop a system that maximizes the utilization of computing resources on one hand, while on other hand provides proper load balancing and task scheduling to get the optimal solution in the cloud federation for e-Governance services.

References

Ashutosh Gupta, Praveen Dhyani, O.P.Rishi, “Cloud based e-Voting: one step ahead for Good Governance in India”, In International Journal of Computer Applications(0975-8887),Volume 67-No.6, April 2013.

National Institute of Standards and Technology (NIST), The NIST Definition of Cloud Computing, http://csrc.nist.gov /publications/drafts800-145/Draft-SP-800-145_cloud-definition.pdf.

Dr. M. Srivenkatesh, K. Vanitha, “Task Scheduling in Federated Cloud by Multilevel Queue based on Genetic Algorithm”, In International Journal of Advanced Research in Computer and Communication Engineering, Vol.4, Issue 3, March 2015.

Preyesh Kanungo, “Design Issues in Federated Cloud Architectures”, In International Journal of Advanced Research in Computer and Communication Engineering, Vol.5, Issue.5, May 2016.

Himanshu Goel, Narendra Chamoli, “Job Scheduling algorithm in Cloud Computing : a survey”, In International Journal of Computer Applications (0975-8887), Vol.95, No.23, June 2014.

Ziqian Dong, Ning Liu and Roberto Rojas-Cessa, “Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers”, In the Journal of Cloud Computing:Advances, Systems and Applications (2015) .

Kyong Hoon Kim, Rajkumar Buyya and Jong Kim, “Power Aware Scheduling of Bag-of-Tasks Applications with Deadline Constraints on DVS-enable Clusters”.

Cong Liu,Xiao Qin and shuang Li “PASS: Power-Aware Scheduling of Mixed Applications with Deadline Constraints on Clusters”, Proc. the 17th int’l Conf. Computer Communications and Networks(ICCCN) St. Thomas, Vergin Islands, Aug. 2008.

Shruti and Meenakshi Sharma, “ Task Scheduling and Resource Optimization in Cloud Computing using Deadline-Aware Particle Sworm Technique”, in International Journal of Computer Sciences and Engineering(2347-2693), Volume-5, Issue-6, PP 227-231, June 2017.

Indukuri R. Krishnan Raju, Penmasta Suresh Varma, M.V.Rama Sundari, G.Jose Moses “ Deadline Aware Two stage scheduling Algorithm in Cloud computing”, In Indian journal of science and Technology, Vol 9(4), Jan 2016.

Horowitz E., Sahni S. and Rajasekaran S., “Fundamental of computer algorithms”, Hyderabad, A.P., Universities Press(India) Private Limited, India, 2008. page no. 231.

Downloads

Published

2025-11-13
CITATION
DOI: 10.26438/ijcse/v6i5.597601
Published: 2025-11-13

How to Cite

[1]
A. Gupta, P. Dhyani, O. Rishi, and V. Pathak, “Service Request Approach for e-Governance using Federation of Cloud”, Int. J. Comp. Sci. Eng., vol. 6, no. 5, pp. 597–601, Nov. 2025.

Issue

Section

Research Article