[ns] Distributed Algorithm

["Alessio" <alessio.net@tin.it>]

Dear Sir


I'd like to know if it's possible to implement and simulate a dynamic
distributed algorithm for the all-pairs shortest paths problem on general
network with positive real edge weights to valutate message, time and space
complexity.
If it's possible to implement and simulate the following algorithms:
1-Distance Vector Algorithm ( Bellmann-Ford )
2-The algorithm proposed by S. Haldar: an all pair shortest paths
distributed algorithm using 2n*n messages. Journal of algorithms,24
(1997),995-1003.
3-The algorithm proposed by K.V.S. Ramarao and S. Venkatesan: on finding and
updating shortest paths distributively. Journal of algorithms, 13 (1992),
235-257.


Thank you for your attention
Sergio Angelillis