scholarly journals THE TASK OF REDESIGNING LARGE DISTRIBUTED CORPORATE SYSTEM

2021 ◽  
pp. 330-333
Author(s):  
Anatolii Kosolapov
Keyword(s):  
Distributed Systems ◽  
Information Transmission ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Communication Channels ◽  
Information Flows ◽  
Data Corruption ◽  
Information Logistics ◽  
Corporate System ◽  
Integral Indicator

The paper proposes a new problem to be solved in the process of redesigning large distributed corporate systems in which there is an exchange of many information flows through various channels. The variety of information transmission routes often leads to multiple duplication of information flows in physical channels. This increases the likelihood of data corruption on the network. At the same time, in large distributed systems, powerful and weak channels with low bandwidth or low reliability are used, which are often disconnected, and in this case it is necessary to solve the problem of information logistics - redistribution of information flows. The paper proposes the problem of optimizing the redistribution of information flows by the criterion of minimizing the total increment in the volume of transmitted information in the system, which is included in the integral indicator of the characteristics of logical and physical communication channels. The problem is solved at the application level when redesigning a corporate system by removing ineffective channels to obtain a minimum spanning tree structure.

scholarly journals Converting MST to TSP Path by Branch Elimination

2020 ◽  
Vol 11 (1) ◽  
pp. 177
Author(s):  
Pasi Fränti ◽  
Teemu Nenonen ◽  
Mingchuan Yuan
Keyword(s):  
Spanning Tree ◽  
Closed Loop ◽  
Minimum Spanning Tree ◽  
Travelling Salesman Problem ◽  
Open Loop ◽  
Travelling Salesman ◽  
Elimination Algorithm ◽  
Number Of Iterations ◽  
Number Of Branches

Travelling salesman problem (TSP) has been widely studied for the classical closed loop variant but less attention has been paid to the open loop variant. Open loop solution has property of being also a spanning tree, although not necessarily the minimum spanning tree (MST). In this paper, we present a simple branch elimination algorithm that removes the branches from MST by cutting one link and then reconnecting the resulting subtrees via selected leaf nodes. The number of iterations equals to the number of branches (b) in the MST. Typically, b << n where n is the number of nodes. With O-Mopsi and Dots datasets, the algorithm reaches gap of 1.69% and 0.61 %, respectively. The algorithm is suitable especially for educational purposes by showing the connection between MST and TSP, but it can also serve as a quick approximation for more complex metaheuristics whose efficiency relies on quality of the initial solution.

Latency, Capacity, and Distributed Minimum Spanning Tree†

2020 ◽  
Author(s):  
John Augustine ◽  
Seth Gilbert ◽  
Fabian Kuhn ◽  
Peter Robinson ◽  
Suman Sourav
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree

DEVELOPING PROXIMITY GRAPHS BY PHYSARUM POLYCEPHALUM: DOES THE PLASMODIUM FOLLOW THE TOUSSAINT HIERARCHY?

2009 ◽  
Vol 19 (01) ◽  
pp. 105-127 ◽  
Author(s):  
ANDREW ADAMATZKY
Keyword(s):  
Foraging Behavior ◽  
Delaunay Triangulation ◽  
Spanning Tree ◽  
Physarum Polycephalum ◽  
Minimum Spanning Tree ◽  
Nearest Neighbour ◽  
Minimal Spanning Tree ◽  
Proximity Graphs ◽  
Relative Neighborhood Graph ◽  
Plasmodium Of Physarum Polycephalum

Plasmodium of Physarum polycephalum spans sources of nutrients and constructs varieties of protoplasmic networks during its foraging behavior. When the plasmodium is placed on a substrate populated with sources of nutrients, it spans the sources with protoplasmic network. The plasmodium optimizes the network to deliver efficiently the nutrients to all parts of its body. How exactly does the protoplasmic network unfold during the plasmodium's foraging behavior? What types of proximity graphs are approximated by the network? Does the plasmodium construct a minimal spanning tree first and then add additional protoplasmic veins to increase reliability and through-capacity of the network? We analyze a possibility that the plasmodium constructs a series of proximity graphs: nearest-neighbour graph (NNG), minimum spanning tree (MST), relative neighborhood graph (RNG), Gabriel graph (GG) and Delaunay triangulation (DT). The graphs can be arranged in the inclusion hierarchy (Toussaint hierarchy): NNG ⊆ MST ⊆ RNG ⊆ GG ⊆ DT . We aim to verify if graphs, where nodes are sources of nutrients and edges are protoplasmic tubes, appear in the development of the plasmodium in the order NNG → MST → RNG → GG → DT , corresponding to inclusion of the proximity graphs.

Sign in / Sign up

Export Citation Format

Share Document