Implementation of Cloud Data Storage Scheduling Algorithm

Cloud storage services keep user data on many storage nodes, and two decisions decide how well they perform: which node serves a request, and how many copies of the data are kept. Common policies such as First-Come-First-Served (FCFS) and Round Robin ignore node capacity, load and bandwidth, and most file systems apply one fixed replication factor to all data. This paper presents a cloud data storage scheduling framework that takes both decisions together. An efficient scheduler gives every feasible node a composite score from its free capacity, load, bandwidth and latency and picks the best one. A replication manager then derives the replication factor from a target availability, the node failure probability, and the access frequency and criticality of the object, and places the replicas on distinct nodes with automatic failover. The environment is modelled in CloudSim and Storage CloudSim, and the scheduler will be compared with FCFS, Round Robin, Shortest Job First and Min-Min on makespan, response time, throughput, load imbalance, availability and storage cost. An administrator dashboard shows node load, replica status and alerts. The work is at the design stage, so the paper gives the architecture, the mathematical model and the evaluation plan, and no experimental results; the worked example is illustrative.

Authors

Publication Details

Journal
International Journal of Advanced Research in Science Communication and Technology
Published
2026-11-17
DOI
https://doi.org/10.48175/ijarsct-40822
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Implementation of Cloud Data Storage Scheduling Algorithm

Sakshi Lahanbhau Varpe, J. K. Shimpi, P. B. Todmal, Akanksha Sambhaji Raut Supriya Pankaj Patare, Vaibhav Pandurang Solat
International Journal of Advanced Research in Science Communication and Technology
Cloud Computing and Resource Management
article

Implementation of Cloud Data Storage Scheduling Algorithm

Sakshi Lahanbhau Varpe, J. K. Shimpi, P. B. Todmal, Akanksha Sambhaji Raut Supriya Pankaj Patare, Vaibhav Pandurang Solat
article en

Abstract

Cloud storage services keep user data on many storage nodes, and two decisions decide how well they perform: which node serves a request, and how many copies of the data are kept. Common policies such as First-Come-First-Served (FCFS) and Round Robin ignore node capacity, load and bandwidth, and most file systems apply one fixed replication factor to all data. This paper presents a cloud data storage scheduling framework that takes both decisions together. An efficient scheduler gives every feasible node a composite score from its free capacity, load, bandwidth and latency and picks the best one. A replication manager then derives the replication factor from a target availability, the node failure probability, and the access frequency and criticality of the object, and places the replicas on distinct nodes with automatic failover. The environment is modelled in CloudSim and Storage CloudSim, and the scheduler will be compared with FCFS, Round Robin, Shortest Job First and Min-Min on makespan, response time, throughput, load imbalance, availability and storage cost. An administrator dashboard shows node load, replica status and alerts. The work is at the design stage, so the paper gives the architecture, the mathematical model and the evaluation plan, and no experimental results; the worked example is illustrative.

International Journal of Advanced Research in Science Communication and Technology
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon