• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.233-241
• /
• 2002

In this paper, we proposed a new mechanism that solves the fairness problem between unicast traffic using the TCP and multicast traffic using the UDP, and satisfies the requirement of various receivers fairly in the Internet. The proposed mechanism decentralizes the load of blanket transmission rate control from sender to designated server, and uses the method that talc designated server intercepts the sender's data and controls the transmission rate suitable for it's local network. Therefore, the proposed mechanism not only provides multicast service by accurate estimation of the network status of each receiver, but also realizes both the inter-session fairness and the intra-session fairness problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5328-5346
• /
• 2016

An optimal power control algorithm based on convex optimization is proposed for base stations in long term evolution networks. An objective function was formulated to maximize the proportional fairness of the networks. The optimal value of the objective function was obtained using convex optimization and distributed methods based on the path loss model between the base station and users. Field tests on live networks were conducted to evaluate the performance of the proposed algorithm. The experimental results verified that, in a multi-cell multi-user scenario, the proposed algorithm increases system throughputs, proportional fairness, and energy efficiency by 9, 1.31 and 20.2 %, respectively, compared to the conventional fixed power allocation method.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.183-192
• /
• 2014

This paper proposes a payment-based power control scheme using non-cooperative game with a novel pricing function in cognitive radio networks (CRNs). The proposed algorithm considers the fairness of power control among second users (SUs) where the value of per SU' signal to noise ratio (SINR) or distance between SU and SU station is used as reference for punishment price setting. Due to the effect of uncertainty fading environment, the system is unable to get the link gain coefficient to control SUs' transmission power accurately, so the quality of service (QoS) requirements of SUs may not be guaranteed, and the existence of Nash equilibrium (NE) is not ensured. Therefore, an alternative iterative scheme with sliding model is presented for the non-cooperative power control game algorithm. Simulation results show that the pricing policy using SUs' SINR as price punishment reference can improve total throughput, ensure fairness and reduce total transmission power in CRNs.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.181-181
• /
• 2000

We identified the performance problems of scheduling algorithms such as FCFS, and demonstrated the superiority of WFQ in terms of realtime performance measures. For this purpose, we presented the service scenario and performed the analysis for the delay bound and fairness which are required to support the realtime applications in the Internet.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.743-754
• /
• 2003

TFRC(TCP-Friendly Rate Control) is proposed to satisfy the demands of multimedia applications while being reasonably fair when competing for bandwidth with TCP flows[1-3]. However, TFRC has a shortcoming that the fairness and throughput are degraded when the mobile host using TFRC experiences handoffs. This paper proposes a new control mechanism based on TFRC, which deals with the congestion caused by handoffs as well as the losses caused during the handoffs. The simulation results show that our mechanism achieves better throughput and fairness compared to TFRC for repeated handoffs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.355-357
• /
• 2001

TFRC(TCF-friendly Rate Control) 혼잡제어는 연속적인 재생을 필요로 하는 멀티미디어 서비스를 위한 TCP-friendly 알고리즘이다. 이러한 TCP-friendly 알고리즘의 성능을 결정하는 가장 중요한 요인으로 기존 TCP 혼잡제어 알고리즘을 이용하는 트래픽과의 전송대역폭에 대한 공정성(fairness)이다. TFRC 혼잡제어 알고리즘에서는 이러한 공정성을 만족시키기 위하여 TCP를 모델링한 식에 의하여 전송률을 결정한다. 그러나 TFRC 혼잡제어는 혼잡이 심한 네트워크 상황에서는 공정성이 급격히 떨어진다. 본 논문에서는 TFRC 혼잡제어알고리즘의 전송률 결정방법의 개선을 통하여, 높은 손실률을 보이는 혼잡한 네트워크상황에서 공정성이 떨어지는 문제를 해결한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.547-556
• /
• 1997

In this paper we suggest a dynamic quota allocation mechansim for B-ISDN(Broadband Integrated Services Digital Network) subscriber networks. The quota adaptation decision based on the number of cells in the transmission queue is made distributively by each node in the ring network. This mechanism provides both fairness and efficiency for it enables each node to adapt its quota under asymmetric traffic condition. The simulation results show that substantial improvements in access delay time and throughput can be achieved with this algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.653-660
• /
• 2013

This paper deals with the problem of unfairness among uplink TCP (Transmission Control Protocol) flows associated with frame aggregation employed in IEEE 802.11n WLANs (Wireless Local Area Networks). When multiple stations have uplink TCP flows and transmit TCP data packets to an AP (Access Point), the AP has to compete for channel access with stations for the transmission of TCP ACK (acknowledgement) packets to the stations. Due to this contention-based channel access, TCP ACKs tend to be accumulated in the AP's downlink buffer. We show that the frame aggregation in the MAC (Medium Access Control) layer increases TCP ACK losses in the AP and leads to the serious unfair operation of TCP congestion control. To resolve this problem, we propose the TAC (TCP ACK Compression) mechanism operating at the top of the AP's interface queue. By exploiting the properties of cumulative TCP ACK and frame aggregation, TAC serves only the representative TCP ACK without serving redundant TCP ACKs. Therefore, TAC reduces queue occupancy and prevents ACK losses due to buffer overflow, which significantly contributes to fairness among uplink TCP flows. Also, TAC enhances the channel efficiency by not transmitting unnecessary TCP ACKs. The simulation results show that TAC tightly assures fairness under various network conditions while increasing the aggregate throughput, compared to the existing schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.175-182
• /
• 2018

As Internet of things with a large number of nodes emerges, wireless-power communication networks (WPCN) based on a random access protocol needs to be investigated. In the random access-based WPCN, a terminal accessing later in given random access (RA) slots can harvest more energy before transmission and thus can transmit data with higher power and achieve higher throughput if the access is successful. On the basis of this property, the proposed random access control protocol gives the terminals priority and distinguishes the RA slots according to the priority level, so that a near terminal with access point allows to access preferentially other than a remote terminal. This operation decreases the throughput of near terminal and increases the throughput of remote terminal, and then, the doubly near-far problem in WPCN is resolved and the user fairness is improved. Results show that the proposed random access control improves both channel throughput and user fairness according to the priority level.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.