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

O. Abuamsha and N. Pekergin

Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1)

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.

Keywords: NETWORK; ANALYSIS (search for similar items in EconPapers)
JEL-codes: C10 (search for similar items in EconPapers)
Pages: 24 pages
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:pariem:98.01

Access Statistics for this paper

More papers in Papiers d'Economie Mathématique et Applications from Université Panthéon-Sorbonne (Paris 1) France; Universite de Paris I - Pantheon- Sorbonne, 12 Place de Pantheon-75005 Paris, France. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel (krichel@openlib.org).