Robust local algorithms for communication and stability in distributed networks

• Online Access: http://hdl.handle.net/2047/D20247295

In a world in which our technological infrastructure is increasingly reliant on platforms that are distributed in nature, there is a substantial need for distributed algorithms and network designs that are able to perform a wide range of tasks as or more efficiently than their non-distributed counterparts. Furthermore, these algorithms and networks must be resilient to changes and disruptions in the network. Arguably the best way to do this is to design algorithms that are decentralized. By exchanging messages and data with immediate neighbors and running other subprocesses locally (often involving some sort of random choice), a coordinated solution to problem still emerges from the system.