Performance of weighted fair queuing system with multi-class jobs

Amina Al-Sawaai; Irfan Awan; Rod Fretwell

doi:10.1109/AINA.2010.25

Performance of weighted fair queuing system with multi-class jobs

Amina Al-Sawaai^*, Irfan Awan, Rod Fretwell

^*Corresponding author for this work

Mathematics & Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper analyses the weighted fair queueing (WFQ) system subject to three classes of network applications. The arrival traffic flows follow Poisson processes. The service times is exponentially distributed. The system is modelled as a two-dimensional Markov chain and use matrix geometric technique to solve its stationary probabilities. The determination of the steady state probabilities can be used to compute the performance measures of the system, such as the mean queue length, the throughput and the mean response time. Numerical experiments corroborate the theoretical results are offered and make the developed model as an effective tool for examining the performance of WFQ systems.

Original language	English
Title of host publication	24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010
Pages	50-57
Number of pages	8
DOIs	https://doi.org/10.1109/AINA.2010.25
Publication status	Published - 2010
Event	24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010 - Perth, WA, Australia Duration: Apr 20 2010 → Apr 23 2010

Other

Other	24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010
Country/Territory	Australia
City	Perth, WA
Period	4/20/10 → 4/23/10

Keywords

First inter first out (FIFO)
Markov chain
Shared buffer model,M +M+M/M̄/1/N
Weighted fair queuing (WFQ)

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/AINA.2010.25

Cite this

Al-Sawaai, A, Awan, I & Fretwell, R 2010, Performance of weighted fair queuing system with multi-class jobs. in 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010., 5474673, pp. 50-57, 24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010, Perth, WA, Australia, 4/20/10. https://doi.org/10.1109/AINA.2010.25

@inproceedings{f254ee8267624354bdde2bc2efc556d7,

title = "Performance of weighted fair queuing system with multi-class jobs",

abstract = "This paper analyses the weighted fair queueing (WFQ) system subject to three classes of network applications. The arrival traffic flows follow Poisson processes. The service times is exponentially distributed. The system is modelled as a two-dimensional Markov chain and use matrix geometric technique to solve its stationary probabilities. The determination of the steady state probabilities can be used to compute the performance measures of the system, such as the mean queue length, the throughput and the mean response time. Numerical experiments corroborate the theoretical results are offered and make the developed model as an effective tool for examining the performance of WFQ systems.",

keywords = "First inter first out (FIFO), Markov chain, Shared buffer model,M +M+M/{\=M}/1/N, Weighted fair queuing (WFQ)",

author = "Amina Al-Sawaai and Irfan Awan and Rod Fretwell",

year = "2010",

doi = "10.1109/AINA.2010.25",

language = "English",

isbn = "9780769540184",

pages = "50--57",

booktitle = "24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010",

note = "24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010 ; Conference date: 20-04-2010 Through 23-04-2010",

}

TY - GEN

T1 - Performance of weighted fair queuing system with multi-class jobs

AU - Al-Sawaai, Amina

AU - Awan, Irfan

AU - Fretwell, Rod

PY - 2010

Y1 - 2010

N2 - This paper analyses the weighted fair queueing (WFQ) system subject to three classes of network applications. The arrival traffic flows follow Poisson processes. The service times is exponentially distributed. The system is modelled as a two-dimensional Markov chain and use matrix geometric technique to solve its stationary probabilities. The determination of the steady state probabilities can be used to compute the performance measures of the system, such as the mean queue length, the throughput and the mean response time. Numerical experiments corroborate the theoretical results are offered and make the developed model as an effective tool for examining the performance of WFQ systems.

AB - This paper analyses the weighted fair queueing (WFQ) system subject to three classes of network applications. The arrival traffic flows follow Poisson processes. The service times is exponentially distributed. The system is modelled as a two-dimensional Markov chain and use matrix geometric technique to solve its stationary probabilities. The determination of the steady state probabilities can be used to compute the performance measures of the system, such as the mean queue length, the throughput and the mean response time. Numerical experiments corroborate the theoretical results are offered and make the developed model as an effective tool for examining the performance of WFQ systems.

KW - First inter first out (FIFO)

KW - Markov chain

KW - Shared buffer model,M +M+M/M̄/1/N

KW - Weighted fair queuing (WFQ)

UR - http://www.scopus.com/inward/record.url?scp=77954341831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954341831&partnerID=8YFLogxK

U2 - 10.1109/AINA.2010.25

DO - 10.1109/AINA.2010.25

M3 - Conference contribution

AN - SCOPUS:77954341831

SN - 9780769540184

SP - 50

EP - 57

BT - 24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010

T2 - 24th IEEE International Conference on Advanced Information Networking and Applications, AINA2010

Y2 - 20 April 2010 through 23 April 2010

ER -

Performance of weighted fair queuing system with multi-class jobs

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this