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 条

[1]

Alsultan M, Oztoprak K, Hassanpour R., Power aware routing protocols in wireless sensor network, IEICE Transactions on Communications, 99, 7, pp. 1481-1491, (2016)

[2]

What is pub/sub?, (2021)

[3]

Baldoni R, Beraldi R, Quema V, Querzoni L, Tucci-Piergiovanni S., TERA: topic-based event routing for peer-to-peer architectures, Proceedings of the 2007 inaugural international conference on distributed event-based systems, pp. 2-13, (2007)

[4]

Besta M, Hoefler T., Slim fly: a cost effective low-diameter network topology, SC’14: proceedings of the international conference for high performance computing, networking, storage and analysis, pp. 348-359, (2014)

[5]

Bozdagi A, Oztoprak K., Hybrid fault tolerant peer to peer video streaming architecture, IEICE Transactions on Communications, 91, 11, pp. 3627-3638, (2008)

[6]

Carvalho N, Araujo F, Rodrigues L., Scalable QoS-based event routing in publish-subscribe systems, Fourth IEEE international symposium on network computing and applications, pp. 101-108, (2005)

[7]

Chen C, Jacobsen H-A, Vitenberg R., Divide and conquer algorithms for publish/- subscribe overlay design, 2010 IEEE 30th international conference on distributed computing systems, pp. 622-633, (2010)

[8]

Chen C, Jacobsen H-A, Vitenberg R., Star merge and divide-and-conquer algorithms for publish/subscribe topic-connected overlay design, (2010)

[9]

Chen C, Tock Y, Jacobsen H-A, Vitenberg R., Weighted overlay design for topic-based publish/subscribe systems on geo-distributed data centers, 2015 IEEE 35th international conference on distributed computing systems, pp. 474-485, (2015)

[10]

Chockler G, Melamed R, Tock Y, Vitenberg R., Constructing scalable overlays for pub-sub with many topics, Proceedings of the twenty-sixth annual ACM symposium on principles of distributed computing, pp. 109-118, (2007)

← 1 2 3 →