Dynamic update of minimum cost paths in computer networks
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 2 (2011)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID==259 |
When requesting a correction, please mention this item's handle: RePEc:ids:ijmnec:v:2:y:2011:i:1:p:58-74. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.