• Title/Summary/Keyword: 사용자 공평성

Search Result 53, Processing Time 0.027 seconds

Class Gated Dynamic Bandwidth Allocation Algorithm for supporting QoS in the EPON (EPON 시스템에서 효율적인 QoS 제공을 위한 Class Gated 동적 대역 할당 알고리즘)

  • Hwang Jun-Ho;Kim Hyo-Won;Yoo Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.94-103
    • /
    • 2006
  • Ethernet passive optical network (EPON) has drawn many attention as a promising access network technology for FTTH because it can provide a high bandwidth with a low cost. Since the uplink bandwidth in the EPON system is shared by many users, it is necessary for an EPON system to have an efficient bandwidth allocation mechanism. To support QoS in EPON, the previous bandwidth allocation schemes employ strict priority queueing (SPQ). Since SPQ gives unlimited priority to higher service class, the QoS of lower service classes gets worse. In this paper, we propose Class Gated DBA (Dynamic Bandwidth Allocation) algorithm in which the bandwidth is requested / granted in a service class basis. To avoid the monopoly in bandwidth usage by higher classes the maximum bandwidth that is allocate to each service class is limited (fairness between services classes). In addition, to avoid the monopoly in bandwidth usage by some particular users, each ONU runs fairness bandwidth allocation algorithm within each service classes. Through computer simulations, it is verified that the proposed algorithm achieves a good level of QoS, and at the same time maintains a good level of fairness between both service classes and users.

A Scheduling Algorithm to reduce inter-cell interference in OFDM Systems (OFDM 시스템에서의 인접 셀 간의 간섭을 줄이기 위한 스케줄링 알고리즘)

  • Lee, Tae-Rak;Wu, Hyuk;Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.4
    • /
    • pp.521-529
    • /
    • 2010
  • In this paper, we propose a new scheduling algorithms in OFDM systems to reduce inter-cell interference. The proposed algorithm applies different subcarrier allocation sequences for different cells which is optimized through integer programming to minimize inter-cell interference. System level simulation is executed to derive the performance of the proposed algorithm. Simulation results show that the proposed scheduling algorithm improves user fairness as well as throughput compared with previous algorithms and therefore improves support of user QoS.

Fixed Indoor-BS Selection Based Self-Healing in Indoor Wireless Communication System (인도어 무선통신시스템에서 고정적 인도어기지국 선택을 통한 자가치유 알고리즘)

  • Lee, Howon;Lee, Kisong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1540-1546
    • /
    • 2014
  • In order to resolve coverage hole problems caused by indoor-BS (IBS) faults, we propose a new frame structure and practical algorithm based on optimization technique. Our main contributions can be described as follows: 1) a frame structure with healing channels for solving abnormal IBS faults; and 2) an efficient heuristic resource allocation algorithm with fixed IBS selection to reduce the complexity for the optimization problem. Through intensive simulations, we evaluate the performance excellency of our proposed algorithm with respect to average cell capacity and user fairness compared with conventional algorithms.

On Improved Outage Probability of Correlated Superposition Coding/non-SIC NOMA (상관 관계 중첩 코딩/non-SIC 비직교 다중접속의 향상된 Outage 확률에 관해)

  • Chung, Kyu-Hyuk
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.4
    • /
    • pp.611-616
    • /
    • 2021
  • This paper investigates the improved outage probability of correlated superposition coding(CSC)/non-successive interference cancellation(SIC) non-orthogonal multiple access(NOMA) scheme. For this, first, we calculate the outage probability of the conventional independent superposition coding(ISC)/SIC NOMA scheme. Then, simulations demonstrate that the outage probability of CSC/non-SIC NOMA improves greatly, with respect to that of conventional ISC/SIC NOMA. As a result, CSC/non-SIC NOMA schemes could be a promising technique in 5G networks, especially with such improved outage probability.

Physical Layer Diversity and its Effects on the Performance of WLANs (물리 계층의 다양성과 무선 랜의 성능에 미치는 영향)

  • Choi, Sunwoong;Park, Kihong;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.723-731
    • /
    • 2005
  • Wide spread deployment of infrastructure WLANs has made Wi Fi an integral part of today's Internet access technology. Despite its crucial role in affecting end to end performance, past research has focused on MAC protocol enhancement, analysis and simulation based performance evaluation without sufficient consideration for modeling inaccuracies stemming from inter layer dependencies, including physical layer diversity, that significantly impact performance. We take a fresh look at IEEE 802.11 WLANs, and using experiment, simulation, and analysis demonstrate its surprisingly agile performance traits. Contention based MAC throughput degrades gracefully under congested conditions, enabled by physical layer channel diversity that reduces the effective level of MAC contention. In contrast, fairness and jitter significantly degrade at a critical offered load. This duality obviates the need for link layer flow control for throughput improvement but necessitates traffic control for fairness and QoS. We use experimentation and simulation in a complementary fashion, pointing out performance characteristics where they agree and differ.

Long-Term Performance Evaluation of Scheduling Disciplines in OFDMA Multi-Rate Video Multicast Transmission (OFDMA 다중률 비디오 멀티캐스트 전송에서 스케줄링 방식의 장기적 성능 평가)

  • Hong, Jin Pyo;Han, Minkyu
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.246-255
    • /
    • 2016
  • The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

A Priority based Dynamic Spectrum Allocation Algorithm for Multiple Network Operators Supporting Multiple Service Classes (다중 서비스 클래스를 제공하는 네트워크 운영자를 위한 우선순위 기반의 동적 스펙트럼 할당 알고리즘)

  • Kim, Hoon;Joo, Yang-Ick;Yun, Sang-Boh;Lee, Yeon-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.59-66
    • /
    • 2008
  • This paper presents a spectrum sharing and allocation problem in multiple network operators(NOs). Most of previous works as to dynamic spectrum allocation(DSA) schemes have presented the DSA gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators(NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority(or fairness) between NOs, the prioritybetween multiple class services, and the urgent bandwidth request. It was shown that the proposed algorithm with priorities between multiple class services could sustain better satisfaction ratio(SR) than the fixed allocation schemes or one without priority under different traffic patterns. Therefore, we conclude that the proposed DSA with priorities between multiple class services and network operators could provide the fairness between service classes of network operators and effective negotiation procedure for urgent bandwidth request by users.

Capacity Optimization of a 802.16e OPDMA/TDD Cellular System using the Joint Allocation Algorithm of Sub-charmel and Transmit Power - Part II : Sub-channel Allocation in the Uplink Using the Channel Sounding and Initial Transmit Power Decision Algorithm According to the User's Throughput (802.16e OFDMA/TDD 셀룰러 시스템의 성능 최적화를 위한 부채널과 전송전력 결합 할당 알고리즘 - Part II : 상향링크에서 Channel Sounding을 통한 부채널 할당 및 사용자의 수율에 따른 초기전송전력 결정 알고리즘)

  • Ko, Sang-Jun;Chang, Kyung-Hi;Kim, Jae-Hyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9A
    • /
    • pp.888-897
    • /
    • 2007
  • In this paper, we propose an uplink dynamic resource allocation algorithm to increase sector throughput and fairness among users in 802.16e OFDMA TDD system. In uplink, we address the difference between uplink and downlink channel state information in 802.16e OFDMA TDD system. The simulation results show that not only an increment of 10% of sector throughput but higher level of fairness is achieved by round-robin using the FLR and the rate / margin adaptive inner closed-loop power control algorithm. The FLR algorithm determines the number of sub-channels to be allocated to the user according to the user's position. Also, we get 31.8% more sector throughput compared with the round-robin using FLR by FASA algorithm using uplink channel state information. User selection, sub-channel allocation, power allocation algorithms and simulation methodology are mentioned in Part I.

GPU Memory Management Technique to Improve the Performance of GPGPU Task of Virtual Machines in RPC-Based GPU Virtualization Environments (RPC 기반 GPU 가상화 환경에서 가상머신의 GPGPU 작업 성능 향상을 위한 GPU 메모리 관리 기법)

  • Kang, Jihun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.5
    • /
    • pp.123-136
    • /
    • 2021
  • RPC (Remote Procedure Call)-based Graphics Processing Unit (GPU) virtualization technology is one of the technologies for sharing GPUs with multiple user virtual machines. However, in a cloud environment, unlike CPU or memory, general GPUs do not provide a resource isolation technology that can limit the resource usage of virtual machines. In particular, in an RPC-based virtualization environment, since GPU tasks executed in each virtual machine are performed in the form of multi-process, the lack of resource isolation technology causes performance degradation due to resource competition. In addition, the GPU memory competition accelerates the performance degradation as the resource demand of the virtual machines increases, and the fairness decreases because it cannot guarantee equal performance between virtual machines. This paper, in the RPC-based GPU virtualization environment, analyzes the performance degradation problem caused by resource contention when the GPU memory requirement of virtual machines exceeds the available GPU memory capacity and proposes a GPU memory management technique to solve this problem. Also, experiments show that the GPU memory management technique proposed in this paper can improve the performance of GPGPU tasks.

A New Resource Allocation with Rate Proportionality Constraints in OFDMA Systems (OFDMA 시스템에서 비율적 전송률 분배를 위한 자원 할당)

  • Han, Seung-Youp;Oh, Eun-Sung;Han, Myeong-Su;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.59-65
    • /
    • 2008
  • In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.