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

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

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.444-450
• /
• 2008

This paper studies the performance of multiuser data networks with transmit diversity under correlated fading channels. Previous work shows that correlated fading reduces the link performance of multiple antenna systems, but how correlated fading affects the throughput of multiuser data networks is still unknown since the throughput depends not only on the link performance but also on the multiuser diversity. We derive the throughput of the multiuser data networks with various transmit diversity schemes under correlated fading channels. The impact of correlated fading on the throughput is investigated. Analytical and simulation results show that, although correlated fading is harmful for link performance, it increases the throughput of the multiuser data networks if the transmit scheme is appropriately selected.

• 한국통신학회논문지
• /
• 제28권12C호
• /
• pp.1192-1199
• /
• 2003

본 논문에서는 다중경로 채널 환경에서 펄스 반복 빈도 (pulse repetition frequency, PRF)와 슬롯 시간이 UWB (ultra wide band) 무선 통신 시스템의 데이터 전송율 (throughput) 성능에 미치는 영향을 조사하고 이를 기반하여 유효 데이터 전송율이 최대화되도록 하는 PRF와 슬롯 시간을 이용한 전송율 제어를 제안한다. 최근에 UWB 시스템이 갖고 있는 장점으로 인하여 근거리 고속 무선 데이터 전송과 관련하여 관심이 고조되고 있다. UWB 시스템에서는 데이터 전송율을 결정짓는 파라미터로는 펄스를 반복하는 펄스 반복 회수와 펄스간의 간격을 결정짓는 슬롯 시간을 들 수 있다. AWGN이 존재하는 다중경로 채널 하에 있는 UWB 시스템은 펄스간의 간섭(inter-pulse interference, IPI)과 잡음에 의하여 시스템 성능이 저하된다. UWB 시스템은 이 두 파라미터의 조정을 통하여 시스템의 성능을 유지 또는 개선할 수 있다. 본 논문에서는 두 파라미터의 변화가 다양한 채널 환경에서 데이터 전송율에 미치는 영향을 모의실험을 통하여 관측하고 이를 기반하여 설계된 가변 전송율을 사용하는 것이 비가변적인 방법에 비하여 유효 데이터 전송율 측면에서 우수함을 모의실험을 통하여 검증하였다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2008년도 정보통신설비 학술대회
• /
• pp.107-111
• /
• 2008

3GPP는 사용자의 다운링크 패킷 데이터 Throughput을 높이고,NodeB에 MAC계층을 위치시켜, 사용자의 스케줄링과 재전송을 담당하게 함으로써, 다운링크 패킷의 전송 지연을 감소시키는 HSDPA(High Speed Data Packet Access)기술을 Release 5에서 도입하였다. NodeB에 위치한 MAC-hs 스케줄러는 각각의 사용자에게 가용한 NodeB의 RF power와 code 자원을 제공하며, R99에서 사용했던 Power control을 이용하는 대신, AMC(Adaptive Modulation and Coding)기능을 제공하여 Radio conditions에 따라 전송되는 Data Format을 조정하여 채널환경이 좋은 사용자에게는 높은 data Throughput을 제공하며, 채널환경이 좋지 않은 사용자에게는 낮은 data throughput을 제공하고 있다. 본 고에서는 매 TTI에 스케줄링된 사용자에게 제공하고도, RF power 및 code 자원이 남아 있을 경우, 스케줄러는 남은 자원을 각각의 사용자에게 재 분배하여, 초기에 추정한 HSDPA Throughput보다 향상된 성능을 갖을 수 있음을 설명하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.668-685
• /
• 2019

Provision of higher throughput without sacrificing consistency guarantees in replication systems is a critical problem. In this paper, we propose a novel approach called Bidirectional Chain Replication (BCR) to improve throughput in traditional Chain Replication (CR) through better utilization of computing and communication resources of the chain. Unlike CR where the whole replicated data store is treated as a single unit, in BCR the replicated shared data at each server in the chain is split into two disjoint Logical Partitions ($LP_1$, $LP_2$). This forms two chains running concurrently on the same hardware in two opposite directions; the first chain ($CR_1$) exclusively manipulates data objects in $LP_1$, while the second chain ($CR_2$) exclusively manipulates data objects in $LP_2$, therefore, conflict is avoided and concurrency is guaranteed. The simultaneous employment of these two chains results in better utilization of hardware in the sense that the two chains can evenly share the workload, hence, throughput can be improved without sacrificing consistency. Experimental results showed an improvement of approximately 85% in throughput of BCR over CR.

• 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.

• Journal of information and communication convergence engineering
• /
• 제15권2호
• /
• pp.79-84
• /
• 2017

In a cognitive radio network (CRN), cognitive radio users (CUs) should be powered by a small battery for their operations. The operations of the CU often include spectrum sensing and data transmission. The spectrum sensing process may help the CU avoid a collision with the primary user (PU) and may save the energy that is wasted in transmitting data when the PU is present. However, in a time-slotted manner, the sensing process consumes energy and reduces the time for transmitting data, which degrades the achieved throughput of the CRN. Subsequently, the sensing process does not always offer an advantage in regards to throughput to the CRN. In this paper, we propose a scheme to find an optimal policy (i.e., perform spectrum sensing before transmitting data or transmit data without the sensing process) for maximizing the achieved throughput of the CRN. In the proposed scheme, the data collection period is considered as the main factor effecting on the optimal policy. Simulation results show the advantages of the optimal policy.

• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.213-218
• /
• 2007

Methods for symbol-by-symbol channel feedback and adaptation of symbol durations have been recently proposed. In this paper, we quantitatively analyze the gain in error-constrained data throughput due to such an extremely rapid adaptation of symbol durations to fast-time-varying channels. The results show that a symbol-by-symbol adaptation can achieve a throughput gain by orders of magnitude over a frame-by-frame adaptation.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.155-162
• /
• 2016

Several distributed scheduling policies have been proposed with the objective of attaining the maximum throughput region or a guaranteed fraction throughput region. These policies consider only the theoretical throughput and do not account the lost in throughput due to the time complexity of implementing an algorithm in practice. Therefore, we propose a novel concept called effective throughput to characterize the actual throughput by taking into account the time complexity. Effective throughput can be viewed as the actual transmitted data without including the control message overhead. Numerical results demonstrate that in practical scheduling, time complexity significantly affects throughput. The performance of throughput degrades when the time complexity is high.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4324-4342
• /
• 2014

Previous papers analyzed the throughput performance of the CDMA ALOHA system in Rayleigh fading channel, but they assume that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. We recently proposed the finite-state Markov channel (FSMC) model to the throughput analysis of DS uncoded CDMA/unslotted ALOHA networks for fixed length data traffic in the mobile environment. We now propose the FSMC model to the throughput analysis of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and one or two user classes in the mobile environment. The proposed DS CDMA/unslotted ALOHA wireless networks for two user classes with access control can maintain maximum throughput for the high priority user class under high message arrival per packet duration.