Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

TL;DR

This paper introduces efficient offline algorithms for various packet routing problems in distributed systems, addressing complex scenarios like bottleneck paths, multi-objective optimization, and network failures.

Contribution

It presents novel algorithmic techniques for computing optimal solutions to multiple complex routing problems using graph theory.

Findings

Efficient algorithms for bottleneck path trees.

Optimal paths with non-linear costs achieved.

Maintaining connectivity under link failures.

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.