• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.51-61
• /
• 2002

By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.126-129
• /
• 2007

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 transportations to provide Telematics service. The killer-application of Telematics is navigation system. Recently, due to the mass storage conversion, the performance of the terminal and mobile communications technology development, navigation system is also changed. It more and more develops into 3D in a preexistence 2D map. In the future, it is expected to include the remote sensing map. There is also the characteristic of all the information expressed in frequently a change partially happening. That is, POI(Point Of Interest) which is freshly registered or is deleted is many. In a preexistence, MCP(Map Contents Providers) offer the new version map by off-line monthly or quarterly. And a user wastes time and is inconvenient because of updating the total map by the off-line. Thus, in this paper, in order to resolve this, we describe MCP-MAUS(Maus Air Update Server) interface for updating only the partial map that was changed.

• The Korean Journal of Applied Statistics
• /
• v.21 no.6
• /
• pp.997-1006
• /
• 2008

This paper proposes a new model by combining an infinite-server queueing model for multi-task processing software system with a perfect debugging model based on Markov process with two types of faults suggested by Lee et al. (2001). We apply this model for module and integration testing in the testing process. Also, we compute several measure, such as the expected number of tasks whose processes can be completed and the task completion probability are investigated under the proposed model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• Journal of the military operations research society of Korea
• /
• v.29 no.1
• /
• pp.57-75
• /
• 2003

Policy-based networking offers a network manager the ability to manage the network in a holistic and dynamic fashion rather than force a network manager to manage the network by dealing with each device individually. Policy-based networking is focusing on users and applications instead of emphasizing devices and interfaces. An important part of the policy-based networking is to simplify the task of administration and management for different disciplines. The Defense Information System(DIS) of today are complex and heterogeneous systems. Operational needs are not a trivial task and Quality of Service(QoS) is not generally guaranteed. So, important data may be missed or congested by trivial data. Policy-based networking provide a way to support QoS and simplify the management of multiple devices deploying complex technologies. This paper suggest implementation of policy-based networking in DIS to improvement of performance, and implementation is progressed step by step. Especially this paper is focusing on the providing QoS with policy-based networking using Lightweight Directory Access Protocol(LDAP) Server.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4098-4116
• /
• 2020

Mobile devices such as smartphones are very attractive targets for augmented reality (AR) services, but their limited resources make it difficult to increase the number of objects to be recognized. When the recognition process is scaled to a large number of objects, it typically requires significant computation time and memory. Therefore, most large-scale mobile AR systems rely on a server to outsource recognition process to a high-performance PC, but this limits the scenarios available in the AR services. As a part of realizing large-scale standalone mobile AR, this paper presents a solution to the problem of accuracy, memory, and speed for large-scale object recognition. To this end, we design our own basic feature and realize spatial locality, selective feature extraction, rough pose estimation, and selective feature matching. Experiments are performed to verify the appropriateness of the proposed method for realizing large-scale standalone mobile AR in terms of efficiency and accuracy.

• Journal of the Korean Society for Heat Treatment
• /
• v.24 no.1
• /
• pp.3-9
• /
• 2011

Plasma nitriding of stainless steels has been investigated over a range of temperature from 400 to $500^{\circ}C$ and time from 10 to 20 hours. Characterization of systematic materials was carried out in terms of mechanical properties and corrosion behaviors. The results showed that plasma nitriding conducted at low temperatures not only increased the surface hardness, but also improved the corrosion resistance of STS 316L, STS409L, and STS 420J2. It was found that plasma-nitriding treatment at $500^{\circ}C$ resulted in increasing the corrosion performance of STS 409L and STS 420J2, while STS 316L was observed with server and massive damage on surface due to the formation of CrN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.3
• /
• pp.251-265
• /
• 2009

VoIP service is the transmission of voice data using SIP protocol on an IP-based network. The SIP protocol has many advantages, such as providing IP-based voice communication and multimedia service with low communication cost. Therefore, the SIP protocol disseminated quickly. However, SIP protocol exposes new forms of vulnerabilities to malicious attacks, such as message flooding attack. It also incurs threats from many existing vulnerabilities as occurs for IP-based protocol. In this paper, we propose a new virtual proxy to cooperate with the existing Proxy Server to provide state monitoring and detect SIP message flooding attack with IP/MAC authentication. Based on a proposed virtual proxy, the proposed system enhances SIP attack detection performance with minimal latency of SIP packet transmission.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.835-837
• /
• 2001

컴퓨터의 급속한 보급과 인터넷의 사용이 급증하면서 사용자에게 좀 더 나은 서비스를 제공하기 위해 고성능 웹서버가 필요하게 되었다. 따라서 최근에는 리눅스 가상서버를 이용한 클러스터 웹 서버의 구축사례가 늘고 있다. 이는 기존의 단일 서버 시스템에 비해 가격이 저렴하면서도 지속적인 서비스를 할 수 있는 가용성과 서버의 수를 쉽게 늘릴 수 있는 확장성을 갖고 있다. 오픈소스인 리눅스와 여러 대의 저렴한 PC들을 이용하여 서버로 들어오는 부하를 분배서버가 여러 실제 서버에게 분산시킴으로써 웹 서버의 성능을 향상시키고, 서버의 가용성을 높이는 것이 클러스터 웹 서버의 목적이라 할 것이다. 본 논문에서는 서버에 들어오는 요청을 실제 서버들에게 분산시켜주는 스케줄링 알고리즘들을 알아보고 각각의 성능을 비교, 분석하였다. 그 결과 정적 스케줄링 알고리즘보다는 각 실제 서버의 부하를 고려한 알고리즘이 더 좋은 성능을 보인다는 것과 캐쉬 친화적 알고리즘이 캐쉬를 고려하지 않은 알고리즘 보다 더 좋은 성능을 보인다는 것을 알 수 있었다. 가장 중요한 결론으로는 알고리즘의 성능보다는 노드 개수 증가율이 클러스터 웹 서버 성능에 더 큰 영향을 미친다는 것을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.445-447
• /
• 2001

휴대폰의 사용이 급증하고 스마트폰, PDA와 칼은 우선 단말기 등의 개발이 점차적으로 확대됨에 딸라 이런 휴대용 단말기를 이용하여 인터넷 환경이 아닌 무선 네트웍을 이용하여 데이터 통신을 하는 일이 급속도로 증가 되고 있다. 이런 환경에서 우선 단말기에서 캐쉬를 사용한다고 하면 아직은 적은 메모리와 스토리지 용량을 가진 무선 단말기에서의 데이터 통신을 좀 더 효과적으로 이용할 수 있을 것이다. 특히 본 논문에서는 모바일 클라이언트(MC) 내의 캐쉬 된 데이터가 무효화(invalidation)될 때 서버에서 보내야 하는 무효성 보고 패킷( IR )의 발생과 관련하여 그 패킷 수를 줄여서 대역폭이 낮은 무선 환경에 적합한 알고리즘을 논의한다. MSS(Mobile Switching Station)을 이용한 계층적 캐쉬 알고리즘을 제시하며 데이터의 수정 주기를 이용한 AVI_based 알고리즘을 제시한다. MSS는 MC의 캐쉬의 내용을 알고 있는 state server의 역할을 하게 된다. MC는 캐쉬의 데이터의 avi가 이전보다 짧아졌다는 IR을 받거나 현재 시간과 avi값에 의해 그 데이터가 무효하다는 것을 판단한다. 본 논문의 마지막은 제시된 알고리즘의 시뮬레이션 설계를 통해 AVI 값의 주기성에 따른 성능 평가를 보여준다.