• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.717-721
• /
• 2005

With HTTP/1.0, a single request means a single HTTP connection so that the granular unit of dispatching is the same as real load. But with persistent HTTP connection, multiple requests may arrive on a single TCP connection. Therefore, a scheme that dispatches load at the granularity of individual requests constrains the feasible dispatching policies In this paper we propose a new connection dispatching polity for supporting HTTP/1.1 persistent connections in cluster-based Web servers. When the request of a base html file arrives, the dispatcher gets the subsequent load arriving on that connection using the embedded objects information. After the dispatcher stores the load information in Load Table, the dispatcher employs the connection aging strategy on live persistent connections on the passage of time. The results of simulation show about $1.7\%\~16.8\%$ improved average response time compared to existing WLC algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.20 no.1
• /
• pp.69-75
• /
• 2002

The important issues of facility database management in GIS are to collect up-to-date information and to update information in accordance with new-establishment, repair and replacement of the facilities. Therefore, it is necessary to develop a system which has capability of monitoring facilities as well as managing database efficiently. The purpose of this study is to propose possibility of implementation of mobile GIS solution for the facility management. In order to achieve the goal, to process existing digital maps and to receive on-site information through the wireless communication service are required. In addition, the system is required to process spatial information obtained by GPS and digital photogrammetric technique with real-time updating database in server. The system increases efficiency both in work flow and monitoring for facility management by providing optimal routing information to the sites and real-time two-way communication using VoIP(Voice over Internet Protocol). The system is expected to perform real-time database management effectively. In consequence, the system could appropriately response on-site situations in various practical applications. The proposed technology could contribute to improve nation's leading-edge technology.

• Journal of IKEEE
• /
• v.28 no.3
• /
• pp.458-464
• /
• 2024

This study proposes a fault-tolerant caching system to address the issue of caching content imbalance caused by the dynamic departure and participation of cache servers in a heterogeneous cache server network, and validates it in both real and virtual environments. With the increase of large-scale media content requiring various types and resolutions, the necessity of cache servers as key components to reduce response time to user requests and alleviate network load has been growing. In particular, research on heterogeneous cache server networks utilizing edge computing and low-power devices has been actively conducted recently. However, in such environments, the irregular departure and participation of cache servers can occur frequently, leading to content imbalance among the cache servers deployed in the network, which can degrade the performance of the cache server network. The fault-tolerant caching algorithm proposed in this study ensures stable service quality by maintaining balance among media contents even when cache servers depart. Experimental results confirmed that the proposed algorithm effectively maintains content distribution despite the departure of cache servers. Additionally, we built a network composed of seven heterogeneous cache servers to verify the practicality of the proposed caching system and demonstrated its performance and scalability through a large-scale cache server network in a virtual environment.

• KIISE Transactions on Computing Practices
• /
• v.23 no.10
• /
• pp.605-610
• /
• 2017

In distributed environments, dynamic partitioning is needed to resolve the load on a particular server or the load caused by communication among servers. In heterogeneous environments, existing dynamic partitioning schemes can distribute the same load to a server with a low physical performance, which results in a delayed query response time. In this paper, we propose a dynamic partitioning scheme for large RDF data in heterogeneous environments. The proposed scheme calculates the query loads with its frequency and the number of vertices used in the query for load balancing. In addition, we calculate the server loads by considering the physical performance of the servers to allocate less of a load to the servers with a smaller physical performance in a heterogeneous environment. We perform dynamic partitioning to minimize the number of edge-cuts to reduce the traffic among servers. To show the superiority of the proposed scheme, we compare it with an existing dynamic partitioning scheme through a performance evaluation.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.33-38
• /
• 2003

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider (ISP), without taking into account characteristics and capacities of duplicated servers. However, they are less reliable without prior information on capacities of duplicated servers. In this paper we propose two algorithms, performance rating algorithm of hardware and capacity algorithm, inspired by the need of improving QoS of delivering multimedia contents without incurring long access delays when the capacities of duplicated servers are significantly different and clients locate in a fixed geographical domain Our simulation results show that they are better than HTTP response time algorithm when the multimedia contents are large and quite different from performances between duplicated servers.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.339-347
• /
• 2010

Inter-process communication (IPC), which is a technique that enables exchanging data among multiple processes, is commonly used not only in user applications but also in system processes. For this reason, the performance of IPC highly influences the performance of whole computer system. Especially, heavy overload on a single server process caused by IPC requests from multiple client processes, easily results overall slowdown of IPC response time. Here, to deal with the problem stated above, the time-slice donation technique which is adapted in L4 microkernel is analyzed and enhanced for reducing latency of IPC response time and implemented on linux kernel for actual performance evaluation. While trying to maintain the additional overhead as least as possible, the experiment shows that the use of this technique enhances the performance of IPC multiple times of existing technique under certain circumstances.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.119-130
• /
• 2005

A spatial data warehouse is a system that stores geographical information as a subject oriented, integrated, time-variant, non-volatile collection for efficiently supporting decision. This system consists of a builder and a spatial data warehouse server. A spatial data warehouse server suspends user services, stores transferred data in the data repository and constructs index using stored data for short response time. Existing methods that construct index are bulk-insertion and index transfer methods. The Bulk-insertion method has high clustering cost for constructing index and searching cost. The Index transfer method has improper for the index reconstruction method of a spatial data warehouse where periodic source data are inserted. In this paper, the efficient index reconstruction method using a partial index in a spatial data warehouse is proposed. This method is an efficient reconstruction method that transfers a partial index and stores a partial index with expecting physical location. This method clusters a spatial data making it suitable to construct index and change treated clusters to a partial index and transfers pages that store a partial index. A spatial data warehouse server reserves sequent physical space of a disk and stores a partial index in the reserved space. Through inserting a partial index into constructed index in a spatial data warehouse server, searching, splitting, remodifing costs are reduced to the minimum.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.115-123
• /
• 2017

A message processor is server software that receives non-realtime messages as well as realtime messages from clients that need to be processed within a deadline. With the recent advances of micro-processor technologies and Linux, the message processor is often implemented in Linux-based multi-core servers and it is important to use cores efficiently to maximize the performance of system in multi-core environments. Numerous research efforts on a real-time scheduler for the efficient utilization of the multi-core environments have been conducted. Typically, though, they have been conducted theoretically or via simulation, making a subsequent real-system application difficult. Moreover, many Linux-based real-time schedulers can only be used in a specific Linux version, or the Linux source code needs to be modified. This paper presents the design of a Linux-based message processor for multi-core environments that maps the threads to the cores at user level. The message processor is implemented through a modification of the traditional RM algorithm that consolidates the real-time messages into certain cores using a first-fit-based bin-packing algorithm; this minimizes the response-time delay of the non-real-time messages, while guaranteeing the violation rate of the real-time messages. To compare the performances, the message processor was implemented using the two multi-core-scheduling algorithms GSN-EDF and P-FP, which are provided by the LITMUS framework. The benchmarking results show that the response-time delay of non-real-time messages in the proposed system was improved up to a maximum of 17% to 18%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.56-66
• /
• 2009

In the traditional Server/Client architecture, the client connects to the known servers and gets information through web searching. However, nowadays, diverse internet devices providing services (get) working on internet easily. The update interval of the services or information provided by the devices is relatively short. And also they tend to be both a server and a client. In this situation, the way of the traditional information searching such as web searching is not appropriate. In this paper we propose a service push model, where it pushes its service profiles to all the other network devices by broadcasting them on the network. When a device connects to the network newly, it can get all service profiles in the network and it gets service profiles newly pushed by service providers in prompt. Also it can call any service among the service profiles within itself. We implemented a prototype system for the service push model on the JXTA platform based on P2P network. Also we measured the service profile pushing delay, the service discovery time, and the response time of service execution by running test applications written on the prototype system.

• Journal of the Korean Institute of Gas
• /
• v.25 no.3
• /
• pp.46-52
• /
• 2021

In this study, the on-site location identification and response system was proposed by accurately checking the location information of rescue requesters in the buildings using the smartphone Wi-Fi AP. The location server was requested to measure the strength of the Wi-Fi AP at least 25 times at 8 different building location points. And the accuracy of the position and the error range were checked by analyzing the coordinate values of the received positions. In addition, the response time was measured by changing the conditions of location information in three groups to compare the response time for saving lives with and without location information. The minimum and maximum error values for the eight cases were found to be at least 4.137 m and up to 14.037 m, respectively, with an average error of 9.525 m. Compared to the base transceiver station (BTS) based position error value of 263m, the range could be reduced by up to 93%. When the location information was given, it took 10 minutes and 50 seconds to save lives; however, when there was no location information at all, rescue process took more than 45 minutes. From this research effort, it was analyzed that the acquisition of the location information of rescuees in the building using the smartphone Wi-Fi AP approach is effective in reducing the life-saving time for on-site responses.