Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. CSAIL Digital Archive
  4. CSAIL Technical Reports (July 1, 2003 - present)
  5. Near-Optimal Distributed Failure Circumscription

Near-Optimal Distributed Failure Circumscription

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2003-009.ps

Size

12.62 MB

Format

PostScript

Checksum (MD5)

e550f94e017d4ccba0629a2cfd276892

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2003-009.pdf

Size

820.44 KB

Format

Adobe PDF

Checksum (MD5)

38bd899550ae4818b32949c64433d34d

Author(s)
Beal, Jacob
Date Issued
August 11, 2003
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using hierarchical clustering and neighbor relations, andthe resulting circumscription is near-optimal for convex failures.
Subjects
AI
amorphous distributed ad-hoc computing self-organizing stopping failure
Persistent DSpace Link
http://hdl.handle.net/1721.1/30404
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.