IDEAS home Printed from https://ideas.repec.org/p/fth/pariem/98.01.html
   My bibliography  Save this paper

Eligible Start-Time Fair Queuing: A New Fair Queuing Policy and its Analysis with a Stochastic Comparison Approach

Author

Listed:
  • Abuamsha, O.
  • Pekergin, N.

Abstract

We present a new Fair Queuing policy adapted to low-bandwidth flows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processos Sharing PGPS and its version Worst-case Fair, Fair Queuing WF2Q which eliminates discrepancy, the proposed scheduling algorithm is computationally efficient hence feasible for high speed broadband networks. The ESFQ scheduler uses like WF2Q an eligibility criterion to select packets to be transmitted, and like Start-time Fair Queuing SFQ, it uses a Virtual Time based on Virtual Start tags.

Suggested Citation

  • Abuamsha, O. & Pekergin, N., 1998. "Eligible Start-Time Fair Queuing: A New Fair Queuing Policy and its Analysis with a Stochastic Comparison Approach," Papiers d'Economie Mathématique et Applications 98.01, Université Panthéon-Sorbonne (Paris 1).
    • Handle: RePEc:fth:pariem:98.01
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    NETWORK ANALYSIS;

    JEL classification:

    • C10 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fth:pariem:98.01. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/cerp1fr.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.