Paper Title
Quantified Weighted Nodes Scheduling Principle For Cloud Architectures

Request scheduling has a major impact on the performance of the service delivery model in a large scale distributed computing environment like cloud. It is desirable in a distributed system to have a request scheduling principle that evenly spread the workload among the compute nodes. The capacity of the servers is normally termed high or low relative to one another. There is a need to quantify the server capacity to overcome this subjective assessment. Subsequently, a method to split the requests based on this quantified server capacity is also needed. This paper intends to address these requirements by introducing a novel scheduling principle, namely, Capacity Quantified Compute Nodes Load Balancing Principle. IndexTerms- Cloud Computing, Load Balancing, Weighted Nodes Load Balancing, Cloud Simulators.