460 search results - page 31 / 92 » Bounding the locality of distributed routing algorithms |
163
click to vote
ICDCS
2010
IEEE
15 years 10 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...
136
click to vote
ISPA
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
184
click to vote
TSP
2010
15 years 23 days ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
177
click to vote
SECON
2008
IEEE
16 years 14 days ago
2008
IEEE
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
164
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...