IDEAS home Printed from https://ideas.repec.org/a/ids/ijmnec/v2y2011i1p58-74.html
   My bibliography  Save this article

Dynamic update of minimum cost paths in computer networks

Author

Listed:
  • Gianlorenzo D'Angelo
  • Daniele Frigioni
  • Vinicio Maurizio

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.

Suggested Citation

  • Gianlorenzo D'Angelo & Daniele Frigioni & Vinicio Maurizio, 2011. "Dynamic update of minimum cost paths in computer networks," International Journal of Management and Network Economics, Inderscience Enterprises Ltd, vol. 2(1), pages 58-74.
    • Handle: RePEc:ids:ijmnec:v:2:y:2011:i:1:p:58-74
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=42580
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=259 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.