ویراساینس.
سند علمی

Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks

Sheng-Tzong Cheng, Ming-Hung Tao

چکیده

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limitedbuffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematical analysis and simulations. key words: fair scheduling, weighted-sacrificing fair queueing, packetized weighted sacrificing fair queueing

اسناد مشابه

  • High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

    سند علمی۱۹۹۷ICNPJon C. R. Bennett, Donpaul C. Stephens, Hui Zhang

    The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated services networks and many Packet Fair Queueing (PFQ) algorithms have been proposed to approximate GPS. However, there have been few high speed implementations of PFQ algorithms that c

  • Review: Fair Scheduling in Wireless Packet Network

    سند علمی۱۹۹۸Ch'ng Shi Baw

    A lot of work has been done addressing issues of fair scheduling in wireline packet networks. Most techniques developed have not effectively address the unique constraints post by a wireless packet network. This report reviews [1], a paper which proposes a model for wireless pack

  • : Packet Fair Queuing in Wireless Packet Networks

    سند علمی۲۰۰۰Yung Yi, Yongho Seok, Taekyoung Kwon, Yanghee Choi

    ! "$# % & ' ( )# * +, /.0 1 "!243 2&5% ' "0 7685% 1 "9 /: + "0 * ; 583 $ "0 ? ! %6@ % BAC % / $D9AE @ % F ( G ! ! 0 IH 5, ! C J"!KL * ;

  • Design and Evaluation of a Wireless Fair Queueing Algorithm with Weighted-Sacrificing Policy

    سند علمی۲۰۰۴International Conference on Wireless NetworksSheng-Tzong Cheng, Ming-Hung Tao

    ─ Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or

  • Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors

    سند علمی۱۹۹۸INFOCOMT. S. Eugene Ng, Ion Stoica, Hui Zhang

    While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to

  • Title Channel capacity fair queueing in wireless networks: Issues and a new algorithm

    سند علمی۲۰۰۱Author Wang

    Wireless fair queueing algorithms have been extensively studied recently. However, a major drawback in existing approaches is that the channel model is overly simplified—a two states (good or bad) channel is assumed. While it is relatively easy to analyze the system using such a