• Information and Communications Magazine
• /
• v.29 no.5
• /
• pp.62-70
• /
• 2012

대량의 인명 피해가 발생하는 도심 내 급속 확산형 재난 상황이 전 세계적으로 발생함에 따라, 재난 대응을 위한 응급 운송 및 시뮬레이션 연구에 대한 관심이 증가하고 있다. 본 연구에서는 최근 다양한 방법으로 연구되고 있는 재난 대응 응급 운송 및 시뮬레이션 연구의 동향을 구조적인 내용 분석 기법을 이용하여 정리하였다. 우선, 재난 발생 전/후에 발생하는 응급 운송에 관한 문제들을 분류하고 문제의 특징을 분석하였다. 그리고 응급 자원의 최적할당 및 피해 지역 사람들의 효과적인 이송에 관한 의사 결정을 지원하기 위한 시뮬레이션 연구를 정리하였다. 최종적으로, 이러한 구조적 내용 분석을 바탕으로 자율 적응형 재난 대응 체계 구축을 위한 미래의 연구방향을 제시하였다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.229-232
• /
• 2008

급격한 이동통신 기술의 발전에 힘입어 음영지역 해소 및 고속 데이터 처리를 위해 댁내 기지국에 대한 개발 및 연구가 진행 중이다. 댁내 기지국은 크게 음영지역 해소를 위한 Open 방식의 기지국과 고속 데이터 처리를 위해 특정 가입자만 사용할 수 있는 Close 방식이 있다. 상기 방식들은 망의 특성에 맞게 이를 제공하는 망 사업자에 의해 선택 된다. 댁내 기지국을 관리하기 위해서는 많은 시간과 인력자원이 소요되므로 자동으로 설정 및 최적화시키는 기능이 요구 시 되고 있으며, 이를 3GPP에서 SON (Self Organizing Optimizing Networks) 이라 일컫고 연구진행 중이다. 본 논문은 댁내 기지국 관리를 위해 셀의 기본 인자인 PCI(Physical Layer Identity) 할당 방안과 댁내 기지국간 간섭을 최소화 시키기 위한 Adaptive Coverage 방안을 제시한다. 또한 계층적 셀 구성(Hierarchical Cell Structure)에 따른 이동성 제공 방안을 제시한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.4
• /
• pp.443-454
• /
• 1999

최소 여유시간 우선(Least-Laxity-First)스케쥴링 알고리즘은 여유시간이 작은 태스트가 높은 우선순위를 갖는 동적 우선순위 스케줄링 방법으로서 단일프로세서 시스템에서 최적임이 증명되었다. 그러나, 이 알고리즘은 최소 여유시간을 가진 태스크가 여러 개 존재하여 여유시간 충돌이 발생한 경우 이 태스크들 간에 빈번한 문맥교환이 발생하게 되는 문제점이 있어 실용적이지 못하다. 본 논문에서 제한하는 최소 여유시간 우선 기반의 최소선점을 갖는 스케줄링 알고리즘(Least-Laxity-First with Minimum Preemption 또는 LLF/MP)은 여유시간이 충돌했을 때에 문맥교환을 최소화함으로써 최소 여유시간 우선 스케줄링 알고리즘의 단점을 해결하였다. LLF/MP 스케줄링 알고리듬은 불필요한 문맥교환을 줄임으로써 시스템 오버헤드로 인한 시스템의 성능 저하를 방지할 수 있고 보다 많은 시스템 자원을 예측 불가능한 비주기적 태스크에게 할당할수 있다.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.214-223
• /
• 2019

This paper presents methodologies and strategies for developing standard operating procedures (SOPs) that are essential for practical use of disaster communication systems. Therefore, the various factors related to the SOP of the public safety network(SafeNet) are identified and analyzed, and the processes and strategies for the effective development of the SOP are developed and presented based on the analysis. In addition, the proposed SOP is reflected in LTE, which is public safety network implementation technology, and suggests how priority and QoS that are the basis of radio resource allocation should be operated.

• Resources Recycling
• /
• v.27 no.1
• /
• pp.14-21
• /
• 2018

The rapid increase in the consumption of products that contain rare metals has highlighted the importance of recycling and recovering resources from these products when they enter the waste stream. Among various metal resources that can be recovered, this study analyzes the waste streams of cobalt and palladium to determine how their waste resource circulation can be improved at each stage of the waste stream. The findings of this study point to improvements and strategies that can be made at individual stages. First, at the discharge/import stage, the implementation of tariff quotas for specific recycled metal resources is suggested to allow the systemic categorization of waste metals as resources. At the collection/discarding stage, a major problem is the instability in the supply of scrap metals, which may be better managed by changing the bidding process for the scrap metals. At the pretreatment stage, possible areas for improvement are uncovered concerning technical areas, such as technological development and improving the efficiency of material recycling, as well as policy-wise, for instance, expanding the regulation for manufacturers to produce products that are designed to facilitate resource recovery, increasing incentive for closed recycling, and refining the guidelines and standards for recycling. At the resource recovery stage, as the waste metal recycling industry consists of businesses that vary in size, policies to promote cooperation and coexistence between large and smaller enterprises will benefit the industry in the long-run. Lastly, at the product production/export stage, a tariff on exporting waste resources that contain cobalt and palladium will help control the amount of waste metals that are shipped abroad.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.101-106
• /
• 2011

In this paper, our goal is to design the controller which operates a manufacturing system, discrete event system, guaranteeing user specification. In specially, based on supervisory control theory W. M. Wonham, our work consists in performing the controller using Petri nets possible parallelism. In addition, we consider the problem of allocation for resources sharing of the issues to consider when designing using Petri net. The controller can be generated by synthesis of user specification model and plant model after giving the management for the resource sharing. This created controller can control the deadlock and starvation which can occur in the case with resource sharing. Previous studies proposed the Constrained Synchronous Reachability graph to synthesis of the two Petri nets models. Therefore, we provide the controlled system which forbids a deadlock and starvation using the result of previous studies.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.39-48
• /
• 2013

A cloud system has to deal with highly variable workloads resulting from dynamic usage patterns in order to keep the QoS within the predefined SLA. Aside from the aspects regarding services, another emerging concern is to keep the energy consumption at a minimum. This requires the cloud providers to consider energy and performance trade-off when allocating virtualized resources in cloud data centers. In this paper, we propose a resource provisioning approach based on dynamic thresholds to detect the workload level of the host machines. The VM selection policy uses utilization data to choose a VM for migration, while the VM allocation policy designates VMs to a host based on its service reputation. We evaluated our work through simulations and results show that our work outperforms non-power aware methods that don't support migration as well as those based on static thresholds and random selection policy.

• Journal of the Korea Institute of Building Construction
• /
• v.10 no.4
• /
• pp.31-39
• /
• 2010

As the linear scheduling method has been used since the Empire State Building linear schedule in 1929, it is being applied in various fields, such as construction and manufacturing. When addressing concurrent critical paths occurring in a linear construction schedule, empirical researches have stressed resource management, which should be applied for optimizing workflow, ensuring flexible work productivity and continuous resource allocation. However, work relationships have been usually overlooked in making the linear schedule from an existing network schedule. Therefore, this research analyzes the previous researches related to the linear scheduling model, and then proposes a method that can be applied for adopting the relationships of a network schedule to the linear schedule. To this end, this research considers the work relationships occurring in changing a network schedule into a linear schedule, and then confirms the activities movement phenomenon of linear schedule due to workspace change, such as physical floors change. As a result, this research can be used as a basic research in order to develop a system generating a linear schedule from a network schedule.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2539-2548
• /
• 2015

Overcoming inter-cell interference and spectrum scarcity are major issues in heterogeneous cellular networks. Static Frequency reuse schemes have been proposed as an effective way to manage the spectrum and reduce ICI(Inter cell Interference) in cellular networks. In a kind of static frequency reuse scheme, the allocations of transmission power and subcarriers in each cell are fixed prior to system deployment. This limits the potential performance of the static frequency reuse scheme. Also, most of dynamic frequency reuse schemes did not consider small cell and the network environment when the traffic load of each cell is heavy and non-uniform. In this paper, we propose an inter-cell resource allocation algorithm that dynamically optimizes subcarrier allocations for the multi-cell heterogeneous networks. The proposed dynamic frequency reuse scheme first finds the subcarrier usage in each cell-edge by using the exhaustive search and allocates subcarrier for all the cells except small cells. After that it allocates subcarrier for the small cell and then iteratively repeats the process. Proposed dynamic frequency reuse scheme performs better than previous frequency reuse schemes in terms of the throughput by improving the spectral efficiency due to it is able to adapt the network environment immediately when the traffic load of each cell is heavy and non-uniform.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2011

Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.