Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems
Data Structures and Algorithms
2009-06-19 v1 Distributed, Parallel, and Cluster Computing
Discrete Mathematics
Abstract
In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we present efficient, novel, algorithmic techniques for computing optimal solutions. We address topics like: bottleneck paths (trees), optimal paths with non-linear costs, optimal paths with multiple optimization objectives, maintaining aggregate connectivity information under a sequence of network link failures, and several others.
Cite
@article{arxiv.0906.3483,
title = {Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems},
author = {Mugurel Ionut Andreica and Nicolae Tapus},
journal= {arXiv preprint arXiv:0906.3483},
year = {2009}
}