On the query system organization of a clustered distributed network
News
On the query system organization of a clustered distributed network
Abstract
In this paper, a model of a service-oriented architecture is proposed as a clustered distributed network. In such a network, a node can request a service that can be provided by another, but a priori unknown, network node. The process for finding the closest node is organized similar to the breadth-first search. A proposed search ensures the node reachability, allows to avoid the message duplication, and ensures that the shortest path is utilized for the message exchange. The model is aimed at preventing the network overloading and minimizes both time processing and the required memory size. A clustered distributed network has multiple clusters where each cluster is a subset of network nodes and their connecting edges. Network edges that do not belong to any cluster are not used for message transmission, and messages move from cluster to cluster through common nodes. In order to avoid message duplication, the cluster graph is organized as a tree. In the paper, it is shown that the above requirements are satisfied by a connected block graph, i.e., a connected graph whose blocks (biconnected components) are cliques, and these blocks are then selected as clusters of the network.
Keywords
Edition
Proceedings of the Institute for System Programming, vol. 38, issue 3, part 1, 2026, pp. 7-32
ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).
DOI: 10.15514/ISPRAS-2026-38(3)-1
For citation
Full text of the paper in pdf (in Russian)
Back to the contents of the volume