Sciweavers

107 search results - page 2 / 22
» Fair Scheduling in Internet Routers
Sort
View
HUMAN
2003
Springer
13 years 10 months ago
Fair Real-Time Resource Allocation for Internet End System's QoS Support
Delivered end-to-end QoS is often limited by the ineffective resource management at Internet end systems. To overcome this problem, we present a resource allocation framework tha...
Jungkeun Park, Minsoo Ryu, Seongsoo Hong
ICCCN
2008
IEEE
13 years 11 months ago
Work-Conserving Fair-Aggregation with Rate-Independent Delay
—Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary a...
Jorge Arturo Cobb
ICCCN
2007
IEEE
13 years 11 months ago
Work-Conserving Fair-Aggregation Across Multiple Core Networks
—In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, Flow Aggregation outperforms Dynamic Packet State...
Jorge Arturo Cobb, Zhe Xu
LCN
2005
IEEE
13 years 11 months ago
On the Server Fairness of Congestion Control in the ISP Edge Router
The Internet Engineering Task Force (IETF) recommended the deployment of Active Queue Management (AQM) in the Internet routers in 1998. There were more than 50 new AQM algorithms ...
Hsien-Ming Wu, Chin-Chi Wu, Woei Lin
COMCOM
2002
104views more  COMCOM 2002»
13 years 5 months ago
Low-latency guaranteed-rate scheduling using Elastic Round Robin
Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia ap...
Salil S. Kanhere, Harish Sethu