Browsing by Author "Layazali, Sina"

Now showing 1 - 4 of 4

Citation Count: Yumuşak, Semih;...et.al. (2022). "A Novel Hypercube-based Approach to Overlay Design Algorithms on Topic Distribution Networks", Politeknik Dergisi, Vol.25, No.4, pp.1535-1552.
A Novel Hypercube-based Approach to Overlay Design Algorithms on Topic Distribution Networks
(2022) Yumuşak, Semih; Layazali, Sina; Öztoprak, Kasım; Hassanpour, Reza
Data communication in peer-to-peer (P2P) network requires a fine-grained optimization for memory and processing to lower the total energy consumption. When the concept of Publish/subscribe (Pub/Sub) systems were used as a communication tool in a P2P network, the network required additional optimization algorithms to reduce the complexity. The major difficulty for such networks was creating an overlay design algorithm (ODA) to define the communication patterns. Although some ODAs may perform worse on a high-scale, some may have better average/maximum node degrees. Based on the experimentation and previous works, this study designed an algorithm called the Hypercube-ODA, which reduces the average/maximum node degree for a topic connected Pub/Sub network. The Hypercube-ODA algorithm creates the overlay network by creating random cubes within the network and arranging the nodes with the cubes they belong to. In this paper, the details of the proposed Hypercube algorithm were presented and its performance was compared with the existing ODAs. Results from the experiments indicate that the proposed method outperforms other ODA methods in terms of lower average node degree (lowering the average node degree by up to 60%).
Citation Count: Yumusak, Semih;...et.al. (2021). "Low-diameter topic-based pub/sub overlay Network Construction with minimum–maximum node Degree", PeerJ Computer Science, Vol.7, pp.1-26.
Low-diameter topic-based pub/sub overlay Network Construction with minimum–maximum node Degree
(2021) Yumusak, Semih; Layazali, Sina; Öztoprak, Kasım; Hassanpour, Reza
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.
Citation Count: Layazali, Sina; Öztoprak, Kasım; Doğdu, Erdoğan, "Topic distribution constant diameter overlay design algorithm (TD-CD-ODA)", 2017 11th IEEE International Conference On Semantic Computing (ICSC), pp. 482-486, (2017).
Topic distribution constant diameter overlay design algorithm (TD-CD-ODA)
(IEEE, 2017) Öztoprak, Kasım; Layazali, Sina; Doğdu, Erdoğan
Publish/subscribe communication systems, where nodes subscribe to many different topics of interest, are becoming increasingly more common in application domains such as social networks, Internet of Things, etc. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem in these systems. For scalability and efficiency, it is important to keep the maximum node degree of the overlay in the publish/subscribe system low. Ideally one would like to be able not only to keep the maximum node degree of the overlay low, but also to ensure that the network has low diameter. We address this problem by presenting Topic Distribution Constant Diameter Overlay Design Algorithm (TD-CD-ODA) that achieves a minimal maximum node degree in a low-diameter setting. We have shown experimentally that the algorithm performs well in both targets in comparison to the other overlay design algorithms.
Citation Count: Öztoprak, Kasım; Layazali, Sina; Doğdu, Erdoğan. "Topic Distribution Constant Diameter Overlay Design Algorithm (TD-CD-ODA)", 2017 IEEE 11th International Conference on Semantic Computing, pp. 482-486, 2017.
Topic Distribution Constant Diameter Overlay Design Algorithm (TD-CD-ODA)
(2017) Öztoprak, Kasım; Layazali, Sina; Doğdu, Erdoğan; 129828
Publish/subscribe communication systems, where nodes subscribe to many different topics of interest, are becoming increasingly more common in application domains such as social networks, Internet of Things, etc. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem in these systems. For scalability and efficiency, it is important to keep the maximum node degree of the overlay in the publish/subscribe system low. Ideally one would like to be able not only to keep the maximum node degree of the overlay low, but also to ensure that the network has low diameter. We address this problem by presenting Topic Distribution Constant Diameter Overlay Design Algorithm (TDCD-ODA) that achieves a minimal maximum node degree in a low-diameter setting. We have shown experimentally that the algorithm performs well in both targets in comparison to the other overlay design algorithms.