269 search results - page 26 / 54 » Online oblivious routing |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...