LoboVault Home
 

Algorithms for self-healing networks

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/10914

Algorithms for self-healing networks

Show simple item record

dc.contributor.author Trehan, Amitabh
dc.date.accessioned 2010-06-28T22:56:06Z
dc.date.available 2010-06-28T22:56:06Z
dc.date.issued 2010-06-28T22:56:06Z
dc.date.submitted May 2010
dc.identifier.uri http://hdl.handle.net/1928/10914
dc.description.abstract Many 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.iso en_US en_US
dc.subject algorithms en_US
dc.subject self-healing en_US
dc.subject distributed en_US
dc.subject networks en_US
dc.subject reconfigurable en_US
dc.subject peer-to-peer en_US
dc.subject responsive en_US
dc.subject data structure en_US
dc.subject half-full tree en_US
dc.subject stretch en_US
dc.subject degree en_US
dc.subject connectivity en_US
dc.subject diameter en_US
dc.subject reliability en_US
dc.subject.lcsh Adaptive routing (Computer network management)
dc.subject.lcsh Self-adaptive software.
dc.subject.lcsh Adaptive computing systems.
dc.subject.lcsh Distributed algorithms.
dc.title Algorithms for self-healing networks en_US
dc.type Dissertation en_US
dc.description.degree Computer Science en_US
dc.description.level Doctoral en_US
dc.description.department University of New Mexico. Dept. of Computer Science en_US
dc.description.advisor Saia, Jared
dc.description.committee-member Hayes, Thomas
dc.description.committee-member Moore, Cris
dc.description.committee-member Berger-Wolf, Tanya


Files in this item

Files Size Format View
PhDDissertation.pdf 2.416Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account