![]() |
![]() |
|||
|
||||
|
|
||||
| Title: | PRIORITY-BASED NETWORK QUALITY OF SERVICE | |
| DOI No: | 10.1142/9789812709677_0097 | |
| Source: | INFORMATION SCIENCES 2007 (pp 699-705) | |
| Author(s): | ANIMESH DALAKOTI
School of Electrical Engineering and Computer Science, Washington State University, WA, USA 99163, USA NINA PICONE School of Electrical Engineering and Computer Science, Washington State University, WA, USA 99163, USA BEHROOZ A. SHIRAZ This work is partially supported by NASA AIST Grant #106269, NSF-ITR grant IIS-0326505, and NSF-ITR grant IIS-0324835. School of Electrical Engineering and Computer Science, Washington State University, WA, USA 99163, USA WEN-ZHAN SONG This work is partially supported by NASA AIST Grant #106269, NSF-ITR grant IIS-0326505, and NSF-ITR grant IIS-0324835. School of Engineering and Computer Science, Washington State University-Vancouver, WA, USA 98686, USA ALI HURSON This work is partially supported by NASA AIST Grant #106269, NSF-ITR grant IIS-0326505, and NSF-ITR grant IIS-0324835. Department of Computer Science and Engineering, Pennsylvania State University, PA, USA 16802, USA |
|
| Abstract: | In this paper we propose a Variable-Weighted Fair Queuing scheduling algorithm (V-WFQ) as an alternative to Weighted Fair Queuing (WFQ) that provides dynamic adjustments to message priorities as network congestion changes. Our results show that we are able to provide better Quality of Service to messages with higher priorities when compared with WFQ. | |
| Full Text: | View full text in PDF format (103KB) | |
| TOC: | Back to Table of Contents | |
|
||