Advanced Search
MyIDEAS: Login to save this article or follow this journal

Dynamic update of minimum cost paths in computer networks

Contents:

Author Info

  • Gianlorenzo D'Angelo
  • Daniele Frigioni
  • Vinicio Maurizio
Registered author(s):

    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.

    Download Info

    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.
    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 look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Inderscience Enterprises Ltd in its journal Int. J. of Management and Network Economics.

    Volume (Year): 2 (2011)
    Issue (Month): 1 ()
    Pages: 58-74

    as in new window
    Handle: RePEc:ids:ijmnec:v:2:y:2011:i:1:p:58-74

    Contact details of provider:
    Web page: http://www.inderscience.com/browse/index.php?journalID==259

    Related research

    Keywords: minimum cost paths; distributed networks; dynamic networks; concurrent computation; distance vector algorithms; simulation.;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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 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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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