Sciweavers

107 search results - page 5 / 22
» Fair Scheduling in Internet Routers
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
13 years 9 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
ICNS
2007
IEEE
14 years 4 months ago
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Changhua Sun, Lei Shi, Chengchen Hu, Bin Liu
ICNP
2000
IEEE
14 years 2 months ago
Differentiated Predictive Fair Service for TCP Flows
The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spu...
Ibrahim Matta, Liang Guo
WSC
2008
14 years 3 days ago
Simulating the performance of a Class-Based Weighted Fair Queueing system
Class Based Weighted Fair Queueing (CBWFQ) is a very important router discipline that allows different types of Internet Protocol (IP) traffic like voice, video, and best effort d...
Martin J. Fischer, Denise M. Bevilacqua Masi, John...
ISCC
2000
IEEE
160views Communications» more  ISCC 2000»
14 years 2 months ago
The Adaptive Load Service (ALS): An ABR-Like Service for the Internet
In this paper, we present a novel approach for realizing adaptive QoS control in the Internet called the adaptive load service (ALS). ALS was designed in a similar fashion to the ...
Dorgham Sisalem, Henning Schulzrinne