IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v9y2018i3p23-63.html
   My bibliography  Save this article

Swarm-Inspired Routing Algorithms for Unstructured P2P Networks

Author

Listed:
  • Vesna Šešum-Čavić

    (Vienna University of Technology, Vienna, Austria)

  • Eva Kuehn

    (Vienna University of Technology, Vienna, Austria)

  • Stefan Zischka

    (Vienna University of Technology, Vienna, Austria)

Abstract

Due to extreme complexity in nowadays networks, routing becomes a challenging task. This problem is especially delicate in unstructured P2P networks, as there is neither a global view on the network nor a global address mapping. Although different conventional solutions are commercially available, swarm-intelligent approaches are promising in case of frequently changing conditions in P2P networks. In this article, an approach inspired by Dictyostelium discoideum slime molds and bees with distributive and autonomous properties is proposed. Both bio-mechanisms are “tailored” for routing in unstructured P2P systems, resulting in swarm-inspired routing algorithms, SMNet and BeeNet. They are compared with three swarm-based routing algorithms and two conventional approaches. The benchmarks include parameter sensitivity-, comparative-, statistical- and scalability-analysis. SMNet outperforms the other algorithms in the comparative analysis regarding the average data packet delay, especially for bigger network sizes and data packet traffic levels. Both algorithms show good scalability.

Suggested Citation

  • Vesna Šešum-Čavić & Eva Kuehn & Stefan Zischka, 2018. "Swarm-Inspired Routing Algorithms for Unstructured P2P Networks," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 9(3), pages 23-63, July.
    • Handle: RePEc:igg:jsir00:v:9:y:2018:i:3:p:23-63
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2018070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jsir00:v:9:y:2018:i:3:p:23-63. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.