266 search results - page 2 / 54 » Distributed Routing in Tree Networks with Few Landmarks |
WEA
2007
Springer
13 years 11 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
FTDCS
2004
IEEE
13 years 9 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...