Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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, 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-333199

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.