• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.93-96
• /
• 2002

Fair Queueing has been studied only on wired network. When it is applied to wireless netowork, the collision phenomenon makes a problem.'rho information of queue of MT cannot be transferred to fair queueing algorithm In real time easily. We propose wireless fair queueing scheduler that protects short term farirness and long term fairness. We developed it in TDMA/TDD enviroment. Our scheme also supports uplink and downlink at the same time. And it can make subframe boundary based on fair scheduling algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.916-924
• /
• 2003

Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. In most fair queuing algorithms, based on the generalized processor sharing(GPS), emphasizes fairness guarantee while overlooking bounded delay guarantee which is critical to support multimedia services in the networks. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guaranteeing bounded delay of flows according to their individual delay requirements for multimedia services in the wireless packet networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.98-106
• /
• 2005

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.245-253
• /
• 2005

The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we proposed distributed implementation of the delay guaranteed fair queueing (DGFQ) scheme in multimedia ad hoc wireless networks. Through the the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1177-1186
• /
• 2003

The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we implemented the delay guaranteed fair queueing (DGFQ) scheme distributively. Through the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.473-475
• /
• 2000

무선 네트워크의 급격한 성장으로 기존의 전자우편, 멀티미디어 등의 응용을 이동 컴퓨팅 환경에서 보다 효과적으로 지원해야 할 필요성이 증대되었다. 기존 유선 네트워크 환경에서 사용자의 독립적 서비스 보장과 요구 비율에 따른 자원의 공정한 배분을 위해서 Fair Queueing 기법이 제안되었다. 이 Fair Queueing 기법을 무선 네트워크에 적용하려는 연구가 진행되고 있으나 무선 미디어 자원의 빈약성과 사용자 이동에 따른 오류 발생 가능성 등으로 인해 아직까지 체계적인 기술은 미비한 형편이다. 본 논문에서는 기존 Fair Queueing 기법에서 각 세션의 가중치를 조절하여 무선 네트워크 환경에서 사용자의 다양한 서비스 품질(QoS; Queueing of Service)을 지원하고 오류 발생시 급격한 서비스 품질 저하를 방지하는 패킷 서비스 기법을 제시하고 그 성능을 분석한다.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.19-28
• /
• 2010

The GTS(Guaranteed Time Slot) of the IEEE 802.15.4 standard, which is the contention free access mechanism, is used for low-latency applications or applications requiring specific data bandwidth. But it has some problems such as delay of service due to FIFS(First In First Service) scheduling. In this paper, we proposes a weight based GTS allocation scheme for fair queuing in IEEE 802.15.4 LR-WPAN. The proposed scheme uses a weight that formed by how much more weight we give to the recent history than to the older history for a new GTS allocation. This scheme reduces service delay time and also guarantees transmission simultaneously within a limited time. The results of the performance analysis shows that our approach improves the performance as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard.