Advanced

Haar wavelet prediction-based fair queuing

Shams Shafigh, Ali Reza; Bastani, Saeed LU ; Mohrehkesh, Shahram and Analoui, Morteza (2006) International Symposium on Computer Networks (ISCN) In [Host publication title missing] p.61-65
Abstract
Since the Internet is developing rapidly in size and in complexity as well, it is very hard to adjust quality of service (QoS) parameters. In order to guarantee service quality, efficient resource reservation is needed. The allocation of resources requires a dynamic reconfiguration mechanism that configures a switch, taking into account the incoming traffic fluctuations. This paper presents a new efficient bandwidth allocation algorithm called Haar wavelet prediction-based fair queuing (HWFQ) which is designed to schedule bandwidth adaptively, fairly and efficiently among all competing flows. The key feature of the new scheduling scheme is to predict the scheduling weights. The proposed algorithm has no need to prior knowledge about the... (More)
Since the Internet is developing rapidly in size and in complexity as well, it is very hard to adjust quality of service (QoS) parameters. In order to guarantee service quality, efficient resource reservation is needed. The allocation of resources requires a dynamic reconfiguration mechanism that configures a switch, taking into account the incoming traffic fluctuations. This paper presents a new efficient bandwidth allocation algorithm called Haar wavelet prediction-based fair queuing (HWFQ) which is designed to schedule bandwidth adaptively, fairly and efficiently among all competing flows. The key feature of the new scheduling scheme is to predict the scheduling weights. The proposed algorithm has no need to prior knowledge about the incoming traffics and complexity of HWFQ algorithm is very low; therefore, it can be simply implemented in routers and switches. The performance of the proposed algorithm is evaluated using ns-2 simulator and compared with static weighted round robin. (Less)
Please use this url to cite or link to this publication:
author
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
[Host publication title missing]
pages
5 pages
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
International Symposium on Computer Networks (ISCN)
external identifiers
  • Scopus:34247526040
ISBN
1-4244-0491-6
DOI
10.1109/ISCN.2006.1662509
language
English
LU publication?
no
id
35740db5-e78e-4992-a5fd-41b9d64a2158 (old id 8056766)
date added to LUP
2015-10-20 10:38:45
date last changed
2016-10-13 04:43:38
@misc{35740db5-e78e-4992-a5fd-41b9d64a2158,
  abstract     = {Since the Internet is developing rapidly in size and in complexity as well, it is very hard to adjust quality of service (QoS) parameters. In order to guarantee service quality, efficient resource reservation is needed. The allocation of resources requires a dynamic reconfiguration mechanism that configures a switch, taking into account the incoming traffic fluctuations. This paper presents a new efficient bandwidth allocation algorithm called Haar wavelet prediction-based fair queuing (HWFQ) which is designed to schedule bandwidth adaptively, fairly and efficiently among all competing flows. The key feature of the new scheduling scheme is to predict the scheduling weights. The proposed algorithm has no need to prior knowledge about the incoming traffics and complexity of HWFQ algorithm is very low; therefore, it can be simply implemented in routers and switches. The performance of the proposed algorithm is evaluated using ns-2 simulator and compared with static weighted round robin.},
  author       = {Shams Shafigh, Ali Reza and Bastani, Saeed and Mohrehkesh, Shahram and Analoui, Morteza},
  isbn         = {1-4244-0491-6},
  language     = {eng},
  pages        = {61--65},
  publisher    = {ARRAY(0x9ed4e80)},
  series       = {[Host publication title missing]},
  title        = {Haar wavelet prediction-based fair queuing},
  url          = {http://dx.doi.org/10.1109/ISCN.2006.1662509},
  year         = {2006},
}