7133 search results - page 1192 / 1427 » Communication algorithms with advice |
191
click to vote
WAOA
2005
Springer
16 years 21 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
208
click to vote
MM
2004
ACM
16 years 20 days ago
2004
ACM
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
226
click to vote
SIGCOMM
2004
ACM
16 years 20 days ago
2004
ACM
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
220
click to vote
SIGMETRICS
2004
ACM
16 years 20 days ago
2004
ACM
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
197
click to vote
NOSSDAV
2004
Springer
16 years 18 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...