Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/224964.224967acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article
Free access

Fault-local distributed mending (extended abstract)

Published: 20 August 1995 Publication History
First page of PDF

References

[1]
~ehud~ A~ek, Baruch Awerbuch, and Eli Gafni. Applying static network protocols to dynamic networks. In Proc.,~8th IEEE S~tmp. on Foundatio,~s of Computer Science, October 1987.
[2]
Baruch Awerbuch, Israel Cidon, and Shay Kutten. Optimal maintenance of replicated information. In Proc. Slst fEEE S~tmp. on Foundations of Computer Science, 1990.
[3]
B. Awerbuch, B. Patt-Shamir, and G. Varghese. Selfstabilization by local checking and correction, in Proc. 3~nd IEEE S~mp. on Foundation of Computer Science, pages 268-277, October 1991.
[4]
Y. Afek, S. Kutten, and M. Yung. Memory-efficient self stabilizing protocols for general networks. In Proc. dth Int. Workshop on Distributed Algorithms, (WDAG), Springer- Verlag LNCS, September 1990.
[5]
B. Awerbuch, S. Kutten, Y. Mansoux, B. Patt-Shamir and G. Varghese, Time-Optimal Self Stabilizing Synchronization, Proc. 1993 ACM Syrup. on Theory of Computing, San Diego, CMifornia, pp. 652-661, May 1993.
[6]
D. E. Comer. Intemetworking with TCP/iP. Prantice Hall, New Jersey, US, 1991.
[7]
T. D. Chandra and S. Toueg. Unreliable Failure Detector for Asynchronous Systems. in P~c. l Oth A CM Symposium o~ Principles of Distributed Computing, Montreal, OaxLada, August 1991, pp. 325-340.
[8]
T. D. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Concensus. In Proc. I lth A UM SStmposium on Principles of Distributed Computing, Vancouver, Canada, August 1992, pp. 147-158.
[9]
S. Dolev and T. Herman. SuperStabilizing Protocols for Dynamic Distributed Systems. In ~nd Workshop on $el/- Stabilizing Systems. Las Vegas, Nevada, May 1995.
[10]
Steven G. Finn. Resynch procedures and a fail-safe network protocol. IEEE Trans. on Communications, 00M- 27(6):840-845, June 1979.
[11]
A. V. Goldberg, S. Plotkin, and G. Shannon, Parallel symmerry breaking in sparse graphs, Proc. 19th ACM Syrup. on Theory of Computing, May 1987.
[12]
S. Kutten and D. P~leg, Tight Fault-locality, Manuscript, 1995.
[13]
S. Kutten and D. Peleg. Fault-Local Self-Stabillzation, In preparation.
[14]
W. Lo and V. Hadzilacos. Using Failure Detectors to Solve Concensus in Asynchronous Shared Memory Systems. In Proc. 8th Int. Work,hop on Di, tributed Algorithms, Terschelling, The Netherlands, September 1994, pp.280-295.
[15]
N. Linlal, D. Peleg, Y. Rabinovichand M. Saks, Sphere Packing and Local Majorities in Graphs, Proc. 2nd Israel Syrup. on Theory of Computing and Systems, Natanya, Israel, June 1993, 141-149.
[16]
N. Linial, Locality in distributed graph algorithms, SIAM J. on Comput., 21:193-201, 1992.
[17]
J. M. McQuillan, I. R/chef and E. C. Rosen, The New Routing Algorithm for the ARPANET. IEEE Trans. on Communications, COM-28, May 1980, pp. 711-719.
[18]
M. Naor and L. Stockmeyer, What Can Be Computed Locally? In Proc. of the ~Sth .4 CM Syrup. on the Theory of Computing, San Diego, California, May 1993, pp. 184-193.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
August 1995
284 pages
ISBN:0897917103
DOI:10.1145/224964
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 August 1995

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PODC95
Sponsor:

Acceptance Rates

PODC '95 Paper Acceptance Rate 49 of 132 submissions, 37%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)37
  • Downloads (Last 6 weeks)9
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Origin of Self-StabilizationEdsger Wybe Dijkstra10.1145/3544585.3544592(81-104)Online publication date: 12-Jul-2022
  • (2020)Fault diagnosis based on extremely randomized trees in wireless sensor networksReliability Engineering & System Safety10.1016/j.ress.2020.107284(107284)Online publication date: Oct-2020
  • (2017)An analysis of fault detection strategies in wireless sensor networksJournal of Network and Computer Applications10.1016/j.jnca.2016.10.01978:C(267-287)Online publication date: 15-Jan-2017
  • (2014)SKIP+Journal of the ACM10.1145/262969561:6(1-26)Online publication date: 17-Dec-2014
  • (2013)Handoff optimization and load balancing in wireless LANs using association controlInternational Journal of Communication Systems10.1002/dac.269628:4(682-704)Online publication date: 20-Nov-2013
  • (2012)TiaraTheoretical Computer Science10.1016/j.tcs.2011.12.079428(18-35)Online publication date: 1-Apr-2012
  • (2011)Fault containment in weakly stabilizing systemsTheoretical Computer Science10.1016/j.tcs.2011.02.039412:33(4297-4311)Online publication date: Jul-2011
  • (2010)Adaptive containment of time-bounded byzantine faultsProceedings of the 12th international conference on Stabilization, safety, and security of distributed systems10.5555/1926829.1926843(126-140)Online publication date: 20-Sep-2010
  • (2010)Distributed error confinementACM Transactions on Algorithms10.1145/1798596.17986016:3(1-23)Online publication date: 2-Jul-2010
  • (2010)Adaptive Containment of Time-Bounded Byzantine FaultsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-642-16023-3_12(126-140)Online publication date: 2010
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media