• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.69-84
• /
• 2005

As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.13-22
• /
• 2000

To apply the queueing network theory in evaluating performances of flexible manufacturing systems, it is generally assumed that the processing times are distributed exponentially. However, in FMS, processing times are usually deterministic. In this study the performance measures of FMS are approximated under the assumption that processing times are usually deterministic. Multi-classes of parts and single server and multi-server stations are considered in the model. This study also that, in the numerical example, this approach yields better solutions than those obtained by the pure Linearizer algorithm, when the processing times are deterministic.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.327-330
• /
• 2008

It is required that a server which communicates with various client simultaneously should have an efficient data transfer model. In Windows$^{(R)}$ environment, the server was generally developed based on IOCP model. Developing the IOCP model, the server generally has one data transfer buffer per client. If the server divides a larger data than the transfer buffer into several fragments, there used to be a problem in sending it to a client, because there is a conflict in a data transfer buffer. That is, CPU requests one data-fragment transfer, then it will request the next data-fragment transfer successively before completing the previous request, owing to the property of overlapped IO model. In this paper, we proposed the transfer buffer sharing technique to solve the conflicting problem. The experimental result shows that the performance of data transfer was enhanced by 39% maximally.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.3
• /
• pp.40-45
• /
• 2016

In this paper, the fire engine pump is controlled and monitored by the AJAX (Asynchronous Javascript and Xml) in the web server. The embedded system with built-in system having a processor and a memory of high performance occurs many problems in transmitting the large amount of data in real time through the web server. The AJAX is different from HTML (Hyper Text Makeup Language) with java script technology and can make RIA (Rich Internet Application). It process the necessary data by using asynchronous and it take advantage of usefulness, accessibility, a fast response time. Using AJAX can build up web server with real time and monitoring that fire engine pump status, check processing pump memory in the event of fire, also remotely monitors can do. The web server system can control the fire engine pump as like the black box. The experimental results show the effectiveness and commercialize possibility.

• Annual Conference of KIPS
• /
• 2004.11a
• /
• pp.191-194
• /
• 2004

차세대 인터넷 서버는 인터넷을 통하여 여러 사용자에게 HDTV 급 고품질 멀티미디어 서비스를 제공하고자 개발된 시스템이며, 이를 위하여 디스크 연결 및 네트워크 기능을 정합 시킨 특화된 NS 카드를 개발하였다. Contents Container 파일 시스템은 NS 카드 전용으로 개발된 멀티미디어 파일 시스템이며, 본 논문에서는 Contents Container 파일 시스템에 대한 개발 내용을 기술하고, 개발 시스템의 장단점을 파악하고자 EXT3 파일 시스템과 비교 분석하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2283-2291
• /
• 1999

Most of collaborative applications use the Server-Client paradigm where all requests of clients will be delivered first to server and that server distributes again the requests to the rest of clients. This server-oriented operation and data transmission mechanism always presents end-to-end communications between the server and clients that can notably decrease the overall performance of applications. In this paper, we propose a new design approach to inhibit the inefficiency of applications using active networking concepts. We propose the ASM service that offers an application-specific in-network multicast functions, the AMTC service and its tree algorithm that builds anon-core based shared tree for multicast. These proposed services locate in active nodes performing its services as part of the overall system to improve the performance of collaborative applications.

• Journal of Korea Game Society
• /
• v.11 no.1
• /
• pp.101-109
• /
• 2011

The performance of server becomes important issues in online game with the online game market expansion. This paper proposes a method of improving performance to decrease synchronized packets for each entity's informations in game. Our method provides adapted solution of reconstructing spatial subdivision to reduce a load of movement between boundary regions using prediction of entity's movement range and disabled regions where entity can not move to. It is shown through the experiments that proposed method outperforms existing method in terms of processing quantity of packets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1421-1444
• /
• 2012

Mobile devices such as Android devices are emerging as a convenient client computing device with mobility and context-sensing capability. However, the computing power and hardware resource of the devices are limited due to their small form-factor. Consequently, large-scaled applications could not be deployed on these devices. Nonetheless, if the large-scaled applications are deployed and executed on the devices, high performance of the applications cannot be guaranteed. To remedy the limitation in terms of performance, it is inevitable to let some heavy-weight functionality executed on the server side and let a client application invoke the functionality in the server. To realize this kind of mobile applications, we adopt well-defined architecture design principles; being thin-client, being layered with Model-View-Controller (MVC), and being balanced between client side and server side. By adopting the principles, we propose a unique, ideal and practical architecture for mobile applications, called balanced MVC architecture. By considering the principles, key design considerations of realizing balanced MVC architecture lie in functionality partitioning. Hence, we define key criteria of determining the degree of performance. And, we define a method to design a balanced MVC architecture which embodies functionality partitioning for high performance, and a simulation-based evaluation method of balanced MVC architectures.

• Convergence Security Journal
• /
• v.6 no.1
• /
• pp.13-23
• /
• 2006

It is more desirable to execute AV software on server systems rather than on clients for the minimization of damages due to malicious codes. AV software on server system, however, may aggravate the load of server system. In this paper, we propose a new AV software executed on server system without additional loads with a monitor and multi-agent model. The new AV software supports dynamic load balancing that reflects the features of AV engine, and thus it can be executed efficiently on server systems. The results of performance evaluation on the AV software attest to the strong points of the new AV software.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.573-582
• /
• 2002

We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.