• Title/Summary/Keyword: packet fairness

Search Result 170, Processing Time 0.024 seconds

A study on fairness packet scheduling scheme in IEEE 802.11e WLAN system (Fairness보장을 위한 IEEE 802.l1e무선 LAN패킷 스케줄링 기법 연구)

  • Jang Jae-Shin;Jeon Hyung-Ik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1551-1557
    • /
    • 2006
  • Since subscribers, who pay the same communication fees, have a strong desire to take similar services with the other users, it is an important issue to provide fairness among those subscribers wherever they are located. Therefore, in this paper we propose a QoS packet scheduler that can provide fairness among wireless LAN terminals and evaluate its performance using computer simulation. The key idea of this scheduler is to reduce the CW value of the wireless LAN terminal that has failed in sending its packets due to channel transmission error in order to offer the wireless MM terminal a higher transmission priority which is the idea of service compensation. We evaluate its performance using NS-2 network simulator, compare its numerical results to those of IEEE 802.11e without this scheme, and conclude that this scheme can reduce throughput difference between similar wireless LAN terminals.

An Efficient Distribution Method of Inter-Session Shared Bandwidth Based on Fairness (공정성 기반의 세션간 공유 대역폭의 효율적 분배 기법)

  • Hwang, Kil-Hong;Ku, Myung-Mo;Kim , Sang-Bok
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.7
    • /
    • pp.905-912
    • /
    • 2004
  • It is a study LVMPD to solve the fairness problem of inter-session shared bandwidth. Whenever congestion occurs in one session, the highest layer is dropped. Also the highest layer of other sessions in non-congestion is dropped by iner-session fairness. While there is spare bandwidth, receivers of session in non-congestion can't use bandwidth efficiently. In this paper, we proposed a distribution method to use efficiently spare bandwidth that occurred by inter-session fairness. In our method, we considered the highest layer those receivers receiving and the higher layer those receivers requesting. The sender assigns the packet-deleting priority to packets when congestion occurs in receivers, and sets layer add/drop flag when receivers of session in non-congestion request the higher layer. The switch deletes packets with packet-deleting priority and transfers packets with layer add/drop flag for session in non-congestion. Therefore receivers of session in non-congestion can add the higher layer. In experimental results, it was known that proposed algorithm use the inter-session shared bandwidth more effectively compared with already known method.

  • PDF

Performance Evaluation of Energy Efficient Packet Transmissions Considering Fairness for Wi-Fi System (Wi-Fi 시스템을 위한 공정성 고려한 에너지 효율적 패킷 전송 방법의 성능 평가)

  • Shin, Taehyu;Park, Suwon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.3
    • /
    • pp.24-30
    • /
    • 2015
  • Wi-Fi STAs in power saving mode described in the Wi-Fi specification can deteriorate the system performance such as throughput, time delay when they receive data frames from a Wi-Fi AP. This problem is caused by data frame reception failure due to the channel state, and it increases re-transmissions. In this paper, we propose a modified power saving mode considering fairness of Wi-Fi system in order to solve the problem. By simulation, we showed that data throughput can be increased without time delay degradation if the proposed method restricting the number of packet transmission attempts and HARQ are used.

Wireless Packet Scheduling Algorithms based on Link Level Retransmission (링크 계층 재전송을 고려한 무선 패킷 스케줄링 알고리즘)

  • Kim, Nam-Gi;Yoon, Hyun-Soo
    • 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.

Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks

  • Nie, Wei;Wang, Houjun;Park, Jong-Hyuk
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.261-270
    • /
    • 2011
  • The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.

p-Persistent MAC Protocol for WDM Ring Networks

  • So, Won-Ho;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.589-597
    • /
    • 2007
  • In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

Design and Performance Analysis of an Asynchronous Shared-Bus Type Switch with Priority and Fairness Schemes

  • Goo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.812-822
    • /
    • 1997
  • In this paper, we propose an architecture of the asynchronous shared-bus type switch with priority and fairness schemes. The switch architecture is an input and output queueing system, and the priority scheme is implemented in both input and output queues. We analyze packet delay of both input and output queues. In the analysis, we consider to stations with asymmetric arrival rates. Although we make some approximations in the analysis, the numerical results show good agreements with the simulation results.

  • PDF

Packet Scheduling Algorithms for Throughput Fairness and Coverage Enhancement in TDD-OFDMA Downlink Network (TDD-OFDMA 하향 링크에서의 수율 공평성과 서비스 커버리지 보장을 위한 패킷 스케줄링 알고리즘 연구)

  • Ki, Young-Min;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.611-619
    • /
    • 2005
  • The present paper proposes two different packet scheduling algorithms in the IEEE 802.16e type TDD-OFDMA downlink, which are the weighted fair scheduling(WFS) and the throughput guarantee scheduling(TGS). The performance of proposed scheduling algorithms are compared to some of conventional schedulers such as round robin(RR), proportional fair(PF), fast fair throughput(FFTH), and fair throughput(FH) in terms of service coverage, effective throughput and fairness at 64 kbps and 128 kbps minimum user throughput requirements. For a relatively smaller throughput(64 kbps) requirement, the proposed algorithms provide higher improvement in the number of users per sector within 95$\%$ service coverage while satisfying the lxEV-DV fairness criterion. For a relatively larger throughput(128 kbps) requirement, the proposed algorithms provide higher coverage enhancement while maintaining the same effective aggregate throughput over PF scheduler.

The Classification of Congestion and Wireless Losses for TCP Segments Using ROTT (상대전송지연시간을 이용한 TCP 세그먼트의 혼잡 손실과 무선 손실 구분 알고리즘)

  • Shin, Kwang-Sik;Lee, Bo-Ram;Kim, Ki-Won;Jang, Mun-Suck;Yoon, Wan-Oh;Choi, Sang-Bang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.858-870
    • /
    • 2007
  • TCP is popular protocol for reliable data delivery in the Internet. In recent years, wireless environments with transmission errors are becoming more common. Therefore, there is significant interest in using TCP over wireless links. Previous works have shown that, unless the protocol is modified, TCP may perform poorly on paths that include a wireless link subject to transmission errors. The reason for this is the implicit assumption in TCP that all packet losses are due to congestion which causes unnecessary reduction of transmission rate when the cause of packet losses are wireless transmission errors. In this paper, we propose a new LDA that monitors the network congestion level using ROTT. And we evaluate the performance of our scheme and compare with TCP Veno, Spike scheme with NS2(Network Simulator 2). In the result of our experiment, our scheme reduces the packet loss misclassification to maximum 55% of other schemes. And the results of another simulation show that our scheme raise its transmission rate with the fairness preserved.

A Packet Scheduling Algorithm and Efficient Framing Method for Next Generation Wireless Communication System and its Performance (차세대 이동통신시스템을 위한 패킷 스케쥴링 알고리즘과 효율적인 프레임 구성 방법 및 성능 분석)

  • Baek Jang Hyun;Kim Dong Hoi
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.29-40
    • /
    • 2005
  • In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.