Amit M Bhosle, Teofilo F Gonzalez  Home/Search
Context
Related
| ucsb.edu/~bhosle/pub...iastedpdcs03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsb.edu/~bhosle/pubs (more) Homepages: A.Bhosle T.Gonzalez |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the single link failure recovery problem and its application to the alternate path routing problem for ATM networks. Specifically, given a 2-connected graph G, a specified node s, and a shortest paths tree T s = fe 1 ; e 2 ; : : : ; e n\Gamma1 g of s, where e i = (x i ; y i ) and x i = parent Ts (y i ), find a shortest path from y i to s in the graph Gne i for 1 i n \Gamma 1. We present an O(m + n log n) time algorithm for this problem and a linear time algorithm for the case... (Update)
Active bibliography (related documents): More All
1.3: Efficient Algorithms for Single Link Failure Recovery and Its - Application To Atm (Correct)
1.0: Algorithms for Single Link Failure Recovery and Related Problems - Bhosle, Gonzalez (2003) (Correct)
0.2: Call Admission Control Algorithms in ATM Networks: A.. - Rahin, Kara (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ bg03slfr,
author = {Amit M. Bhosle and Teofilo F. Gonzalez},
title = {Efficient Algorithms for Single Link Failure Recovery and Its Application to ATM Networks},
booktitle = {Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems (to appear)},
volume = {1},
pages = {87 - 92},
year = {2003},
isbn = {0-88986-366-0},
publisher = {ACTA Press},
url = "citeseer.ist.psu.edu/bhosle03efficient.html",
url = "http://www.cs.ucsb.edu/~bhosle/publications/slfr-pdcs03.ps" }
Citations (may not include all citations):353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1985
97 Trans-dichotomous algorithms for minimum spanning trees and .. (context) - Fredman, Willard - 1994
78 Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
66 A class of algorithms which require nonlinear time to mainta.. (context) - Tarjan - 1979
31 An optimal minimum spanning tree algorithm - Pettie, Ramachandran - 2000
23 A minimum spanning tree algorithm with inverse-ackermann typ.. (context) - Chazelle - 2000
21 Undirected single source shortest path in linear time - Thorup - 1997
16 Linear-time pointer-machine algorithms for least common ance.. - Buchsbaum, Kaplan et al. - 1998
7 time and linear space (context) - Han, in et al. - 2002
4 Interim Inter-switch Signalling Protocol (context) - Forum - 1996
3 PNNI Routing Specification (context) - Forum
3 A polynomial-time algorithm for the establishment of primary.. - Slosiar, Latin - 2000
Documents on the same site (http://www.cs.ucsb.edu/~bhosle/pubs.html): More
Optimal Assignment of High Threshold Voltage for.. - Tripathi, Bhosle.. (2001) (Correct)
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (Correct)
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC