Notice Board :

Call for Paper
Vol. 4 Issue 8

Submission Start Date:
August 01, 2018

Acceptence Notification Start:
August 10, 2018

Submission End:
August 15, 2018

Final MenuScript Due:
August 25, 2018

Publication Date:
August 31, 2018


                         Notice Board: Call for PaperVol. 4 Issue 8      Submission Start Date: August 01, 2018      Acceptence Notification Start: August 10, 2018      Submission End: August 15, 2018      Final MenuScript Due: August 25, 2018      Publication Date: August 31, 2018




Volume III Issue IV

Author Name
Aparna Chaurasia, Prof. Kapil Sahu
Year Of Publication
2017
Volume and Issue
Volume 3 Issue 4
Abstract
Load balancing in the cloud-computing environment has an important impact on the performance. Good load balancing makes cloud computing more efficient and improves user satisfaction. Load balancing with cloud computing provides a good efficient strategy to several inquiries residing inside cloud computing environment set. complete balancing must acquire straight into accounts two tasks, one will be the resource provisioning as well as resource allocation along with will be task scheduling throughout distributed System. Round robin algorithm can be via far the Easiest algorithm shown to help distribute populate among nodes. Because of this reason it is frequently the first preference when implementing a easy scheduler. One of the reasons for it being so simple is that the only information required is a list of nodes. The proposed algorithm eliminates the drawbacks of implementing a simple round robin architecture in cloud computing by introducing a concept of assigning different time slices to individual processes depending on their are priorities.
PaperID
2017/IJRRETAS/4/2017/21610

Author Name
Gaurav Khare, Dr. Pankaj Dashore
Year Of Publication
2017
Volume and Issue
Volume 3 Issue 4
Abstract
Wsn routing nodes can be implemented on any type of industries,battlefield and are able to organize themselves in a broad-scalable wireless ad-hoc network. Genral or common routing protocols do not exist into account that a hope contains only a Suppresed supply of energy. Optimal routing always tries to enhance the duration of time over which the sensing work can be performed, But requires further knowledge. As this is very much unrealistic, we derive a practical scenario based on the energy obtained from various histograms and modify a spectrum of latest techniques to improve the route generation in sensor networks. Our very first approach aggregates packet transmission in a robust way, resulting in reduction of energy upto factor 2 to 4. Secondly, we argue that a more static resource utilization can be gained by shaping the traffic movement and flow. Various techniques, which depend only on localized parametres are proposed and calculated. We show that they can enhance the lifetime o
PaperID
2017/IJRRETAS/3/2017/19615