71 search results - page 4 / 15 » Demand-Oblivious Routing: Distributed vs. Centralized Approa... |
100
click to vote
FTDCS
2004
IEEE
15 years 1 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
IJCAI
2001
14 years 11 months ago
2001
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...