• Proceedings of the Korea Database Society Conference
• /
• 1994.09a
• /
• pp.105-129
• /
• 1994

The information system of corporations are facing a new environment expressed by miniaturization, decentralization and Open System. It is therefore of utmost importance for corporations to adapt flexibly th such new environment by providing for corresponding changes to their existing information systems. The objectives of this study are to identify this new environment faced by today′s information system and develop effective methods for data resource management under this new environment. In this study, it is assumed that the new environment faced by information systems can be specified as Distributed Computing Environment, and in order to achieve such system, presents Client/server architecture as its representative computing structure, This study defines Client/server architecture as a computing architecture which specialize the fuctionality of the client system and the server system in order to have an application distribute and perform cooperative processing at the best platform. Furthermore, from among the five structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsibility and powers with respect to control of data used by the user are given not only is it more adaptable to modern flexible corporate environment, but in terms of system operation, it presents a more efficient data management alternative compared to existing data management methods in terms of cutting costs.

• 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 Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.296-301
• /
• 2000

This paper provides the solution for supporting H.323 services through firewalls with proxy server. The paper Provides a survey of H.323 Protocol, and framework for firewalls. The Paper also discusses the issues of H.323 and proxy server - why H.323 is hard for firewalls, and service scenarios with H.323 terminals and proxy server. Finally, the paper propose an application proxy service architecture for supporting H.323 protocol.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.836-839
• /
• 2006

Telematics, one of the so-called New Growth Engine of IT839, is a leading IT service where wireless internet service represented by information and mobility is extended to the area of transportation. To provide telematics service, Telematics service provider have to connect with various Contents Provider or Service Provide server - for example - LBSS(Location Based Service Server), ASPS(Application Service Provider Server), TELICS(TELematics Information Center Server), GMS(Geo-mobility Server), WTPS(World Telematics Protocol Server) and MAUS(Map Air Update Server). Presently, It is nearly impossible or very difficult for the company that are manufacturing and testing telematics device to develop and test telematics solution without connecting Telematics Service Provider, Service Provider, Contents Provider. And, it is very difficult to connect in TSP, CP, SP having the product to be developed. In this paper, we proposed virtual telematics service provider. The proposed Virtual Telematics Service Provider is to provide telematics services and functionalities by integrating telematics servers into TSP gateway virtually. In other words, VTSP is performs with the role of TSP, CP, SP. And the VTSP support integration of telematics servers, interfacing and monitoring between terminal and the integrated servers.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.10
• /
• pp.63-68
• /
• 2016

Recently, Biometrics is being magnified than ID or password about user authentication. However, unlike a PIN, password, and personal information there is no way to modify the exposure if it is exposed and used illegally. As FIDO(Fast IDentity Online) than existing server storing method, It stores a user's biometric information to the user device. And the user device authentication using the user's biometric information, the user equipment has been used a method to notify only the authentication result to the server FIDO. However, FIDO has no mutual authentication between the user device and the FIDO server. We use a Certificate Authority in order to mutually authenticate the user and the FIDO server. Thereby, we propose a more reliable method and compared this paper with existed methods about security analysis.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.10
• /
• pp.1340-1346
• /
• 2014

Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.101-107
• /
• 2017

In this paper, we study the problem of parallel machine scheduling considering the moving time of multiple servers. The parallel machine scheduling is to assign jobs to parallel machines so that the total completion time(makespan) is minimized. Each job has a setup phase, a processing phase and a removal phase. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. A server is needed to move to a parallel machine for a setup phase and a removal phase. But previous researches have been done under the assumption that the server moving time is zero. In this study we have proposed an efficient algorithm for the problem of parallel machine scheduling considering multiple server moving time. We also have investigated experimentally how the number of servers and the server moving time affect the total completion time.

• Journal of the Korea Society for Simulation
• /
• v.7 no.2
• /
• pp.33-43
• /
• 1998

To evaluate the server performance and forecast capacity requirements, we carry out simulation of Multimedia-on-demand(MOD) server. In multimedia service environment, especially for on-demand service, one of the key problems is capacity planning, which requires ensuring that adequate computer resources will be available to meet the future workload demands in a cost-effective manner. In this paper, we design and implement a simulation model for MOD server with failures of components (e.g., processors, disks and networks). By acquisition of utilization and queue length parameters, we can estimate desirable capacity of server components with various arrival rates of customers and failure rates of components. For a given failure probability, we also compute packet delay probability and reliability of the server. It is possible to derive some important design information of the MOD server by using the above parameters.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.488-490
• /
• 2003

Over the past few years, a number of studies have been made on web map services, which enable the GIS user to access spatial data through the web. They, however, have focused on only implementation techniques separately, such as map client implementation, map server implementation, communication between client and server, and the map data representation. Therefore, it is hard to share and practical use the spatial data, because they does not ensure interoperability in heterogeneous map servers. In this paper, we have designed and implemented the web map server with open architecture, which complies with the standard interfaces proposed by OpenGIS Consortium (OGC). In particular, we have extended the OGC’s interfaces for a map server to support one or more data sources. This paper has contributed to construction and practical use of web map services by newly proposing the method of implementation of a map server, which could be reused regardless of the types of data sources.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.507-510
• /
• 2001

HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server's resource when server maintains conn ection with the idle-state client that requests no data for a certain time. This paper proposes the mechanism of a heuristic connection management supported by the client-side under persistent HTTP, in addition to HTTP/1.1's fixed holding time model on server-side. The client exploits the tag information within transferred HTML page so that decides connection-closing time. As a result, the mechanism allows server to use server's resource more efficiently without server's efforts.