• 디지털산업정보학회논문지
• /
• 제13권4호
• /
• pp.153-162
• /
• 2017

Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.197-201
• /
• 2003

We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제9권1호
• /
• pp.25-32
• /
• 2003

오늘날 사람들의 많은 관심을 끌고 있는 생명 공학 분야에서, 가상 검색은 컴퓨터에서 가상적으로 시뮬레이션을 수행함으로서 특정 질병에 관여하는 물질을 널다 빠르게 추출하여 신약을 설계하는 방법이다. 본 논문에서는 지역적으로 분산된 유휴 또는 전략적 자원을 이용하여 가상 검색을 효과적으로 수행할 수 있는 분산 시스템인 DVSF(Distributed Virtual Screening Facilities)를 소개한다. DVSF는 중소규모의 실험실이 가지고 있는 유휴 자원을 이용하여 최소한의 비용으로 효과적인 신약 개발을 위한 환경을 구성할 수 있도록 개발되었다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2005년도 전력전자학술대회 논문집
• /
• pp.704-706
• /
• 2005

According to the second scheme of the Korean Government about technology development, utilization and popularization of new ${\cdot}$ renewable energy, the continuous growth of distributed resources are expected. But there is a few paper about recloser and sectionalizer coordination and protection scheme in distribution system interconnected a number of distributed resources. In this paper, it is dealt with that recloser and sectionalizer coordination at the cases concerned with position among protection devices. Adding distributed resource, the problems of each case are investigated through simulation.

• Journal of Communications and Networks
• /
• 제11권4호
• /
• pp.350-358
• /
• 2009

In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its application in an online structural health monitoring (SHM) system. The objective is to recover a damage severity vector, which identifies, localizes, and quantifies damages in a structure, via distributive and collaborative decision-making among wireless sensors. Observing the fact that damages are generally scarce in a structure, this paper develops a nonlinear 0-norm minimization formulation to recover the sparse damage severity vector, then relaxes it to a linear and distributively tractable one. An optimal algorithm based on the alternating direction method of multipliers (ADMM) and a heuristic distributed linear programming (DLP) algorithm are proposed to estimate the damage severity vector distributively. By limiting sensors to exchange information among neighboring sensors, the distributed decision-making algorithms reduce communication costs, thus alleviate the channel interference and prolong the network lifetime. Simulation results in monitoring a steel frame structure prove the effectiveness of the proposed algorithms.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권11호
• /
• pp.518-524
• /
• 2005

This paper presents an analytical method for the reliability evaluation of distribution system, including the distributed generations. Unlike the large sized generations of transmission system, the distributed generations have complexities in analyzing and determining the operation. In the process of evaluate reliability, it can be shown that the analytical method is simpler than the Monte-Carlo simulation and the method using Load Duration Curve model is more accurate than that using peak load model. The modeling of distributed generation to analysis distribution system reliability using LDC is proposed in this Paper, and is compared with the MCS method as a result of case studies.

• 전기학회논문지
• /
• 제60권2호
• /
• pp.279-284
• /
• 2011

Harmonic distortions in current waveform may cause significant problems in electric power system facility and operation. This paper presents an adaptive parameter estimation method to detect harmonic current components caused by nonlinear loads. In addition, a coordination strategy for multiple inverter-interfaced distributed generators to compensate the harmonic currents is discussed. The coordination strategy is realized by distributing the harmonic compensation participation index to individual distributed generators. The harmonic compensation participation index can be determined by the amount of remaining power generation capacity of each distributed generator. Simulation results based on switching-level inverter models show that the proposed harmonic detection method has good performance and the coordination strategy can improve harmonic problems efficiently.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2017년도 전력전자학술대회
• /
• pp.180-181
• /
• 2017

Recently as distributed source has increased, the distribution system has changed from unidirectional power flow to bi-directional power flow. This power flow causes the PCC voltage variation, which can adversely affect voltage sensitive loads. In this paper, the relation between the active power, reactive power and PCC voltage of the distributed source is analyzed, and the PCC voltage control scheme by reactive power compensation is proposed in the distributed source itself. In addition, limitations and conditions according to the standard for interconnecting distributed resources are specified and verified through simulation.

• 한국정보통신학회논문지
• /
• 제24권11호
• /
• pp.1558-1561
• /
• 2020

In this paper, we propose a blockchain scheme to enhance fault tolerance in distributed storage blockchain systems. Traditional blockchain systems suffer from ever-increasing storage cost. To overcome this problem, distributed storage blockchain techniques have been proposed. Distributed storage blockchain schemes effectively reduce the storage cost, but there are still limitations in reducing recovery cost and fault tolerance. The proposed approach recovers multiple errors within a group by utilizing locally repairable codes with availability. This improves the fault tolerance of the blockchain systems. Simulation results show that the proposed scheme enhances the fault tolerance while minimizing storage cost and recovery cost compared to other state-of-art schemes.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.313-324
• /
• 2005

The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.