• Journal of Korean Society for Quality Management
• /
• v.37 no.1
• /
• pp.1-9
• /
• 2009

Data envelopment analysis(DEA) has proved to be powerful for benchmarking and has been widely used in a variety of settings since the advent of it. DEA can be used in identifying the best performing units to be benchmarked against as well as in providing actionable measure for improvement of a organization's performance. However, the selection of performance benchmarks is a matter of both technical production possibilities and organizational policy considerations, managerial preferences and external restrictions. In that regards, DEA has a limited value in benchmarking because it focuses on only technical production Possibilities. This research proposes a new perspective in using DEA and a frame-work for benchmarking to select benchmarks that are both feasible and desirable in terms of organizational context. To do this, the concept of local and global efficiency is newly proposed. To show how useful the suggested concept and framework are, a case study is addressed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1B
• /
• pp.56-70
• /
• 2006

This study attempts to estimate the size of economic value that could be created by the adoption of a new internet protocol, IPv6. The existence of externality and diffusion effects in the adoption of a new platform technology makes it difficult to capture the exact costs and benefits of IPv6 adoption. Hence, this study employed multiple evaluation methods rather than relying on single method to increase the validity of results by averaging the value of different methods. Futhermore, the proposed evaluation model includes qualitative variables such as expert opinions, as well as quantitative variables, to incorporate various stakeholders' perspectives. Finally, the policy implications for IPv6 adoption and the limitations of this study are discussed.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.81-90
• /
• 2001

As the rapid growth of Internet, computer systems are growing in its size and complexity. To meet high availability requirements for the systems, one usually uses both hardware and software fault tolerance techniques. To prevent failures of computer systems from software-aging phenomenon that come from long mission time, we adopt software rejuvenation method that stops and restarts the software in the servers intentionally. The method makes the systems clean and healthy state in which the probability of fault occurrence is very low. In this paper, we study how switchover time affects software rejuvenation of primary-backup server systems. Through experiments, we find that switchover time is an essential factor for deciding the rejuvenation policy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4028-4049
• /
• 2014

Attribute-based encryption (ABE) is a promising cryptographic primitive for implementing fine-grained data sharing in cloud computing. However, before ABE can be widely deployed in practical cloud storage systems, a challenging issue with regard to attributes and user revocation has to be addressed. To our knowledge, most of the existing ABE schemes fail to support flexible and direct revocation owing to the burdensome update of attribute secret keys and all the ciphertexts. Aiming at tackling the challenge above, we formalize the notion of ciphertext-policy ABE supporting flexible and direct revocation (FDR-CP-ABE), and present a concrete construction. The proposed scheme supports direct attribute and user revocation. To achieve this goal, we introduce an auxiliary function to determine the ciphertexts involved in revocation events, and then only update these involved ciphertexts by adopting the technique of broadcast encryption. Furthermore, our construction is proven secure in the standard model. Theoretical analysis and experimental results indicate that FDR-CP-ABE outperforms the previous revocation-related methods.

• Journal of Digital Convergence
• /
• v.12 no.11
• /
• pp.349-355
• /
• 2014

In this paper, we propose the artificial vision system using human visual information processing and wavelet. Artificial vision system may be used for the visually impaired person and the machine recognition system. In this paper, we have constructed the information compression process to ganglion cells from the human retina. And we have reconstructed the primary visual information using recovery process to primary visual cortex from ganglion. Primary visual information is constructed by wavelet transformation using a high frequency and low frequency response. In the experiment, we used the faces database of AT&T. And the proposed method was able to improve the accuracy of face recognition considerably. And it was verified through experiments.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.593-606
• /
• 2006

Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next-generation internet. As a result, issues concerning the designing and testing of efficient connection-admission-control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital-video-broadcasting return-channel-via-satellite (DVB-RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real-time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well-known iterative CAC mainly designed for the managing of real-time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real-time multimedia traffic sources in high load and mixed traffic conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.59-62
• /
• 2002

최근 네트워크 구성이 복잡해짐에 따라 정책기반의 네트워크 관리기술에 대한 필요성이 증가하고 있으며, 특히 네트워크 보안관리를 위한 새로운 패러다임으로 정책기반의 네트워크 관리 기술이 도입되고 있다. 보안정책 서버는 새로운 정책을 입력하거나 기존의 정책을 수정, 삭제하는 기능과 보안정책 결정 요구 발생시 정책결정을 수행하여야 하는데 이를 위해서는 보안정책 실행시스템에서 보내온 경보 메시지에 대한 분석 및 관리가 필요하다. 따라서 이 논문에서는 정책기반 네트워크 보안관리 프레임워크의 구조 중에서 보안정책 서버의 효율적인 보안정책 수림 및 수행을 지원하기 위한 경보데이터 관리기를 설계하고 구현한다. 그리고 경보 데이터 저장과 분석을 위해서 데이터베이스 스키마를 설계하고 저장된 경보데이터를 분석하는 모듈을 구현한다. 또한 불량사용자나 호스트의 관리를 위하여 블랙 리스트 매니져를 구현하며 블랙리스트 매니져는 위험한 불량사용자와 호스트를 탐지하여 관리하는 기능을 제공한다 구현된 경보 관리기나 고수준 분석기는 효율적인 보안정책관리를 지원하게 된다.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.308-318
• /
• 2012

As mobile markets in most developed countries are rapidly coming close to saturation, it is increasingly challenging to cover the cost of providing the network, as revenues are not growing. This has driven mobile operators, thus far mostly involved in facility-based competition, to turn their attention to network sharing. There exist various types of mobile network sharing (MNS), from passive to active sharing. In this paper, we propose a model, based on the supply-demand model, for evaluating the economic effects of using six types of MNS. Our study measures the economic effects of employing these six types of MNS, using actual WiBro-related data. Considering lower service price and expenditure reduction, the total economic effect from a year's worth of MNS use is estimated to be between 513 million and 689 million USD, which is equal to three to four percent of the annual revenue of Korean mobile operators. The results of this study will be used to support the establishment of a MNS policy in Korea. In addition, the results can be used as a basic model for developing various network sharing models.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.184-193
• /
• 2011

Tailored for wireless local area networks, the present paper proposes a cross-layer resource allocation scheme for multiple-input multiple-output orthogonal frequency-division multiplexing systems. Our cross-layer resource allocation scheme consists of three stages. Firstly, the condition of sharing the subchannel by more than one user is studied. Secondly, the subchannel allocation policy which depends on the data packets' lengths and the admissible combination of users per subchannel is proposed. Finally, the bits and corresponding power are allocated to users based on a greedy algorithm and the data packets' lengths. The analysis and simulation results demonstrate that our proposed scheme not only achieves significant improvement in system throughput and average packet delay compared with conventional schemes but also has low computational complexity.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.173-181
• /
• 2009

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.