DocumentCode :
2946607
Title :
s-t paths using the min-sum algorithm
Author :
Ruozzi, Nicholas ; Tatikonda, Sekhar
Author_Institution :
Dept. of Comput. Sci., Yale Univ., New Haven, CT
fYear :
2008
fDate :
23-26 Sept. 2008
Firstpage :
918
Lastpage :
921
Abstract :
Solving the distributed shortest path problem has important applications in the theory of distributed systems, most notably routing. In this paper, we provide and prove the convergence of a min-sum algorithm to compute the shortest path between two nodes in a graph with positive edge weights. Unlike the standard distributed shortest path algorithms, the rate of convergence depends on the weight of the minimal path and not necessarily the number of nodes in the network.
Keywords :
directed graphs; integer programming; directed graph; distributed shortest path problem; integer programming; min-sum algorithm; routing; s-t paths; Application software; Computer science; Constraint optimization; Convergence; Distributed algorithms; Linear programming; Message passing; Routing; Shortest path problem; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location :
Urbana-Champaign, IL
Print_ISBN :
978-1-4244-2925-7
Electronic_ISBN :
978-1-4244-2926-4
Type :
conf
DOI :
10.1109/ALLERTON.2008.4797655
Filename :
4797655
Link To Document :
بازگشت