• 한국통신학회논문지
• /
• 제37권8B호
• /
• pp.677-686
• /
• 2012

In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

• 한국통신학회논문지
• /
• 제32권5A호
• /
• pp.387-393
• /
• 2007

본 논문에서는 WiBro 시스템의 특징을 바탕으로 데이터 트래픽의 수율을 최대로 유지 할 수 있도록 기존 방법을 개선한 부하 제어 방법을 제안하고 컴퓨터 시뮬레이션을 통하여 성능을 평가한다. 송신단에서 단위 사용자당 최대 할당 가능한 전력이 주어졌을 때, 송출 가능한 전력범위 내에서 최대의 수율을 갖도록 각 부반송파에 데이터 비트를 할당하는 알고리즘을 바탕으로 WiBro 시스템의 전체 수율(throughput)과 데이터 트래픽 관점에서 시스템의 수율을 고려하였다. 제안하는 방안의 평가를 위해 사용된 시스템의 파라메터로 WiBro시스템의 규격값들을 사용한다. 현재 시스템의 부하제어 절차로는 접속과다로 인한 대역폭 요구(bandwidth request)의 증가로 인하여 과부하 상태에 이를 때 시그널링 트래픽으로 인하여 데이터의 수율이 급격히 감소하며 접속지연이 매우 증가하게 된다. 이러한 현상을 막을 수 있는 부하 제어 방법을 제안하고 다중 사용자 환경에서 시뮬레이션을 통하여 평가한다.

• 한국통신학회논문지
• /
• 제34권4A호
• /
• pp.316-323
• /
• 2009

본 논문은 셀간 간섭을 제어하여 셀 경계 사용자의 데이터 전송율을 증가시키는 기술인 소프트 주파수 재사용시 전력 할당에 관한 것이다. 소프트 주파수 재사용 기술은 셀 경계 사용자의 데이터 전송율을 개선하는데 유용한 기술이나 주파수 재사용 지수가 증가되어 셀 평균 데이터 전송율을 감소시키는 문제가 있다. 본 논문에서는 하나의 중앙 제어기가 물리적 거리가 인접한 여러 개의 셀을 제어하는 환경에서, 셀 경계 사용자의 데이터 전송율 개선하면서도 셀 평균 전송율 감소를 최소화하도록 소프트 주파수 재사용을 위한 송신 전력 할당 기법을 제안한다. 시스템 시뮬레이션을 통하여 인접한 두 셀에 소프트 주파수 재사용 기술을 적용하여 소프트 주파수 재사용에 의한 셀 평균 데이터 전송율 감소 정도와 제안하는 전력 할당 기법에 의한 셀 평균 데이터 전송을 개선을 살펴본다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1342-1359
• /
• 2021

The data deduplication technique identifies the duplicates and minimizes the redundant storage data in the backup server. The chunk level deduplication plays a significant role in detecting the appropriate chunk boundaries, which solves the challenges such as minimum throughput and maximum chunk size variance in the data stream. To provide the solution, we propose a new chunking algorithm called Dynamic Prime Chunking (DPC). The main goal of DPC is to dynamically change the window size within the prime value based on the minimum and maximum chunk size. According to the result, DPC provides high throughput and avoid significant chunk variance in the deduplication system. The implementation and experimental evaluation have been performed on the multimedia and operating system datasets. DPC has been compared with existing algorithms such as Rabin, TTTD, MAXP, and AE. Chunk Count, Chunking time, throughput, processing time, Bytes Saved per Second (BSPS) and Deduplication Elimination Ratio (DER) are the performance metrics analyzed in our work. Based on the analysis of the results, it is found that throughput and BSPS have improved. Firstly, DPC quantitatively improves throughput performance by more than 21% than AE. Secondly, BSPS increases a maximum of 11% than the existing AE algorithm. Due to the above reason, our algorithm minimizes the total processing time and achieves higher deduplication efficiency compared with the existing Content Defined Chunking (CDC) algorithms.

• 중소기업융합학회논문지
• /
• 제4권1호
• /
• pp.1-6
• /
• 2014

PB/MC-CDMA는 기존 MC-CDMA 시스템과는 달리 여러 개의 블록으로 전체 주파수 대역을 분할하는 효율적인 시스템이다. 다중 블록 PB/MC-CDMA에서 효율적인 자원 할당 방식을 제안한다. 이 시스템은 주파수 효율을 향상시키고 다양한 채널 조건을 통해 사전에 정의 된 임계값을 만족시키면서 전체 처리량을 극대화 하는 것을 목표로 하고 있다. 또한, 컴퓨터 시뮬레이션을 통해 제안하는 시스템의 성능 처리량 측면에서 더 효과적인 것을 확인한다.

• 한국통신학회논문지
• /
• 제35권4A호
• /
• pp.315-321
• /
• 2010

Ad-hoc 네트워크에서는 전력을 제어할 기지국의 부재로 시스템의 성능을 최적화 시키는 중앙 전력 제어가 불가능하여, 각 노드들은 독립적이고 자동적인 방식으로 분산형 전력 제어 알고리즘을 수행해야 한다. 기존의 분산형 전력 제어 알고리즘은 수신 신호의 SINR (signal to interference and noise ratio)에 따라 MCS (modulation and coding scheme) 레벨을 변화 시키는 adaptive bit loading operation을 고려하지 않기 때문에, 전체 throughput 향상에 제한이 있다. 본 논문에서는 Ad-hoc 환경에서 전체 throughput 을 향상시키고, outage 확률을 낮추기 위해 MCS 레벨에 따라 adaptive bit loading operation을 고려한 분산형 전력 제어 알고리즘을 제안한다. 컴퓨터 모의실험 결과 매우 큰 throughput 향상과 outage 확률 감소의 성능 향상을 확인할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1301-1318
• /
• 2017

In order to utilize the licensed channel of cognitive radio (CR) when the primary user (PU) is detected busy, a benefit-exchange access mode based on cooperative communication is proposed to allow secondary user (SU) to access the busy channel through giving assistance to PU's communication in exchange for some transmission bandwidth. A holistic joint optimization problem is formulated to maximize the total throughput of CR system through jointly optimizing the parameters of cooperative spectrum sensing (CSS), including the local sensing time, the pre-configured sensing decision threshold, the forward power of cooperative communication, and the bandwidth and transmission power allocated to SUs in benefit-exchange access mode and traditional access mode, respectively. To solve this complex problem, a combination of bi-level optimization, interior-point optimization and exhaustive optimization is proposed. Simulation results show that, compared with the tradition throughput maximizing model (TTMM), the proposed holistic joint optimization model (HJOM) can make use of the channel effectively even if PU is busy, and the total throughput of CR obtains a considerable improvement by HJOM.

• 반도체디스플레이기술학회지
• /
• 제19권4호
• /
• pp.39-45
• /
• 2020

In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.267-284
• /
• 2008

Consider a supply chain where products are produced at a manufacturing system, shipped to a distribution center, and then supplied to customers. The distribution center controls inventory based on a base-stock policy, and whenever a unit of product is demanded by a customer, an order is released to the production system. Unsatisfied demand is backordered, and the inventory and backordered units are a function of the base-stock level. The manufacturing system is modeled as an M/M/s/c queueing system, and orders exceeding the limited buffer capacity are blocked and lost. The throughput of the manufacturing system and the steady state distribution of the outstanding orders are functions of number of servers and buffers of the manufacturing system. There is a profit obtained from throughput and costs due to servers and buffers of the manufacturing system, and also costs due to inventory positions of the distribution center, and we want to maximize the total production profit minus the total cost of the supply chain by simultaneously determining the optimal number of servers and buffers of the manufacturing system and the optimal base-stock level of the distribution center. We develope two algorithms, one analytical but without guarantee of the optimal solution and one optimal but without complete analytical proofs. The problem integrates strategic problem of the manufacturing system with tactical problem of the distribution center in a supply chain.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.93-104
• /
• 2007

We consider a supply chain where products are shipped to warehouse from manufacturing system to customers. Products are supplied from either in-house regular manufacturing or the secondary source such as subcontractor. The inventory in warehouse is controlled by base-stock policy, that is, whenever a demand arrives from customer, an order is released to the manufacturing system. Unsatisfied demand is backlogged. The manufacturing system is modeled as M/M/s+1/c queueing system, and the orders exceeding the given limit care blocked and lost. The steady state distribution of the outstanding orders and the throughput of the manufacturing system are functions of the level of engagement In the secondary source. There is a profit obtained from throughput and cost not only due to the engagement of the secondary source in the manufacturing system but also inventory positions. We want to maximize the total production profit minus the total cost of the production system by simultaneously determining the optimal level of engagement of the secondary source and the optimal base-stock level of the inventory. We develop two algorithms : one without guarantee of the optimal solution but with the small number of computations, the other optimal but with more computations.