Low-diameter topic-based pub/sub overlay Network Construction with minimum–maximum node Degree

被引：0

作者：

Yumusak S. ^{[1
]}

Layazali S. ^{[2
]}

Oztoprak K. ^{[3
]}

Hassanpour R. ^{[4
]}

机构：

[1] Department of Computer Engineering, KTO Karatay University, Konya

[2] Department of Computer Engineering, Çankaya University, Ankara

[3] Department of Computer Engineering, Konya Food and Agriculture University, Konya

[4] Department of Computer Science, Rotterdam University of Applied Sciences, Holland, Rotterdam

来源：

PeerJ Computer Science | 2021年 / 7卷

关键词：

Overlay network design; Peer-to-peer networks; Publisher/subscriber systems;

D O I：

10.7717/PEERJ-CS.538

中图分类号：

学科分类号：

摘要：

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. Copyright 2021 Yumusak et al.

引用

页码：1 / 26

页数：25

共 24 条

[11]

Chockler G, Melamed R, Tock Y, Vitenberg R., Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication, Proceedings of the 2007 inaugural international conference on Distributed event-based systems, pp. 14-25, (2007)

[12]

Eugster PT, Felber PA, Guerraoui R, Kermarrec A-M., The many faces of publish/- subscribe, ACM Computing Surveys, 35, 2, pp. 114-131, (2003)

[13]

What is pub/sub?, (2021)

[14]

Apache kafka, (2021)

[15]

Lau LC, Naor J, Salavatipour MR, Singh M., Survivable network design with degree or order constraints, SIAM Journal on Computing, 39, 3, pp. 1062-1087, (2009)

[16]

Liu H, Ramasubramanian V, Sirer EG., Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews, Proceedings of the 5th ACM SIGCOMM conference on internet measurement, (2005)

[17]

Azure service bus cloud messaging service, (2021)

[18]

Milo T, Zur T, Verbin E., Boosting topic-based publish-subscribe systems with dy-namic clustering, Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pp. 749-760, (2007)

[19]

Onus M, Richa AW., Minimum maximum-degree publish–subscribe over-lay network design, IEEE/ACM Transactions on Networking, 19, 5, pp. 1331-1343, (2011)

[20]

Onus M, Richa AW., Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design, Computer Networks, 94, pp. 307-317, (2016)

← 1 2 3 →