• 디지털산업정보학회논문지
• /
• 제10권3호
• /
• pp.35-40
• /
• 2014

Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.

• 한국시뮬레이션학회논문지
• /
• 제13권4호
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• 전자공학회논문지A
• /
• 제29A권11호
• /
• pp.25-39
• /
• 1992

Due to the data processing development by the computer, the early warning system recently has made a remarkable evolution in its functions and performance as a component of the communication and control system which is also supported by the computer communication and intelligence system. In this paper it is presented that a integrated data processing system is designed to integrate the information sent from the various radar systems which constitute an early warning system. The suggested system model of this paper is devided into two types of structures, the centralized model and the distributed model, according to the data processing algorithm. We apply the queueing theory to analyse the performance of the designed models and the OPNET system kernel to make the analysing program with C language. From the analysis of the queueing components by applying the analysis programs to the designed systems, we got the tendancies and characteristics of both models, that is, a fast data processing performance of the distributed model and a stable data processing capability of the centralized model.

• 디지털산업정보학회논문지
• /
• 제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.

• 인터넷정보학회논문지
• /
• 제21권5호
• /
• pp.39-48
• /
• 2020

Recently, the study and development of environment-friendly energy technique have increased in worldwide due to environmental pollution and energy resources problems. In vehicle industry, the development of electric vehicle(EV) is now on progress, and also, many other governments support the study and development and make an effort for EV to become widely available. In addition, though they strive to construct the EV infra such as a charge station for EV, the techniques related to managing charge demand and peak power are not enough. The standard of EV communication has been already established as ISO/IEC 15118, however, most of implemented EVs and EV charge stations do not support any communication between each of them. In this paper, an improved slow charge scheme for non-communication EVs is proposed and designed by using predicting charge demand. The proposed scheme consists of distributed charge model and charge demand prediction. The distributed charge model is designed to manage to distribute charge power depending on available charge power and charge demand. The charge demand prediction is designed to be used in the distributed charge model. The proposed scheme is based on the collected data which were from EV slow charge station in business building during the past 1 year. The system-level simulation results show that the waiting time of EV and the charge fee of the proposed scheme are better than those of the conventional scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.494-513
• /
• 2019

A multi-channel access problem based on hypergraph model in ultra-dense small cell networks is studied in this paper. Due to the hyper-dense deployment of samll cells and the low-powered equipment, cumulative interference becomes an important problem besides the direct interference. The traditional binary interference model cannot capture the complicated interference relationship. In order to overcome this shortcoming, we use the hypergraph model to describe the cumulative interference relation among small cells. We formulate the multi-channel access problem based on hypergraph as two local altruistic games. The first game aims at minimizing the protocol MAC layer interference, which requires less information exchange and can converge faster. The second game aims at minimizing the physical layer interference. It needs more information interaction and converges slower, obtaining better performance. The two modeled games are both proved to be exact potential games, which admit at least one pure Nash Equilibrium (NE). To provide information exchange and reduce convergecne time, a cloud-based centralized-distributed algorithm is designed. Simulation results show that the proposed hypergraph models are both superior to the existing binary models and show the pros and cons of the two methods in different aspects.

• 디지털콘텐츠학회 논문지
• /
• 제8권1호
• /
• pp.27-33
• /
• 2007

그리드(Grid)는 WWW 컴퓨팅 모델을 계승할 차세대 분산 처리 모델이며, 자바 언어는 그리드 시스템을 설계하고 구현하는 훌륭한 개발 언어이다. 자바언어는 분산 처리를 위해 개발되었으며, 현재 WWW 응용 개발에 널리 사용되고 있다. 본 논문에서는 그리드의 기본 개념을 소개하고, 자바 언어를 사용한 컴퓨팅 그리드를 설계하고 구현하였다. 구현된 컴퓨팅 그리드에 알맞은 분산 응용 프로그램의 실행 결과를 분석하였다. 본 논문에서 구현된 그리드에 사용된 분산 멀티미디어 응용의 실행 결과는 기존의 시스템에 비하여 매우 향상된 성능을 보여주고 있다.

• 한국전자파학회:학술대회논문집
• /
• 한국전자파학회 2003년도 종합학술발표회 논문집 Vol.13 No.1
• /
• pp.38-42
• /
• 2003

In this paper, a radar scattering model for forest canopies has been developed based on an empirical rough surface scattering model and the radiative transfer theory. Leaves in the forest canopy are modeled by rectangular resistive sheets, brunches and trunks are modeled by cylinder, which sizes and orientations are randomly distributed. The scattering model has been verified with the measurement data of JPL/AirSAR system.

• 한국전자거래학회지
• /
• 제1권1호
• /
• pp.227-247
• /
• 1996

Presented in this paper is a control model for developing virtual factory simulator, which is being operated under the distributed environment. The control model consists of production activity plan and information flows. To incorporate elements of the characteristics of the distributed control system, we suggested a collaboration model. This model is working under the client/server architecture, and also designed for cooperative-distributed shop control(CDSC) system in order to exploit several advantages of client/server architecture. Collaboration among each agent(or client) is done through negotiation and task sharing. Based on a contract net model, the CDSC system has three kinds of agents-order agent, resource agent, and communication forwarding agent. Each agent performs shop scheduling and control through negotiation on contract net. No node in CDSC system can have authority over other node. A bidding scheme is employed far negotiation between order agent and resource agents. The CDSC system can support re-negotiation among resource agents and an algorithm for re-negotiation is also developed. Experimental results are shown to advocate the effectiveness of the CDSC system for CIM environments.

• ETRI Journal
• /
• 제20권2호
• /
• pp.149-170
• /
• 1998

Between a wide range of distributed applications, this work is particularly focused on those applications which allow a group of persons, who are geographically distributed, to interact and cooperate exchanging different kind of information in order to realize group activities in a common work environment. In this paper we realized a study of this kind of applications to identify general and functional characteristics which will then enable us to determine their communication requirements. Also, we analyzed the existent support architectures to examine whether they support multimedia cooperative applications. Based on the results of analysis, we proposed a set of communication functions needed additionally to support these applications, using the ODP(Open Distributed Processing) modelling concepts, rules and view points as our global design methodology.