• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2597-2615
• /
• 2013

This paper proposes a dynamic downlink load control scheme that jointly employs dynamic load threshold management and virtual coverage management schemes to reduce the degree of performance degradation due to traffic overload in two-tier femtocell networks. With the proposed scheme, the downlink load in a serving macrocell is controlled with a load threshold which is adjusted dynamically depending on the varying downlink load conditions of neighboring macrocells. In addition, traffic overloading is alleviated by virtually adjusting the coverage of the overloaded serving macrocell, based on the adjusted load threshold of the serving macrocell. Simulation results show that the proposed scheme improves the performance of two-tier femtocell networks in terms of the outage probability and sum throughput. This improvement is significantly increased with appropriate values of load thresholds and with an intermediate-level adjustment of the virtual coverage area (i.e., handover hysteresis margin: HOM). Furthermore, the proposed scheme outperforms both a previously proposed load control scheme with a static load threshold and the LTE system without a HOM adjustment.

• Geomechanics and Engineering
• /
• v.16 no.2
• /
• pp.113-124
• /
• 2018

Under repeated loading, the residual stresses within the subgrade and subsoil can accelerate the deformation of the road structures. In this paper, a series of laboratory cyclic loading model tests and small-scale model tests were conducted to investigate the dynamic stress response within soils under different loading conditions. The experimental results showed that a dynamic stress accumulation effect occurred if the soil showed cumulative deformation: (1) the residual stress increased and accumulated with an increasing number of loading cycles, and (2) the residual stress was superimposed on the stress response of the subsequent loading cycles, inducing a greater peak stress response. There are two conditions that must be met for the dynamic stress accumulation effect to occur. A threshold state exists only if the external load exceeds the cyclic threshold stress. Then, the stress accumulation effect occurs. A higher loading frequency results in a higher rate of increase for the residual stress. In addition to the superposition of the increasing residual stress, soil densification might contribute to the increasing peak stress during cyclic loading. An increase in soil stiffness and a decrease in dissipative energy induce a greater stress transmission within the material.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.105-108
• /
• 2000

As Internet and WWW grow rapidly, the role of web servers is getting more important, and the number of users in a few popular site is also explosively increasing. Load balancing in clustered web server systems is important task to utilize whole system effectively, so dynamic load balancing is required to overcome the limit of static load balancing. In this paper, we propose two dynamic load balancing schemes, and analyzed load model and Performance improvement and also compare existing load balancing methods and IP filtering method. In case of load balancing with threshold, little extra traffic was required for better performance, but in case of load balancing with load weight, we found that the performance mainly depends on information exchange rate.

• Wind and Structures
• /
• v.19 no.1
• /
• pp.1-14
• /
• 2014

Rail-mounted cranes can be easily damaged by a sudden gust of wind while working at a running speed, due to the large mass and high barycenter positions. In current designs, working rail-mounted cranes mainly depend on wheel braking torques to resist large wind load. Regular brakes, however, cannot satisfactorily stop the crane, which induces safety issues of cranes and hence leads to frequent crane accidents, especially in sudden gusts of wind. Therefore, it is necessary and important to study the braking performance of working rail mounted cranes under wind load. In this study, a simplified mechanical model was built to simulate the working rail mounted gantry crane, and dynamic analysis of the model was carried out to deduce braking performance equations that reflect the qualitative relations among braking time, braking distance, wind load, and braking torque. It was shown that, under constant braking torque, there existed inflection points on the curves of braking time and distance versus windforce. Both the braking time and the distance increased sharply when wind load exceeded the inflection point value, referred to as the threshold windforce. The braking performance of a 300 ton shipbuilding gantry crane was modeled and analyzed using multibody dynamics software ADAMS. The simulation results were fitted by quadratic curves to show the changes of braking time and distance versus windforce under various mount of braking torques. The threshold windforce could be obtained theoretically by taking derivative of fitted curves. Based on the fitted functional relationship between threshold windforce and braking torque, theoretical basis are provided to ensure a safe and rational design for crane wind-resistant braking systems.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.868-870
• /
• 2004

ad-hoc 망에서 라우팅 프로토콜의 부하균등(load balancing)은 이동성과 전송 지연사이의 trade-off로 인하여 성능 관점에서 중요한 이슈가 되어왔다. 부하균등을 고려한 SLAP(Simple Load-balancing Ad-hoc routing Protocol)이 제안되었으나 혼잡이 발생하거나 망의 토폴로지가 변화하였을 때 유연하게 대처하지 못한다. 본 논문에서는 ad-hoc 망에서 트래픽 혼잡 제어와 망의 이동성에 적응하기 위하여 동적인 임계치를 사용하는 부하균등 라우팅 프로토콜을 제안하였다. 제안된 프로토콜은 성능은 GloMoSim으로 시뮬레이션을 수행하여 AODV, DSR, SLAP과 지연, 패킷 전송률 등을 비교하여 평가하였다.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.63-72
• /
• 2007

This paper introduces a load-balancing algorithm focusing on distributing web requests evenly into the web cluster servers. The load-balancing algorithms based on conventional periodic load-information update mechanism are not suitable for dynamic page applications, which are common in Cyber Foraging services, due to the problems caused by periodic synchronized load-information updating and the difficulties of work load estimation caused by embedded executing scripts of dynamic pages. Update-on-Finish algorithm solves this problem by using non-periodic load-update mechanism, and the web switch knows the servers' real load information only after their reporting and then distributes new loads according to the new load-information table, however it results in much communication overhead. Our proposed mechanism improve update-on-finish algorithm by using K-Percents-Finish mechanism and thus largely reduce the communication overhead. Furthermore, we consider the different capabilities of servers with a threshold Ti value and propose a load-balancing algorithm for servers with various capabilities. Simulation results show that the proposed K-Percents-Finish Reporting mechanism can at least reduce 50% communication overhead than update-on-finish approach while sustaining better load balancing performance than periodic mechanisms in related work.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Journal of Korean Association for Spatial Structures
• /
• v.20 no.2
• /
• pp.77-85
• /
• 2020

This paper examined the dynamic instability of a shallow arch according to the response characteristics when nearing critical loads. The frequency changing feathers of the time-domain increasing the loads are analyzed using Fast Fourier Transformation (FFT), while the response signal around the critical loads are analyzed using Hilbert-Huang Transformation (HHT). This study reveals that the models with an arch shape of h = 3 or higher exhibit buckling, which is very sensitive to the asymmetric initial conditions. Also, the critical buckling load increases as the shape increases, with its feather varying depending on the asymmetric initial conditions. Decomposition results show the decrease in predominant frequency before the threshold as the load increases, and the predominant period doubles at the critical level. In the vicinity of the critical level, sections rapidly manifest the displacement increase, with the changes in Instantaneous Frequency (IF) and Instant Energy (IE) becoming apparent.

• International Journal of Contents
• /
• v.8 no.4
• /
• pp.7-11
• /
• 2012

Cloud Computing can be viewed as a dynamically-scalable pool of resources. Virtualization is one of the key technologies enabling Cloud Computing functionalities. Virtual machines (VMs) scheduling and allocation is essential in Cloud Computing environment. In this paper, two dynamic VMs scheduling and allocating schemes are presented and compared. One dynamically on-demand allocates VMs while the other deploys optimal threshold to control the scheduling and allocating of VMs. The aim is to dynamically allocate the virtual resources among the Cloud Computing applications based on their load changes to improve resource utilization and reduce the user usage cost. The schemes are implemented by using SimPy, and the simulation results show that the proposed adaptive scheme with one threshold can be effectively applied in a Cloud Computing environment both performance-wise and cost-wise.