• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.97-99
• /
• 2012

모바일 애플리케이션의 다양한 개발 방법 중에서 파서는 중요한 요소로써 쓰이고 있으며 그 종류에는 여러 가지가 있다. 또 각 파서마다 데이터를 파싱하는 방법이 모두 다르며 구현되는 구조 또한 다르다. 본 논문에서는 이렇게 여러 가지 형태로 구현되는 파서를 분석하여 웹 서버를 거쳐 데이터베이스에 접근하는 방식을 좀 더 신속하고 효율적인 구조로 구현하고자한다. 구현방법으로는 파서의 성능 비교를 웹 전송부분을 제외한 파싱 속도를 측정한 방법과 웹 전송부분을 포함한 파싱 속도를 측정하는 두 가지 방법을 통하여 비교하였다. 그 결과, 웹 전송부분을 제외한 방법에서는 DOM 파서가 가장 좋은 성능을 보여주었고 웹 전송부분을 포함한 방법에서는 SAX 파서가 가장 좋은 성능을 보여주었다. 이러한 결과는 안드로이드 애플리케이션에서 웹 서버를 경유하여 데이터를 가져와 파싱하는데 사용할 파서를 선택하는데 도움을 줄 수 있다.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.1-14
• /
• 2000

Recently, as construction of information infra including high-speed communication networks remarkably expands, more various information services have been provided. Thus the number of internet users rapidly increases, and it results in heavy load on Web server and higher traffics on networks. The phenomena cause longer response time that means worse quality of service. To solve such problems, much effort has been attempted to loosen bottleneck on Web server, reduce traffic on networks and shorten response times by caching informations being accessed more frequently at the proxy server that is located near to clients. And it is also possible to improve internet performance further by allowing clients to share informations stored in proxy caches. In this paper, we perform simulations of hierarchical proxy caches with the 3-level 4-ary tree structure by using real web traces, and analyze cache hit ratio for various cache replacement policies and cache sizes when the delayed-store scheme is applied. According to simulation results, the delayed-store scheme increases the remote cache hit ratio, that improves quality of service by shortening the service response time.

• Journal of Families and Better Life
• /
• v.20 no.3
• /
• pp.113-124
• /
• 2002

The purpose of this study was to identify the subarea of customer complaints handling service and to accomplish the data for an improvement of complaints handling get service through the evaluation of the importance and performance on customer handling service as subdivisions of customer complaints handling service. The data were collected 303 female/male, 20-30 age by outline survey. The major findings of this study were as follows: 1) The subdivisions of customer complaints handling service were classified into four different factors ; promptness, empathy, information, policy factors. 2) As the subdivisions factors, importance was promptness, empathy>information>policy factor and performance was empathy>information>promptness>policy factor in order. 3) There were question asking the performance evaluation of influencing the total satisfaction of customer complaints handling service. There were promptness, empathy of performance evaluation of influencing the total satisfaction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2548-2566
• /
• 2012

This paper derives two main end-to-end performance metrics, namely the spatial capacity density and the average end-to-end delay of the multi-hop wireless ad hoc networks with multi-antenna communications. Based on the closed-form expressions of these performance metrics, three hopping strategies, i.e., the closest neighbor, the furthest neighbor and the randomly selected neighbor hopping strategies have been investigated. This formulation provides insights into the relations among node density, diversity gains, number of hops and some other network design parameters which jointly determine network performances, and a method of choosing the best hopping strategy which can be formulated from a network design perspective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1899-1911
• /
• 2018

In this work, we propose a concurrency control scheme in object-oriented database (OODB). Since an OODB provides complex modeling power than the conventional relational databases, a concurrency control technique in OODB is also rather complicated and has influence on the overall performance. Thus, it is very important to develop a concurrency control technique with less overhead. The proposed scheme deals with class hierarchy that is a key concept in OODBs. The proposed scheme is developed on implicit locking scheme. Also, the proposed scheme is designed using data access frequency in order to reduce locking overhead than implicit locking. It means that, if access frequency information is not available, the proposed scheme works just like the existing implicit locking, In our work, the correctness of the proposed scheme is proved. The performance is analyzed depending on access types. Also, it is proved that our scheme performs works much better than the implicit locking does.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2567-2582
• /
• 2016

This paper investigates the impact of outdated channel state information (CSI) on the performance of the incremental amplify-and-forward (AF) opportunistic relaying (OR) over dual-hop Rayleigh fading channels. According to the definition of distribution function, we obtain the cumulative distribution function (CDF) of the actual combined signal-to-noise ratio (SNR) received at the destination. Based on this CDF, the closed-form expressions of the average spectral efficiency and outage probability are derived for the incremental AF OR under outdated CSI. Numerical results show that in the low region of the average SNR of the direct link, outdated CSI deteriorates the system performance, whereas in the high region, outdated CSI has almost no impact on the system performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.324-340
• /
• 2010

Video streaming service over wireless networks is a challenging task because of the changes in the wireless channel conditions that can occur due to interference, fading, and station mobility. To provide an efficient wireless video streaming service, the rate adaptation scheme should improve wireless node performance and channel utilization. Moreover, the quality adaptation scheme should be considered at the streaming application. To meet these requirements, we propose a new cross-layer design for video streaming over wireless networks. This design includes the rate and quality adaptation schemes. The rate adaptation scheme selects the optimal transmission mode and resolves the performance anomaly problem. Based on performance improvement by the proposed rate adaptation scheme, our quality adaptation scheme improves the quality of video streaming. Through performance evaluations, we prove that our cross-layer design improves the wireless channel utilization and the quality of video streaming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.12-18
• /
• 2003

A web crawler is used widely in a variety of Internet applications such as search engines. As the Internet continues to grow, high performance web crawlers become more essential. Crawl scheduling which manages the allocation of web pages to each process for downloading documents is one of the important issues. In this paper, we identify issues that are important and challenging in the crawl scheduling. To address the issues, we propose a dynamic owl scheduling framework and subsequently a system architecture for a web crawler subject to the framework. This paper presents the architecture of a web crawler with dynamic scheduling support. The result of our preliminary performance evaluation made to the proposed crawler architecture is also presented.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.277-280
• /
• 2005

With the proliferation of mobile terminals, use of the Internet in mobile environments is becoming more common. To support mobility in these terminals, Mobile IPv4 is proposed and represents the standard in IPv4 environments. Authentication should be mandatory, because mobile terminals can utilize Internet services in any foreign domain. Mobile IPv4 provides symmetric key based authentication using the default HMAC-MD5. However, symmetric key based authentication creates a key distribution problem. To solve this problem, public key based authentication mechanisms have been proposed. In this paper, the performance of each of these mechanisms is evaluated. The results present that, among these mechanisms, partial certificate based authentication has superior performance, and certificate based authentication has the worst performance. Although current public key based authentication mechanisms have lower performance than symmetric key based authentication, this paper presents the possibility that public key based authentication mechanisms may be used for future mobile terminal authentication.