Einloggen

Thematische Bibliographien / Multiple Spanning Tree Protocol / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Multiple Spanning Tree Protocol.

Zeitschriftenartikel zum Thema „Multiple Spanning Tree Protocol“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 17. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Multiple Spanning Tree Protocol" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Seo, Seok Weon, Seong Mun Kim und Sung Gi Min. „Extensible Multiple Spanning Tree Protocol for Virtual eXtensible LAN“. International Journal of Computer and Communication Engineering 5, Nr. 2 (2016): 120–29. http://dx.doi.org/10.17706/ijcce.2016.5.2.120-129.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Tang, Jun Yong, und Hai Yan Hao. „An Optimizing Strategy of Load Balancing Based on MSTP“. Advanced Materials Research 490-495 (März 2012): 2221–25. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.2221.

Der volle Inhalt der Quelle

Annotation:

With Multiple Spanning Tree Protocol (MSTP) defined in IEEE802.1s, the Common Spanning Tree (CST) and additional Spanning Trees could be configured to take on load balancing in switch networks. For achieving balance distribution in traffic flows, we proposed an optimizing strategy to determine the MSTP parameters configuration in single regions. The strategy optimizes load balancing and shows its efficiency through computational results of instances. We compared the MSTP solutions in various flow load instances, and the result shows that the optimizing strategy takes an efficient load balancing when traffic flows are mainly between switches belonging to the same region.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Fortz, Bernard, Luís Gouveia und Martim Joyce-Moniz. „Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol“. Discrete Applied Mathematics 234 (Januar 2018): 114–30. http://dx.doi.org/10.1016/j.dam.2016.07.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Wang, Jian-Yong, Zhen Tian, Xu Zhu und Naif D. Alotaibi. „Finite-Time Consensus with a Time-Varying Reference State and Switching Topology“. Complexity 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/6038584.

Der volle Inhalt der Quelle

Annotation:

The finite-time consensus problem in the networks of multiple mobile agents is comprehensively investigated. In order to resolve this problem, a novel nonlinear information exchange protocol is proposed. The proposed protocol ensures that the states of the agents are converged to a weighted-average consensus in finite time if the communication topology is a weighted directed graph with a spanning tree and each strongly connected component is detail-balanced. Furthermore, the proposed protocol is also able to solve the finite-time consensus problem of networks with a switching topology. Finally, computer simulations are presented to demonstrate and validate the effectiveness of the theoretical analysis under the proposed protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Jin, Rencheng, Xiaolei Fan und Ting Sun. „Centralized Multi-Hop Routing Based on Multi-Start Minimum Spanning Forest Algorithm in the Wireless Sensor Networks“. Sensors 21, Nr. 5 (04.03.2021): 1775. http://dx.doi.org/10.3390/s21051775.

Der volle Inhalt der Quelle

Annotation:

Wireless sensor networks (WSNs) are widely applied in environmental monitoring, target tracking, military, and industrial fields. However, the battery energy of sensor nodes in WSNs is limited, which limits its development. Previous studies have shown that clustering protocols and multi-hop communication are beneficial to reduce nodes energy consumption. The multi-hop protocol based on low energy adaptive clustering hierarchy (LEACH) has been proven to significantly reduce energy dissipation. However, LEACH-based multi-hop protocols generally have the problem of unbalanced energy dissipation and data conflicts. In this paper, we propose a centralized multi-hop routing based on multi-start minimum spanning forest (LEACH-CMF) to optimize LEACH. In order to realize multi-hop communication, we introduced a multi-start minimum spanning tree algorithm to select relay nodes with the minimum relay cost and generate appropriate multi-hop paths. To avoid data collision in multi-hop communication and make nodes including the cluster heads sleep as much as possible in the non-working state, we design a bottom-up continuous time slot allocation method to improve the time division multiple access (TDMA) cycle. We performed simulation in NS2. The simulation results show that the network lifetime is approximately doubled compared to LEACH and centralized low energy adaptive clustering hierarchy (LEACH-C). The simulation results show that the proposed protocol can effectively balance the energy dissipation of nodes and prolong network lifetime.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Wang, Ling Xiu, und Ye Wen Cao. „Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks“. Advanced Materials Research 204-210 (Februar 2011): 1399–402. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1399.

Der volle Inhalt der Quelle

Annotation:

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Wei, Xiaoqian, und Jianying Yang. „Finite time simultaneous attack for a maneuvering target with unknown acceleration“. Transactions of the Institute of Measurement and Control 41, Nr. 7 (17.10.2018): 1849–60. http://dx.doi.org/10.1177/0142331218788119.

Der volle Inhalt der Quelle

Annotation:

This paper investigates the finite time simultaneous attack problem for a maneuvering target with unknown acceleration when the multiple attackers move slower than the target at the initial stage under a communication network having a spanning tree. Attackers can reach agreement before the precise strike when the upper bound on time to consensus is calculated beforehand. The unknown acceleration of the target can be estimated by a disturbance observer, and a cooperation protocol is designed to decrease chattering. Numerical simulations with comparisons demonstrate the effectiveness and the superiority of the proposed method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Chelik, Mourad, und Rachid Beghdad. „Proposed method: mean delays synchronization protocol (MDSP) for wireless sensor networks“. International Journal of Pervasive Computing and Communications 16, Nr. 1 (24.01.2020): 74–100. http://dx.doi.org/10.1108/ijpcc-03-2019-0013.

Der volle Inhalt der Quelle

Annotation:

Purpose Many synchronization approaches are based on low-level time capturing, causing a tight integration with the Media Access Control (MAC) layer. Alternatively, this study aims to present a hybrid approach combining both receiver–receiver and sender–receiver schemes to reduce the variation of two-way message exchange durations, in heavy-load networks. To achieve network-wide synchronization, a variant of Prim’s algorithm (Cormen et al., 2009) is used to build a spanning tree, guaranteeing the minimum number of ancestors and limited error propagation. The simulation results show that the proposed approach is very competitive with a set of the most-cited synchronization protocols. In addition, a new synchronization simulator SynSim was developed using C++ language Design/methodology/approach To achieve network-wide synchronization, a variant of Prim's algorithm (Cormen et al., 2009) is used to build a spanning tree, guaranteeing the minimum number of ancestors and limited error propagation. Findings Simulation results show that the proposed approach is very competitive with a set of the most-cited synchronization protocols. In addition, a new synchronization simulator SynSim was developed using in C++ language. Research limitations/implications It can be concluded from the experiments that MDSP is suitable for WSNs especially if MAC layer timestamping is not possible. So, the mean delays synchronization protocol (MSDP) is suitable to achieve time synchronization in single-hop and multi-hop networks without the MAC layer timestamping in large wireless sensor network (WSN) deployments. Practical implications A future enhancement of MDSP could be switching between the traditional timestamping and the new proposed timestamping based on a given threshold, which is the number of nodes in the neighborhood and the load of the network. It will be also interesting to test it in a prototype. The proposed solution can be used in practice to implement the Time-division multiple access (TDMA) protocol in a WSN. In addition, the proposed simulator can be used in a computer network synchronization protocols course. Originality/value To the best of authors’ knowledge, this study’s contribution is original. In addition, the authors implemented a new synchronization simulator

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Huang, Mingyang, Chenglin Liu und Liang Shan. „Containment Control of First-Order Multi-Agent Systems under PI Coordination Protocol“. Algorithms 14, Nr. 7 (14.07.2021): 209. http://dx.doi.org/10.3390/a14070209.

Der volle Inhalt der Quelle

Annotation:

This paper investigates the containment control problem of discrete-time first-order multi-agent system composed of multiple leaders and followers, and we propose a proportional-integral (PI) coordination control protocol. Assume that each follower has a directed path to one leader, and we consider several cases according to different topologies composed of the followers. Under the general directed topology that has a spanning tree, the frequency-domain analysis method is used to obtain the sufficient convergence condition for the followers achieving the containment-rendezvous that all the followers reach an agreement value in the convex hull formed by the leaders. Specially, a less conservative sufficient condition is obtained for the followers under symmetric and connected topology. Furthermore, it is proved that our proposed protocol drives the followers with unconnected topology to converge to the convex hull of the leaders. Numerical examples show the correctness of the theoretical results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Stachowiak, Krzysztof, Tytus Pawlak und Maciej Piechowiak. „Performance Evaluation of Multicast Overlay Routing Protocols“. Image Processing & Communications 17, Nr. 1-2 (01.12.2012): 19–31. http://dx.doi.org/10.2478/v10248-012-0012-4.

Der volle Inhalt der Quelle

Annotation:

Abstract For almost three decades the multicast communication has been a subject of a dynamic research. It came to the world of the packet switching networks rather late and still has not become a fist class citizen of the Internet, yet the demand for such services is growing and thus the relevant technologies evolve persistently providing increasing quality and availability of the means of the group communication. The overlay approach to the multicast is an application layer realization which came to life due to certain deficiencies at the lower layers. In general the gain from using multicast for group communication instead of duplicated unicast links is that we avoid sending the same data many times through a single link. Such gain may be achieved wit the use of the router level mulitcast solution. The overlay solutions tend to approach his level of efficiency with a different degree of success. Therefore one of the main characteristics that is interesting when evaluating a particular overlay protocol is how well does it achieve the aforementioned gain. There are several metrics that allow for objective comparison of protocols in this regard. However this is not the only point of view to provide a valuable evaluation of the multicast overlay solutions. One of the important aspects of the modern group communication such as the IPTV or teleconferencing is the dynamic nature of the users’ participation. A particular group may be joined and left by multiple users at a very frequent rate which is critical to the resources management as well as to maintaining the integrity of the abstract communication structure, e.g. a tree spanning all the participants. In such case two major classes of the evaluation criteria emerge: the statical and the dynamical ones. They’re both very important and interdependent, however the means to measure them may differ significantly. In this article a wide variety of the multicast overlay protocols have been analysed and two of them have been chosen to be compared. The stress of the evaluation has been put on the dynamic aspects of the multicast overlay protocols operation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Grandoni, Fabrizio, Gaia Nicosia, Gianpaolo Oriolo und Laura Sanità. „Stable routing under the Spanning Tree Protocol“. Operations Research Letters 38, Nr. 5 (September 2010): 399–404. http://dx.doi.org/10.1016/j.orl.2010.05.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Singh, Gurdip, und Arthur J. Bernstein. „A highly asynchronous minimum spanning tree protocol“. Distributed Computing 8, Nr. 3 (März 1995): 151–61. http://dx.doi.org/10.1007/bf02242717.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Young, Carolyn A., Clive H. Bock, Nikki D. Charlton, Chakradhar Mattupalli, Nick Krom, Joanna K. Bowen, Matthew Templeton, Kim M. Plummer und Bruce W. Wood. „Evidence for Sexual Reproduction: Identification, Frequency, and Spatial Distribution of Venturia effusa (Pecan Scab) Mating Type Idiomorphs“. Phytopathology® 108, Nr. 7 (Juli 2018): 837–46. http://dx.doi.org/10.1094/phyto-07-17-0233-r.

Der volle Inhalt der Quelle

Annotation:

Venturia effusa (syn. Fusicladium effusum), causal agent of pecan scab, is the most prevalent pathogen of pecan (Carya illinoinensis), causing severe yield losses in the southeastern United States. V. effusa is currently known only by its asexual (conidial) stage. However, the degree and distribution of genetic diversity observed within and among populations of V. effusa are typical of a sexually reproducing fungal pathogen, and comparable with other dothideomycetes with a known sexual stage, including the closely related apple scab pathogen, V. inaequalis. Using the mating type (MAT) idiomorphs from V. inaequalis, we identified a single MAT gene, MAT1-1-1, in a draft genome of V. effusa. The MAT1-1-1 locus is flanked by two conserved genes encoding a DNA lyase (APN2) and a hypothetical protein. The MAT locus spanning the flanking genes was amplified and sequenced from a subset of 14 isolates, of which 7 contained MAT1-1-1 and the remaining samples contained MAT1-2-1. A multiplex polymerase chain reaction screen was developed to amplify MAT1-1-1, MAT1-2-1, and a conserved reference gene encoding β-tubulin, and used to screen 784 monoconidial isolates of V. effusa collected from 11 populations of pecan across the southeastern United States. A hierarchical sampling protocol representing region, orchard, and tree allowed for analysis of MAT structure at different spatial scales. Analysis of this collection revealed the frequency of the MAT idiomorphs is in a 1:1 equilibrium of MAT1-1:MAT1-2. The apparent equilibrium of the MAT idiomorphs provides impetus for a renewed effort to search for the sexual stage of V. effusa. [Formula: see text] Copyright © 2018 The Author(s). This is an open access article distributed under the CC BY-NC-ND 4.0 International license .

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Marchese, M., und M. Mongelli. „Simple protocol enhancements of Rapid Spanning Tree Protocol over ring topologies“. Computer Networks 56, Nr. 4 (März 2012): 1131–51. http://dx.doi.org/10.1016/j.comnet.2011.10.008.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Hamacher, Horst W., und Günter Ruhe. „On spanning tree problems with multiple objectives“. Annals of Operations Research 52, Nr. 4 (Dezember 1994): 209–30. http://dx.doi.org/10.1007/bf02032304.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Katayama, Yoshiaki, Toshiyuki Hasegawa und Naohisa Takahashi. „A superstabilizing spanning tree protocol for a link failure“. Systems and Computers in Japan 38, Nr. 14 (2007): 41–51. http://dx.doi.org/10.1002/scj.20656.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Smirnov, Alexander V. „The Spanning Tree of a Divisible Multiple Graph“. Modeling and Analysis of Information Systems 25, Nr. 4 (27.08.2018): 388–401. http://dx.doi.org/10.18255/1818-1015-2018-4-388-401.

Der volle Inhalt der Quelle

Annotation:

In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or k + 1 vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges, and it can be the common ending vertex to k linked edges of a multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of any other multi-edge. Special attention is paid to the class of divisible multiple graphs. The main peculiarity of them is a possibility to divide the graph into k parts, which are adjusted on the linked edges and which have no common edges. Each part is an ordinary graph. The definition of a multiple tree is stated and the basic properties of such trees are studied. Unlike ordinary trees, the number of edges in a multiple tree is not fixed. In the article, the evaluation of the minimum and maximum number of edges in the divisible tree is stated and proved. Next, the definitions of the spanning tree and the complete spanning tree of a multiple graph are given. The criterion of completeness of the spanning tree is proved for divisible graphs. It is also proved that a complete spanning tree exists in any divisible graph. If the multiple graph is weighted, the minimum spanning tree problem and the minimum complete spanning tree problem can be set. In the article, we suggest a heuristic algorithm for the minimum complete spanning tree problem for a divisible graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Smirnov, A. V. „The Spanning Tree of a Divisible Multiple Graph“. Automatic Control and Computer Sciences 52, Nr. 7 (Dezember 2018): 871–79. http://dx.doi.org/10.3103/s0146411618070325.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Smirnov, Alexander Valeryevich. „NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3“. Modeling and Analysis of Information Systems 28, Nr. 1 (24.03.2021): 22–37. http://dx.doi.org/10.18255/1818-1015-2021-1-22-37.

Der volle Inhalt der Quelle

Annotation:

In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k + 1) vertices correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of k linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. A multiple tree is a connected multiple graph with no cycles. Unlike ordinary trees, the number of edges in a multiple tree is not fixed. The problem of finding the spanning tree can be set for a multiple graph. Complete spanning trees form a special class of spanning trees of a multiple graph. Their peculiarity is that a multiple path joining any two selected vertices exists in the tree if and only if such a path exists in the initial graph. If the multiple graph is weighted, the minimum spanning tree problem and the minimum complete spanning tree problem can be set. Also we can formulate the problems of recognition of the spanning tree and complete spanning tree of the limited weight. The main result of this article is the proof of NPcompleteness of such recognition problems for arbitrary multiple graphs as well as for divisible multiple graphs in the case when multiplicity k ≥ 3. The corresponding optimization problems are NP-hard.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Bathla, Gaurav. „Minimum Spanning Tree based Protocol for Heterogeneous Wireless Sensor Networks“. i-manager’s Journal on Wireless Communication Networks 1, Nr. 4 (15.03.2013): 12–23. http://dx.doi.org/10.26634/jwcn.1.4.2189.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Uppal, Ankush, und Ramanjot Kaur. „To Find Energy Efficient Protocol by using Minimum Spanning Tree“. International Journal of Computer Applications 178, Nr. 33 (17.07.2019): 6–11. http://dx.doi.org/10.5120/ijca2019919199.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Takashima, I., und M. Ikezaki. „An expanded spanning-tree protocol for home-oriented network management“. IEEE Transactions on Consumer Electronics 37, Nr. 3 (1991): 379–87. http://dx.doi.org/10.1109/30.85540.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Lai, Yingxu, Zenghui Liu, Qiuyue Pan und Jing Liu. „Study on Cloud Security Based on Trust Spanning Tree Protocol“. International Journal of Theoretical Physics 54, Nr. 9 (25.02.2015): 3311–30. http://dx.doi.org/10.1007/s10773-015-2571-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Huynh, Minh, Prasant Mohapatra und Stuart Goose. „Spanning tree elevation protocol: Enhancing metro Ethernet performance and QoS“. Computer Communications 32, Nr. 4 (März 2009): 750–65. http://dx.doi.org/10.1016/j.comcom.2008.12.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Elkin, Michael. „A faster distributed protocol for constructing a minimum spanning tree“. Journal of Computer and System Sciences 72, Nr. 8 (Dezember 2006): 1282–308. http://dx.doi.org/10.1016/j.jcss.2006.07.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Shaik, Faizaan, Srikanth Bezawada und Neena Goveas. „CySpanningTree: Minimal Spanning Tree computation in Cytoscape“. F1000Research 4 (05.08.2015): 476. http://dx.doi.org/10.12688/f1000research.6797.1.

Der volle Inhalt der Quelle

Annotation:

Simulating graph models for real world networks is made easy using software tools like Cytoscape. In this paper, we present the open-source CySpanningTree app for Cytoscape that creates a minimal/maximal spanning tree network for a given Cytoscape network. CySpanningTree provides two historical ways for calculating a spanning tree: Prim’s and Kruskal’s algorithms. Minimal spanning tree discovery in a given graph is a fundamental problem with diverse applications like spanning tree network optimization protocol, cost effective design of various kinds of networks, approximation algorithm for some NP-hard problems, cluster analysis, reducing data storage in sequencing amino acids in a protein, etc. This article demonstrates the procedure for extraction of a spanning tree from complex data sets like gene expression data and world network. The article also provides an approximate solution to the traveling salesman problem with minimum spanning tree heuristic. CySpanningTree for Cytoscape 3 is available from the Cytoscape app store.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Subli, Moh, Hoiriyah und Erfan Wahyudi. „PENERAPAN SPANNING TREE PROTOCOL UNTUK MENCEGAH TERJADINYA LOOPING PADA FRAME ETHERNET“. EXPLORE 10, Nr. 1 (10.04.2020): 7. http://dx.doi.org/10.35200/explore.v10i1.358.

Der volle Inhalt der Quelle

Annotation:

Spanning Tree Protocol (STP) adalah layanan yang memungkinkan LAN switch dan LAN bridge terinterkoneksi secara berlebih dengan cara menyediakan mekanisme untuk mencegah loop yang tidak diinginkan dalam jaringan yang terjadi pada bridge. Tanpa adanya STP, pada frame Ethernet akan terjadi loop untuk periode tak terbatas di dalam waktu jaringan dengan link berlebihan secara fisik. Untuk mencegah loop pada frame Ethernet, STP memblok beberapa port dari frame Ethernet sehingga hanya satu jalur yang aktif ada di antara setiap pasang segmen LAN (collision domain). Hasil STP adalah loop frame Ethernet tidak terbatas yang membuat LAN dapat digunakan. Satu hal yang perlu diperhatikan adalah bahwa Redundant link tidak untuk keseimbangan beban, karena hanya satu link aktif. Cara kerja Spanning Tree Protocol adalah menggunakan algoritma spanning tree yang secara otomatis menemukan topologi jaringan dan membentuk suatu jaringan tunggal yang optimal melalui suatu bridge jaringan dengan menugasi fungsi-fungsi yang ada pada setiap bridge. STP Menghentikan terjadinya loo-loop network pada network layer 2 (bridge atau switch). STP secara terus menerus memonitor network untuk menemukan semua link, memastikan bahwa tidak ada loop yang terjadi dengan cara mematikan semua link yang redundant. STP menggunakan algoritma yang disebut Spanning Tree Algorithm (STA) untuk menciptakan sebuah topologi database, kemudian mencari dan menghancurkan link-link redundant. Dengan menjalankan STP, frame-frame hanya akan diteruskan pada link-link utama yang dipilih oleh STP.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Mayliana, Mayliana. „Optimasi Jaringan dengan Spanning Tree untuk Congestion Management“. ComTech: Computer, Mathematics and Engineering Applications 5, Nr. 1 (30.06.2014): 53. http://dx.doi.org/10.21512/comtech.v5i1.2582.

Der volle Inhalt der Quelle

Annotation:

A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized. Spanning tree is one of the algorithms that can be used. The purpose of the Spanning tree is to prevent and reduce the loops in the network by negotiating free path and as well as to increase network uptime through redundancy (back-up). To comprehend spanning tree, the first important thing to know is how bridges and switches perform their functions. The more switches used, the use of the spanning tree becomes more important. With the spanning tree protocol, a broadcast storm can be prevented that can achieved network optimization.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

FARLEY, ARTHUR M., PARASKEVI FRAGOPOULOU, DAVID KRUMME, ANDRZEJ PROSKUROWSKI und DANA RICHARDS. „MULTI-SOURCE SPANNING TREE PROBLEMS“. Journal of Interconnection Networks 01, Nr. 01 (März 2000): 61–71. http://dx.doi.org/10.1142/s0219265900000056.

Der volle Inhalt der Quelle

Annotation:

We consider a model of multicast communication in a network whereby multiple sources have messages to disseminate among all sites of a network. We propose that the messages from all sources are disseminated along the same spanning tree of the network and consider the problem of constructing an optimal such tree. One measure for suitability of the construction is the sum of distances from all sources to all other vertices. We show that finding the exact solution in this case in [Formula: see text]-hard (in the strong sense). We then investigate solutions for some restricted classes of graphs and give efficient algorithms for those. We also consider an alternative measure of goodness for the spanning tree, being the maximum eccentricity of a source. We show that the problem of finding such a minimum eccentricity spanning tree is somewhat easier to solve and give a pseudo-polynomial solution algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Chen, Wei, Qiang Yu, Peng Fei Yu, Jie Ren und Zhi Huang. „Research of Ethernet Ring Protection Technology“. Applied Mechanics and Materials 556-562 (Mai 2014): 6026–29. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6026.

Der volle Inhalt der Quelle

Annotation:

Ethernet ring networks are used widely recently, and the research on the ring protection switching is carried out. Spanning Tree Protocol (STP) was the first technology to control ring networks to avoid the storm. Rapid Spanning Tree Protocol (RSTP) is an upgraded version of STP[1]. RSTP can provide shorter convergence time than STP. Ethernet Automatic Protection switching (EAPS) is designed for a single ring topology [2]. The convergence time of EAPS is below 50ms and EAPS can meet the real-time requirements and high-reliability requirements of network services.G.8032 is a standardized scheme for achieving sub-50ms service protection in ring topologies which is recommended by ITU-T[3]. This paper intelligent Ethernet ring protection technologes about Spanning Tree Protocol, RFC3619 and G.8032 .These technologies appear in different times, and have their advantages and disadvantages. This article outlines these Ethernet ring protection switching technology and explains their basal principles.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Peng Hai-Xia, Zhao Hai, Li Da-Zhou und Lin Chuan. „Data fusaggregation algorithm based on dynamic minimal spanning tree routing protocol“. Acta Physica Sinica 63, Nr. 9 (2014): 090206. http://dx.doi.org/10.7498/aps.63.090206.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Jayapal, Cynthia, Senthil Jayavel und Vanitha V. „Enhancing the Performance of Service Discovery Protocol Using Minimum Spanning Tree“. International Journal of Mobile Communications 18, Nr. 1 (2020): 1. http://dx.doi.org/10.1504/ijmc.2020.10023330.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Jayapal, Cynthia, Senthil Jayavel und V. Vanitha. „Enhancing the performance of service discovery protocol using minimum spanning tree“. International Journal of Mobile Communications 18, Nr. 4 (2020): 443. http://dx.doi.org/10.1504/ijmc.2020.108307.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Patil, Priyanka, und M. A. Rizvi. „Improved and Energy Efficient Olsr Protocol Using Spanning Tree in Manet“. IOSR Journal of Computer Engineering 16, Nr. 4 (2014): 38–42. http://dx.doi.org/10.9790/0661-16423842.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Sun, Xuemei, Cheng Chang, Hua Su und Chuitian Rong. „Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm“. Mathematical Problems in Engineering 2015 (2015): 1–13. http://dx.doi.org/10.1155/2015/601782.

Der volle Inhalt der Quelle

Annotation:

Degree constrained minimum spanning tree (DCMST) refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is no more thand(d≥ 2). The paper proposes an improved multicolony ant algorithm for degree constrained minimum spanning tree searching which enables independent search for optimal solutions among various colonies and achieving information exchanges between different colonies by information entropy. Local optimal algorithm is introduced to improve constructed spanning tree. Meanwhile, algorithm strategies in dynamic ant, random perturbations ant colony, and max-min ant system are adapted in this paper to optimize the proposed algorithm. Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Vashist, Risha, und Suniti Dutt. „Minimum Spanning Tree based Improved Routing Protocol for Heterogeneous Wireless Sensor Network“. International Journal of Computer Applications 103, Nr. 2 (18.10.2014): 29–33. http://dx.doi.org/10.5120/18047-8945.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Mustafiz, Rafid, Abu Sayem Mohammad Delowar Hossain, Nazrul Islam und Mohammad Motiur Rahman. „Analysis of QoS in Software Defined Wireless Network with Spanning Tree Protocol“. International Journal of Computer Network and Information Security 9, Nr. 6 (08.06.2017): 61–68. http://dx.doi.org/10.5815/ijcnis.2017.06.07.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Bi, Cheng, An Zhang und Ying Wan. „Time synchronisation in wireless sensor networks under energy-efficient spanning tree protocol“. International Journal of Automation and Logistics 2, Nr. 3 (2016): 218. http://dx.doi.org/10.1504/ijal.2016.078497.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Cheng, C., I. Cimet und S. Kumar. „A protocol to maintain a minimum spanning tree in a dynamic topology“. ACM SIGCOMM Computer Communication Review 18, Nr. 4 (August 1988): 330–37. http://dx.doi.org/10.1145/52325.52357.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Hojjat, Hossein, Hootan Nakhost und Marjan Sirjani. „Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended Rebeca“. Electronic Notes in Theoretical Computer Science 159 (Mai 2006): 139–54. http://dx.doi.org/10.1016/j.entcs.2005.12.066.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Santos, Dorabella, Amaro de Sousa, Filipe Alvelos, Mateusz Dzida und Michał Pióro. „Optimization of link load balancing in multiple spanning tree routing networks“. Telecommunication Systems 48, Nr. 1-2 (04.06.2010): 109–24. http://dx.doi.org/10.1007/s11235-010-9337-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Ramadoss, Poonkuzhali, Sanavullah Mohamed Yakub und Sabari Annaji. „A PREEMPTIVE LINK STATE SPANNING TREE SOURCE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKS“. Journal of Computer Science 10, Nr. 1 (01.01.2014): 85–90. http://dx.doi.org/10.3844/jcssp.2014.85.90.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Pahuja, Poonam, und Tarun Shrimali. „Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks“. International Journal of Computer Applications 74, Nr. 20 (30.07.2013): 19–23. http://dx.doi.org/10.5120/13026-0196.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Saputra, Wahyu, und Fajar Suryawan. „Implementasi VLAN dan Spanning Tree Protocol Menggunakan GNS 3 dan Pengujian Sistem Keamanannya“. Khazanah Informatika: Jurnal Ilmu Komputer dan Informatika 3, Nr. 2 (17.01.2018): 64. http://dx.doi.org/10.23917/khif.v3i2.5311.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Nunia, Vijay, und Ramesh C. Poonia. „Fast and Efficient Recovery of Root Node Failure in Spanning Tree Routing Protocol“. Recent Patents on Computer Science 11, Nr. 4 (13.12.2018): 262–67. http://dx.doi.org/10.2174/2213275911666180907145304.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Molinier, Lionel, Mathieu Ligocki, Emna Ghedira, Guy Pujolle und Dominique Gaïti. „Piloting the spanning tree protocol in home networks using a multi-agent system“. Telecommunication Systems 51, Nr. 1 (22.01.2011): 15–27. http://dx.doi.org/10.1007/s11235-010-9411-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Shyu, Shyong Jian, Yin Te Tsai und R. C. T. Lee. „The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction“. Journal of Combinatorial Optimization 8, Nr. 4 (Dezember 2004): 453–68. http://dx.doi.org/10.1007/s10878-004-4837-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Zhang, Kai, und Min Jin. „Research on Routing Protocol for Large-Scale Wireless Sensor Networks“. Applied Mechanics and Materials 511-512 (Februar 2014): 146–49. http://dx.doi.org/10.4028/www.scientific.net/amm.511-512.146.

Der volle Inhalt der Quelle

Annotation:

Aimed at the application characteristics of the large-scale WSN, a new clustering routing protocol LEACH_CHMST is proposed in this paper. The multi-hop strategy for cluster-heads communication has been introduced instead of the one-hop strategy in LEACH, and a minimum spanning tree of cluster-head is established, in which the routes from all cluster-heads to sink are found.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Tamma, Bheemarjuna Reddy, Anirudh Badam, C. Siva Ram Murthy und Ramesh R. Rao. „K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks“. Computer Networks 54, Nr. 11 (August 2010): 1864–84. http://dx.doi.org/10.1016/j.comnet.2010.02.013.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

GARCIA, ROMAN, und JOSE DUATO. „SUBOPTIMAL-OPTIMAL ROUTING FOR LAN INTERNETWORKING USING TRANSPARENT BRIDGES“. International Journal of Foundations of Computer Science 09, Nr. 02 (Juni 1998): 139–56. http://dx.doi.org/10.1142/s0129054198000118.

Der volle Inhalt der Quelle

Annotation:

The current standard transparent bridge protocol IEEE-802.1D is based on the Spanning Tree (ST) algorithm. It has a very important restriction: it cannot work when the topology has active loops. Therefore, a tree is the only possible interconnection topology that can be used. The ST algorithm guarantees that the active topology is a tree discarding lines that form loops. However, because of this, network bandwidth cannot be fully utilized. Moreover, trees have a very serious bottleneck near the root. This paper proposes a new transparent bridge protocol for LAN interconnection that allows active loops. Therefore, strongly connected regular topologies like tori, hypercubes, meshes, etc., as well as irregular topologies can be used without wasting bandwidth. As loops provide alternative paths, the new protocol (named OSR for Optimal-Suboptimal Routing) uses optimal routing or, in the worst case, suboptimal routing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!