Log in

Relevant bibliographies by topics / Weighted Fair Queueing (WFQ) System

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Weighted Fair Queueing (WFQ) System'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Weighted Fair Queueing (WFQ) System.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Weighted Fair Queueing (WFQ) System"

1

Borst, Sem, Michel Mandjes, and Miranda van Uitert. "Generalized processor sharing queues with heterogeneous traffic classes." Advances in Applied Probability 35, no. 03 (2003): 806–45. http://dx.doi.org/10.1017/s0001867800012556.

Full text

Abstract:

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behaviour of the light-tailed traffic flow under the assumption that its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated syste

APA, Harvard, Vancouver, ISO, and other styles

2

Borst, Sem, Michel Mandjes, and Miranda van Uitert. "Generalized processor sharing queues with heterogeneous traffic classes." Advances in Applied Probability 35, no. 3 (2003): 806–45. http://dx.doi.org/10.1239/aap/1059486830.

Full text

Abstract:

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behaviour of the light-tailed traffic flow under the assumption that its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated syste

APA, Harvard, Vancouver, ISO, and other styles

3

Guillemin, Fabrice, Ravi Mazumdar, Alain Dupuis, and Jacqueline Boyer. "Analysis of the fluid weighted fair queueing system." Journal of Applied Probability 40, no. 01 (2003): 180–99. http://dx.doi.org/10.1017/s0021900200022336.

Full text

Abstract:

We analyse in this paper the fluid weighted fair queueing system with two classes of customers, who arrive according to Poisson processes and require arbitrarily distributed service times. In a first step, we express the Laplace transform of the joint distribution of the workloads in the two virtual queues of the system by means of unknown Laplace transforms. Such an unknown Laplace transform is related to the distribution of the workload in one queue provided that the other queue is empty. We explicitly compute the unknown Laplace transforms by means of a Wiener—Hopf technique. The determinat

APA, Harvard, Vancouver, ISO, and other styles

4

Guillemin, Fabrice, Ravi Mazumdar, Alain Dupuis, and Jacqueline Boyer. "Analysis of the fluid weighted fair queueing system." Journal of Applied Probability 40, no. 1 (2003): 180–99. http://dx.doi.org/10.1239/jap/1044476834.

Full text

Abstract:

We analyse in this paper the fluid weighted fair queueing system with two classes of customers, who arrive according to Poisson processes and require arbitrarily distributed service times. In a first step, we express the Laplace transform of the joint distribution of the workloads in the two virtual queues of the system by means of unknown Laplace transforms. Such an unknown Laplace transform is related to the distribution of the workload in one queue provided that the other queue is empty. We explicitly compute the unknown Laplace transforms by means of a Wiener—Hopf technique. The determinat

APA, Harvard, Vancouver, ISO, and other styles

5

Frantti, Tapio, and Mirjami Jutila. "Embedded fuzzy expert system for Adaptive Weighted Fair Queueing." Expert Systems with Applications 36, no. 8 (2009): 11390–97. http://dx.doi.org/10.1016/j.eswa.2009.03.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

You, Guohua, and Ying Zhao. "A weighted-fair-queuing (WFQ)-based dynamic request scheduling approach in a multi-core system." Future Generation Computer Systems 28, no. 7 (2012): 1110–20. http://dx.doi.org/10.1016/j.future.2011.07.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Weighted Fair Queueing (WFQ) System"

1

Alsawaai, Amina S. M. "Performance Modelling and Analysis of Weighted Fair Queueing for Scheduling in Communication Networks. An investigation into the Development of New Scheduling Algorithms for Weighted Fair Queueing System with Finite Buffer." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4877.

Full text

Abstract:

Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received considerable attention by several researches since WFQ offers the minimum delay and optimal fairness guarantee. However, all previous work on WFQ has focused on developing approximations of the scheduler with an infinite buffer because of supposed scalability problems in the WFQ computation. The main aims of this thesis are to study WFQ system, by providing an analytical WFQ model which is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solu

APA, Harvard, Vancouver, ISO, and other styles

2

Alsawaai, Amina Said Mohammed. "Performance modelling and analysis of weighted fair queueing for scheduling in communication networks : an investigation into the development of new scheduling algorithms for weighted fair queueing system with finite buffer." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4877.

Full text

Abstract:

Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received considerable attention by several researches since WFQ offers the minimum delay and optimal fairness guarantee. However, all previous work on WFQ has focused on developing approximations of the scheduler with an infinite buffer because of supposed scalability problems in the WFQ computation. The main aims of this thesis are to study WFQ system, by providing an analytical WFQ model which is a theoretical construct based on a form of processor sharing for finite capacity. Furthermore, the solutions f

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Weighted Fair Queueing (WFQ) System"

1

Mahmood, Dhari Ali, and Gábor Horváth. "A Simple Approximation for the Response Times in the Two-Class Weighted Fair Queueing System." In Analytical and Stochastic Modelling Techniques and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61428-1_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Weighted Fair Queueing (WFQ) System"

1

Fischer, Martin J., Denise M. Bevilacqua Masi, and John F. Shortle. "Simulating the performance of a Class-Based Weighted Fair Queueing system." In 2008 Winter Simulation Conference (WSC). IEEE, 2008. http://dx.doi.org/10.1109/wsc.2008.4736412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!