Implementation of a novel credit based SCFQ scheduler for broadband wireless access

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A novel tag computation circuit for a credit based Self-Clocked Fair Queuing (SCFQ) Scheduler is presented in this paper. The scheduler combines Weighted Fair Queuing (WFQ) with a credit based bandwidth reallocation scheme. The proposed architecture is able to reallocate bandwidth on the fly if particular links suffer from channel quality degradation. The hardware architecture is parallel and pipelined enabling an aggregated throughput rate of 180 million tag computations per second. The throughput performance is ideal for Broadband Wireless Access applications, allowing room for relatively complex computations in QoS aware adaptive scheduling. The high-level system breakdown is described and synthesis results for Altera Stratix II FPGA technology are presented. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Garcia-Palacios, E., Sezer, S., Toal, C., & Dawson, S. (2004). Implementation of a novel credit based SCFQ scheduler for broadband wireless access. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 876–884. https://doi.org/10.1007/978-3-540-27824-5_115

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free