• Title/Summary/Keyword: Fair Performance

Search Result 417, Processing Time 0.024 seconds

On the Fairness of the Multiuser Eigenmode Transmission System

  • Xu, Jinghua;Zhou, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.6
    • /
    • pp.1101-1112
    • /
    • 2011
  • The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

Performance Evaluation of Interference Alignment Technique in Wireless LAN Environment (무선랜 환경에서 간섭정렬 기술의 성능 평가)

  • Yoon, Seokhyun;Shin, Won-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1639-1644
    • /
    • 2016
  • In this paper, we consider the performance improvement that can be obtained with interference alignment (IA) technique applied to 802.11ac based multi-BSS WiFi service. To this end, we developed a system simulator consisting of a link-level PHY simulator, based on 802.11ac specification, and multi-BSS proportional-fair scheduler. Specifically, assuming perfect channel side information and synchronization of signals from multiple APs, we used a SLNR based interference alignment algorithm proposed in [13] and compared its performance with that of multiuser beamforming based time-sharing system. The performance was evaluated in terms of average throughput per BSS and 5% worst user throughput. The results show that 70 to 100% throughput gain can be obtained in this ideal scenario.

Multi-Parameter Based Scheduling for Multi-user MIMO Systems

  • Chanthirasekaran, K.;Bhagyaveni, M.A.;Parvathy, L. Rama
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2406-2412
    • /
    • 2015
  • Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

Proposed Performance Criteria and Evaluation Procedures for Transmission System Planning in Korea

  • Kook, Kyung-Soo;Kim, Taihyun;Oh, Tae-Kyoo;Bang, Min-Jae
    • KIEE International Transactions on Power Engineering
    • /
    • v.2A no.4
    • /
    • pp.160-165
    • /
    • 2002
  • This paper describes a proposed performance criteria and evaluation procedures for transmission system planning in Korea. Performance criteria of the transmission system are expected to be used as a guideline for investment into a transmission network. Moreover, performance evaluation procedures, which are based on current practices and widely accepted theories, are suggested to achieve fair and acceptable results.

A Study on Real Time Traffic Performance Improvement Considering QoS in IEEE 802.15.6 WBAN Environments (IEEE 802.15.6 WBAN 환경에서 QoS를 고려한 실시간 트래픽 성능향상에 관한 연구)

  • Ro, Seung-Min;Kim, Chung-Ho;Kang, Chul-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.84-91
    • /
    • 2011
  • Recently, WBAN(Wireless Body Area Network) which has progressed standardization based on IEEE 802.15.6 standardization is a network for the purpose of the short-range wireless communications within around 3 meters from the inner or outer human body. Effective QoS control technique and data efficient management in limited bandwidth such as audio and video are important elements in terms of users and loads in short-range wireless networks. In this paper, for high-speed WBAN IEEE 802.15.6 standard, the dynamic allocation to give an efficient bandwidth management and weighted fair queueing algorithm have been proposed through the adjustment of the super-frame about limited data and Quality of Service (QoS) based on the queuing algorithm. Weighted Fair Queueing(WFQ) Algorithm represents the robust performance about elements to qualitative aspects as well as maintaining fairness and maximization of system performance. The performance results show that the dynamic allocation expanded transmission bandwidth five times and the weighted fair queueing increased maximum 24.3 % throughput and also resolved delay bound problem.

Performance Analysis of HomePNA 2.0 MAC Protocol (HomePNA 2.0 MAC 프로토콜의 성능 분석)

  • Kim, Jong-Won;Kim, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.877-885
    • /
    • 2005
  • The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we propose some mathematical models about the important elements of HomePNA 2.0 MAC protocol performance, which are Saturation Throughput, Packet Delay and Packet Jitter. Then, we present an overall performance analysis of HomePNA 2.0 MAC protocol along with simulations.

A Delay-Bandwidth Normalized Scheduling Model with Service Rate Guarantees (서비스율을 보장하는 지연시간-대역폭 정규화 스케줄링 모델)

  • Lee, Ju-Hyun;Hwang, Ho-Young;Lee, Chang-Gun;Min, Sang-Lyul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.529-538
    • /
    • 2007
  • Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

Design of Optimized Multi-Fuzzy Controllers by Hierarchical Fair Competition-based Genetic Algorithms for Air-Conditioning System (에어컨시스템에 대한 계층적 공정 경쟁 유전자 알고리즘을 이용한 최적화된 다중 퍼지제어기 설계)

  • Jung, Seung-Hyun;Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.4
    • /
    • pp.344-351
    • /
    • 2007
  • In this paper, we propose an approach to design multi-fuzzy controllers for the superheat and the low pressure that have an influence on energy efficiency and stabilization of air conditioning system with multi-evaporators. Air conditioning system with multi-evaporators is composed of compressor, condenser, several evaporators and several expansion valves. It is quite difficult to control the air conditioning system because the change of the refrigerant condition give an impact on the overall air conditioning system. In order to solve the drawback, we design multi-fuzzy controllers which control simultaneously both three expansion valve and one compressor for the superheat and the low pressure of air conditioning system. The proposed multi fuzzy controllers are given as a kinds of controller types such as a simplified fuzzy inference type. Here the scaling factors of each fuzzy controller are efficiently adjusted by Hierarchical Fair Competition-based Genetic Algorithms. The values of performance index of the simulation results of the A company type compare with simulation results of simplified inference type.

Performance Improved Buffer Management Algorithm for GFR Service (GFR 서비스를 위한 성능 향상된 버퍼관리 알고리즘)

  • Cho Hae-Seong
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.5
    • /
    • pp.248-254
    • /
    • 2005
  • The existing buffer management scheme is caused by with burstness characteristic of the TCP traffic and with only the transmission which is not loss it provides the smallest transmission rate guarantee where the GFR demands and a fair characteristic. In order to provide a high fair characteristic from the dissertation which it sees with the smallest transmission rate guarantee where the GFR demands it proposed the existing buffer algorithm which applies a Fuzzy mechanism in the existing buffer management technique. The proposed algorithm decides a packet disuse used by three parameters which are composed of tagging information, the buffer usage, and the load of VC. Simulation results shows that the fairness and goodput of the proposed algorithm were excellent where the size of MCR will become larger, from the switch the Double-EPD or the DFBA was visible a similar efficiency even from size change of the buffer. The algorithm which is proposed provides a good throughput and a fair characteristic.

  • PDF

Cell Scheduling Algorithm for Internet Service over ATM Networks (ATM 망에서 인터넷 서비스를 위한 셀 스케줄링 알고리즘)

  • Cho, Hae-Seong
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.238-244
    • /
    • 2007
  • Guaranteed Frame Rate(GFR), recently approved by the ATM Forum, expects to become an important service category to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. We proposed new scheduling scheme for the GFR service. Proposed scheme provides priority to VCs and high priority to a VC which have more untagged cells in buffer. High priority VCs have much more serviced than low priority. Proposed scheme can provide MCR(minimum cell rate) guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP goodput and fairness than previous scheme.