Einloggen

Thematische Bibliographien / Rapid Spanning Tree Protocol / Zeitschriftenartikel

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

Zeitschriftenartikel zum Thema „Rapid Spanning Tree Protocol“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. 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 "Rapid 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

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

2

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

3

Aljohani, Sarah L., und Mohammed J. F. Alenazi. „MPResiSDN: Multipath Resilient Routing Scheme for SDN-Enabled Smart Cities Networks“. Applied Sciences 11, Nr. 4 (22.02.2021): 1900. http://dx.doi.org/10.3390/app11041900.

Der volle Inhalt der Quelle

Annotation:

The number of smart cities is increasing rapidly around the world with the continuous increase of governments’ interest in exploiting Information and Communication Technologies (ICT) to solve issues arising from rapid urbanization. Most smart city services rely fundamentally on ubiquitous sensing, enabled by Wireless Sensor Network (WSN) technologies. However, WSNs in smart cities are naturally vulnerable to unavoidable external challenges like storms, fires, and other natural disasters. Such challenges pose a great threat to smart city infrastructure, including WSNs, as they might affect network connectivity or result in complete blockages of network services. However, some particular smart city services are critical, to the point where they must remain available in all situations, especially during disasters; to monitor the disaster and obtain sensory information needed for controlling it, limiting its danger, or for decision-making during rescue operations. Thus, it is crucial to design a smart-city network to maintain connectivity against such challenges. In this paper, we introduce MPResiSDN, a MultiPath Resilient routing system based on Software Defined Networking (SDN). The system introduced exploits SDN’s capabilities and aided-multipath routing to reactively provide connectivity in smart city networks in the presence of challenges. We evaluated our proposed system under simulations of different natural disasters. The results demonstrate that the system improved data delivery under the challenges by as much as 100% compared to the Spanning Tree Protocol when a suitable value for k diverse paths was selected.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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

5

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

6

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

7

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

8

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

9

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

10

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

11

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

12

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

13

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

14

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

15

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

16

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

17

Bakker, Freek T., Alexandre Antonelli, Julia A. Clarke, Joseph A. Cook, Scott V. Edwards, Per G. P. Ericson, Søren Faurby et al. „The Global Museum: natural history collections and the future of evolutionary science and public education“. PeerJ 8 (28.01.2020): e8225. http://dx.doi.org/10.7717/peerj.8225.

Der volle Inhalt der Quelle

Annotation:

Natural history museums are unique spaces for interdisciplinary research and educational innovation. Through extensive exhibits and public programming and by hosting rich communities of amateurs, students, and researchers at all stages of their careers, they can provide a place-based window to focus on integration of science and discovery, as well as a locus for community engagement. At the same time, like a synthesis radio telescope, when joined together through emerging digital resources, the global community of museums (the ‘Global Museum’) is more than the sum of its parts, allowing insights and answers to diverse biological, environmental, and societal questions at the global scale, across eons of time, and spanning vast diversity across the Tree of Life. We argue that, whereas natural history collections and museums began with a focus on describing the diversity and peculiarities of species on Earth, they are now increasingly leveraged in new ways that significantly expand their impact and relevance. These new directions include the possibility to ask new, often interdisciplinary questions in basic and applied science, such as in biomimetic design, and by contributing to solutions to climate change, global health and food security challenges. As institutions, they have long been incubators for cutting-edge research in biology while simultaneously providing core infrastructure for research on present and future societal needs. Here we explore how the intersection between pressing issues in environmental and human health and rapid technological innovation have reinforced the relevance of museum collections. We do this by providing examples as food for thought for both the broader academic community and museum scientists on the evolving role of museums. We also identify challenges to the realization of the full potential of natural history collections and the Global Museum to science and society and discuss the critical need to grow these collections. We then focus on mapping and modelling of museum data (including place-based approaches and discovery), and explore the main projects, platforms and databases enabling this growth. Finally, we aim to improve relevant protocols for the long-term storage of specimens and tissues, ensuring proper connection with tomorrow’s technologies and hence further increasing the relevance of natural history museums.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

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

19

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

20

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

21

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

22

Dymerska, Barbara, Korbinian Eckstein, Beata Bachrata, Bernard Siow, Siegfried Trattnig, Karin Shmueli und Simon Daniel Robinson. „Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)“. Magnetic Resonance in Medicine 85, Nr. 4 (26.10.2020): 2294–308. http://dx.doi.org/10.1002/mrm.28563.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

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

24

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

25

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

26

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

27

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

28

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

29

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

30

Zojaji, Masoumeh, Mohammad Reza Mollakhalili Meybodi und Kamal Mirzaie. „A rapid learning automata-based approach for generalized minimum spanning tree problem“. Journal of Combinatorial Optimization 40, Nr. 3 (13.06.2020): 636–59. http://dx.doi.org/10.1007/s10878-020-00605-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

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

32

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

33

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

34

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

35

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

36

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

37

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

38

Dolev, Shlomi. „Optimal Time Self-Stabilization in Uniform Dynamic Systems“. Parallel Processing Letters 08, Nr. 01 (März 1998): 7–18. http://dx.doi.org/10.1142/s0129626498000043.

Der volle Inhalt der Quelle

Annotation:

In this paper we present a randomized uniform self-stabilizing protocol that provides each (anonymous) processor of a uniform system with a distinct identifier. The protocol uses a predefined fixed amount of memory and stabilizes within expected Θ(d) time, where d is the actual diameter of the network. The naming protocol can be combined with self-stabilizing protocols that assume distinct identifiers for the processors. Thus, we achieve with optimal time and predefined amount of memory uniform self-stabilizing protocols for many tasks including: Spanning tree construction, leader election and reset.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Ke-xing, Cao, Liu Zhao-xing, Li Xin und Lv Zhi-han. „Weak Connection Edges Independent Discriminant of Rapid Spanning Tree Recommendation of Social Network Community“. International Journal of Multimedia and Ubiquitous Engineering 11, Nr. 3 (31.03.2016): 209–22. http://dx.doi.org/10.14257/ijmue.2016.11.3.20.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

I, Justin Sophia, und N. Rama. „Improving the Proactive Routing Protocol using Depth First Iterative Deepening Spanning Tree in Mobile Ad Hoc Network“. International Journal of Electrical and Computer Engineering (IJECE) 7, Nr. 1 (01.02.2017): 316. http://dx.doi.org/10.11591/ijece.v7i1.pp316-323.

Der volle Inhalt der Quelle

Annotation:

<p>Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.</p>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Yan, Zheping, Di Wu, Wei Zhang und Yibo Liu. „Consensus of Multiagent Systems with Packet Losses and Communication Delays Using a Novel Control Protocol“. Abstract and Applied Analysis 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/159609.

Der volle Inhalt der Quelle

Annotation:

This paper studies the consensus problem of multiagent system with packet losses and communication delays under directed communication channels. Different from previous research results, a novel control protocol is proposed depending only on periodic sampling and transmitting data in order to be convenient for practical implementation. Due to the randomicity of transmission delays and packet losses, each agent updates its input value asynchronously at discrete time instants with synchronized time stamped information and evolves in continuous time. Consensus conditions for multiagent system consists of three typical dynamics including single integrator, double integrator, and high-order integrator that are all discussed in this paper. It is proved that, for single integrator agents and double integrator systems with only communication delays, consensusability can be ensured through stochastic matrix theory if the designed communication topology contains a directed spanning tree. While, for double integrator agents and high-order integrator agents with packet losses and communication delays, the interval system theory is introduced to prove the consensus of multiagent system under the condition that the designed communication topology is a directed spanning tree. Finally, simulations are carried out to validate the effectiveness of the proposed solutions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

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

43

Linge, N., E. Ball, R. Tasker und P. Kummer. „A bridge protocol for creating a spanning tree topology within an IEEE 802 extended LAN environment“. Computer Networks and ISDN Systems 13, Nr. 4-5 (Januar 1987): 323–32. http://dx.doi.org/10.1016/0169-7552(87)90007-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Sajedi, Hedieh, und Zahra Saadati. „A Hybrid Structure for Data Aggregation in Wireless Sensor Network“. Journal of Computational Engineering 2014 (23.12.2014): 1–7. http://dx.doi.org/10.1155/2014/395868.

Der volle Inhalt der Quelle

Annotation:

In recent years, wireless sensor networks have been used for various applications such as environmental monitoring, military and medical applications. A wireless sensor network uses a large number of sensor nodes that continuously collect and send data from a specific region to a base station. Data from sensors are collected from the study area in the common scenario of sensor networks. Afterward, sensed data is sent to the base station. However, neighboring sensors often lead to redundancy of data. Transmission of redundant data to the base station consumes energy and produces traffic, because process is run in a large network. Data aggregation was proposed in order to reduce redundancy in data transformation and traffic. The most popular communication protocol in this field is cluster based data aggregation. Clustering causes energy balance, but sometimes energy consumption is not efficient due to the long distance between cluster heads and base station. In another communication protocol, which is based on a tree construction, because of the short distance between the sensors, energy consumption is low. In this data aggregation approach, since each sensor node is considered as one of the vertices of a tree, the depth of tree is usually high. In this paper, an efficient hierarchical hybrid approach for data aggregation is presented. It reduces energy consumption based on clustering and minimum spanning tree. The benefit of combining clustering and tree structure is reducing the disadvantages of previous structures. The proposed method firstly employs clustering algorithm and then a minimum spanning tree is constructed based on cluster heads. Our proposed method was compared to LEACH which is a well-known data aggregation method in terms of energy consumption and the amount of energy remaining in each sensor network lifetime. Simulation results indicate that our proposed method is more efficient than LEACH algorithm considering energy consumption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

HUANG, GUANGYAN, XIAOWEI LI, JING HE und XIN LI. „DATA MINING VIA MINIMAL SPANNING TREE CLUSTERING FOR PROLONGING LIFETIME OF WIRELESS SENSOR NETWORKS“. International Journal of Information Technology & Decision Making 06, Nr. 02 (Juni 2007): 235–51. http://dx.doi.org/10.1142/s0219622007002538.

Der volle Inhalt der Quelle

Annotation:

Clustering is applied in wireless sensor networks for increasing energy efficiency. Clustering methods in wireless sensor networks are different from those in traditional data mining systems. This paper proposes a novel clustering algorithm based on Minimal Spanning Tree (MST) and Maximum Energy resource on sensors named MSTME. Also, specified constrains of clustering in wireless sensor networks and several evaluation metrics are given. MSTME performs better than already known clustering methods of Low Energy Adaptive Clustering Hierarchy (LEACH) and Base Station Controlled Dynamic Clustering Protocol (BCDCP) in wireless sensor networks when they are evaluated by these evaluation metrics. Simulation results show MSTME increases energy efficiency and network lifetime compared with LEACH and BCDCP in two-hop and multi-hop networks, respectively.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Sun, Yi-Jie, Guo-liang Zhang und Jing Zeng. „Consensus Analysis for a Class of Heterogeneous Multiagent Systems with Time Delay Based on Frequency Domain Method“. Mathematical Problems in Engineering 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/248684.

Der volle Inhalt der Quelle

Annotation:

The consensus problem of heterogeneous multiagent systems composed of first-order and second-order agent is investigated. A linear consensus protocol is proposed. Based on frequency domain method, the sufficient conditions of achieving consensus are obtained. If communication topology contains spanning tree and some conditions can be satisfied on control gains, consensus can be achieved. Then, a linear consensus protocol with time delay is proposed. In this case, consensus is dependent only on system coupling strength, each agent input time delay, but independent of communication delay. Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical result.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Ma, Cui-Qin, Yun-Bo Zhao und Wei-Guo Sun. „Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise“. Journal of Control Science and Engineering 2018 (06.08.2018): 1–9. http://dx.doi.org/10.1155/2018/7186737.

Der volle Inhalt der Quelle

Annotation:

Event-triggered bipartite consensus of single-integrator multi-agent systems is investigated in the presence of measurement noise. A time-varying gain function is proposed in the event-triggered bipartite consensus protocol to reduce the negative effects of the noise corrupted information processed by the agents. Using the state transition matrix, Ito^ formula, and the algebraic graph theory, necessary and sufficient conditions are given for the proposed protocol to yield mean square bipartite consensus. We find that the weakest communication requirement to ensure the mean square bipartite consensus under event-triggered protocol is that the signed digraph is structurally balanced and contains a spanning tree. Numerical examples validated the theoretical findings where the system shows no Zeno behavior.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Parins-Fukuchi, Caroline, Gregory W. Stull und Stephen A. Smith. „Phylogenomic conflict coincides with rapid morphological innovation“. Proceedings of the National Academy of Sciences 118, Nr. 19 (03.05.2021): e2023058118. http://dx.doi.org/10.1073/pnas.2023058118.

Der volle Inhalt der Quelle

Annotation:

Evolutionary biologists have long been fascinated with the episodes of rapid phenotypic innovation that underlie the emergence of major lineages. Although our understanding of the environmental and ecological contexts of such episodes has steadily increased, it has remained unclear how population processes contribute to emergent macroevolutionary patterns. One insight gleaned from phylogenomics is that gene-tree conflict, frequently caused by population-level processes, is often rampant during the origin of major lineages. With the understanding that phylogenomic conflict is often driven by complex population processes, we hypothesized that there may be a direct correspondence between instances of high conflict and elevated rates of phenotypic innovation if both patterns result from the same processes. We evaluated this hypothesis in six clades spanning vertebrates and plants. We found that the most conflict-rich regions of these six clades also tended to experience the highest rates of phenotypic innovation, suggesting that population processes shaping both phenotypic and genomic evolution may leave signatures at deep timescales. Closer examination of the biological significance of phylogenomic conflict may yield improved connections between micro- and macroevolution and increase our understanding of the processes that shape the origin of major lineages across the Tree of Life.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Feng, Neng Shan, und Zhong Ming Yang. „Research on Rapid Detection Algorithm Based on Property Choosing Tree“. Advanced Materials Research 505 (April 2012): 386–92. http://dx.doi.org/10.4028/www.scientific.net/amr.505.386.

Der volle Inhalt der Quelle

Annotation:

The construction method used by detection engine Snort-NG based on ID3 decision tree has the problem of excessive memory occupancy. The idea that the test properties are chosen according to the gradation of rule property in network protocol stack was presented in this paper; that is, the property of link layer first determined, and then network layer and transport layer. The atomicity of the value of these properties were preserved and the values of these properties were treated as a whole. The results of experiment showed that the occupancy of memory was much less in the state of non-trivial property being very common with this approach.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Rahman, P. A. „An algorithm for selection of the preferable root switch for the spanning-tree protocol in computer networks“. Journal of Physics: Conference Series 1661 (November 2020): 012010. http://dx.doi.org/10.1088/1742-6596/1661/1/012010.

Der volle Inhalt der Quelle

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!