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

Mugurel Ionut Andreica (1) , Nicolae Tapus (1)

1 Parallel and Distributed Systems Laboratory [Bucarest]

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.

Mots clés: Packet Routing; Optimal Paths; Bottleneck Path; Connectivity Maintenance; Distributed Systems

Domaines: Algorithme et structure de données [cs.DS]; Réseaux et télécommunications [cs.NI]; Calcul parallèle, distribué et partagé [cs.DC]

Mugurel Ionut Andreica, Nicolae Tapus. Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems. Acta Universitatis Apulensis - Mathematics-Informatics (ISSN: 1582-5329), 2009, 18, pp.111-128. ⟨hal-00465528⟩