Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Institut universitaire de France [IUF] | |
| dc.contributor.author | GAVOILLE, Cyril | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | GODFROY, Quentin | |
| hal.structure.identifier | Networks, Graphs and Algorithms [GANG] | |
| dc.contributor.author | VIENNOT, Laurent | |
| dc.date.accessioned | 2024-04-15T09:46:58Z | |
| dc.date.available | 2024-04-15T09:46:58Z | |
| dc.date.created | 2011-09-13 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198053 | |
| dc.description.abstractEn | Motivated by multipath routing, we introduce a multi-connected variant of spanners. For that purpose we introduce the $p$-multipath cost between two nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally vertex-disjoint paths between $u$ and $v$. Given a weighted graph $G$, a subgraph $H$ is a $p$-multipath $s$-spanner if for all $u,v$, the $p$-multipath cost between $u$ and $v$ in $H$ is at most $s$ times the $p$-multipath cost in $G$. The $s$ factor is called the stretch. Building upon recent results on fault-tolerant spanners, we show how to build $p$-multipath spanners of constant stretch and of $\tO(n^{1+1/k})$ edges\footnote{Tilde-$O$ notation is similar to Big-$O$ up to poly-logarithmic factors in $n$.}, for fixed parameters $p$ and $k$, $n$ being the number of nodes of the graph. Such spanners can be constructed by a distributed algorithm running in $O(k)$ rounds. Additionally, we give an improved construction for the case $p=k=2$. Our spanner $H$ has $O(n^{3/2})$ edges and the $p$-multipath cost in $H$ between any two node is at most twice the corresponding one in $G$ plus $O(W)$, $W$ being the maximum edge weight. | |
| dc.language.iso | en | |
| dc.subject.en | distributed graph algorithm | |
| dc.subject.en | spanner | |
| dc.subject.en | multipath routing | |
| dc.title.en | Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners | |
| dc.type | Rapport | |
| dc.subject.hal | Informatique [cs]/Réseaux et télécommunications [cs.NI] | |
| dc.subject.hal | Informatique [cs]/Mathématique discrète [cs.DM] | |
| dc.identifier.arxiv | 1109.2696 | |
| dc.description.sponsorshipEurope | Experimental UpdateLess Evolutive Routing | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| hal.identifier | hal-00622915 | |
| hal.version | 1 | |
| hal.audience | Non spécifiée | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00622915v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=GAVOILLE,%20Cyril&GODFROY,%20Quentin&VIENNOT,%20Laurent&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||