Single backup table schemes for shortest-path routing

Ito, Hiro; Iwama, Kazuo; Okabe, Yasuo; Yoshihiro, Takuya

doi:10.1016/j.tcs.2004.06.033

Cited by 22 publications

(21 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather expensive and causes long delays in the message's transmission [5,10]. Hopefully, some of these costs will be reduced if the serial algorithms for dynamic graphs (e.g., those of [1]) could be somehow employed; to date, the difficulties of finding an efficient distributed implementation have not been overcome (e.g., see [9]).…”

Section: Introductionmentioning

confidence: 99%

“…A new strategy has been recently proposed [2,5,7,8,11]. It starts from the idea of precomputing, for each link in the tree, a single non-tree link (the swap edge) able to reconnect the network should the first fail.…”

Section: Introductionmentioning

confidence: 99%

“…From a distributed point of view, only the first of those problems, F dist , has been investigated and solved. A simple but non-optimal solution has been developed in [5]. An efficient optimal solution has been recently proposed [3].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Computing All the Best Swap Edges Distributively

Flocchini¹,

Pagli²,

Prencipe³

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in presence of transient failures. According to this technique, a message follows the normal routing table information unless the next hop has failed; in this case, it is redirected towards a precomputed link, called swap; once this link has been crossed, normal routing is resumed. The amount of precomputed information required in addition to the routing table is rather small: a single link per each destination. Several efficient serial algorithms have been presented to compute this information; none of them can unfortunately be efficiently implemented in a distributed environment. In this paper we present protocols, based on a new strategy, that allow the efficient computation of all the optimal swap edges under several optimization criteria.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Computing All the Best Swap Edges Distributively

Flocchini¹,

Pagli²,

Prencipe³

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Information (E) is obtained by having the center node send a "distance from d c " message to both neighbors d c+1 and d c−1 on D, which is forwarded and updated on the diameter 3 . This information is used by the diameter nodes for computing λ(d i ), required in (I).…”

Section: Computing the Additional Informationmentioning

confidence: 99%

“…Among all possible swap links, one should choose a best swap w.r.t. the original objective [3], [4], [5], [6], that is in our case, a swap that minimizes the diameter of the resulting swap tree. Note that the swap tree is different from a minimum diameter spanning tree of the underlying graph that does not use the failed link.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Gfeller

Santoro

Widmayer

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract-Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link failures is swap rerouting, where the temporarily broken link is replaced by a single swap link from the underlying graph. A rapid replacement of a broken link by a swap link is only possible if all swap links have been precomputed. The selection of high quality swap links is essential; it must follow the same objective as the originally chosen communication subnetwork. We are interested in a minimum diameter tree in a graph with edge weights (so as to minimize the maximum travel time of messages). Hence, each swap link must minimize (among all possible swaps) the diameter of the tree that results from swapping. We propose a distributed algorithm that efficiently computes all of these swap links, and we explain how to route messages across swap edges with a compact routing scheme. Finally, we consider the computation of swap edges in an arbitrary spanning tree, where swap edges are chosen to minimize the time required to adapt routing in case of a failure, and give efficient distributed algorithms for two variants of this problem.

show abstract

Design and Analysis of Distributed Algorithms

Santoro¹

2006

157

147

View full text Add to dashboard Cite

Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages.For general information on our other products and services or for technical support, please contact our Customer Care Department within the United States at (800) 762-2974, outside the United States at (317) 572-3993 or fax (317) 572-4002.Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic formats. For more information about Wiley products, visit our web site at www.wiley.com.

show abstract

Single backup table schemes for shortest-path routing

Cited by 22 publications

References 5 publications

Computing All the Best Swap Edges Distributively

Computing All the Best Swap Edges Distributively

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Design and Analysis of Distributed Algorithms

Contact Info

Product

Resources

About