• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.73-80
• /
• 2023

The recent growth in the use of mobile devices has contributed to increased computing and storage requirements. Cloud computing has been used over the past decade to cater to computational and storage needs over the internet. However, the use of various mobile applications like Augmented Reality (AR), M2M Communications, V2X Communications, and the Internet of Things (IoT) led to the emergence of mobile cloud computing (MCC). All data from mobile devices is offloaded and computed on the cloud, removing all limitations incorporated with mobile devices. However, delays induced by the location of data centers led to the birth of edge computing technologies. In this paper, we discuss one of the edge computing technologies, i.e., cloudlet. Cloudlet brings the cloud close to the end-user leading to reduced delay and response time. An algorithm is proposed for scheduling tasks on cloudlet by considering VM's load. Simulation results indicate that the proposed algorithm provides 12% and 29% improvement over EMACS and QRR while balancing the load.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.37-47
• /
• 2011

Current researches in the Cloud focus on the appropriate interactions of cloud components in a large-scale system implementation. However, the current designs do not include intelligent methods like grouping the similar service providers based on their properties and integrating adaptive schemes for load distribution which can promote effective sharing of resource. This paper proposes an efficient virtualization of services by grouping the cloud providers to improve the service provisioning. The grouping of cloud service providers based on a cluster analysis collects the similar and related services in one group. The adaptive load balancing supports the service provisioning of the cloud system where it manages the load distribution within the group using an adaptive scheme. The proposed virtualization mechanism (GRALB) showed good results in minimizing message overhead and throughput performance compared to other methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.43-52
• /
• 2008

The paper presents the problem definition of video placement and efficient methods for placing video data on a cluster of video servers. The video placement is to place each of video replicas on one of the servers where the number and location of the servers are already determined. The rejection ratio of user requests is one of most important user-perceive performance measures, so it has been used as a performance criteria in many researches on the VOD system. The objective of our video placement is to achieve the load balancing among servers and the minimization of total network loads. To our experiment, the presented methods show better performance in terms of the rejection ratio of user requests than the methods for video placements in which only either server load balancing or network load minimization is considered. Also, it is observed that considerations on server load balancing is especially important in video placement. To our survey, little research has been published on video placement in which server and network load are considered together in a video server cluster environment.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.101-106
• /
• 2016

A femtocell network has been attracting attention as a promising solution for providing high data rate transmission over the conventional cellular network in an indoor environment. In this paper, we propose a distributed power control algorithm considering both indoor coverage and data load balancing in the femtocell network. As data traffic varies by time and location according to user distribution, each femto base station suffers from an unbalanced data load, which may degrade network performance. To distribute the data load, the base stations are required to adjust their transmission power dynamically. Since there are a number of base stations in practice, we propose a distributed power control algorithm. In addition, we propose the simple algorithm to detect the faulty base station and to recover coverage. We also explain how to insert a new base station into a deployed network. We present the simulation results to evaluate the proposed algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1457-1467
• /
• 2015

Depending on the type of Tx-Rx pairs, VHF Data Exchange System (VDES) for maritime communication is expected to employ the different frequency channels. Load imbalance between the different channels turns out to be a critical problem for the multi-hop communication using Ad-hoc Self-Organizing TDMA (ASO-TDMA) MAC protocol, which has been proposed to provide the connectivity between land station and remote ship stations. In order to handle the inter-channel load imbalance problem, we consider a model of the stochastic geomety in this paper. After analyzing the spatial reuse efficiency in each hop region by the given model, we show that the resource utility can be maximized by balancing the inter-channel traffic load with optimal resource allocation in each hop region.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.671-678
• /
• 2002

In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources'costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.45-52
• /
• 2008

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-Performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• New & Renewable Energy
• /
• v.16 no.4
• /
• pp.41-48
• /
• 2020

This study performed a single hole operation method using a balancing well-cross-mixed underground heat exchanger, and conducted thermal performance studies of an SCW-type underground heat exchanger using a two-well. The study attempted to change the existing operating method of the two adjacent SCW underground heat exchangers with one ball each. The SCW-type geothermal heat exchanger is considered to enable up to 20% of bleed discharge at maximum load, which makes groundwater usage unequal. The efficiency factor of the geothermal system was improved by constructing the discharged water by cross-mixing two balancing wells to prevent the discharge of groundwater sources and keep the temperature of the underground heat exchanger constant. As a result of the cooling and heating operation with the existing SCW heat exchange system and the balancing well-cross-mixed heat exchange system, the measured performance coefficient improved by 23% and 12% in cooling and heating operations, respectively. In addition, when operating with a balanced cross-mixing heat exchange system, it has been confirmed that the initial basement temperature is constant with a standard deviation of 0.08 to 0.12℃.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.22-37
• /
• 2013

Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.