Cargando…
Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree
In the construction of effective and scalable overlay networks, publish/subscribe (pub/sub) network designers prefer to keep the diameter and maximum node degree of the network low. However, existing algorithms are not capable of simultaneously decreasing the maximum node degree and the network diam...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8157249/ https://www.ncbi.nlm.nih.gov/pubmed/34084935 http://dx.doi.org/10.7717/peerj-cs.538 |
_version_ | 1783699640276746240 |
---|---|
author | Yumusak, Semih Layazali, Sina Oztoprak, Kasim Hassanpour, Reza |
author_facet | Yumusak, Semih Layazali, Sina Oztoprak, Kasim Hassanpour, Reza |
author_sort | Yumusak, Semih |
collection | PubMed |
description | In the construction of effective and scalable overlay networks, publish/subscribe (pub/sub) network designers prefer to keep the diameter and maximum node degree of the network low. However, existing algorithms are not capable of simultaneously decreasing the maximum node degree and the network diameter. To address this issue in an overlay network with various topics, we present herein a heuristic algorithm, called the constant-diameter minimum–maximum degree (CD-MAX), which decreases the maximum node degree and maintains the diameter of the overlay network at two as the highest. The proposed algorithm based on the greedy merge algorithm selects the node with the minimum number of neighbors. The output of the CD-MAX algorithm is enhanced by applying a refinement stage through the CD-MAX-Ref algorithm, which further improves the maximum node degrees. The numerical results of the algorithm simulation indicate that the CD-MAX and CD-MAX-Ref algorithms improve the maximum node-degree by up to 64% and run up to four times faster than similar algorithms. |
format | Online Article Text |
id | pubmed-8157249 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | PeerJ Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-81572492021-06-02 Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree Yumusak, Semih Layazali, Sina Oztoprak, Kasim Hassanpour, Reza PeerJ Comput Sci Computer Networks and Communications In the construction of effective and scalable overlay networks, publish/subscribe (pub/sub) network designers prefer to keep the diameter and maximum node degree of the network low. However, existing algorithms are not capable of simultaneously decreasing the maximum node degree and the network diameter. To address this issue in an overlay network with various topics, we present herein a heuristic algorithm, called the constant-diameter minimum–maximum degree (CD-MAX), which decreases the maximum node degree and maintains the diameter of the overlay network at two as the highest. The proposed algorithm based on the greedy merge algorithm selects the node with the minimum number of neighbors. The output of the CD-MAX algorithm is enhanced by applying a refinement stage through the CD-MAX-Ref algorithm, which further improves the maximum node degrees. The numerical results of the algorithm simulation indicate that the CD-MAX and CD-MAX-Ref algorithms improve the maximum node-degree by up to 64% and run up to four times faster than similar algorithms. PeerJ Inc. 2021-05-14 /pmc/articles/PMC8157249/ /pubmed/34084935 http://dx.doi.org/10.7717/peerj-cs.538 Text en ©2021 Yumusak et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
spellingShingle | Computer Networks and Communications Yumusak, Semih Layazali, Sina Oztoprak, Kasim Hassanpour, Reza Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title | Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title_full | Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title_fullStr | Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title_full_unstemmed | Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title_short | Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
title_sort | low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree |
topic | Computer Networks and Communications |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8157249/ https://www.ncbi.nlm.nih.gov/pubmed/34084935 http://dx.doi.org/10.7717/peerj-cs.538 |
work_keys_str_mv | AT yumusaksemih lowdiametertopicbasedpubsuboverlaynetworkconstructionwithminimummaximumnodedegree AT layazalisina lowdiametertopicbasedpubsuboverlaynetworkconstructionwithminimummaximumnodedegree AT oztoprakkasim lowdiametertopicbasedpubsuboverlaynetworkconstructionwithminimummaximumnodedegree AT hassanpourreza lowdiametertopicbasedpubsuboverlaynetworkconstructionwithminimummaximumnodedegree |