Load balancing in the provisioning of hose model virtual private networks with multi-path routing

2007 ◽  
Vol 1 (4) ◽  
pp. 684 ◽  
Author(s):  
H. Wang ◽  
G.-S. Poo
Keyword(s):  
Load Balancing ◽  
Virtual Private Networks ◽  
Hose Model

Algorithms for provisioning virtual private networks in the hose model

2002 ◽  
Vol 10 (4) ◽  
pp. 565-578 ◽  
Author(s):  
A. Kumar ◽  
R. Rastogi ◽  
A. Silberschatz ◽  
B. Yener
Keyword(s):  
Virtual Private Networks ◽  
Hose Model

Resource optimization algorithms for virtual private networks using the hose model

2008 ◽  
Vol 52 (16) ◽  
pp. 3130-3147 ◽  
Author(s):  
Monia Ghobadi ◽  
Sudhakar Ganti ◽  
Gholamali C. Shoja
Keyword(s):  
Optimization Algorithms ◽  
Resource Optimization ◽  
Virtual Private Networks ◽  
Hose Model

Algorithms for provisioning virtual private networks in the hose model

2001 ◽  
Vol 31 (4) ◽  
pp. 135-146 ◽  
Author(s):  
Amit Kumar ◽  
Rajeev Rastogi ◽  
Avi Silberschatz ◽  
Bulent Yener
Keyword(s):  
Virtual Private Networks ◽  
Hose Model

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document