• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.458-463
• /
• 2008

An IFC Server is a database management system that stores data complying with a standard data format, called IFC, and keeps track of data transactions, modifications, and deletions. It plays a role as an information hub for storing and sharing information between various parties involved in construction projects. There have been several efforts to develop an IFC Server, however, they suffered from slow performance and long transaction time due to a complex mapping process between IFC files and relational database structures. In this study, we aim to develop an IFC Server using an object-relational database system. Since IFC has an object-flavored data structure, we expect to have a simpler and faster mapping process from IFC to the IFC Server. This paper reviews existing studies and describes the overall framework of the OR-IFC Server.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.233-236
• /
• 2001

When we execute a online game in the network, a lots of game informations and user informations are transfered between game server and game clients. This information has deferent data structure and communication protocol. So, game developers will be design the communication protocols and packet structures after analyze the game. And, they will be design the database for user management. It will be lots of overload to the game developers. From a user point of view, they must be register to each game server to use several games. It is a undesible operation for the game users. This problems are solved by using the communication server which operates commonly with several game servers. Game providers can get the benefit of multiple access of users and get freedom from user management. Game users can access the several games which connected to communication server by register the communication server only. In this paper we design the communication packet and propose a communication protocol which operates on the communication server described previous.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.11a
• /
• pp.211-219
• /
• 2004

Due to rapid increases in Internet users, it becomes essential to provide well-established web services and monitor web server's load for the sake of reliable web server management. The existing web server load monitoring has been based on such cable methods as RPC, RMI, CORBA and etc. But it has the limitation in bringing information both anywhere and anytime over the Internet. This thesis is aimed to realize real-time wireless web server monitoring system based on Wireless Application Protocol (WAP). As any user can log on wirelessly to the Internet at any time through wireless terminals like PDA, the realization will make possible instant and real-time web server monitoring.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.200-202
• /
• 2004

This paper deals with the real-time monitoring and control system using PC, PDA(Win CE embedded device) and PCS(based BREW platform). The camera attached to the server captures the moving target, and the captured frame of color image is encoded in JPEG for image compression at the server. The client(PC, PDA, PCS) receives the image data from the remote server and the received image is decoded from decompression. We use the TCP/IP protocol to send the image frames. The client can control the position of the camera by sending the control command to the server. Two DC servo motors for the camera are controlled in any directions, up-down and left-right, by the controller which is communicating with the server via the serial communication to get the control command. In this way, on the client we can monitor the moving images at the server and also control the position of the camera.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.5
• /
• pp.31-38
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction on the number of servers for each customer class. customers are divided into two different classes. Class 1 customers have non-preemptive priority over class 2 customers. They are served by both servers when available but class 2 customers are served only by a designated server. We use a method of generating function depending on the state of servers. We find the generating function of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.168-174
• /
• 2000

All the visiting customers makes a queue and then can be served at an unoccupied server, in the queueing system of multi-server. The customer and server, however, have a conflictive feeling of satisfaction at all times. To solve the problem, in this paper, it is proposed that new design method of server number to maximize the satisfaction level of customer and server by the hzzy concept which is applied to the queuing system.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.1
• /
• pp.23-32
• /
• 2009

Although the web is becoming a widely accepted medium, it provides relatively poor performance and low availability. A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. Web server clusters require a high-availability service with a proactive and practical fault management. However, as the system complexity grows, it is not easy to meet the requirement. Therefore, web server clusters must have self-fault management capability for meeting high-availability requirement. In this paper, we propose high availability web server clusters using self-healing technique with a minimal human intervention. Our experimental results show that a proposed method can be used to improve the availability of web server clusters.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1858-1867
• /
• 1996

This paper describes a platform for video conferencing on Information Super Highway. In this paper we de-sign a Multi-Multicast Server(MCS) and the platform. The platform uses Multi-MultiCast Server for multitasking IP Multicast data on IP over ATM. Based on Multicast Address Resolution Server (AMRS) which was proposed in this paper the platform maps from D class IP addresses to ATM addresses. MARS handles a recovery in case of MCS down. This paper also presents a solving mechanism for handling botteneck by using the MCS.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.876-881
• /
• 2009

Online game servers usually has been using the static thread pool system. But this system is not fit for huge online game server because the overhead is always up-and-down. Therefore, in this paper, we suggest the new algorithm for huge online game server. This algorithm is based on the prediction-based dynamic thread pool system. But it was developed for web servers and every 0.1 seconds the system prediction the needed numbers of threads and determine the thread pool size. Some experimental results show that the check time of 0.4 seconds is the best one for online game server and if the number of worker threads do not excess or lack to the given threshold then we do not predict and keep the current state. Otherwise we apply the prediction algorithm and change the number of threads. Some experimental results shows that this proposed algorithm reduce the overhead massively and make the performance of huge online game server improved in comparison to the static thread pool system.

• Journal of information and communication convergence engineering
• /
• v.18 no.2
• /
• pp.82-87
• /
• 2020

This paper discusses how to design a game server that is scalable, adaptable, and re-buildable with components. Furthermore, it explains how various implementation issues were resolved. To support adaptability, the server comprises three layers: network, user, and database. To ensure independence between the layers, each layer was designed to communicate with each other only via message queues. In this architecture, each layer can have an arbitrary number of threads; thus, scalability is guaranteed for each layer. The network layer uses input/output completion ports(IOCP), which shows the best performance on the Windows platform, it can handle up to 5,000 simultaneous connections on a typical entry-level computer, despite being built with a single-threaded user layer. To completely separate the database from the game server, the SQL code was not directly embedded in the database layer.