Dynamic update of minimum cost paths in computer networks

Gianlorenzo D'Angelo, Daniele Frigioni and Vinicio Maurizio

International Journal of Management and Network Economics, 2011, vol. 2, issue 1, 58-74

Abstract: The problem of dynamically update minimum cost paths in a distributed network of computers while link update operations occur to the network is considered crucial in today's practical applications. A number of solutions have been proposed in the literature for this problem. In this paper, we perform an extensive experimental study in the OMNeT++ simulation environment by implementing three different algorithms for the above described problem: the Bellman-Ford method; DUAL (a part of CISCO's widely used EIGRP protocol), which is perhaps the most used algorithm; and ConFu, a recently proposed algorithm. We perform several tests both on real-world and random networks and randomly generated update sequences. These experiments show that in most cases ConFu outperforms Bellman-Ford and DUAL in terms of either number of messages sent or space occupancy per node.

Keywords: minimum cost paths; distributed networks; dynamic networks; concurrent computation; distance vector algorithms; simulation. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=42580 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmnec:v:2:y:2011:i:1:p:58-74

Access Statistics for this article

More articles in International Journal of Management and Network Economics from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().