Show simple item record

dc.contributor.authorTrehan, Amitabh
dc.date.accessioned2010-06-28T22:56:06Z
dc.date.available2010-06-28T22:56:06Z
dc.date.issued2010-06-28T22:56:06Z
dc.date.submittedMay 2010
dc.identifier.urihttp://hdl.handle.net/1928/10914
dc.description.abstractMany modern networks are reconfigurable, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and, maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call self-healing. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer.en_US
dc.language.isoen_USen_US
dc.subjectalgorithmsen_US
dc.subjectself-healingen_US
dc.subjectdistributeden_US
dc.subjectnetworksen_US
dc.subjectreconfigurableen_US
dc.subjectpeer-to-peeren_US
dc.subjectresponsiveen_US
dc.subjectdata structureen_US
dc.subjecthalf-full treeen_US
dc.subjectstretchen_US
dc.subjectdegreeen_US
dc.subjectconnectivityen_US
dc.subjectdiameteren_US
dc.subjectreliabilityen_US
dc.subject.lcshAdaptive routing (Computer network management)
dc.subject.lcshSelf-adaptive software.
dc.subject.lcshAdaptive computing systems.
dc.subject.lcshDistributed algorithms.
dc.titleAlgorithms for self-healing networksen_US
dc.typeDissertationen_US
dc.description.degreeComputer Scienceen_US
dc.description.levelDoctoralen_US
dc.description.departmentUniversity of New Mexico. Dept. of Computer Scienceen_US
dc.description.advisorSaia, Jared
dc.description.committee-memberHayes, Thomas
dc.description.committee-memberMoore, Cris
dc.description.committee-memberBerger-Wolf, Tanya


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record