Weight Fair Queuing is an ideal scheduling algorithm to guarantee the bandwidth of different queues according to their configured Weights when the switching nodes of the network are congested. Many of the switching nodes based on FPGA in the current network support four physical ports or hundreds of virtual ports. Massive logic and storage resources would be consumed if each port implemented a WFQ scheduler. This paper proposes a Queue-Group-Based WFQ Scheduler (QGWFQS), which can support WFQ scheduling across multiple ports through the reuse of tag calculation and encoding circuits. We also propose a novel finish tag calculation algorithm to accommodate the variation in the link rate of each port. The remainder of integer division is also ...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end d...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algor...
The new emergent network applications such as, voice over IP (Internet Protocol), video streaming, m...
The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated serv...
Summarization: In order to address the challenge of providing quality of service guarantees in today...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated serv...
Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multipl...
Emerging applications in multimedia communications and Virtual Private Networks (VPNs) require data...
[[abstract]]We propose an adaptive bandwidth allocation algorithm for reservation protocols to suppo...
Abstract—Over the past decade, the problem of achieving fair bandwidth allocation on a link shared b...
Packet scheduling, together with classification, is one of the expensive processing steps in systems...
Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received con...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end d...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algor...
The new emergent network applications such as, voice over IP (Internet Protocol), video streaming, m...
The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated serv...
Summarization: In order to address the challenge of providing quality of service guarantees in today...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated serv...
Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multipl...
Emerging applications in multimedia communications and Virtual Private Networks (VPNs) require data...
[[abstract]]We propose an adaptive bandwidth allocation algorithm for reservation protocols to suppo...
Abstract—Over the past decade, the problem of achieving fair bandwidth allocation on a link shared b...
Packet scheduling, together with classification, is one of the expensive processing steps in systems...
Analytical modelling and characterization of Weighted Fair Queueing (WFQ) have recently received con...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end d...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...