• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.165-174
• /
• 2004

Because a quantity wireless internet contents is much less than wired internet contents, it exist high necessities that wired internet contents should be converted into wireless internet contents. The conversion server implemented in this paper, automatically recognizes the type of user agents when they request, retrieves source documents on the web site specified by an URL, generates metaXML documents as an intermediate form, and converts them wireless markup documents appropriate for user agents. The conversion server interoperates with the image converter for image conversion and the clipper which is an authoring tool for clipping existing wired internet documents. We performed experiments about capability of the conversion server transcoding static/dynamic web pages specified by an URL. According to performance results on dynamic web pages, the conversion server showed better throughput when a thread pool in the terror maintains 5 threads compared with 1 and 10 threads.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.557-560
• /
• 2005

The purpose of this study is to realize DHCP server based on embedded system. To achieve this, embedded Linux was ported in ez Bord-M01 mounted with Intel Strong ARM SA1110 processor, and ethernet-based network was constructed for network function. In this way, this study suggests embedded DHCP server where Window and Linux client hosts are dynamically configurated as network information by dynamically assigning network information in embedded board.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.171-174
• /
• 2011

서버 클러스터에서 부하 분산기는 사용자의 요청을 각 서버로 분산시키는 역할을 한다. 리눅스 가상 서버(LVS: Linux Virtual Server)는 소프트웨어적으로 사용되는 부하 분산기로서 여러 가지 스케줄링 방식들을 가지고 있다. 그러나 부하 분산 시에 서버의 유동적인 부하 정보를 반영하지 못하는 단점이 있다. 이에 개선된 방식으로 서버의 동시 연결 개수에 따라 상한계(Upper Bound)와 하한계(Lower Bound)를 설정하고, 요청을 분산하는 동적 스케줄링(Dynamic Scheduling)이 존재한다. 그러나 서버의 상태에 따라 상한계와 하한계가 바뀔 수 있음에도 불구하고 이 값들이 고정되어 있다는 단점을 가진다. 본 논문에서는 기존 부하 분산 방법의 단점을 극복하는 서버 전력 정보에 기반한 스케줄링 방식을 제안한다. 제안된 방식은 서버의 부하 정보를 기반으로 에너지를 추정하고 전력 수치를 기반으로 LVS의 가중치 테이블을 주기적으로 갱신한다. 그리고 부하 분산기는 클라이언트로부터 요청 받은 트래픽을 각 서버의 에너지 소모 상태에 따라 적용시킴으로써 에너지 소모가 최소화되도록 부하를 분산한다. 또한 서버의 상태에 따라 상한계와 하한계가 바뀔수 있음을 고려하여 상한계와 하한계를 설정하지 않고 서버의 상태에 따라 적절하게 요청이 분배되도록 하였다. 15대의 PC를 사용하여 실험을 수행하였으며, 실험 결과는 기존 부하 분산 알고리즘 중 성능이 가장 좋은 알고리즘에 비해 서버의 성능이 동일한 경우 성능 및 소비전력 면에서 거의 동등하였고, 서버의 성능이 상이한 경우 50.2% 성능 향상 및 27.3% 소비 전력 절감을 확인하였다.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.121-128
• /
• 2005

This paper describes the requested IP assignment and authentication problem for wireless internet service of visited ISP subscriber on GPRS network, and proposes to use RADIUS authentication and accounting server for these problems. In this paper, we also define signals between GGSN and RADIUS, and between RADIUS authentication server and accounting sever for IP management and wireless internet service.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.109-117
• /
• 2011

The exhibition industry, as technology-intensive, eco-friendly industry, contributes to regional and national development and enhancement of its image as well, if it joins cultural and tourist industry. Therefore, We need to revitalize the exhibition industry, as actively holding an exhibition event. However, to attract a number of exhibition audience, the work of enhancing audience satisfaction and awareness of value for participation should be prioritized after improving quality of service within exhibition hall. As one way to enhance the quality of service, it is thought that the way providing personalized service geared toward each audience is needed. that is, if audience avoids the complexity in exhibition space and it affords them service to enable effective time and space management, it will improve the satisfaction. All such personalized service affordable lets the audience's preference on the basis of each audience profile registered in advance online grasp. and Based on this information, it is provided with exhibition-related information suited their purpose that is the booth for the interesting audience, the shortest path to go to the booth and event via audience's smart phone. and it collects audience's reaction information, such as visiting the booth, participating the event through offered the information in this way and location information for the flow of movement, the present position so that it makes revision of existing each audience profile. After correcting the information, it extracts the individual's preference. hereunder, it provides recommend booth and event information. in other words, it provides optimal information for individual by amendment based on reaction information about recommending information built on basic profile. It provides personalized service dynamic and interactive with audience. This paper will be able to provide the most suitable information for each audience through circular and interactive structure and designed smart-phone application supportable for updating dynamic and interactive personalized service that is able to afford surrounding information in real time, as locating movement position through sensing. The proposed application collects user‘s context information and carrys information gathering function collecting the reaction about searched or provided information via sensing. and it also carrys information gathering function providing needed data for user in exhibition hall. In other words, it offers information about recommend booth of position foundation for user, location-based services of recommend booth and involves service providing detailed information for inside exhibition by using service of augmented reality, the map of whole exhibition as well. and it is also provided with SNS service that is able to keep information exchange besides intimacy. To provide this service, application is consisted of several module. first of all, it includes UNS identity module for sensing, and contain sensor information gathering module handling and collecting the perceived information through this module. Sensor information gathered like this transmits the information gathering server. and there is exhibition information interfacing with user and this module transmits to interesting information collection module through user's reaction besides interface. Interesting information collection module transmits collected information and If valid information out of the information gathering server that brings together sensing information and interesting information is sent to recommend server, the recommend server makes recommend information through inference with gathered valid information. If this server transmit by exhibition information process, exhibition information process module is provided with user by interface. Through this system it raises the dynamic, intelligent personalized service for user.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.135-144
• /
• 2012

All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.956-963
• /
• 2006

This research studies multi participant consistency and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted frequence, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dynamic data path prediction, the tests the location prediction error between Dead-reckoning convergence interval and error of prediction and actual condition one time above threshold it interpolates a previously location. The shared dynamic data of the 3D virtual environment is implementation using the VRML EAI.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.4
• /
• pp.93-105
• /
• 2002

In this paper forest fire status information management system was developed under web environment using web GIS(geographic information system) technology. Though this system, general users can easily retrieval domestic forest fire status information and obtain that in visual way such as maps, graphs, and texts if they have only certain web browsers. Moreover, officials, who have system access authority, can easily control and manage all domestic forest fire status information through input interface, retrieval interface, and out interface of the system. This system can be considered as the first domestic system to manage forest fire status data and service them in visual through user friendly interfaces on web. In order to implement this system, IIS 5.0 of Microsoft is used as web server and Oracle 8i and ASP(active server page) are used for database construction and dynamic web page operation, respectively. Also, ArcGIS IMS(internet map server) of ESRI is used to serve maps by using Java and HTML as system development languages. Not only the domestic tendency of forest fire but also the forest fire status information of certain area and time such as the frequency and the loss can be presented through distribution maps, graphs and tables. Therefore, this system is supposed to play as a important role when the policy relate to domestic forest fire is established. In addition, the self consciousness of people against forest fire can be inspired and the foundation of scientific and systemic forest fire services can be obtained through this system in the future.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.30-39
• /
• 2013

Web crawler should maintain fresh data with minimum server overhead for large amount of data in the web sites. The overhead in the server increases rapidly as the amount of data is exploding as in the big data era. The amount of web information is increasing rapidly with advanced wireless networks and emergence of diverse smart devices. Furthermore, the information is continuously being produced and updated in anywhere and anytime by means of easy web platforms, and smart devices. Now, it is becoming a hot issue how frequently updated web data has to be refreshed in data collection and integration. In this paper, we propose dynamic web-data crawling methods, which include sensitive checking of web site changes, and dynamic retrieving of web pages from target web sites based on historical update patterns. Furthermore, we implemented a Java-based web crawling application and compared efficiency between conventional static approaches and our dynamic one. Our experiment results showed 46.2% overhead benefits with more fresh data compared to the static crawling methods.