检索结果-内蒙古大学图书馆

International Conference Parallel Distributed Grid Computing

作者： Agarwal, Aayush Manisha, G. Milind, Raje Neha Shylaja, S. S. PES Inst Technol Dept Informat Sci & Engn Bangalore Karnataka India

ISBN: (纸本)9781479976836

Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, load balancing is one of the key issues. load balancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases

关键词： load Cloud computing load balancing load balancing algorithms Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Implementation of Server load balancing in Software Defined Networking 1

引用

3rd International Conference on Information System Design and Intelligent Applications (INDIA)

作者： Kaur, Sukhveer Singh, Japinder Shaheed Bhagat Singh State Tech Campus Ferozepur India

ISBN: (数字)9788132227526

ISBN: (纸本)9788132227526;9788132227502

Network management is very painful and tedious process in large networks having hundreds of switches and routers. Software Defined Networking (SDN) is a new way for creating, designing and managing networks which aims to change this current undesirable situation. The main idea of SDN consists in logically centralizing network control in a SDN controller, which controls and monitors the behavior of the network. In this paper we developed an SDN application that performs server load balancing. The Main problem with traditional load balancer is that they use dedicated hardware. That hardware is very expensive and inflexible. Network Administrators cannot write their own algorithms since traditional load balancers are vendor locked. Therefore to solve these problems, we created SDN application which turned simple OpenFlow device into powerful load balancer. There are already certain existing load balancing algorithms in SDN but main problem with all these algorithms is that every request and return message has to pass through the load balancer. It introduces unnecessary latency. To solve these problems we implemented direct routing based load balancing algorithms. In Direct Routing, the load balancer is not involved in the return message from the web server to the client. It means server responds directly to client bypassing the load balancer thus improving performance.

关键词： SDN OpenFlow load balancer load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Various load balancing Algorithm in Cloud Computing Environment

A Comparative Study of Various Load Balancing Algorithm in C...

引用

2024 IEEE International Students' Conference on Electrical, Electronics and Computer Science, SCEECS 2024

作者： Mowade, Vinay Ganthade, Anjali Mahapatra, Dhanashri Kamdi, Naina Verma, Aryan Shelke, Nilesh Patni, Jagdish Symbiosis International Deemed University Symbiosis Institute of Technology Nagpur Campus Pune India

ISBN: (纸本)9798350348460

This research paper conducts a thorough and comparative analysis of various load balancing algorithms in cloud computing environments, aiming to provide valuable insights for cloud administrators and architects in their decision-making process. The research methodology involves creating a controlled experimental environment that mirrors typical cloud infrastructures. Performance metrics such as demand response time, server load, throughput, demand distribution fairness, scalability, and resource usage are considered, with real data from cloud environments enhancing the analysis. Both quantitative and qualitative data, supported by advanced statistical tools and data visualization techniques, are employed to shed light on the overall merits of each load balancing algorithm. This research empowers cloud professionals with the knowledge to navigate intricate realm of load balancing in cloud computing, thereby enhancing the performance, flexibility, and scalability of their cloud systems. © 2024 IEEE.

关键词： Cloud Computing Distributed Systems High Availability load balancing algorithms Performance Metrics Resthis research studyce Utilization

来源：评论

学校读者我要写书评

暂无评论

load balancing Strategies for Cloud Computing: A Comprehensive Review 2

Load Balancing Strategies for Cloud Computing: A Comprehensi...

引用

2nd International Conference on Intelligent Data Communication Technologies and Internet of Things, IDCIoT 2024

作者： Sree, Talari Navya Kalyan, Reddy Venkat Azam Khan, Pathan Faizaan Deepak, V. Koneru Lakshmaiah Education Foundation Department of Computer Science and Engineering Andhra Pradesh Vaddeswaram India

ISBN: (纸本)9798350327533

Cloud computing has revolutionized the way modern applications and services are delivered, offering scalability, flexibility, and cost-efficiency. A key challenge in maximizing the benefits of cloud environments is the efficient distribution of workloads across virtual machines or servers. In order to determine which dynamic load balancing algorithm in cloud computing is the most efficient, the research work presents a thorough analysis and comparison. In this study, to maximize resource use, minimize response times, and improve overall system performance, well-known cloud-based load balancing algorithms are reviewed This research study uses a variety of methods, which are applied to real-world situations, such as FIFO, PHMEFT, Markov Process, DRALBA, and GWO-PSO. Further, this study helps the cloud experts to choose the best load balancing algorithms for particular use cases, which improves the system performance and enables the efficient use of resources in cloud environments. © 2024 IEEE.

关键词： Cloud Computing Dynamic load balancing load balancing algorithms Resource Utilization Response Time Optimization

来源：评论

学校读者我要写书评

暂无评论

Parallel multi-core and multi-processor methods on point-value multiresolution algorithms for hyperbolic conservation laws

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 123卷 192-203页

作者： Soni, V. Hadjadj, A. Roussel, O. Moebs, G. Normandie Univ INSA Rouen CNRS CORIA F-76000 Rouen France Umea Univ Dept Phys S-90187 Umea Sweden Univ Nantes Jean Leray Math Lab UMR CNRS 6629 F-44300 Nantes France Cambridge Flow Solut Cambridge CB24 9AD England

The underlying sequential behavior of the multiresolution (MR) method has been exploited for parallel computing by introducing a concept of multiresolution forest structures (MFS) along with two new load-balancing algorithms. Another easy-to-implement multithreading approach has also been introduced for the multicore architectures. Tests were conducted using an Euler solver based on a fifth-order shock capturing WENO scheme and a third-order Runge-Kutta algorithm. The methods have been rigorously analyzed in terms of speedup ratio and parallel efficiency to bring forth their benefits as well as limitations. The performance yielded through these methods indicates that the MFS is a new headway for the MR method in parallel computing that has a potential to harness better scalability. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Multiresolution method Parallel computing load balancing algorithms Finite differences

来源：评论

学校读者我要写书评

暂无评论

A generic formal model for the comparison and analysis of distributed job-scheduling algorithms in grid environment

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 132卷 331-343页

作者： Ben Hafaiedh, Imene Univ Tunis El Manar UTM Higher Inst Comp Sci Tunis ISI Dept Software Engn & Informat Syst Tunis Tunisia

Nowadays, high-end Systems consist of thousands of individual devices which are in general heterogeneous. Grid computing environments are an example of high-end systems which are composed of many diverse and heterogeneous resources distributed within multiple geographical areas. The performance of such systems depends considerably on job scheduling and resource allocation algorithms. Indeed, to improve the global throughput of these environments, effective and efficient load balancing algorithms are fundamentally important. In this paper, we propose a completely distributed formal model for the description of grid architecture. Our model, is then parameterized to describe different job-scheduling algorithms in a completely parallel architecture. In particular, we focus on the modeling and description of distributed load-balancing algorithms. To reach this purpose, we define a set of parallel schedulers communicating together to achieve a given load-balancing policy. To show the applicability of our approach, we propose to specify and compare different well-known job-scheduling policies in grid environments. The formal verification of different properties of the studied protocols has been performed automatically using Model-checking and a set of performance analysis results are also provided. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Formal verification Distributed scheduling Grid computing environment load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

DLB3M : A noble load balancing algorithm for cloud computing services

引用

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES 2021年第5期42卷 1087-1113页

作者： Hossain, Md Alam Roy, Saumendu Sen, Sujit Kumar Hossain, Nazmul Jashore Univ Sci & Technol Dept Comp Sci & Engn Jashore 7408 Bangladesh

The idea of cloud computing is flourished on a basic principle of reusability of IT capabilities. It is completely a web-based technology, which enhances its usefulness as well as monitors PAYG model. Cloud computing follows the technology, services, applications that are analogous to those on the internet and shifts them into a self-service utility. Cloud computing synopsis the details of system implementation from developers and users. In cloud computing, load balancing is a ticklish topic. It is a procedure that utilizes several nodes and allocates dynamic workload among them. The original purpose of load balancing is the minimization of overall response time and best use of resources. This paper is largely concentrated on the DLB3M (Dynamic load balancing Max-Min and Max) algorithms. This reduces the overall response time compared to other load balancing algorithms. This paper describes briefly the DLB3M algorithm and why it is best suited in the cloud computing environment.

关键词： Cloud computing Virtualization VMs load balancing algorithms DLB3M

来源：评论

学校读者我要写书评

暂无评论

L3SFA: load Shifting Strategy for Spreading Factor Allocation in LoRaWAN Systems 45

L3SFA: Load Shifting Strategy for Spreading Factor Allocatio...

引用

45th Annual IEEE Conference on Local Computer Networks (LCN)

作者： Hamnache, Mohamed Kacimi, Rahim Beylot, Andre-Luc Univ Toulouse IRIT ENSEEIHT Toulouse France Univ Toulouse IRIT UT3 Toulouse France

ISBN: (纸本)9781728171586

LoRaWAN Enabled networks are expected to have a dizzying growth. Thus, an efficient allocation of wireless resources so as to support a large number of nodes is a major concern. In this paper we propose an SF assignment approach paying attention on the traffic load both per Spreading Factor and over the channels. Indeed, our strategy consists in finding a better distribution of the nodes on the SF by orchestrating an effective load balancing. Moreover, the performance of our solution is evaluated under diverse network configurations taking into account the capture effect and the non-orthogonality of SFs. In addition, we validated some assumptions by full-scale experiments like for the 3GPP path loss model which is used for the first time in LoRa simulations. Our results suggest that load Shifting leads to better performance in terms of DER (Date Extraction Rate) while guaranteeing good scalability on the network size and density.

关键词： LoRa networks resource allocation Spreading Factor capture-effect load balancing algorithms 3GPP urban path loss model Experiments

来源：评论

学校读者我要写书评

暂无评论

A Distributed Spanning Tree-Based Dynamic Self-Organizational Framework for Web Server 2nd

A Distributed Spanning Tree-Based Dynamic Self-Organizationa...

引用

2nd International Conference on Computer and Communication Technologies

作者： Amudhavel, J. Prabu, U. Saravanan, N. Dhavachelvan, P. Baskaran, R. Venkatachalapathy, V. S. K. SMVEC Dept Comp Sci & Engn Pondicherry India TCET Dept Informat Technol Vandavasi India Pondicherry Univ Dept CSE Pondicherry India Anna Univ Dept CSE Madras 600025 Tamil Nadu India SMVEC Dept Mech Engn Pondicherry India

ISBN: (纸本)9788132225263;9788132225256

Web services are playing a very important role in various business-based applications. There are an enormous amount of web services present and they are creating a huge web traffic. The organizations are trying to reduce the web traffic by having cluster-based web servers. It is a vital task to handle these cluster-based web servers while they have a varying load on it. These servers should be highly scalable and available. load balancing is an important technique to provide rapid response to the requests of the client. As the process of load balancing occurs fault tolerance should be taken care of. This paper focuses on the scalable, fault-tolerant, and load balancing mechanism of cluster-based web servers. The distributed spanning tree structure is used for balancing the client requests among the cluster-based servers. An architecture based on DST is proposed in this paper for cluster-based web servers.

关键词： Web server load balancing load balancing algorithms DST Based load balancing architecture

来源：评论

学校读者我要写书评

暂无评论

Dynamic Combination of Improved Max-Min and Ant Colony Algorithm for load balancing in Cloud System

Dynamic Combination of Improved Max-Min and Ant Colony Algor...

引用

International Conference on Computing, Communications and Networking Technologies

作者： NAVTEJ SINGH GHUMMAN RAJWINDER KAUR CSE DEPARTMENT SBS STATE TECHNICAL CAMPUS FEROZEPUR INDIA

ISBN: (纸本)9781479979851

Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources directly through internet. Users can use these resources and services as they want on pay per use concept. In cloud computing architecture load balancing is a very important issue. There are many algorithms for load balancing in cloud computing. All algorithms work different ways. We proposed a Improved Max-Min Ant colony Algorithm. Improved Max-Min used the concept of original Max-Min. Improved Max-Min is based on the execution time not on completion time as a selection basis. The main motive of our work is to balance the total load of cloud system .We try to minimizing the total makespan. We simulated results using the CloudSim toolkit Results show the comparison between improved max min and new hybrid improved Max-Min ant approach. It mainly focuses on total processing time and processing cost.

关键词： Cloud computing load balancing algorithms Improved Max- Min algorithm ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：