Enviar pesquisa
Carregar
17 51-1-pb
•
1 gostou
•
361 visualizações
E
Editor IJARCET
Seguir
Tecnologia
Negócios
Denunciar
Compartilhar
Denunciar
Compartilhar
1 de 6
Baixar agora
Baixar para ler offline
Recomendados
Service Request Scheduling based on Quantification Principle using Conjoint A...
Service Request Scheduling based on Quantification Principle using Conjoint A...
IJECEIAES
Modified Active Monitoring Load Balancing with Cloud Computing
Modified Active Monitoring Load Balancing with Cloud Computing
ijsrd.com
A study of load distribution algorithms in distributed scheduling
A study of load distribution algorithms in distributed scheduling
eSAT Publishing House
G04624447
G04624447
IOSR-JEN
dynamic resource allocation using virtual machines for cloud computing enviro...
dynamic resource allocation using virtual machines for cloud computing enviro...
Kumar Goud
Load Balancing in Cloud Computing Environment: A Comparative Study of Service...
Load Balancing in Cloud Computing Environment: A Comparative Study of Service...
Eswar Publications
IRJET - Efficient Load Balancing in a Distributed Environment
IRJET - Efficient Load Balancing in a Distributed Environment
IRJET Journal
G216063
G216063
inventionjournals
Recomendados
Service Request Scheduling based on Quantification Principle using Conjoint A...
Service Request Scheduling based on Quantification Principle using Conjoint A...
IJECEIAES
Modified Active Monitoring Load Balancing with Cloud Computing
Modified Active Monitoring Load Balancing with Cloud Computing
ijsrd.com
A study of load distribution algorithms in distributed scheduling
A study of load distribution algorithms in distributed scheduling
eSAT Publishing House
G04624447
G04624447
IOSR-JEN
dynamic resource allocation using virtual machines for cloud computing enviro...
dynamic resource allocation using virtual machines for cloud computing enviro...
Kumar Goud
Load Balancing in Cloud Computing Environment: A Comparative Study of Service...
Load Balancing in Cloud Computing Environment: A Comparative Study of Service...
Eswar Publications
IRJET - Efficient Load Balancing in a Distributed Environment
IRJET - Efficient Load Balancing in a Distributed Environment
IRJET Journal
G216063
G216063
inventionjournals
Virtual Machine Migration and Allocation in Cloud Computing: A Review
Virtual Machine Migration and Allocation in Cloud Computing: A Review
ijtsrd
A Prolific Scheme for Load Balancing Relying on Task Completion Time
A Prolific Scheme for Load Balancing Relying on Task Completion Time
IJECEIAES
The Concept of Load Balancing Server in Secured and Intelligent Network
The Concept of Load Balancing Server in Secured and Intelligent Network
IJAEMSJORNAL
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Editor IJCATR
Load balancing in Distributed Systems
Load balancing in Distributed Systems
Richa Singh
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Eswar Publications
Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...
IEEEFINALYEARPROJECTS
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
IRJET Journal
Quality of Service based Task Scheduling Algorithms in Cloud Computing
Quality of Service based Task Scheduling Algorithms in Cloud Computing
IJECEIAES
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
Susheel Thakur
Dynamic Cloud Partitioning and Load Balancing in Cloud
Dynamic Cloud Partitioning and Load Balancing in Cloud
Shyam Hajare
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
Susheel Thakur
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
IJCNCJournal
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
Nexgen Technology
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
Susheel Thakur
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
idescitation
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
Susheel Thakur
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
Susheel Thakur
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
IJCNCJournal
92 97
92 97
Editor IJARCET
Pdf
Pdf
Editor IJARCET
341 345
341 345
Editor IJARCET
Mais conteúdo relacionado
Mais procurados
Virtual Machine Migration and Allocation in Cloud Computing: A Review
Virtual Machine Migration and Allocation in Cloud Computing: A Review
ijtsrd
A Prolific Scheme for Load Balancing Relying on Task Completion Time
A Prolific Scheme for Load Balancing Relying on Task Completion Time
IJECEIAES
The Concept of Load Balancing Server in Secured and Intelligent Network
The Concept of Load Balancing Server in Secured and Intelligent Network
IJAEMSJORNAL
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Editor IJCATR
Load balancing in Distributed Systems
Load balancing in Distributed Systems
Richa Singh
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Eswar Publications
Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...
IEEEFINALYEARPROJECTS
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
IRJET Journal
Quality of Service based Task Scheduling Algorithms in Cloud Computing
Quality of Service based Task Scheduling Algorithms in Cloud Computing
IJECEIAES
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
Susheel Thakur
Dynamic Cloud Partitioning and Load Balancing in Cloud
Dynamic Cloud Partitioning and Load Balancing in Cloud
Shyam Hajare
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
Susheel Thakur
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
IJCNCJournal
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
Nexgen Technology
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
Susheel Thakur
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
idescitation
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
Susheel Thakur
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
Susheel Thakur
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
IJCNCJournal
Mais procurados
(19)
Virtual Machine Migration and Allocation in Cloud Computing: A Review
Virtual Machine Migration and Allocation in Cloud Computing: A Review
A Prolific Scheme for Load Balancing Relying on Task Completion Time
A Prolific Scheme for Load Balancing Relying on Task Completion Time
The Concept of Load Balancing Server in Secured and Intelligent Network
The Concept of Load Balancing Server in Secured and Intelligent Network
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Survey on Dynamic Resource Allocation Strategy in Cloud Computing Environment
Load balancing in Distributed Systems
Load balancing in Distributed Systems
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Dynamic resource allocation using virtual machines for cloud computing enviro...
Dynamic resource allocation using virtual machines for cloud computing enviro...
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
IRJET- An Adaptive Scheduling based VM with Random Key Authentication on Clou...
Quality of Service based Task Scheduling Algorithms in Cloud Computing
Quality of Service based Task Scheduling Algorithms in Cloud Computing
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
SERVER COSOLIDATION ALGORITHMS FOR CLOUD COMPUTING: A REVIEW
Dynamic Cloud Partitioning and Load Balancing in Cloud
Dynamic Cloud Partitioning and Load Balancing in Cloud
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
Performance Analysis of Server Consolidation Algorithms in Virtualized Cloud...
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
THRESHOLD BASED VM PLACEMENT TECHNIQUE FOR LOAD BALANCED RESOURCE PROVISIONIN...
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERS
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
Performance Evaluation of Server Consolidation Algorithms in Virtualized Clo...
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
A Kernel-Level Traffic Probe to Capture and Analyze Data Flows with Priorities
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
Server Consolidation Algorithms for Virtualized Cloud Environment: A Performa...
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
A Study on Energy Efficient Server Consolidation Heuristics for Virtualized C...
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENT
Destaque
92 97
92 97
Editor IJARCET
Pdf
Pdf
Editor IJARCET
341 345
341 345
Editor IJARCET
370 374
370 374
Editor IJARCET
13 48-1-pb
13 48-1-pb
Editor IJARCET
167 169
167 169
Editor IJARCET
51 54
51 54
Editor IJARCET
346 351
346 351
Editor IJARCET
182 185
182 185
Editor IJARCET
Destaque
(9)
92 97
92 97
Pdf
Pdf
341 345
341 345
370 374
370 374
13 48-1-pb
13 48-1-pb
167 169
167 169
51 54
51 54
346 351
346 351
182 185
182 185
Semelhante a 17 51-1-pb
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
iosrjce
J017367075
J017367075
IOSR Journals
2012an20
2012an20
vishnu kumar prajapati
LOAD BALANCING IN CLOUD COMPUTING
LOAD BALANCING IN CLOUD COMPUTING
IRJET Journal
IRJET- An Improved Weighted Least Connection Scheduling Algorithm for Loa...
IRJET- An Improved Weighted Least Connection Scheduling Algorithm for Loa...
IRJET Journal
A SURVEY ON STATIC AND DYNAMIC LOAD BALANCING ALGORITHMS FOR DISTRIBUTED MULT...
A SURVEY ON STATIC AND DYNAMIC LOAD BALANCING ALGORITHMS FOR DISTRIBUTED MULT...
IRJET Journal
An Efficient Decentralized Load Balancing Algorithm in Cloud Computing
An Efficient Decentralized Load Balancing Algorithm in Cloud Computing
Aisha Kalsoom
A Distributed Control Law for Load Balancing in Content Delivery Networks
A Distributed Control Law for Load Balancing in Content Delivery Networks
Sruthi Kamal
Cloud Computing Load Balancing Algorithms Comparison Based Survey
Cloud Computing Load Balancing Algorithms Comparison Based Survey
INFOGAIN PUBLICATION
Load Balancing in Cloud Nodes
Load Balancing in Cloud Nodes
INFOGAIN PUBLICATION
Load Balancing in Cloud Nodes
Load Balancing in Cloud Nodes
INFOGAIN PUBLICATION
AWSQ: an approximated web server queuing algorithm for heterogeneous web serv...
AWSQ: an approximated web server queuing algorithm for heterogeneous web serv...
IJECEIAES
J0210053057
J0210053057
researchinventy
N1803048386
N1803048386
IOSR Journals
Multilevel Hybrid Cognitive Load Balancing Algorithm for Private/Public Cloud...
Multilevel Hybrid Cognitive Load Balancing Algorithm for Private/Public Cloud...
IDES Editor
Volume 2-issue-6-2061-2063
Volume 2-issue-6-2061-2063
Editor IJARCET
Volume 2-issue-6-2061-2063
Volume 2-issue-6-2061-2063
Editor IJARCET
IRJET- Enhance Dynamic Heterogeneous Shortest Job first (DHSJF): A Task Schedu...
IRJET- Enhance Dynamic Heterogeneous Shortest Job first (DHSJF): A Task Schedu...
IRJET Journal
An efficient scheduling policy for load balancing model for computational gri...
An efficient scheduling policy for load balancing model for computational gri...
Alexander Decker
An Efficient Distributed Control Law for Load Balancing in Content Delivery N...
An Efficient Distributed Control Law for Load Balancing in Content Delivery N...
IJMER
Semelhante a 17 51-1-pb
(20)
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
J017367075
J017367075
2012an20
2012an20
LOAD BALANCING IN CLOUD COMPUTING
LOAD BALANCING IN CLOUD COMPUTING
IRJET- An Improved Weighted Least Connection Scheduling Algorithm for Loa...
IRJET- An Improved Weighted Least Connection Scheduling Algorithm for Loa...
A SURVEY ON STATIC AND DYNAMIC LOAD BALANCING ALGORITHMS FOR DISTRIBUTED MULT...
A SURVEY ON STATIC AND DYNAMIC LOAD BALANCING ALGORITHMS FOR DISTRIBUTED MULT...
An Efficient Decentralized Load Balancing Algorithm in Cloud Computing
An Efficient Decentralized Load Balancing Algorithm in Cloud Computing
A Distributed Control Law for Load Balancing in Content Delivery Networks
A Distributed Control Law for Load Balancing in Content Delivery Networks
Cloud Computing Load Balancing Algorithms Comparison Based Survey
Cloud Computing Load Balancing Algorithms Comparison Based Survey
Load Balancing in Cloud Nodes
Load Balancing in Cloud Nodes
Load Balancing in Cloud Nodes
Load Balancing in Cloud Nodes
AWSQ: an approximated web server queuing algorithm for heterogeneous web serv...
AWSQ: an approximated web server queuing algorithm for heterogeneous web serv...
J0210053057
J0210053057
N1803048386
N1803048386
Multilevel Hybrid Cognitive Load Balancing Algorithm for Private/Public Cloud...
Multilevel Hybrid Cognitive Load Balancing Algorithm for Private/Public Cloud...
Volume 2-issue-6-2061-2063
Volume 2-issue-6-2061-2063
Volume 2-issue-6-2061-2063
Volume 2-issue-6-2061-2063
IRJET- Enhance Dynamic Heterogeneous Shortest Job first (DHSJF): A Task Schedu...
IRJET- Enhance Dynamic Heterogeneous Shortest Job first (DHSJF): A Task Schedu...
An efficient scheduling policy for load balancing model for computational gri...
An efficient scheduling policy for load balancing model for computational gri...
An Efficient Distributed Control Law for Load Balancing in Content Delivery N...
An Efficient Distributed Control Law for Load Balancing in Content Delivery N...
Mais de Editor IJARCET
Electrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturization
Editor IJARCET
Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207
Editor IJARCET
Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199
Editor IJARCET
Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204
Editor IJARCET
Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194
Editor IJARCET
Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189
Editor IJARCET
Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185
Editor IJARCET
Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176
Editor IJARCET
Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172
Editor IJARCET
Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164
Editor IJARCET
Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158
Editor IJARCET
Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154
Editor IJARCET
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
Editor IJARCET
Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124
Editor IJARCET
Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142
Editor IJARCET
Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138
Editor IJARCET
Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129
Editor IJARCET
Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118
Editor IJARCET
Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113
Editor IJARCET
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
Editor IJARCET
Mais de Editor IJARCET
(20)
Electrically small antennas: The art of miniaturization
Electrically small antennas: The art of miniaturization
Volume 2-issue-6-2205-2207
Volume 2-issue-6-2205-2207
Volume 2-issue-6-2195-2199
Volume 2-issue-6-2195-2199
Volume 2-issue-6-2200-2204
Volume 2-issue-6-2200-2204
Volume 2-issue-6-2190-2194
Volume 2-issue-6-2190-2194
Volume 2-issue-6-2186-2189
Volume 2-issue-6-2186-2189
Volume 2-issue-6-2177-2185
Volume 2-issue-6-2177-2185
Volume 2-issue-6-2173-2176
Volume 2-issue-6-2173-2176
Volume 2-issue-6-2165-2172
Volume 2-issue-6-2165-2172
Volume 2-issue-6-2159-2164
Volume 2-issue-6-2159-2164
Volume 2-issue-6-2155-2158
Volume 2-issue-6-2155-2158
Volume 2-issue-6-2148-2154
Volume 2-issue-6-2148-2154
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2143-2147
Volume 2-issue-6-2119-2124
Volume 2-issue-6-2119-2124
Volume 2-issue-6-2139-2142
Volume 2-issue-6-2139-2142
Volume 2-issue-6-2130-2138
Volume 2-issue-6-2130-2138
Volume 2-issue-6-2125-2129
Volume 2-issue-6-2125-2129
Volume 2-issue-6-2114-2118
Volume 2-issue-6-2114-2118
Volume 2-issue-6-2108-2113
Volume 2-issue-6-2108-2113
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
Último
Architecting Cloud Native Applications
Architecting Cloud Native Applications
WSO2
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Victor Rentea
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
?#DUbAI#??##{{(☎️+971_581248768%)**%*]'#abortion pills for sale in dubai@
FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024
The Digital Insurer
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Orbitshub
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
MadyBayot
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
Zilliz
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Victor Rentea
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
apidays
MS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectors
Nanddeep Nachan
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire business
panagenda
presentation ICT roal in 21st century education
presentation ICT roal in 21st century education
jfdjdjcjdnsjd
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
sammart93
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
Rustici Software
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
apidays
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Zilliz
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
sudhanshuwaghmare1
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Jago de Vreede
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
apidays
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
UiPathCommunity
Último
(20)
Architecting Cloud Native Applications
Architecting Cloud Native Applications
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
Finding Java's Hidden Performance Traps @ DevoxxUK 2024
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
EMPOWERMENT TECHNOLOGY GRADE 11 QUARTER 2 REVIEWER
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
MS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectors
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire business
presentation ICT roal in 21st century education
presentation ICT roal in 21st century education
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Spring Boot vs Quarkus the ultimate battle - DevoxxUK
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
17 51-1-pb
1.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 ADAPTIVE LOAD BALANCING FOR CLUSTER USING CONTENT AWARENESS WITH TRAFFIC MONITORING Archana Nigam, Tejprakash Singh, Anuj Tiwari, Ankita Singhal Abstract purpose of load balancing is to improve the performance of a distributed system through an With the rapid growth of both information and users appropriate distribution of the application load. on the Internet, how to effectively improve the A general formulation of this problem is as follows: quality of network service becomes an urgent given a large number of requests, find the allocation problem to be addressed. Load balancing is a solution of requests to servers while optimizing a given to this problem in an effective way. Different objective function (e.g. total execution time) [2]. It is adaptive load balancing methods have been to distribute a large number of requests to different developed to estimate servers load performance. servers, to ease the burden of a single server. Load- However, they suffer from either increased balancing technology can balance conflicting factors processing load on the servers, or additional traffic on such as cost, performance, and scalability through a the network and the servers, or are impractical in real relatively low total cost of the computer cluster to time scenario. achieve a strong performance that cannot be achieved In this paper, we used the concept of content based by stand-alone system. Server load balancing is queues, and have used RTT passive measurement highly significant for network research and has broad technique to get an adaptive load balancing algorithm market prospects. inside the cluster and used the round robin load Different load balancing methods have been balancing algorithm outside the cluster. Using the developed to transfer load among servers. Some of same queue for each type of request results into them are impractical in real time scenario while overload on server, so we use the concept of different others increase processing load on the server or on queue for different type of request. The whole load the network. balancing task is performed by a webproxy, a proxy that has access to all servers so it also removes the In this paper ,we use a new adaptive load balancing drawback of dynamic algorithm in which most of the algorithm inside the cluster where the concept of rtt load balancing task is performed by server itself. passive measurement technique and content Keywords: - Round Trip Time (RTT), Adaptive awareness has been used By content awareness we Load Balancing, Content awareness, Webproxy , mean having different queue for different request Distributed Network. types rather than having the same queue for different requests, which improves the total execution time. I. INTRODUCTION Even if the adaptive load balancing method doesn’t work then rtt passive measurement will do all load A distributed system consists of a collection of balancing task for selecting the appropriate cluster autonomous computers, connected through a which increases the reliability of the system. network and distribution middleware, which enables computers to coordinate their activities and to share The Server Selection policy used in our paper is in the resources of the system, so that users perceive compliance with the policy described in [3] where the system as a single, integrated computing facility application layer RTT between the router and the [1]. The users of a distributed system have different server is a key parameter to monitor goals, objectives and strategies and their behaviour is load/performance of server. RTT calculation is done difficult to characterize. In such systems the through a passive measurement policy to remove any management of resources and applications is a very burden on the network. challenging task. When the demand for computing power increases the load balancing problem becomes important. The 18 All Rights Reserved © 2012 IJARCET
2.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 The concept of cluster is used to provide higher availability,reliability and scalability than can be II. RELATED WORK obtained by using a single system. Benefit of having cluster architecture is, it provides high availability by Load balancing mechanisms can be broadly making application software and data available on categorized as centralized or decentralized, dynamic several servers linked together in a cluster or static [4]. configuration. If one server stops functioning, a In a centralized algorithm, there is a central scheduler process called failover automatically shifts the which gathers all load information from the nodes workload of the failed server to another server in the and makes appropriate decisions. However, this cluster. approach is not scalable for a vast environment and Also, as described earlier, Load balancing algorithms also central scheduler is a bottleneck. In can be classified as either static or dynamic. decentralized models, there is usually no specific Unfortunately these methods generates additional node known as a server or collector. Instead, all processing load on the server, deteriorating its nodes have information about some or all other performance. The proposed architecture to handle nodes. This leads to a huge overhead in this is as shown in Figure 1. The function of a web communication. server is to service HTTP requests made by client. Typically the server receives a request asking for a Static algorithms are not affected by the system state, specific resource, and it returns the resource as a as their behaviour is predetermined. On the other response. A client might reference in its request a hand, dynamic algorithms make decisions according file, then that file is returned or, for example, a to the system state. The state refers to certain types of directory, then the content of that directory (codified information, such as the number of jobs waiting in in some suitable form) is returned. A client might the ready queue, the current job arrival rate, etc. also request a program, and it is the web server task Dynamic algorithms tend to have better performance to launch that program (CGI script) [7] and to return than static ones. Some dynamic load balancing the output of that program to the client. Various other algorithms are adaptive; in other words, dynamic type of resources might be referenced in client's policies are modifiable as the system state changes. request. Different request have different sizes thus required server time is different for them. Client request is transferred to the web server via router, and In a distributed network, content based adaptive the router distinguishes the request on the basis of routing algorithm is used where router directs user content. As shown in Figure 1, there are clusters of request to appropriate server but the key parameter server; each back end server inside the cluster keeps for selecting the best server is difficult to choose. queues for handling each type of request. This Many balancing techniques use different parameters database is maintained by the router for each server to measure system performance [5]. One of the best and router transfers the request to a particular queue way is to use “ICMP echo request and reply” of a server after rtt passive measurement. There is a between router and servers. But this is an active common module for all the servers which we call as approach and creates lot of communication overhead web proxy. This is the main improvement over other which can be avoided by applying a passive adaptive load balancing algorithms. It performs the admission monitoring method where no additional load balancing task by running the algorithm traffic is generated in network. Another problem with (explained in the next section) thus freeing the such a technique is that if all the requests processed servers from performing load balancing technique by server are enqueued in a single queue it will slow and thus improves efficiency. down the overall response time. . The algorithm introduced here does the load balancing inside the cluster uses the concept of content awareness and passive measurement to decrease the overhead on the server significantly.. III. PROPOSED SOLUTION Architecture 19 All Rights Reserved © 2012 IJARCET
3.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 the server selection probability. A router i calculates Pij,, a probability of selecting server j, as follows [3]. Where n is total number of servers serving the same service and RTTm is the RTT between router i and server m. Figure 1 Architecture Before describing the algorithm, first let us understand what is exactly mean by content awareness and its need. Suppose we have three RTT Passive Measurement Technique servers in the system and each can handle three different type of request i.e. video, audio, and image. The current load of each of the servers is as follows. Server 1 : 3 video requests. Server 2 : 3 audio requests. Server 3: 3 image requests. If we consider just the length of the queues then all have same length but if the request is forwarded to Figure 2 RTT Passive Measurement server 1 then it will result in higher response time. So the technique that we introduced here is to have different queue for different kind of request and The application layer RTT includes the network whenever a server gets overloaded due to the requests delay and the server processing delay [3] as shown in on a particular queue then transfer the request from figure 2. In some situations, server latency may be this server to the same queue of other server thus dominant due to the load on the particular server. In balancing the load. this case, user response time may be improved by selecting a server that is lightly loaded. In another Algorithm situation, network delay may be dominant due to congestion. In this case, network delay should be This is the adaptive load balancing algorithm run by used for server selection. To realize good selection of webproxy, common for all the servers. So it has servers, we believe that both server processing delay access to the entire server’s queue and can update and network delay should be taken into account. To them as needed. do so, we use the application layer RTT between the Let there be n Servers and each server has m queues, router and the server as information for server where each queues is for a different types of request. selection. This application layer RTT includes the Each type of request is of different size e.g. Videos network delay and the server processing delay. When are of size say x units whereas audio are of size say y a router in a network selects a server which has small units whereas images are of z units (much smaller application layer RTT, total response time can be than x and y) and so on. We define the initial size of improved. Now the question arises if router selects a the queue which will change according to the current server based on its application layer RTT , client state of the system. request may have a tendency to concentrate at a Define loadi where 1≤i≤n, load on ith server. particular server. To avoid this situation, we apply Maxj where 1≤j≤m, maximum load in jth queue. probabilistic server selection policy [3] at the router. Minj where 1≤j≤m, minimum load in jth queue. Selection probability of the server whose RTT is Initialize limit value by taking the average of the large should be small and the server whose RTT is length of all the m queues on n server and divide it small should be selected with large probability. We into the half. If value of loadi is greater than limit apply the following simple method for calculation of value then transfer job from queue of that server to same type of queue of other server. We could have 20 All Rights Reserved © 2012 IJARCET
4.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 taken the full average value and compared load with it, but it will be the situation where server is already overloaded and then measures have to be taken to transfer its load and make it under loaded or lightly loaded. In our case such a situation is not allowed to occur because we take precautionary measures i.e., divide the average into half and transfer the load well before any overloaded condition. Algo for webproxy Steps 1.For each i and j initialize loadi, loadc , Maxj, Minj to 0. 2.Select cluster on the basis of round robin technique. 3. Repeat step 4 to 7, till server is on 4. If (loadi<limit) Converts the m queues into the single queue on the basis of time and server serves the request in FCFS form. 5. If (loadi≥limit) Repeat Step 6 until (loadi<limit) 6. For each queue (from 1 to m) calculate maxj and minj and transfer the request from queue j of server x having maximum load to queue j of server y having minimum load. 7.) Go to step 3. 8.) Exit The above adaptive load balancing algorithm would be implemented inside the cluster for load balancing and for selecting the appropriate cluster static round robin load balancing algorithm is used. By round IV. Experiment and Results robin we mean selecting the cluster from 1 to k, A. Simulation where k is the number of cluster, and after reaching We have implemented the algorithm in netbeans 7.1 to kth server repeat the same procedure. Flowchart of using multithreading. Each thread created adaptive algorithm is shown below. corresponds to a particular server. We designed a client module that generates requests from the web and handed over to the router. The generated requests are of different types. Cluster are selected on the basis of round robin algorithm and on the basis of type of request, router puts them in an appropriate queue. Router transfers the request to the webproxy where the entire relevant load balancing task is performed. We have also implemented the static algorithm based on round robin technique [8] and dynamic algorithm based on load balancing by content based routing technique [5] for making necessary comparison. B. Simulation Results For simulation, we have used the request from web and these requests are of different sizes and types. Algorithm 1 is static algorithm, Algorithm 2 is dynamic algorithm and Algorithm 3 is our proposed adaptive load balancing algorithm. We compare these algorithms on the basis of load distribution among servers and total response time. 21 All Rights Reserved © 2012 IJARCET
5.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 C. Analysis of Results From Fig 3, 4, 5 it may be concluded that the load Figure 5 Proposed Adaptive load balancing distribution is fairer in Algorithm 3 i.e. in adaptive algorithm algorithm. In Figure 3 it is clear that for static algorithm or Algorithm 1 (server 1 gets overloaded because load is transferred in a round robin fashion but it may happen video or much larger size request are processed by any particular server, so that server will be overloaded ) whereas in Figure 4, dynamic algorithm also distribute load to server 1 and 3 while server 2 remains unutilized. Figure 6 shows the total response time and it is also clear from the graph that on an average total response time of Algorithm 3 is less than that of Algorithm 1 and 2. Figure 6 Comparison of three algorithms on the basis of Total Execution Time V. Conclusion An adaptive load balancing algorithm has been developed where the concept of rtt passive measurement and content awareness by having different queues for different type of request has been used. We have compared the proposed algorithm with the static algorithm and a dynamic algorithm. Figure 3 Static Algorithm The result shows that proposed algorithm gives better result as the load on servers’ increases. For lightly loaded server, static algorithm can be used which is less complex than the other two algorithms and hence reduces complexity. However, for huge workload, the proposed algorithm can be used effectively. Also the best part of algorithm is even if webproxy stops working the load balancing can be done on the basis of rtt passive measurement and in this case it is similar to dynamic algorithm, thus the proposed algorithm is more reliable than the dynamic algorithm. In future we would proposed an adaptive load Figure 4 Dynamic load balancing algorithm balancing algorithm for balancing the load among the cluster and inside the cluster the proposed algorithm can be used. It will improve the network as well as server’s performance. REFERNCES [1] Andrew S. Tanenbaum, Maarten Van Steen, “Distributed System Principles and Paradigms”. [2] Satoru Ohta, Ryuichi Andou, “WWW Server Load Balancing Technique Employing Passive Measurement of Server Performance”, ECTI Transactions on Electrical ENG, Electronics and communications vol.8, no.1 February 2010. 22 All Rights Reserved © 2012 IJARCET
6.
International Journal of
Advanced Research in Computer Engineering & Technology Volume 1, Issue 1, March 2012 [3] Yagoubi, B. and M. Meriem (2010). "Distributed Load Balancing Model for Grid Computing." Revue ARIMA 12: 43-60. [4]Chronopoulos, A. T., R. Boppana, et al. "LOAD BALANCING IN DISTRIBUTED SYSTEMS: A GAME THEORETIC APPROACH." [5] H. Miura and M. Yamamoto, "Content routing with network support using passive measurement in content distribution Anuj Tiwari, pursuing M.Tech in Spatial networks," IEICE Trans. on Communs. E86-B, pp.1805-1811, June Information Technology from DAVV, Indore.Working as an intern 2003. for one year atCentre for Artificial Intelligence and Robotics, DRDO Bangalore. My technical interests are in the area of [6] Anuj Tiwari, Ankita Singhal and Archana Nigam, (2012), Computer Networking, Distributed and parallel Computing. “ADAPTIVE LOAD BALANCING TECHNIQUE WITH PASSIVE MEASUREMENT AND TRAFFIC MONITORING”, International Conference on Computer and Communication (ICCC-2012), 27-28 Jan 2012, Bhopal, Madhya Pradesh, India. [7] Dragoi, O. A. (1999). "The conceptual architecture of the Apache web server." Dept. of Computer Science, University of Waterloo, http://www. math. uwaterloo. ca/{oadragoi/CS746G/al/apache—conceptual—arch. html. Ankita Singhal, pursuing M.tech from IIT Roorkee in Computer Science and Engineering having [8] Zhong Xu, Rong Huang, "Performance Study of Load specialization in Information technology. My area of interest is Balancing Algorithms in Distributed Web Server Systems", CS213 distributed and parallel computing, designing and analysis of Parallel and Distributed Processing Project Report. decentralized algorithm. Archana Nigam, pursuing M.tech from IIT Roorkee in Computer Science and Engineering having specialization in Information technology. My area of interest is distributed and parallel computing, designing and analysis of decentralized algorithm. Tejprakash Singh, pursuing M.tech form IIT Roorkee in Computer Science and Engineering having specialization in Information technology. My Area of interest is Cloud Computing, distributed and parallel computing. 23 All Rights Reserved © 2012 IJARCET
Baixar agora