• Title/Summary/Keyword: Fairness Control

Search Result 286, Processing Time 0.026 seconds

Distributed Power and Rate Control for Cognitive Radio Networks

  • Wang, Wei;Wang, Wenbo;Zhu, Yajun;Peng, Tao
    • Journal of Communications and Networks
    • /
    • v.11 no.2
    • /
    • pp.166-174
    • /
    • 2009
  • In this paper, a distributed power and end-to-end rate control algorithm is proposed in the presence of licensed users. By Lagrangian duality theory, the optimal power and rate control solution is given for the unlicensed users while satisfying the interference temperature limits to licensed users. It is obtained that transmitting with either 0 or the maximum node power is the optimal scheme. The synchronous and asynchronous distributed algorithms are proposed to be implemented at the nodes and links. The convergence of the proposed algorithms are proved. Finally, further discussion on the utility-based fairness is provided for the proposed algorithms. Numerical results show that the proposed algorithm can limit the interference to licensed user under a predefined threshold.

A performance study on the fairness of a feedback-based rate control scheme applied to a multicast connection (멀티캐스트 연결에 적용하는 피드백에 근거한 율 제어 기법의 공정성에 관한 성능 분석)

  • 이미정
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2862-2868
    • /
    • 1996
  • A sueueing model is developed and analyzed to evaluate the performance of a local and a remote destination of one multicast connection subject to a simple two-level(binary) feedback-based adaptive rate control scheme. The reate control scheme is a simple extension of the one for point-to-point case. Individual cell loss probabilities at the local and remote destinations are obtained to study the fairness of the adaptive rate control scheme. Numerical results show that this simple adaptive rate control scheme, which is fair when it is applied to a multicast connection consisting of destinations with equal propagation delays, bears bias against remote destination.

  • PDF

Joint Mode Selection, Link Allocation and Power Control in Underlaying D2D Communication

  • Zhang, Wei;He, Wanbing;Wu, Dan;Cai, Yueming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5209-5228
    • /
    • 2016
  • Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

Control Algorithm for Virtual Machine-Level Fairness in Virtualized Cloud Data center (가상화 클라우드 데이터센터에서 가상 머신 간의 균등한 성능 보장을 위한 제어 알고리즘)

  • Kim, Hwantae;Kim, Hwangnam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.6
    • /
    • pp.512-520
    • /
    • 2013
  • In this paper, the control algorithm which can resolve the unfairness in network performance of the virtual machine arised from the CPU scheduling in cloud datacenter has been proposed. We first describe the evaluation and analysis results of the network unfairness phenomenon of virtual machine through the heterogeneous cloud datacenter testbed and we propose the control algorithm which can guarantee the fairness of the network performance based on the PID control scheme. Through the implementation and evaluation results, we verify the performance of the proposed algorithm.

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.

MBAC Mechanism for blocking probability fairness guarantee (Blocking Probability Fairness 보장을 위한 MBAC 메커니즘)

  • Jin, Min-Sook;Kim, Ki-Il;Kim, Sang-Ha
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04a
    • /
    • pp.491-494
    • /
    • 2001
  • IP 망에서 Qos(Quality of Service)를 보장하기 위하여 요구되는 것이 수락 제어이다. 기존의 수락 제어 메커니즘은 크게 RSVP(Resource Reservation Protocol) 시그널링 방법과 MBAC(Measurement Based Admission Control)로 분류된다. 첫번째 방법의 경우 코어 망에서 각 플로우마다 상태를 유지해야 하는 확장성 문제때문에 적용이 쉽지 않고, 두 번째 방법의 경우 긴 경로를 가진 플로우의 경우 짧은 경로를 가진 플로우에 비해 블록킹 확률이 높아지는 문제점이 있다. 본 논문에서는 IP 코어 망에서 사용자의 QoS 요구사항과 서로 다른 경로상의 플로우간 블록킹 확률의 공평성을 위한 TPED MBAC(Two-Phase Edge-to-Edge Distributed Measurement Based Admission Control) 메커니즘을 제안한다. 이 MBAC 메커니즘은 수락 제어를 Quantitative Provisioning 단계와 Qualitative Provisioning 단계로 나누어 수행하며 프로빙 패킷 전송을 위해 홉 카운터에 기반 한 WRR(Weighted Round-Robin) 스케쥴링을 적용함으로써 각 플로우간의 블록킹 확률의 공평성을 제어할 수 있는 메커니즘이다.

  • PDF

A New Fair Call Admission Control for Integrated Voice and Data Traffic in Wireless Mobile Networks

  • Hwang, Young Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • v.2 no.2
    • /
    • pp.107-113
    • /
    • 2006
  • It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

(A New Queue Management Algorithm Improving Fairness of the Internet Congestion Control) (인터넷 혼잡제어에서 공정성 향상을 위한 새로운 큐 관리 알고리즘)

  • 구자헌;최웅철;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.437-447
    • /
    • 2003
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

A Study on the Effect of Fairness Perception of Incentive System on Manager-Trust -The moderating effect on HRM strength- (집단 성과급제도의 공정성이 신뢰에 미치는 영향 - 인사시스템 신뢰강도의 조절효과로 -)

  • Kim, Sung-Gun;Kim, Hae-Ryong
    • Journal of Digital Convergence
    • /
    • v.14 no.9
    • /
    • pp.199-214
    • /
    • 2016
  • There is a negotiation between management and labors about paying incentive at the every end of the year. This result causes the conflict between management and labors. The successful operation of incentive system is based on respect and common benefit between workers and managers. The manager-trust is the power of leading reciprocality. This research started from the issues of companies with incentive system at this year. This research analysed the influence of manager-trust by the fairness of incentive system. and how HRM system affects the manager-trust through the strength of the HRM system. It appeared in a survey that shows the fairness of incentive system and manager-trust effect positive matter. As a result of the control effect in the strength of the HRM system, the relationship between distributive justice and manager-trust shows that Distinctiveness, consistency, and consensus have the control effect. Although the Distinctiveness has control effect, consistency and consensus didn't have control effect in the relationship between perceptual justice and manager-trust.