A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Protocols and Lower Bounds for Failure Localization in the Internet
[chapter]
Advances in Cryptology – EUROCRYPT 2008
Preserved Fulltext
The number of additional messages is an arbitrarily small fraction of the total number of packets. We also prove lower bounds for such protocols: 1. ...
We give the first formal definitions of security for FL-PQM protocols and construct: 1. A simple FL-PQM protocol that can localize a faulty link every time a packet is not correctly delivered. ...
We thank Jennifer Rexford and Eran Tromer for very useful discussions and collaborations on failure localization and routing security in general. ...
doi:10.1007/978-3-540-78967-3_20
dblp:conf/eurocrypt/BarakGX08
fatcat:ppwveboygfarrefo4iml3v4iqe
Page 498 of Mathematical Reviews Vol. , Issue 2001A
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Previous lower bounds for these networks were only constant [P. Fraigniaud and C. Gavoille, in Parallel processing: CONPAR '94, 785-796, Lecture Notes in Comput. Sci., 854, Springer, Berlin, 1994). ...
-*), for any ¢ > 0, for SE, Q(\/n/logn) for CCC and BF, and Q(n(loglogn/logn)*) for S, where n is the number of nodes in the corresponding network. ...
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
[article]
2000
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For propagating information efficiently, we use epidemic communication for both the membership protocol and the fault-tolerance mechanism. ...
We describe an algorithm that allows branch-and-bound problems to be solved in such environments. ...
In the fault-tolerance mechanism, the rumor is stored for local processing, may be processed locally, and is spread infrequently. ...
arXiv:cs/0003054v1
fatcat:k75vys3btzc4zgqifal4fsy6si
The costs and limits of availability for replicated services
2006
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we: i) evaluate availability o f a p r o t o t ype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii ...
with these optimizations to prove t i g h t upper bounds on the availability of services, and iv) show that maximizing availability t ypically entails remaining as close to strong consistency as possible ...
Chandra et.al. 8] derive an analytical failure model for an average Internet path and then simulate the e ects of caching and replication to mask Internet failures. ...
doi:10.1145/1124153.1124156
fatcat:a3uqfzwphvczdjuqbemj3egnbi
The costs and limits of availability for replicated services
2001
ACM SIGOPS Operating Systems Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we: i) evaluate availability o f a p r o t o t ype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii ...
with these optimizations to prove t i g h t upper bounds on the availability of services, and iv) show that maximizing availability t ypically entails remaining as close to strong consistency as possible ...
Chandra et.al. 8] derive an analytical failure model for an average Internet path and then simulate the e ects of caching and replication to mask Internet failures. ...
doi:10.1145/502059.502038
fatcat:cx4eolhfo5fspdahaitrlo44pu
The costs and limits of availability for replicated services
2001
Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we: i) evaluate availability o f a p r o t o t ype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii ...
with these optimizations to prove t i g h t upper bounds on the availability of services, and iv) show that maximizing availability t ypically entails remaining as close to strong consistency as possible ...
Chandra et.al. 8] derive an analytical failure model for an average Internet path and then simulate the e ects of caching and replication to mask Internet failures. ...
doi:10.1145/502035.502038
fatcat:j2pjyhfbojg7vmktivtgjvv5fa
The costs and limits of availability for replicated services
2001
Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we: i) evaluate availability o f a p r o t o t ype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii ...
with these optimizations to prove t i g h t upper bounds on the availability of services, and iv) show that maximizing availability t ypically entails remaining as close to strong consistency as possible ...
Chandra et.al. 8] derive an analytical failure model for an average Internet path and then simulate the e ects of caching and replication to mask Internet failures. ...
doi:10.1145/502034.502038
dblp:conf/sosp/YuV01
fatcat:7wvgc7nbg5f5ncpoki2axkrbpi
Trade-off results for connection management
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We establish trade-offs between message delivery time and quiescence time, in the form of tight lower and upper bounds, for each combination of timing models and failure types. ...
on the performance of connection management protocols, under common assumptions on the pattern of failures of the network and the host nodes. ...
Network and Node Failures In this section, we present our lower bounds under both network and node failures. We start with the drifting clocks model. We show: Theorem 5. ...
doi:10.1007/bfb0036196
fatcat:os2fy5dtbrhynaqajglzyrdr3e
A QoS-configurable failure detection service for internet applications
2016
Journal of Internet Services and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This work presents an Internet Failure Detector Service (IFDS) for processes running in the Internet on multiple autonomous systems. ...
The system was implemented and evaluated for monitored processes running both on single LAN and on PlanetLab. ...
Acknowledgements This work was partially supported by grants 309143/2012-8 and 141714/2014-0 from the Brazilian Research Agency (CNPq). ...
doi:10.1186/s13174-016-0051-y
fatcat:f76xoc3iabblllfhp274u3c5lm
Improving Throughput in SCTP via Dynamic Optimization of Retransmission Bounds
2015
Network Protocols and Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The timeout scheme of SCTP,however, is almost identical to that used in TCP.With the dynamics of today's Internet, that timeoutscheme may be too passive. ...
The algorithm has been im-plemented and tested in real network environments.Experimental results show that the algorithm avoidsspurious retransmissions and provides better through-put by intelligently ...
In contrast, the dynamic RTOmin algorithm provides evidence in favor of lower bounds but only in select environments which are automatically detected. ...
doi:10.5296/npa.v7i3.8228
fatcat:tqbxgugdjnbfxo4dge6d5wxaam
Distributed computing with rules of thumb
2011
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We aim to understand when convergence of the resulting dynamics to an equilibrium point is guaranteed if nodes' interaction is not synchronized (e.g., as in Internet protocols and large-scale markets). ...
We also consider the relationship between classical nontermination results in distributed computing theory and our result, explore the impact of scheduling on convergence, study the computational and communication ...
In [6] , we outline multiple general directions for future research. ...
doi:10.1145/1993806.1993870
dblp:conf/podc/JaggardSW11
fatcat:ttgx46wrancpnpfjly4mtqduai
Slick Packets
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We show that this can be accomplished with reasonably small packet headers for real network topologies, and results in responsiveness to failures that is competitive with past approaches that require much ...
We propose SlickPackets, a novel solution that allows packets to slip around failures by specifying alternate paths in their headers, in the form of compactly-encoded directed acyclic graphs. ...
CDF of SlickPackets FS size and the lower bound in number of edges for handling single-link failures. ...
arXiv:1201.1661v1
fatcat:ypdmfxjzhjcojct4znhxtlfbga
Distributed Hashtable on Pre-structured Overlay Networks
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Internet overlay services must adapt to the substrate network topology and link properties to achieve high performance. ...
In this paper, we present the design of a self-organizing DHT protocol based on the Landmark Hierarchy. ...
We would like to thank anonymous referees for their valuable comments. ...
doi:10.1007/978-3-540-30471-5_5
fatcat:pfipr7yeeffqldzxzpfmcy7zqm
Study of BGP Convergence Time
2016
International Journal of Electrical and Computer Engineering (IJECE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Extensive deployment of the new technologies in internet, protocols need to have continuous improvements in its behavior and operations. ...
Border Gateway Protocol (BGP), a path vector routing protocol, is a widespread exterior gateway protocol (EGP) in the internet. ...
The convergence delay can be increase by increasing the failure in the internet. So for multiple failures, results in more convergence delay in the network. The Amit Sahoo et al. ...
doi:10.11591/ijece.v6i1.8106
fatcat:k76tax7z3nbjta42r3fpqnkbpa
Delayed Internet routing convergence
2000
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication - SIGCOMM '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper examines the latency in Internet path failure, failover, and repair due to the convergence properties of interdomain routing. ...
number of autonomous systems in the Internet. ...
They also thank members of the Internet service provider community for their comments, support, and willingness to permit our instrumentation of their networks. ...
doi:10.1145/347059.347428
dblp:conf/sigcomm/LabovitzABJ00
fatcat:7utdb4rpjrcanhv6x47hy6c7va
« Previous
Showing results 1 — 15 out of 33,657 results