• 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 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 Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.260-268
• /
• 2008

This raper discusses improvement of MCVoD System by changing the channel allocation of VoD Server. And we analyzed performance of MCVoD System. Using simulation, we compare MCVoD with another VoD server using same channel allocation. In case of average channel allocation, MCVoD System using interchange agent, represents three times better than previous VoD server.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1546-1549
• /
• 2020

This paper introduces the development process of mobile home CCTV that enables remote control and object recognition using unused smartphones and Arduino. Clients can control motors connected to Arduino through button, enable bidirectional voice communication between client-server and receive video from the server in real time. The server sends a PUSH notification to the client when its battery is low. When the server recognizes the charger, the client's remote control allows the server to dock to the charger and charge it. It was confirmed that video and voice delivery between client and server works well without any problems, and that object recognition works smoothly.

• Information Systems Review
• /
• v.1 no.1
• /
• pp.35-49
• /
• 1999

• Journal of Information Technology Applications and Management
• /
• v.26 no.4
• /
• pp.19-30
• /
• 2019

Many organizations need to comply with ISMS-P for information systems and personal information management for ISMS-P certification. Organizations should safeguard vulnerablities to information systems. However, as the kinds of information systems are diversified and the number of information systems increases, management of such vulnerabilities manually accompanies with many difficulties. SCAP is a protocol to manage the vulnerabilities of information system automatically with security standards. In this paper, for the introduction of SCAP in domestic domains we verify the applicability of server-oriented system which is one of ISMS-P certification targets. For SCAP applicability, For obtaining this goal, we analyze the structures and functions of SCAP. Then we propose schemes to check vulnerabilities of the server-oriented system. Finally, we implement the proposed schemes with SCAP to show the applicability of SCAP for verifying vulnerabilities of the server-oriented system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1741-1746
• /
• 2016

Recently, technology using a PC and the personal server efficiently has been highlighted in accordance with the historical background. Solutions for large enterprises and public institutions and PC and personal server management are being commercialized for fee. Paying a fee for PC and personal server management being a burden and commercialized solutions include a function that does not require. In this paper, proposed the PC and personal server management system include monitoring that cpu, hdd, memory, respond speed. It expects to extend the PC and service life is available without charge through the free distribution of the burden. The Development program and application is available for free from the android market and on-line. Server agent program of the proposed system operates based on a single-threaded system. That is low load and the low functional burden on the server.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1358-1370
• /
• 1997

Client-Sever-Comptuing is now recognized as the most powerful and flexible computing mode of the future.Many companies have already commited significant amount of their corporate IS resources to building the cli-ent-server computing environment.Despite this active interst and commitment,however,results from such cli-ent-sever projects are far from being convincing Among the many factors,we suspect,we supect that the less than less than satisfac-tory client-server experiences are perhaps due to the company's lack of underxtanding its essertial information processing characteristics.We analyze five client-server archiedctures in temrs of seven IS-related crieria.We then develop a contin-gency model to match company's information processing chracteristics to the ideal client-server architecture for the firm.Based on the client-server architecture analysis from the previous step. we recommend specific im-plementation strategies for each-server architecture selected. Finally,on an exploratory level,we look into the three client-server implmentation cases to cases to check the validity of our contingency model.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.