83 search results - page 2 / 17 » Protocols and Lower Bounds for Failure Localization in the I... |
SPAA
2009
ACM
13 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
TSMC
2008
13 years 4 months ago
2008
In this paper, we study distributed failure diagnosis under k-bounded communication delay, where each local site transmits its observations to other sites immediately after each o...
GLOBECOM
2008
IEEE
13 years 5 months ago
2008
IEEE
This paper develops and studies a traffic-aware inter-domain routing (TIDR) protocol, which drastically improves the stability of the BGP-based inter-domain routing system. TIDR is...
SIGCOMM
2012
ACM
11 years 7 months ago
2012
ACM
The Internet was designed to always find a route if there is a policycompliant path. However, in many cases, connectivity is disrupted despite the existence of an underlying vali...
IWQOS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...