103 search results - page 4 / 21 » Oblivious routing on geometric networks |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
ICCD
2008
IEEE
14 years 6 months ago
2008
IEEE
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
IPPS
2005
IEEE
14 years 3 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...