• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.36-43
• /
• 2005

This paper suggests a method to effectively apply an application model of fuzzy-neural network to the optimal load distribution algorithm, considering the complication and non-linearity of the web server environment. We use the clustering web server in the linux system and it consists of a load balancer that distributes the network loads and some of real servers that processes the load and responses to the client. The previous works considered only with the scrappy decision information such as the connections. That is, since the distribution algorithm depends on the input of the whole network throughput, it was proved inefficient in terms of performance improvement of the web server. With the proposed algorithm, it monitors the whole states of both network input and output. Then, it infers CPU and memory states of each real server and effectively distributes the requests of the clients. In this paper, the proposed model is compared with the previous method through simulations and we analysis the results to develop the optimal and intelligent load balancing model.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

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 solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.829-831
• /
• 2005

실시간 시스템이란 시간적인 제한을 가지고 작업 수행 결과의 정확도가 보장되는 시스템으로 경성 실시간 시스템과 연성 실시간 시스템으로 분류된다. 최근 분산 실시간 분야에서 새로운 패러다임으로써 폭넓게 활용되기 시작한 실시간 객체 모델인 TMO는 Kane Kim과 Kopetz에 의해 처음 제안되었다. TMO 모델은 경성 또는 연성 실시간 응용과 병렬 컴퓨팅 응용 프로그램에서 사용 될 수 있으며, 시스템의 기능적인 면과 시간 조건 수행 모두를 명확히 정의할 수 있다. TMO의 네트워크로 구성되는 실시간 분산 환경에서의 실행을 위해 몇 개의 TMO 실행 엔진이 개발 되었는데, 그 중에서 LTMOS라는 리눅스 기반의 연성 실시간 미들웨어 엔진이 한국외대 RTDCS lab.에서 개발되었다. 하지만 LTMOS의 실시간 시스템 수행 중 작업량의 과부하로 인한 deadline 위반이나, 시스템간의 분산 IPC 통신에 있어서 Channel Traffic이 빈번한 경우 실시간 시스템을 유지할 수 없다는 문제점들을 갖고 있다. 이러한 문제점들을 해결하고 조금 더 효율적인 실시간 시스템을 유지하기 위해서, TMO 프로그램의 resource 정보를 담고 있는 ODS(Object Data Store)만을 다른 노드에 있는 자신의 TMO 프로그램 Replica로 이주해서 실시간 로드 밸런싱을 구현하는 기법을 사용하였다. 이에 본 논문에서는 TMO 프로그램들의 deadline 위반 및 Channel Traffic 부하를 감지할 수 있는 Node Monitor와 최적의 노드를 선별할 수 있는 Migration Manager를 새롭게 추가하였고, 쓰레드들의 스케줄러인 WRMT에 이주 작업을 하기 위한 부가적인 기능을 구현하였다. 2D 이미지의 관측점을 줄여 계산량을 대폭 감소시키는 장점을 갖는다.것으로 조사되었으며 40대 이상의 연령층은 점심비용으로 더 많은 지출을 하고 있는 것으로 나타났다. 4) 끼니별 한식에 대한 선호도는 아침식사의 경우가 가장 높았으며, 이는 40대와 50대에서 높게 나타났다. 점심 식사로 가장 선호되는 음식은 중식, 일식이었으며 저녁 식사에서 가장 선호되는 메뉴는 전 연령층에서 일식, 분식류 이었으며, 한식에 대한 선택 정도는 전 연령층에서 매우 낮게 나타났다. 5) 각 연령층에서 선호하는 한식에 대한 조사에서는 된장찌개가 전 연령층에서 가장 높은 선호도를 나타내었고, 김치는 40대 이상의 선호도가 30대보다 높게 나타났으며, 흥미롭게도 30세 이하의 선호도는 30대보다 높게 나타났다. 그 외에도 떡과 죽에 대한 선호도는 전 연령층에서 낮게 조사되었다. 장아찌류의 선호도는 전 연령대에서 낮았으며 특히 30세 이하에서 매우 낮게 조사되었다. 한식의 맛에 대한 만족도 조사에서는 연령이 올라갈수록 한식의 맛에 대한 만족도는 낮아지고 있었으나, 한식의 맛에 대한 만족도가 높을수록 양과 가격에 대한 만족도는 높은 경향을 나타내었다. 전반적으로 한식에 대한 선호도는 식사 때와 식사 목적에 따라 연령대 별로 다르게 나타나고 있으나, 선호도는 성별이나 세대에 관계없이 폭 넓은 선호도를 반영하고 있으며, 이는 대학생들을 대상으로 하는 연구 등에서도 나타난바 같다. 주 5일 근무제의 확산과 초 중 고생들의 토요일 휴무와 더불어 여행과 엔터테인먼트산업은 더욱 더 발전을 거듭하고 있으며, 외식은 여행과 여가 활동의 필수적인 요소로써 그 역할을 일조하고 있다. 이와 같은 여가시간의 증가는 독신자들에게는 좀더 많은 여유시간을 가족을

• The Journal of the Korea Contents Association
• /
• v.1 no.1
• /
• pp.51-58
• /
• 2001

Electronic commerce system must provide convenient interface, easy and fast searching function, and production information satisfying customers. To do this, many kinds of studies are being advanced actively about electronic commerce system using intelligent agent electronic This paper suggests 2-tier electronic commerce system using intelligent multi agent. We propose a combined reasoning agent system which provides production information satisfying customer's needs using both case-based reasoning and rule-based reasoning. And this system distribute network and sewer system load based on load balancing and 2-tier agent structure. This system can find production information through teaming of rule-based reasoning method and case-based reasoning method. This system can provide the best suitable production information to customers by using combined reasoning agent system. And we can prevent customer's unexpected long waiting causes by network traffic and server load.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.497-504
• /
• 2018

This paper studies about the Oriental Medical Expert System, based on Open Source Drools for rule engine processing, which contains scalability, availability, and modifiability. The system is developed with the Spring MVC framework and Ajax for stable services of the Web-based Medical Expert System. The diagnosis and treatment process of this Medical Expert system provides a service that provides the general users to accesses the web with a series of questionnaires. In order to compensate for the asynchronous communication between clients and services, and also for the complicated JDBC weaknesses, we applied the data handling in JSON to reduce the servers' loads, and also the Mybatis framework to improve the performance of the RDBMS, respectively. In addition, as the number of users increases to cope with the maximum available services of the web-based system, the load balancing structure using Nginx has been developed to solve the server traffic problems and the service availability has been increased. The experimental results show the stable services by approving the scalability test.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1270-1273
• /
• 2007

최근 인터넷의 급속한 발달은 온라인 뱅킹, 인터넷 쇼핑몰 등에서의 실물 경제행위를 온라인상으로 처리할 수 있는 환경을 제공하지만 온라인상의 업무처리는 개인정보유출, 개인정보의 위조 및 변조 등의 문제를 가지고 있다. 사용자가 CA에게서 받은 인증서의 공개키로 전자서명 함으로써 개인정보유출, 정보의 위조 및 변조 등의 문제를 해결한 PKI(Public Key Infrastructure)기반의 인증서 검증시스템이 제안되어 사용되고 있다. 인증서 상태검증 방법에는 CRL(Certificate Revocation List)기반의 검증방식, OCSP(Online Certificate Status Protocol)기반의 검증방식 등이 있다. CRL기반의 인증서 검증방식은 인증서 취소목록을 검색해서 인증서의 유효성 여부를 응답하는 방식으로 시간이 지남에 따라 크기 증가와 오프라인 방식으로 인해서 목록을 다운받는 시간의 부담으로 인해서 OCSP방식이 제안되었다. 하지만 OCSP 방식 역시 서비스의 요청이 집중될 경우 문제가 발생될 수 있다. 그래서 분산된 OCSP를 구축하고 각 서버의 부하의 균형을 유지하기 위해 로드밸런싱 기법을 사용하고 있지만 그 방법 역시 지속적인 서비스 제공이 불가한 문제를 가지고 있다. 본 논문에서는 서비스 요청의 집중으로 인한 시스템 마비나 각 응답서버의 부하가 불균형적임으로써 생길 수 있는 문제를 해결할 수 있는 방법을 제안한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2018

In South Korea, Jeju Island has a role as a test bed for electric vehicles (EVs). All conventional cars on the island are supposed to be replaced with EVs by 2030. Accordingly, how to effectively set up EV charging stations (EVCSs) that can charge EVs is an urgent research issue. In this paper, we present a case study on planning the locations of EVCS for Jeju Island, South Korea. The objective is to determine where EVCSs to be installed so as to balance the load of EVCSs while satisfying demands. For a public service with EVCSs by some government or non-profit organization, load balancing between EVCS locations may be one of major measures to evaluate or publicize the associated service network. Nevertheless, this measure has not been receiving much attention in the related literature. Thus, we consider the measure as a constraint and an objective in a mixed integer programming model. The model also considers the maximum allowed distance that drivers would detour to recharge their EV instead of using the shortest path to their destination. To solve the problem effectively, we develop a heuristic algorithm. With the proposed heuristic algorithm, a variety of numerical analysis is conducted to identify effects of the maximum allowed detour distance and the tightness of budget for installing EVCSs. From the analysis, we discuss the effects and draw practical implications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.81-91
• /
• 2012

Presently in 2011, there are countless attacking tools oriented to invading security on the internet. And most of the tools are possible to conduct the actual invasion. Also, as the program sources attacking the weaknesses of PS3 were released in 2010 and also various sources for attacking agents and attacking tools such as Stuxnet Source Code were released in 2011, the part for defense has the greatest burden; however, it can be also a chance for the defensive part to suggest and develop methods to defense identical or similar patterned attacking by analyzing attacking sources. As a way to cope with such attacking, this study divides the network areas targeted for attack based on load balancing by the approach gateways and communication lines according to the defensive policies by attacking types and also suggests methods to multiply communication lines. The result of this paper will be provided as practical data to realize defensive policies based on high hardware performances through enhancing the price competitiveness of hardware infrastructure with 2010 as a start.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.4
• /
• pp.113-120
• /
• 2023

Smart farms are steadily increasing in research to minimize labor, energy, and quantity put into crops as IoT technology and artificial intelligence technology are combined. However, research on efficiently managing crop growth information in smart farms has been insufficient to date. In this paper, we propose a management technique that can efficiently monitor crop growth information by applying autonomous sensors to smart farms. The proposed technique focuses on collecting crop growth information through autonomous sensors and then recycling the growth information to crop cultivation. In particular, the proposed technique allocates crop growth information to one slot and then weights each crop to perform load balancing, minimizing interference between crop growth information. In addition, when processing crop growth information in four stages (sensing detection stage, sensing transmission stage, application processing stage, data management stage, etc.), the proposed technique computerizes important crop management points in real time, so an immediate warning system works outside of the management criteria. As a result of the performance evaluation, the accuracy of the autonomous sensor was improved by 22.9% on average compared to the existing technique, and the efficiency was improved by 16.4% on average compared to the existing technique.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.25-30
• /
• 2010

Wireless sensor networks is composed of many similar sensor nodes with limited resources. They are randomly scattered over a specific area and self-organize the network. For guarantee of network life time, load balancing and scalability in sensor networks, sensor networks needs the clustering algorithm which distribute the networks to a local cluster. In existing clustering algorithms, the cluster head selection method has two problems. One is additional communication cost for finding location and energy of nodes. Another is unequal clustering. To solve them, this paper proposes a novel cluster head selection algorithm revised previous clustering algorithm, LEACH. The simulation results show that the energy compared with the previous clustering method is reduced.