Sciweavers

16 search results - page 3 / 4
» Fair and Efficient Packet Scheduling Using Elastic Round Rob...
Sort
View
INFOCOM
2002
IEEE
14 years 12 days ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
LCN
2006
IEEE
14 years 1 months ago
Utility-based Packet Scheduler for Wireless Communications
Abstract— Following widespread availability of wireless Internet, a wide range of applications with differing QoS requirements must share the wireless access. The objective of th...
Ana Aguiar, Adam Wolisz, Horst Lederer
ICC
2009
IEEE
128views Communications» more  ICC 2009»
14 years 2 months ago
Approximate Flow-Aware Networking
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
Jerzy Domzal, Andrzej Jajszczyk
GLVLSI
2005
IEEE
132views VLSI» more  GLVLSI 2005»
14 years 1 months ago
FPGA implementation of a modular and pipelined WF scheduler for high speed OC192 networks
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algorithm able to handle variable length packets targeted for Packet Over Sonet (POS...
Abdallah Merhebi, Otmane Aït Mohamed
ICC
2007
IEEE
127views Communications» more  ICC 2007»
13 years 11 months ago
Spectral Efficiency of Channel-Aware Schedulers in Non-Identical Composite Links with Interference
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
Jingxian Wu, Neelesh B. Mehta, Andreas F. Molisch,...