Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree

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

Full description

Saved in:
Bibliographic Details
Published in:PeerJ. Computer science 2021-05, Vol.7, p.e538-e538, Article e538
Main Authors: Yumusak, Semih, Layazali, Sina, Oztoprak, Kasim, Hassanpour, Reza
Format: Article
Language:eng
Subjects:
Algorithms
Chat rooms
Computer Networks and Communications
Connectivity
Greedy algorithms
Heuristic methods
Nodes
Overlay network design
Peer-to-peer networks
Publisher/subscriber systems
Wireless networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2376-5992
2376-5992