641 search results - page 30 / 129 » On robust online scheduling algorithms |
ICALP
2001
Springer
14 years 11 days ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end...
ICNP
2003
IEEE
14 years 1 months ago
2003
IEEE
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...