Sciweavers

57 search results - page 8 / 12
» Hierarchical Packet Fair Queueing Algorithms
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
13 years 7 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
TON
2010
176views more  TON 2010»
13 years 2 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
TCSV
2010
13 years 2 months ago
Perceptually Unequal Packet Loss Protection by Weighting Saliency and Error Propagation
We describe a method for achieving perceptually minimal video distortion over packet-erasure networks using perceptually unequal loss protection (PULP). There are two main ingredie...
Hojin Ha, Jincheol Park, Sanghoon Lee, Alan Conrad...
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
INFOCOM
2000
IEEE
13 years 11 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste