• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.412-430
• /
• 2003

In many practical problems in signal processing and control, the signal values are often restricted to belong to a finite number of levels. These questions are generally referred to as "finite alphabet" problems. There are many applications of this class of problems including: on-off control, optimal audio quantization, design of finite impulse response filters having quantized coefficients, equalization of digital communication channels subject to intersymbol interference, and control over networked communication channels. This paper will explain how this diverse class of problems can be formulated as optimization problems having finite alphabet constraints. Methods for solving these problems will be described and it will be shown that a semi-closed form solution exists. Special cases of the result include well known practical algorithms such as optimal noise shaping quantizers in audio signal processing and decision feedback equalizers in digital communication. Associated stability questions will also be addressed and several real world applications will be presented.

• 대한기계학회논문집
• /
• 제18권10호
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.361-364
• /
• 2008

최근 언제 어디서나 컴퓨팅이 가능한 Ubiquitous Computing System 을 구현하기 위한 연구가 활발히 진행되고 있다. 또한, 이를 구현하기 위해 사용자의 상황에 따라 최적의 서비스를 제공하기 위한 상황인식 (Context-awareness) 컴퓨팅 기술 또한 많은 연구가 진행되고 있다. 본 논문에서는 Ubiquitous Computing System 을 구현하기 위해 복합 센서로부터 입력되는 다양한 상황 정보에 대해 CRS(Context Recognition Switch) 개념을 포함하여 보다 정확하고 빠르게 사용자의 상황 정보를 추출하게 된다. 또한 제안된 DOS(Dynamic and Optimal Standard) 개념으로부터 노드의 고유 속성을 분석하여 특화된 시스템 서비스가 가능한는 IEEE 802.15.4 WPAN Standard 기반의 UoC(Ubiquitous system on Chip) Architecture 를 제안하였다.

• 한국전자통신학회논문지
• /
• 제7권5호
• /
• pp.1041-1051
• /
• 2012

최근 공개되어진 네트워크 인프라를 활용한 서비스 집약 솔루션인 Cloud Computing에 대한 공격은 개발 플랫폼과 웹 기반 제공 소프트웨어, 자원 서비스 등을 무력화시키는 침해 사고와 서비스 장애를 발생시키고 있다. 따라서 불법적인 서비스 차단에 대한 공격으로부터 Cloud Computing 시스템이 지원하는 3가지 서비스 (3S' : laaS, PaaS, SaaS)의 운영정보와 생성된 자료에 대한 보안연구가 필요하다. 본 논문은 Cloud Computing 서비스에 대한 공격과 방어 실험을 단계별 4-Stage 기반의 방어기법으로 최적의 서비스가 가능한 시스템 구축에 관한 연구이다. 최초 네트워크에 대한 접근을 관제하고 가상화 서비스 제어와 지원 서비스 분류, 다중화 경로 선정 등의 순차적이며, 단계적인 4-Stage 접근 제어를 실시하는 방어정책으로 공격을 분산시키고 각 Stage별 접근 제어를 위한 모니터링과 분석을 통해 방어정책 구현과 분석을 시행함으로써 공격 유형별 방어를 실험하고 연구 결과는 Cloud Computing 서비스 기반의 방어정책 구현을 위한 실무적인 기초자료를 제공하고자 한다.

• 한국항행학회논문지
• /
• 제27권6호
• /
• pp.770-775
• /
• 2023

최근 디지털 데이터 양의 기하급수적 증가는 데이터 처리 시스템의 중요성을 부각시켰다. 이 연구는 클라우드 컴퓨팅 (CC; cloud computing), 엣지 컴퓨팅 (EC; edge computing), 그리고 UAV (unmanned aerial vehicle) 기반 지능형 에지 컴퓨팅 (UEC; unmanned aerial vehicle-based intelligent edge computing) 간의 성능을 비교하였으며, 특히 회랑감시와 같은 실시간 대용량 데이터 처리 상황에 초점을 맞추었습니다. UAV 기반 지능형 에지 컴퓨팅은 이동성과 특수 환경에서의 대규모 데이터 처리 및 분석에 높은 효과성을 보인다. 이러한 연구 결과를 바탕으로 각 상황에 맞게 최적화된 시스템 선택 방법론을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4063-4086
• /
• 2016

Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.

• 한국컴퓨터산업학회논문지
• /
• 제2권10호
• /
• pp.1349-1354
• /
• 2001

외판원 문제(Traveling Salesman Problem)는 주어진 n개의 도시들과 그 도시들 간의 거리비용이 주어졌을 때, 모든 도시들을 정확히 한번씩만 방문하면서 걸린 비용이 최소가 드는 경로를 찾는 문제이다. 따라서 최적해(optimal)를 구하는 것은 전형적인 NP-완전 문제 중의 하나로, 외판원 문제를 해결하려는 다양한 알고리즘들이 개발되고 있다. 특히 실제 생체 분자(bio-molecule)를 계산의 도구로 사용하는 새로운 계산 방법인 DNA 컴퓨팅은 DNA 분자가 잠재적으로 가지고 있는 막대한 병렬성을 이용해서 NP-완전 문제들을 해결하고자 하는 연구들이 많이 진행되고 있다. 그러나 아직 실제 생체 분자의 특성을 잘 반영하는 계산 모델이나 분자 생물학에서 사용하는 연산들이 많이 개발되지 않아 계산 효율이 비교적 좋지 않다. 따라서 본 논문에서는 외판원 문제를 해결하기 위한 DAN컴퓨팅의 새로운 중합 효소 연쇄 반응(Polymerase Chain Reaction, PCR) 연산을 개발하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3126-3145
• /
• 2014

Cloud computing is a computing paradigm in which users can rent computing resources from service providers according to their requirements. A spot instance in cloud computing helps a user to obtain resources at a lower cost. However, a crucial weakness of spot instances is that the resources can be unreliable anytime due to the fluctuation of instance prices, resulting in increasing the failure time of users' job. In this paper, we propose a Genetic Algorithm (GA)-based workflow scheduling scheme that can find the optimal task size of each instance in a spot instance-based cloud computing environment without increasing users' budgets. Our scheme reduces total task execution time even if an out-of-bid situation occurs in an instance. The simulation results, based on a before-and-after GA comparison, reveal that our scheme achieves performance improvements in terms of reducing the task execution time on average by 7.06%. Additionally, the cost in our scheme is similar to that when GA is not applied. Therefore, our scheme can achieve better performance than the existing scheme, by optimizing the task size allocated to each available instance throughout the evolutionary process of GA.

• 인터넷정보학회논문지
• /
• 제24권2호
• /
• pp.1-10
• /
• 2023

The Multi-access Edge Computing (MEC) paradigm equips network edge telecommunication infrastructure with cloud computing resources. It seeks to transform the edge into an IT services platform for hosting resource-intensive and delay-stringent services for mobile users, thereby significantly enhancing perceived service quality of experience. However, erratic user mobility impedes seamless service continuity as well as satisfying delay-stringent service requirements, especially as users roam farther away from the serving MEC resource, which deteriorates quality of experience. This work proposes a deep reinforcement learning based service mobility management approach for ensuring seamless migration of service instances along user mobility. The proposed approach focuses on the problem of selecting the optimal MEC resource to host services for high mobility users, thereby reducing service migration rejection rate and enhancing service availability. Efficacy of the proposed approach is confirmed through simulation experiments, where results show that on average, the proposed scheme reduces service delay by 8%, task computing time by 36%, and migration rejection rate by more than 90%, when comparing to a baseline scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권11호
• /
• pp.3030-3049
• /
• 2023

With the development and wide application of hybrid network computing modes like cloud computing, edge computing and fog computing, the customer service requests and the collaborative optimization of various computing resources face huge challenges. Considering the characteristics of network environment resources, the optimized deployment of service resources is a feasible solution. So, in this paper, the optimal goals for deploying service resources are customer experience and service cost. The focus is on the system impact of deploying services on load, fault tolerance, service cost, and quality of service (QoS). Therefore, the alternate node filtering algorithm (ANF) and the adjustment factor of cost matrix are proposed in this paper to enhance the system service performance without changing the minimum total service cost, and corresponding theoretical proof has been provided. In addition, for improving the fault tolerance of system, the alternate node preference factor and algorithm (ANP) are presented, which can effectively reduce the probability of data copy loss, based on which an improved cost-efficient replica deployment strategy named ICERD is given. Finally, by simulating the random occurrence of cloud node failures in the experiments and comparing the ICERD strategy with representative strategies, it has been validated that the ICERD strategy proposed in this paper not only effectively reduces customer access latency, meets customers' QoS requests, and improves system service quality, but also maintains the load balancing of the entire system, reduces service cost, enhances system fault tolerance, which further confirm the effectiveness and reliability of the ICERD strategy.