Abstract
The problem of computing, in a distributed fashion, the shortest paths of a dynamic graph is a core functionality of modern communication networks. Distance vector algorithms are widely adopted solutions for this problem when scalability and reliability are key issues or when nodes have limited hardware resources, as they result very competitive in terms of memory and computational requirements. In this paper, we first discuss some recent distance vector solutions, and then present the results of an ongoing experimental study, conducted on a prominent category of networks, namely generalized linear preference power-law networks, to rank the performance of such solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
