473 search results - page 47 / 95 » Early-release fair scheduling |
160
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
200
click to vote
ICCCN
2008
IEEE
16 years 15 days ago
2008
IEEE
—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...
146
click to vote
ICCCN
2007
IEEE
16 years 11 days ago
2007
IEEE
—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...
168
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
138
click to vote
ICNP
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...