spanning tree
Recently Published Documents


TOTAL DOCUMENTS

2902
(FIVE YEARS 471)

H-INDEX

63
(FIVE YEARS 6)

2022 ◽  
Vol 12 (2) ◽  
pp. 738
Author(s):  
Revital Marbel ◽  
Roi Yozevitch ◽  
Tal Grinshpoun ◽  
Boaz Ben-Moshe

Satellite network optimization is essential, particularly since the cost of manufacturing, launching and maintaining each satellite is significant. Moreover, classical communication optimization methods, such as Minimal Spanning Tree, cannot be applied directly in dynamic scenarios where the satellite constellation is constantly changing. Motivated by the rapid growth of the Star-Link constellation that, as of Q4 2021, consists of over 1600 operational LEO satellites with thousands more expected in the coming years, this paper focuses on the problem of constructing an optimal inter-satellite (laser) communication network. More formally, given a large set of LEO satellites, each equipped with a fixed number of laser links, we direct each laser module on each satellite such that the underlying laser network will be optimal with respect to a given objective function and communication demand. In this work, we present a novel heuristic to create an optimal dynamic optical network communication using an Ant Colony algorithm. This method takes into account both the time it takes to establish an optical link (acquisition time) and the bounded number of communication links, as each satellite has a fixed amount of optical communication modules installed. Based on a large number of simulations, we conclude that, although the underlying problem of bounded-degree-spanning-tree is NP-hard (even for static cases), the suggested ant-colony heuristic is able to compute cost-efficient solutions in semi-real-time.


Author(s):  
Julio R. Fernández ◽  
Inés Gallego ◽  
Andrés Jiménez-Losada ◽  
Manuel Ordóñez

AbstractCost-allocation problems in a fixed network are concerned with distributing the costs for use by a group of clients who cooperate in order to reduce such costs. We work only with tree networks and we assume that a minimum cost spanning tree network has already been constructed and now we are interested in the maintenance costs. The classic problem supposes that each agent stays for the entire time in the same node of the network. This paper introduces cost-allocation problems in a fixed-tree network with a set of agents whose activity over the nodes is fuzzy. Agent’s needs to pay for each period of time may differ. Moreover, the agents do not always remain in the same node for each period. We propose the extension of a very well-known solution for these problems: Bird’s rule.


Symmetry ◽  
2022 ◽  
Vol 14 (1) ◽  
pp. 106
Author(s):  
Saibal Majumder ◽  
Partha Sarathi Barma ◽  
Arindam Biswas ◽  
Pradip Banerjee ◽  
Bijoy Kumar Mandal ◽  
...  

Minimum spanning tree problem (MSTP) has allured many researchers and practitioners due to its varied range of applications in real world scenarios. Modelling these applications involves the incorporation of indeterminate phenomena based on their subjective estimations. Such phenomena can be represented rationally using uncertainty theory. Being a more realistic variant of MSTP, in this article, based on the principles of the uncertainty theory, we have studied a multi-objective minimum spanning tree problem (MMSTP) with indeterminate problem parameters. Subsequently, two uncertain programming models of the proposed uncertain multi-objective minimum spanning tree problem (UMMSTP) are developed and their corresponding crisp equivalence models are investigated, and eventually solved using a classical multi-objective solution technique, the epsilon-constraint method. Additionally, two multi-objective evolutionary algorithms (MOEAs), non-dominated sorting genetic algorithm II (NSGAII) and duplicate elimination non-dominated sorting evolutionary algorithm (DENSEA) are also employed as solution methodologies. With the help of the proposed UMMSTP models, the practical problem of optimizing the distribution of petroleum products was solved, consisting in the search for symmetry (balance) between the transportation cost and the transportation time. Thereafter, the performance of the MOEAs is analyzed on five randomly developed instances of the proposed problem.


2022 ◽  
pp. 1-33
Author(s):  
Sercan Demirci ◽  
Serhat Celil Ileri ◽  
Sadat Duraki

Theoretical applications and practical network algorithms are not very cost-effective, and most of the algorithms in the commercial market are implemented in the cutting-edge devices. Open-source network simulators have gained importance in recent years due to the necessity to implement network algorithms in more realistic scenarios with reasonable costs, especially for educational purposes and scientific researches. Although there have been various simulation tools, NS2 and NS3, OMNeT++ is more suitable to demonstrate network algorithms because it is convenient for the model establishment, modularization, expandability, etc. OMNeT++ network simulator is selected as a testbed in order to verify the correctness of the network algorithms. The study focuses on the algorithms based on centralized and distributed approaches for multi-hop networks in OMNeT++. Two network algorithms, the shortest path algorithm and flooding-based asynchronous spanning tree algorithm, were examined in OMNeT++. The implementation, analysis, and visualization of these algorithms have also been addressed.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Ruo-Hai Di ◽  
Ye Li ◽  
Ting-Peng Li ◽  
Lian-Dong Wang ◽  
Peng Wang

Dynamic programming is difficult to apply to large-scale Bayesian network structure learning. In view of this, this article proposes a BN structure learning algorithm based on dynamic programming, which integrates improved MMPC (maximum-minimum parents and children) and MWST (maximum weight spanning tree). First, we use the maximum weight spanning tree to obtain the maximum number of parent nodes of the network node. Second, the MMPC algorithm is improved by the symmetric relationship to reduce false-positive nodes and obtain the set of candidate parent-child nodes. Finally, with the maximum number of parent nodes and the set of candidate parent nodes as constraints, we prune the parent graph of dynamic programming to reduce the number of scoring calculations and the complexity of the algorithm. Experiments have proved that when an appropriate significance level α is selected, the MMPCDP algorithm can greatly reduce the number of scoring calculations and running time while ensuring its accuracy.


2021 ◽  
pp. 567-574
Author(s):  
S. Suguna Devi ◽  
A. Bhuvaneswari

Internet of Vehicles (IoV) is one of the developing models in the Vehicular adhoc networks (VANETs) with the vast improvement of communication technologies. In order to improve data transmission among the multiple communities without link breakage, a novel Trilateral Location Identified Maximum Weighted Directive Spanning Tree (TLIMWDST) technique is introduced. The proposed TLIMWDST technique consists of two major phases, namely location identification and optimal path identification to improve the reliability of data transmission from source vehicle to destination vehicle. In the first phase, the location of the neighboring vehicles is identified by applying a trilateration technique.  After the location identification, an optimal route path between the source and destination is identified using Maximum Weighted Directive Spanning Tree (MWDST) through the intermediate nodes. The performance of the TLIMWDST technique is assessed through simulation  as compared to the previous path selection techniques in terms of different routing metrics such as packet delivery ratio, packet loss rate, end-to-end delay and throughput with respect to the number of data packets.  


2021 ◽  
Vol 7 (2) ◽  
pp. 77-85
Author(s):  
Muhammad Syihabuddin ◽  
Jenih Jenih

Spanning Tree protocol atau yang sering disingkat dengan STP adalah metode pada jaringan yang menjamin tidak adanya loop dalam jaringan. Dengan model jaringan OSI untuk jaringan komputer, STP ada di layer 2 OSI. Spanning tree protocol memperbolehkan desain jaringan memiliki redundant link untuk membuat jalur backup otomatis. Dengan menggunakan metode spanning tree protocol maka apabila perangkat switch cisco catalyst tersebut down maka akan berimbas pada jaringan tersebut karena sudah ada backup link. Apabila main link down atau terputus, maka port yang tadi terblok akan terbuka oleh switch, sehingga data dari komputer pengirim akan melewati redundant.Kata Kunci: Jaringan, Komputer, Spanning


2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Manuel Aprile ◽  
Samuel Fiorini ◽  
Tony Huynh ◽  
Gwenaël Joret ◽  
David R. Wood

Let $G$ be a connected $n$-vertex graph in a proper minor-closed class $\mathcal G$. We prove that the extension complexity of the spanning tree polytope of $G$ is $O(n^{3/2})$. This improves on the $O(n^2)$ bounds following from the work of Wong (1980) and Martin (1991). It also extends a result of Fiorini, Huynh, Joret, and Pashkovich (2017), who obtained a $O(n^{3/2})$ bound for graphs embedded in a fixed surface. Our proof works more generally for all graph classes admitting strongly sublinear balanced separators: We prove that for every constant $\beta$ with $0<\beta<1$, if $\mathcal G$ is a graph class closed under induced subgraphs such that all $n$-vertex graphs in $\mathcal G$ have balanced separators of size $O(n^\beta)$, then the extension complexity of the spanning tree polytope of every connected $n$-vertex graph in $\mathcal{G}$ is $O(n^{1+\beta})$. We in fact give two proofs of this result, one is a direct construction of the extended formulation, the other is via communication protocols. Using the latter approach we also give a short proof of the $O(n)$ bound for planar graphs due to Williams (2002).


Sign in / Sign up

Export Citation Format

Share Document