• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.305-307
• /
• 2012

World Wide Web (WWW)의 지속적인 성장으로 인해 Web Service의 Response Time을 수집하는 방식에 관한 연구가 진행되고 있다. 현재 Client Response Time을 수집하는 방식은 sniffer[1] 를 이용한 Agent 방식을 사용하고 있다. 하지만, 기존의 방식은 클라이언트 PC에 설치되어 수집하게 되므로 Agent의 설치가 쉽지 않고, 관리 또한 어려운 문제점을 갖고 있다. 이러한 문제점을 개선하기 위하여, 본 논문에서는 Web Application Server (WAS)[2] 에서의 Dynamic HTML 변경을 통해 Client에 추가적인 Application을 설치하지 않고도 Client의 Response Time을 Collection하는 방식에 대하여 제안하였다. 이를 통해, 사용자 (End-User)에게 추가적인 응용 프로그램을 설치하지 않고도 Dynamic HTML 을 이용하여 Client Response Time을 수집함과 동시에 Server에 Feedback할 수 있다.

• Journal of Navigation and Port Research
• /
• v.35 no.9
• /
• pp.735-740
• /
• 2011

It is necessary to develop the one stop system in order to protect our marine environment rapidly from oil spill accident. The purpose of this study is to develop real time database for oil spill prediction modeling and implement real time prediction modelling with ESI and server-client GIS based user interface. The existing oil spill prediction model cannot provide one stop information system for public and government who should protect sea from oil spill accident. The development of multi user based information system permits integrated handling of real time meteorological data from external ftp. A server-client GIS based model is integrated on the basis of real time database and ESI map to provide the result of the oil spill prediction model. End users can access through the client interface and request analysis such as oil spill prediction and GIS functions on the network as their own purpose.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.9
• /
• pp.223-228
• /
• 2016

Nowadays users of Virtual Environment are want to play with thousands of players in an evolving virtual world at the same time over the internet. So, the load of this kind of Virtual Environments is heavier than that of any other precedents. One of load balancing methods is map-partition to divide the load of entire system which is vulnerable to delay message between clients and servers. In this paper, we propose a Migration Agent application server architecture using to help migration of player character between field servers and to reduce response time between clients and field servers. Migration Agent is reduce Player Character's responds time as Cache Server, if Player Character move to another Field Server, Player Character need the synchronization process in the DBMS approach, to minimize response time by reducing the period for cross - Player Character Field Server to perform the role. Field Server by placing them in form of a stack existing form of grid, for load concentrated on a specific server.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.238-241
• /
• 2002

With the popularity of utilization of the Internet among people, the amount of data in the network rapidly increased. So that, the fall of response time from WWW server, which is caused by the network traffic and the burden on m server, has become more of an issue. This problem is encouraged the rearch by redundancy of requesting the same pages by many people, even though they browse the same the ones. To reduce these redundancy, WWW cache server is used commonly in order to store m page data and reuse them. However, the technical uses of WWW cache that different from CPU and Disk cache, is known for its difficulty of improving the cache hit rate. Consecuently, it is difficult to choose effective WWW data to be stored from all data flowing through the WWW cache server. On the other hand, there are room for improvement in commonly used cache replacement algorithms by WWW cache server. In our study, we try to realize a WWW cache server that stresses on the improvement of the stresses of response time. To this end, we propose the new cache replacement algorithm by focusing on the utilizable information of network distance from the WWW cache server to WWW server that possessing the page data of the user requesting.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.197-206
• /
• 2019

Software-defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front-end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load-balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up-to-date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

• Proceedings of the Korea Database Society Conference
• /
• 1994.09a
• /
• pp.49-69
• /
• 1994

A client/server system has become the computing architecture for the business organization which seeks competitive edges. Technically, a client/server system places application processing close to the user and thus increases performance. This paper's two primary goals are (i) to present a performance model for client/server database systems and (ii) to demonstrate analytically the effectiveness of client/server computing in comparison with other computing architectures via an illustrative example. The model is most likely to be used as a practical performance guide for client/server computing.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.9-20
• /
• 2009

In a real-time system with both hard real-time periodic tasks and soft real-time aperiodic tasks, it is important to guarantee the deadlines of each periodic task as well as obtain fast response time for each aperiodic task. This paper proposes Enhanced Total Bandwidth Server (ETBS) with possibly shorter response time than Total Bandwidth Server (TBS), which is efficient and widely used for servicing aperiodic tasks. For uniprocessor system using Earliest Deadline First (EDF) scheduling algorithm, ETBS assigns an on-line deadline to each aperiodic task considering a surplus slack time which gained for every unit execution time of periodic job. The proposed method can fully utilize the processor while meeting all the deadlines of periodic tasks. We show that the proposed ETBS provides better response time of aperiodic tasks than TBS theoretically, but has the same computational complexity as TBS, O(1). Simulation results show that the response time of aperiodic tasks with ETBS are shorter than one with TBS.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.1
• /
• pp.26-33
• /
• 2018

A web application running on the Internet is causing many difficulties for a program developer, and it requires to process multiple sessions at the same time due to the occurrence of excessive traffic. Web applications should be able to process concurrent requests efficiently and in real time. Node.js is a single-threaded server-side JavaScript environment implemented in C and C ++ as one of the latest frameworks to implement event models across the entire stack. Nodes implement JavaScript quickly and robust to achieve the best performance using a JavaScript V8 engine developed by Google. In this paper, it will be explained the operation principle of Node.js, which is a lightweight real-time web server that can be implemented in JavaScript for real-time responsive web applications. In addition, this application was practically implemented through automatic alignment system for group scheduling to demonstrate event-based real-time response web processing.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.1-14
• /
• 2000

Recently, as construction of information infra including high-speed communication networks remarkably expands, more various information services have been provided. Thus the number of internet users rapidly increases, and it results in heavy load on Web server and higher traffics on networks. The phenomena cause longer response time that means worse quality of service. To solve such problems, much effort has been attempted to loosen bottleneck on Web server, reduce traffic on networks and shorten response times by caching informations being accessed more frequently at the proxy server that is located near to clients. And it is also possible to improve internet performance further by allowing clients to share informations stored in proxy caches. In this paper, we perform simulations of hierarchical proxy caches with the 3-level 4-ary tree structure by using real web traces, and analyze cache hit ratio for various cache replacement policies and cache sizes when the delayed-store scheme is applied. According to simulation results, the delayed-store scheme increases the remote cache hit ratio, that improves quality of service by shortening the service response time.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.269-274
• /
• 2018

MMORPG is a role-playing game that tens of thousands of people access it online at the same time. Users connect to the server through the game client and play with their own characters. If the user moves to a management area of another server beyond the area managed by the server, the user information must be transmitted to the server to be moved. In an actual game, the user is required to synchronize the established and the transferred information. In this paper, we propose a migration agent server in the virtual systems. We implement a seamless virtual server using the grid method to experiment with seamless server architecture for virtual systems. We propose a method to minimize the delay and equalize the load when the user moves to another server region in the virtual environment. Migration Agent acts as a cache server to reduce response time, the response time was reduced by 50% in the case of 70,000 people.