scholarly journals Pengujian Optimalisasi Jaringan Kabel Fiber Optic Di Universitas Islam Indonesia Menggunakan Minimum Spanning Tree

2014 ◽  
Vol 3 (1) ◽  
pp. 49
Author(s):  
Muchammad Abrori ◽  
Najib Ubaidillah
Keyword(s):  
Spanning Tree ◽  
Fiber Optic ◽  
Minimum Spanning Tree ◽  
Computer Network ◽  
Star Topology ◽  
Cable Length ◽  
Cable Network ◽  
Cable Lines ◽  
The Cost

Universitas Islam Indonesia (UII) intergrated campus computer network built since 1995. Development of UII integrated campus computer network is using a star topology and fiber optic (FO) cable. Considering that the star topology is the topology that requires a lot of wires, this study was conducted to determine and examine how the application of graph on the FO cable network UII integrated campus in order to minimize the cost, because FO cable network can be modeled by a graph where the buildings as points, while FO cable that connects to each building as a line. This type of research that is used here is a case study, in which data collection by observation, interviews, and documentation. This study used 4 algorithms, that is Kruskal algorithm, Prim, Boruvka and Solin algorithm to find the Minimum Spanning Tree. Based on the research that has been done, the conclution about the troubleshooting steps of optimization UII integrated campus FO cable network based graph theory has been got. From the four algorithms obtained the most optimal results FO cable length 4.700 meters long and is 1.590 meters cable lines. While the results of observations made, it is known that the existing computer network in UII integrated campus has a cable length of 6.120 meters and 2.050 meters long track. The results of the analysis showed that the resulrs of the study 23.2% more optimal than the existing computer networks in UII integrated campus.

scholarly journals Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning

2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan
Keyword(s):  
Trajectory Planning ◽  
Spanning Tree ◽  
Fiber Optic ◽  
Minimum Spanning Tree ◽  
Excess Cost ◽  
Fiber Optic Cable ◽  
The Cost

The transition of copper cable technology to fiber optic is very triggering the development of technology where data can be transmitted quickly and accurately. This cable change can be seen everywhere. This cable is an expensive cable. If it is not installed optimally, it will cost enormously. This excess cost can be used to other things to support performance rather than for excess cable that should be minimized. Determining how much cable use at the time of installation is difficult if done manually. Prim's algorithm can optimize by calculating the minimum spanning tree on branches used for fiber optic cable installation. This algorithm can be used to shorten the time to a destination by making all the points interconnected according to the points listed. Use of this method helps save the cost of fiber optic construction.

Designing a Computer Network in Building a Smart School with Case Study of SMA Negeri 1 Kediri

2020 ◽  
Vol 8 (2) ◽  
pp. 177
Author(s):  
Ni Putu Ega Meiliana Wijaya ◽  
I Komang Ari Mogi
Keyword(s):  
Educational Technology ◽  
Teaching And Learning ◽  
Computer Network ◽  
Integrated System ◽  
Network Development ◽  
Top Down ◽  
Star Topology ◽  
Use Of Technology ◽  
School Concept

Smart school is a technology-based school concept used in the teaching and learning process in the classroom. The use of educational technology includes an integrated system that assists the educational community in carrying out their respective functions with the aim of developing the potential of students. The use of technology in the field of education is expected to help and facilitate students and schools in conducting learning so that technology is able to facilitate and solve problems in learning. In building smart schools, it is also necessary to design technology developed in technology. The concept of network development that will be used is to use the Top-Down method and the topology used is to use ring topology and star topology. With the development of smart schools, it is expected that education using technology will continue to develop.

scholarly journals Algorithms for the power-p Steiner tree problem in the Euclidean plane

2018 ◽  
Vol 25 (4) ◽  
pp. 28
Author(s):  
Christina Burt ◽  
Alysson Costa ◽  
Charl Ras
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Valid Inequalities ◽  
Minimum Cost ◽  
Performance Ratio ◽  
Mixed Integer ◽  
Steiner Tree Problem ◽  
Steiner Points ◽  
Tree Construction ◽  
The Cost

We study the problem of constructing minimum power-$p$ Euclidean $k$-Steiner trees in the plane. The problem is to find a tree of minimum cost spanning a set of given terminals where, as opposed to the minimum spanning tree problem, at most $k$ additional nodes (Steiner points) may be introduced anywhere in the plane. The cost of an edge is its length to the power of $p$ (where $p\geq 1$), and the cost of a network is the sum of all edge costs. We propose two heuristics: a ``beaded" minimum spanning tree heuristic; and a heuristic which alternates between minimum spanning tree construction and a local fixed topology minimisation procedure for locating the Steiner points. We show that the performance ratio $\kappa$ of the beaded-MST heuristic satisfies $\sqrt{3}^{p-1}(1+2^{1-p})\leq \kappa\leq 3(2^{p-1})$. We then provide two mixed-integer nonlinear programming formulations for the problem, and extend several important geometric properties into valid inequalities. Finally, we combine the valid inequalities with warm-starting and preprocessing to obtain computational improvements for the $p=2$ case.

A Low Cost MST-FSM Obfuscation Method for Hardware IP Protection

2020 ◽  
Vol 29 (13) ◽  
pp. 2050208
Author(s):  
Yuejun Zhang ◽  
Zhao Pan ◽  
Pengjun Wang ◽  
Xiaowei Zhang
Keyword(s):  
Integrated Circuit ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Hamming Distance ◽  
Low Cost ◽  
The Arts ◽  
Finite State ◽  
Ip Cores ◽  
Building Program ◽  
The Cost

Effective resistance to intellectual property (IP) piracy, overproduction and reverse engineering are becoming more and more necessary in the integrated circuit (IC) supply chain. To protect the hardware, the obfuscation methodology hides the original function by adding a large number of redundant states. However, existing hardware obfuscation approaches have hardware overhead and efficiency of obfuscation limitations. This paper proposed a novel methodology for IP security using the minimum spanning tree finite state machine (MST-FSM) obfuscation. In the minimum spanning tree (MST) algorithm, the Hamming distance defines the cost of obfuscated states. The Kruskal algorithm optimizes the connection relationship of obfuscated states by computing the Hamming distance of the MST-FSM. The proposed MST-FSM is automatically generated and embedded in the hardware IP with the self-building program. Finally, the MST-FSM is applied on the itc99 benchmark circuits and encryption standard IP cores. Compared with other state-of-the-arts, the obfuscation potency is improved by 3.57%, and the average hardware cost is decreased by about 6.01%.

scholarly journals MINIMUM SPANNING TREE PADA JARINGAN FIBER OPTIC DI UNIVERSITAS TANJUNGPURA

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Neno Juli Triami, Yundari, Fransiskus Fran
Keyword(s):  
Spanning Tree ◽  
Fiber Optic ◽  
Minimum Spanning Tree

Jaringan fiber optic merupakan suatu jaringan kabel yang dapat mentransmisikan sinyal cahaya dari suatu lokasi ke lokasi lainnya dengan kecepatan tinggi. Dibandingkan dengan kabel lainnya, kabel fiber optic ini cenderung lebih tahan lama, lebih cepat dalam mengirim sinyal cahaya. Namun demikian, harganya relatif lebih mahal dari kabel yang lainnya. Oleh karena itu diperlukan cara untuk meminimalisir jaringan pada jaringan fiber optic, salah satu caranya dapat menggunakan minimum spanning tree. Pada saat ini, di Universitas Tanjungpura sudah menggunakan jaringan fiber optic untuk akses internet dari satu unit ke unit yang lainnya. Dalam penelitian ini dibahas mengenai penerapan beberapa algoritma sebagai alternatif untuk mendapatkan MST pada jaringan fiber optic di Universitas Tanjungpura. Hasil penelitian menunjukkan jika menggunakan algoritma Kruskal, algoritma Prim, dan algoritma Sollin diperoleh  panjang jaringan kabel yaitu 4310 meter sedangkan sebelum menggunakan MST diperoleh panjang kabel sebesar 8765 meter. Selanjutnya, untuk jaringan fiber optic yang terbentuk dari algoritma Kruskal dan algoritma Prim menghasilkan jaringan yang sama, namun untuk algoritma Sollin berbeda. Perbedaannya terletak pada akses dari Fakultas Hukum ke Rumah Sakit Untan dan dari Fakultas Ekonomi dan Bisnis ke Fakultas Kedokteran. Kata Kunci : algoritma Kruskal, algoritma Prim, algoritma Sollin

scholarly journals Understanding the Shift of Correlation Structure in Major Currency Exchange Rate

2014 ◽  
Vol 8 (3) ◽  
Author(s):  
Nur Syahidah Yusoff ◽  
Maman Abdurachman Djauhari
Keyword(s):  
Complex System ◽  
Exchange Rate ◽  
Financial Market ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Correlation Structure ◽  
High Dimensional ◽  
Currency Exchange ◽  
Currency Exchange Rate

In this paper, we study the high dimensional correlation structure of financial market. Correlation structure can be considered as a complex system that relates each variable to the others in terms of correlation. To analyze such complex system, minimum spanning tree is constructed to simplify the network. A case study will be presented and a conclusion will be highlighted.

scholarly journals Dynamic Shapley Value in the Game with Perishable Goods

2021 ◽  
Vol 14 ◽  
pp. 273-289
Author(s):  
Li Yin ◽  
◽  
Ovanes Petrosian ◽  
Zou Jinying ◽  
◽  
...  
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Time Consistency ◽  
Characteristic Functions ◽  
Cooperative Behaviour ◽  
Second Stage ◽  
Perishable Goods ◽  
Shapley Values ◽  
The Cost ◽  
Tree Games

The paper investigates two-stage stochastic minimum spanning tree games with perishable goods. The cooperative behaviour of the players is defined. At each stage, all players jointly take action to construct a network with a cost matrix. At the second stage, a particular player may leave the game, and the probability of this leaving depends on the cooperative behaviour of all players at the first stage. At each stage game, the total cost of the spanning tree is calculated to include the sum of the costs of the contained edges and the cost of the loss of perishable goods expended on that edge of the spanning tree. The characteristic functions in the game are considered, and the dynamic Shapley values are modified. The time consistency of the dynamic Shapley values is studied.

scholarly journals The Lower Tail of the Random Minimum Spanning Tree

10.37236/1004 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Abraham D. Flaxman
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Large Deviation ◽  
Random Variable ◽  
Independent Random Variables ◽  
Large Deviation Probability ◽  
Deviation Probability ◽  
Lower Tail ◽  
The Subject ◽  
The Cost

Consider a complete graph $K_n$ where the edges have costs given by independent random variables, each distributed uniformly between 0 and 1. The cost of the minimum spanning tree in this graph is a random variable which has been the subject of much study. This note considers the large deviation probability of this random variable. Previous work has shown that the log-probability of deviation by $\varepsilon$ is $-\Omega(n)$, and that for the log-probability of $Z$ exceeding $\zeta(3)$ this bound is correct; $\log {\rm Pr}[Z \geq \zeta(3) + \varepsilon] = -\Theta(n)$. The purpose of this note is to provide a simple proof that the scaling of the lower tail is also linear, $\log {\rm Pr}[Z \leq \zeta(3) - \varepsilon] = -\Theta(n)$.

scholarly journals A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms

2017 ◽  
Vol 1 (1) ◽  
pp. 58
Author(s):  
Badri Munier ◽  
Muhammad Aleem ◽  
Muhammad Arshad Islam ◽  
Muhammad Azhar Iqbal ◽  
Waqar Mehmood
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Computer Network ◽  
Parallel Implementation ◽  
Network Routing ◽  
Civil Infrastructure ◽  
Computing Power ◽  
Processor Architectures ◽  
And Cluster Analysis ◽  
Application Developers

In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the computing power of multi-core machines. Computer network routing, civil infrastructure planning and cluster analysis are typically use-cases of spanning tree problem. The experimental results show that the proposed algorithm is scalable for different machine and graph sizes. The methodology is simple and can easily be implemented using different shared-memory parallel programming models.

Sign in / Sign up

Export Citation Format

Share Document