Stabilité des arbres des plus courts chemins en présence de concurrence

The shortest path tree problem is studies in the context that each node has this own metric. This problem is connected to inter-domain routing where each node (AS) has policybased metric. Here, we extend the work of Griffin et al. In fact, we also consider that there exist some coalitions. Next, we give somes properties of the instances having such tree. Finally, we present a self-stabilizing algorithm and we show that it converges to a solution of an instance if it instance contains such shortest path tree. MOTS-CLES: plus court chemin, routage interdomaine, autostabilisation, theorie des jeux.