• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 1994년도 DB산업기술 활성화를 위한 학술대회 및 기술 심포지움
• /
• 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.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제5권9호
• /
• pp.223-228
• /
• 2016

최근 가상 환경의 발전은 이용자들이 현실 세계를 그대로 반영한 가상 환경을 요구하도록 변화하고 있다. 하지만 현재 서버 및 네트워크 환경은 소수의 이용자가 소수의 그룹을 이루어 함께하는 형태로, 현실 세계를 그대로 반영하지 못하고 있다. 가장 큰 이유 중 하나는 이용자간 정보 동기화에 많은 부하가 발생하기 때문이며, 이러한 부하는 정보 전달 시간을 증가시키게 된다. 본 논문에서는 이러한 문제를 최소화하기 위한 Migration Agent 서버 시스템을 제안한다. Migration Agent 서버는 Field Server 이동시 Player Character의 동기화 과정에서 DBMS의 접근을 최소화하여 응답 시간을 줄여주기 위한 서버로 Field Server간 Player Character 이동을 위한 캐시 서버 역할을 수행한다. 그에 더해 스택형태로 Field Server를 배치함으로 기존 격자 형태로 인해 특정 서버에 부하가 집중되는 것을 보완하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.296-301
• /
• 2000

본 논문에서는 응용 계층에서 수행되는 Proxy Server방식을 이용하여 Firewall이 있는 환경에서 H.323기반 서비스를 지원할 수 있는 기술적 방안을 연구하였다. H.323 프로토콜 서비스 시나리오와 기존의 Firewall방식을 연구하여 H.323 응용서비스 제공하기 위해서 어떠한 문제를 해결해야할 것인지를 연구하고 기존에 설치된 많은 firewall 환경에 적용 가능한 H.323 응용서비스를 위한 Application Proxy Server 구조를 제안하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• 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.

• 한국컴퓨터정보학회논문지
• /
• 제21권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
• /
• 제38권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.

• 한국컴퓨터정보학회논문지
• /
• 제22권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.

• 한국시뮬레이션학회논문지
• /
• 제7권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• 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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 춘계학술발표논문집 (상)
• /
• 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.