540 search results - page 23 / 108 » Competitive Routing over Time |
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
IWCMC
2010
ACM
14 years 2 months ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—In the absence of end-to-end quality of service (QoS), overlay routing has been used as an alternative to the default best effort Internet routing. Using end-to-end network meas...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— We consider two-hop communication of a delaysensitive, memoryless Gaussian source over two independent paths in an ad-hoc network. To capture the behavior an ad-hoc net...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...