The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Haar wavelet prediction-based fair queuing

På svenska

Author

  • Ali Reza Shams Shafigh
  • Saeed Bastani
  • Shahram Mohrehkesh
  • Morteza Analoui

Summary, in English

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.

Publishing year

2006

Language

English

Pages

61-65

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Telecommunications

Conference name

International Symposium on Computer Networks (ISCN)

Conference date

2006-06-16

Conference place

Istanbul, Turkey

Status

Published

ISBN/ISSN/Other

  • ISBN: 1-4244-0491-6