Sciweavers

7 search results - page 1 / 2
» Near-Optimal Hot-Potato Routing on Trees
Sort
View
EUROPAR
2004
Springer
13 years 9 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
CJ
2002
81views more  CJ 2002»
13 years 4 months ago
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
Alan Roberts, Antonios Symvonis, David R. Wood
INFOCOM
2000
IEEE
13 years 8 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
WINE
2005
Springer
109views Economy» more  WINE 2005»
13 years 9 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
ICASSP
2009
IEEE
13 years 11 months ago
Adaptive distributed transforms for irregularly sampled Wireless Sensor Networks
We develop energy-efficient, adaptive distributed transforms for data gathering in wireless sensor networks. In particular, we consider a class of unidirectional transforms that ...
Godwin Shen, Sunil K. Narang, Antonio Ortega