Algorithmic solutions for transient faults in communication networks: On swap edges and local algorithms
Beat Gfeller · Repository for Publications and Research Data (ETH Zurich) · 2009
Communication networks such as the Internet are ubiquitous today, and play a key role in modern society.Given their widespread use, measures must be taken to ensure the continued operation of these networks even in the presence of failures of individual parts.It is particularly important to efficiently deal with transient faults, since these are predominant in many network environments.This tenet is the main motivation for this dissertation, which provides algorithmic solutions for transient faults in communication networks.In this context, we consider network environments with varying characteristics, from rather static to highly dynamic networks.