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 | |
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 | 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)