 |
|
|
|
| HAL : hal-00465528, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Acta Universitatis Apulensis - Mathematics-Informatics (ISSN: 1582-5329), 18 (2009) 111-128 |
|
|
|
|
| Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems |
|
|
| Mugurel Ionut Andreica 1Nicolae Tapus 1 |
|
|
| (01/10/2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Parallel and Distributed Systems Laboratory [Bucarest] |
|
|
|
University Politehnica of Bucarest |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Algorithme et structure de données Informatique/Réseaux et télécommunications Informatique/Calcul parallèle, distribué et partagé |
|
|
| Packet Routing – Optimal Paths – Bottleneck Path – Connectivity Maintenance – Distributed Systems |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00465528, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00465528 | |
| oai:hal.archives-ouvertes.fr:hal-00465528 | |
| Contributeur : Mugurel Ionut Andreica | |
| Soumis le : Vendredi 19 Mars 2010, 16:49:48 | |
| Dernière modification le : Vendredi 19 Mars 2010, 16:58:23 | |
