loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 International Conference on Advanced Information Networking and Applications Workshops
Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer
Bradford, United Kingdom
May 26-May 29
ISBN: 978-0-7695-3639-2
ASCII Text
x 
 
Amina Al-Sawaai, Irfan Awan, Rod Fretwell, "Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer," Advanced Information Networking and Applications Workshops, International Conference on, pp. 218-223, 2009 International Conference on Advanced Information Networking and Applications Workshops, 2009.
 
 
BibTex
x
 
@article{ 10.1109/WAINA.2009.43,
author = {Amina Al-Sawaai and Irfan Awan and Rod Fretwell},
title = {Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer},
journal ={Advanced Information Networking and Applications Workshops, International Conference on},
volume = {0},
year = {2009},
isbn = {978-0-7695-3639-2},
pages = {218-223},
doi = {http://doi.ieeecomputersociety.org/10.1109/WAINA.2009.43},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications Workshops, International Conference on
TI - Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer
SN - 978-0-7695-3639-2
SP218
EP223
A1 - Amina Al-Sawaai,
A1 - Irfan Awan,
A1 - Rod Fretwell,
PY - 2009
KW - Weighted Fair Queuing (WFQ); First Inter First Out (FIFO); Markov chain
VL - 0
JA - Advanced Information Networking and Applications Workshops, International Conference on
ER -
 
Abstract—This paper analyses a multiple class single server M/M/1/K queue with finite capacity under weighted fair queuing (WFQ) discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. Analytical expressions for the flow balanced equations have been derived using Markov chain. This paper presents an analytical and numerical solution to the M/M/1/K queue with finite buffer under (WFQ ) service and the derivation of a general expression for the steady state probabilities for any buffer K. Numerical experiments corroborate the theoretical results are also offered.
Index Terms:
Weighted Fair Queuing (WFQ); First Inter First Out (FIFO); Markov chain
Citation:
Amina Al-Sawaai, Irfan Awan, Rod Fretwell, "Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer," waina, pp.218-223, 2009 International Conference on Advanced Information Networking and Applications Workshops, 2009
Usage of this product signifies your acceptance of the Terms of Use.