• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2020년도 제62차 하계학술대회논문집 28권2호
• /
• pp.387-388
• /
• 2020

As the utilization of microservice architectural style in diverse applications are increasing, the microservice deployment cost became a concern for many companies. We propose an approach to reduce the deployment cost by generating an algorithm which minimizes the cost of basic operation of a physical machine and the cost of resources assigned to a physical machine. This algorithm will produce optimal resource allocation and deployment location based on genetic algorithm process.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2014년도 추계학술발표대회
• /
• pp.215-217
• /
• 2014

In Software Defined Network (SDN), data plane and control plane are decoupled. Dummy switches on the data plane simply forward packet based on the flow entries that are stored in its flow table. The flow entries are generated by a centralized controller that acts as a brain of the network. However, the size of flow table is limited and it can conduct a security issue related to Distributed Denial of Service (DDoS). Especially, it related to resource attack that consumes all flow table resource and consumes controller resources. In this paper, we will analyze the impact of flow table limitation to the controller. Then we propose an approach that is called Flow Table Management to handle flow table limitation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

• 정보과학회 논문지
• /
• 제44권5호
• /
• pp.439-448
• /
• 2017

대규모 HPC 과학 응용의 워크로드가 전체 실행시간 동안 다양하게 변화하는 자원 요구사항을 갖게 되면서 특정 시점에 갑자기 요구사항이 증가하는(bursty) 형태가 되고 있다. 그러나 이러한 응용 워크로드를 고려하지 않고, 최대 자원 요구사항만을 반영한 가상 자원의 오버-프로비저닝은 과학 응용의 성능을 보장하지만 다른 응용이 사용할 수 없는 유휴 자원을 늘리는 문제로 남아있다. 본 논문에서는 OS-level 가상화 환경에서 응용의 자원 사용 패턴에 대한 프로파일링 데이터를 기반으로 메모리 자원 재구성 기법을 제안한다. 이는 유휴 상태의 메모리 자원을 신속하게 풀어주어 새로운 응용이 자원을 사용하여 수행할 수 있도록 한다. 본 연구에서는 경량화된 OS-level 가상화 시스템의 하나인 Docker에서 과학 워크플로우 응용을 이용하여 제안하는 알고리즘을 검증하였다. 실험을 통해 과학 응용을 실행하는 동안 컨테이너에 대한 메모리 할당 미세 조정이 전반적인 메모리 자원 활용을 향상시킬 수 있음을 보였다. 또한 응용의 메모리 사용 프로파일 데이터를 기반으로 하는 시뮬레이션 실험을 통해, 제안하는 동적 메모리 할당 기법을 사용하는 경우 대기 작업에 유휴상태의 메모리를 할당하여 전체 대기 작업의 수를 줄이고 시스템 작업 대기 시간이 줄어들었음을 보였다.

• Fisheries and Aquatic Sciences
• /
• 제26권10호
• /
• pp.617-627
• /
• 2023

Harvest control rules have been recently developed for some fisheries in Indonesia, including grouper fisheries, and are expected to reverse the trend of declining stocks. One of the proposed options of the harvest control rules is to implement the catch size limit. The catch size limit approach, however, is challenging, unless it is supported also with strong fisheries surveillance, law enforcement, and innovation. The catch size limit approach can be done by implementing changes in fishing methods and gear, including the application of different hook sizes in the hook and line fishing gear. This study examines the impact of different hook sizes on the length at first capture (Lc) and on the bell-shaped maximum selectivity using various selectivity models of the two targeted grouper species (Plectropomus leopardus and Plectropomus maculatus) in the Saleh bay, West Nusa Tenggara, Indonesia. We found that increasing hook size influences the grouper's catch size, increasing the Lc and the bell-shaped maximum selectivity of both species. Based on our findings, hook size can be used as one of the practical tools for grouper management measures, as part of harvest control rules to improve grouper stock in Indonesia.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.1996-2013
• /
• 2015

This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

• 한국게임학회 논문지
• /
• 제11권2호
• /
• pp.57-68
• /
• 2011

본 연구는 새롭게 탄생한 온라인 게임 기업이 시장 성장주기(도입기-성장기-성숙기)에 따라 어떻게 다원화 전략을 행하여 왔는가를 자원기반이론과 진화이론의 관점에서 실증적 사례 분석을 통해 그 역사적 진행 과정을 체계적으로 분석하였다. 초기 온라인 게임 기업들은 진입 조건(장르, 기술력, 이용자특성)에 따라 다른 전략(기술역량기반, 서비스역량기반)을 통해 성장하였다. 이후 성장기에 이들 기업들은 제품 다원화를 위해 자원기반(기술기반전략, 서비스기반전략)에 따라 경로의존적 제휴 전략(보완적, 대체적 제휴)을 수행하여왔다. 그러나 성숙기에 이들 기업들은 기존 경로의존적 전략을 뛰어넘어 이용가능한 모든 자원 역량을 동원하는 통합 전략을 자연적으로 선택함으로서 시장 성장주기에 탄력적으로 적응하였다. 이러한 분석 결과는 진화이론과 자원기반이론을 복합적으로 적용하여 새롭게 탄생한 산업에서 시장의 단계별 성장주기에 따라 온라인 게임 기업의 제휴 전략 패턴이 어떻게 자기조직화 하고 있는지 분석함으로써 새로운 산업적, 정책적, 이론적 모델이 요구되고 있음을 제시하고 있다.

• ETRI Journal
• /
• 제38권2호
• /
• pp.314-325
• /
• 2016

This paper examines the resource gain that can be obtained from the creation of clusters of nodes in densely populated areas. A single node within each such cluster is designated as a "hotspot"; all other nodes then communicate with a destination node, such as a base station, through such hotspots. We propose a semi-distributed algorithm, referred to as coordinated cognitive tethering (CCT), which clusters all nodes and coordinates hotspots to tether over locally available white spaces. CCT performs the following these steps: (a) groups nodes based on a modified k-means clustering algorithm; (b) assigns white-space spectrum to each cluster based on a distributed graph-coloring approach to maximize spectrum reuse, and (c) allocates physical-layer resources to individual users based on local channel information. Unlike small cells (for example, femtocells and WiFi), this approach does not require any additions to existing infrastructure. In addition to providing parallel service to more users than conventional direct communication in cellular networks, simulation results show that CCT can increase the average battery life of devices by 30%, on average.

• 지식경영연구
• /
• 제7권2호
• /
• pp.53-68
• /
• 2006

Knowledge has become an important resource for organization. The manufacturing industry is usually operated on the basis of business processes, and most workers are familiar with their own processes. The process-based approach, therefore, can provide an efficient way to capture and navigate knowledge. In this study, we focus on knowledge which may be missed during knowledge transfer among workers. For this, we propose a method for analyzing knowledge flow, which is passed among business processes. We propose a process-based knowledge management framework for analyzing knowledge flow, which employs a two-phase analysis: process analysis and knowledge flow analysis. A knowledge flow model, represented by Knowledge Flow Diagram, is proposed as a tool for representing knowledge. We formulate several semantics for knowledge flow modeling. We build the three-level schema: conceptual, logical, and physical in order to automate the knowledge model adaptive to knowledge management systems. The proposed approach is verified and illustrated through a case study on the manufacturing process of A Company.

• 자원ㆍ환경경제연구
• /
• 제22권3호
• /
• pp.499-520
• /
• 2013

기존 연구에서는 이산화탄소의 한계저감비용을 추정할 경우 쌍대성 이론에 근거하여 임의로 설정된 하나의 방향성 벡터(directional vector) 설정하였으나 본 연구에서는 이러한 한계를 극복하고자 다양한 형태의 방향성 벡터를 사용하여 이산화탄소의 한계저감비용을 추정하였다. 기존의 방법론에서는 임의로 설정된 방향성 벡터가 한계저감비용 추정에 결정적인 역할을 하여 선택된 방향성 벡터에 따라 한계저감 비용 추정치가 상당한 차이가 있음을 알 수 있다. 그리고 $45^{\circ}$의 방향성 벡터를 설정하는 경우에는 실제 이산화탄소 배출량 수준과는 다른 배출량 수준에서의 한계저감비용을 추정하게 되지만 본 연구에서 제안한 방법론에 의하여 추정된 한계저감비용은 실제 이산화탄소 배출량 수준에서 한계저감비용을 추정하여 보다 더 현실을 정확하게 반영하는 추정치이다. 새로운 방법론을 서유럽 국가에 적용하여 추정한 이산화탄소의 한계저감비용은 기존 방법론을 사용하는 경우에 비하여 적은 것으로 추정되었다.