Sciweavers

2500 search results - page 94 / 500
» Inclusion-Exclusion and Network Reliability
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
EUROSYS
2006
ACM
14 years 6 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
KIVS
2005
Springer
14 years 2 months ago
Establishing P2P-Overlays for Ad Hoc Networks Using Provider Subscription
Multi-hop ad hoc networks are envisioned to be an integral part of future mobile networks. Today, however, ad hoc networks lack the necessary resilience and reliability. This work ...
Tronje Krop, Martin Kappes, Matthias Hollick
IJNSEC
2010
66views more  IJNSEC 2010»
13 years 3 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald
OSDI
2004
ACM
14 years 9 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...