Thematische Bibliographien / Rapid Spanning Tree Protocol

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur 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 den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen 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.

Zeitschriftenartikel zum Thema "Rapid Spanning Tree Protocol"

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

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

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

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

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

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

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

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

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

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

Mehr Quellen

Dissertationen zum Thema "Rapid Spanning Tree Protocol"

Poláčeková, Simona. „Modelování a simulace spanning-tree protokolů“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445508.

Der volle Inhalt der Quelle

Annotation:

This term project deals with the functionality of Spanning Tree protocols, especially the Rapid Spanning Tree Protocol, and the Multiple Spanning Tree Protocol. The primary usage of spanning tree protocols is the prevention of loops within the data link layer, the prevention of a broadcast storm, and also dealing with redundancy in the network. Moreover, the project contains the description of configuration of these protocols on Cisco devices. The main goal of this thesis is to implement the Multiple Spanning Tree protocol into INET framework within the OMNeT++ simulation system. Then, the implemented solution is tested and it's functionality is compared with the referential behavior in a Cisco network.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lindström, Henrik. „Migration to P4-Programmable Switches and Implementation of the Rapid Spanning Tree Protocol“. Thesis, Linköpings universitet, Programvara och system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-167509.

Der volle Inhalt der Quelle

Annotation:

P4 is a high-level language for programming the data plane of a network switch. These P4-programmable switches come with no pre-defined behavior or protocols, so it is entirely up to the loaded P4 program to define these. This allows the user to exclude any unwanted functionality and to create custom protocols. It also removes the dependence on the switch vendor in terms of both trust and addition of new features. This thesis looks at migration from traditional switches to P4-programmable ones. Since no behavior is included out-of-the-box in the P4 switches, a search is made for open-source P4 projects and the functionality they provide is evaluated. It is found that most link layer functionality can be achieved with them, with the exception being loop prevention by spanning tree protocols. Therefore, one of the projects is extended with an implementation of the Rapid Spanning Tree Protocol based on the IEEE 802.1D-2004 standard. Finally, partial migration of networks to P4 switches and to the Software Defined Networking (SDN) paradigm is studied based on a literature review. Four general approaches and specific architectures for these are found, and it is concluded that such a hybrid network can still benefit from P4 and having a centralized SDN controller.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eisazadeh, Ali Akbar, und Nora Espahbodi. „Fast Fault Recovery in Switched Networks for Carrying IP Telephony Traffic“. Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-3859.

Der volle Inhalt der Quelle

Annotation:

One of the most parts of VOIP management is fault management and, in having a good fault management, finding good mechanisms to detect faults in the network have to be considered.

The main focus of this project is to implement different types of fast fault recovery protocols in networks, especially networks that carry IP telephony. Having a complete understanding of some common link failure detection and fault recovery protocols, such as spanning tree protocol (STP), rapid spanning tree protocol (RSTP) and per-VLAN spanning tree protocol (PVSTP), and also having a complete understanding of three other common techniques for fault detection and fault recovery, such as hot standby routing protocol (HSRP), virtual router redundancy protocol (VRRP) and gateway load balancing protocol (GLBP) will be regarded in the project. We are going to test some fault recovery protocols which can be used in IP telephony networks and choose the best. We intend to focus on this issue in LAN environment in theoretical descriptions and practical implementations.

The final outcome of the thesis is implementation in the Halmstad University’s lab environment to obtain the final result. For doing our thesis, we are going to use some technical tools as hardware tools (Cisco L3 and L2 switches, Routers, IP Phones) and tools which are used for network performance monitoring, like as CommVeiw.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kahsay-Eriksson, Genet. „IMPLEMENTATION OF SPANNING TREE PROTOCOL IN SKINNSKATTEBERG COUNCIL'S NETWORK“. Thesis, Mälardalen University, School of Innovation, Design and Engineering, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-5804.

Der volle Inhalt der Quelle

Annotation:

Abstract

In the substation automation applications the utility of Ethernet local area networks (LANs) that interconnects different network devices together has become so popular and has grown steadily, there is always an anxiety on how to protect against the event of a single link network failure? Though, the easiest way to be on the safest side is by the creation of more than one link between two network devices, having many paths between two network devices in the network establishes a loop (loops). A loop is very dangerous to have in data link layer where the frame doesn’t have TTL (time to live) counting down.[9] This can result in an endless loop in the entire LAN and put the network down [3]. To eliminate loop in Ethernet LAN with redundant link, we can use one of the data link layer protocol which is called STP (Spanning Tree Protocol).

In the past STP was not so popular but today more and more enterprises are beginning to use the STP. But not only companies have found the Spanning Tree Protocol to be very interesting, other establishments like schools, hospitals, businesses etc have also found this a great reliable protocol to have.

This thesis is focused on the study of how to create a redundancy link on the Skinnskatteberg council’s network and protecting loops by implementing the Spanning Tree Protocol on a fast growing council in the central region of Sweden. Actually the study is also useful to utilize in other LAN switched networks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Veisllari, Raimena. „Employing Ethernet Multiple Spanning Tree Protocol in an OpMiGua network“. Thesis, Norwegian University of Science and Technology, Department of Telematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10913.

Der volle Inhalt der Quelle

Annotation:

Hybrid optical packet/circuit switched networking architectures are increasingly becoming an interesting research field. They integrate and combine the high resource utilization of statistically multiplexed packet switched networks with the low processing requirements and guaranteed quality of service provided by circuit switched networks. The aim of this thesis is to integrate the OpMiGua hybrid optical network with Ethernet. Specifically, the work is focused on the compatibility of the Ethernets loop-free topology protocols with the redundant multiple traffic service paths of OpMiGua. We analyse the problems and limitations imposed on the network architecture and propose our topology solution called the SM chain-connectivity. The analysis and the proposed schemes are verified based on results obtained from simulations. Furthermore, we design an integrated logical OpMiGua node that relies on an Ethernet switch instead of the Optical Packet Switch for the Statistically Multiplexed traffic. To date, to our knowledge there are no studies analysing the compatibility of Ethernet and its protection mechanisms in a hybrid optical network. This is the first work addressing the use of Ethernet in OpMiGua.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liyanage, M. (Madhusanka). „Enhancing security and scalability of Virtual Private LAN Services“. Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526213767.

Der volle Inhalt der Quelle

Annotation:

Abstract Ethernet based VPLS (Virtual Private LAN Service) is a transparent, protocol independent, multipoint L2VPN (Layer 2 Virtual Private Network) mechanism to interconnect remote customer sites over IP (Internet Protocol) or MPLS (Multiprotocol Label Switching) based provider networks. VPLS networks are now becoming attractive in many Enterprise applications, such as DCI (data center interconnect), voice over IP (VoIP) and videoconferencing services due to their simple, protocol-independent and cost efficient operation. However, these new VPLS applications demand additional requirements, such as elevated security, enhanced scalability, optimum utilization of network resources and further reduction in operational costs. Hence, the motivation of this thesis is to develop secure and scalable VPLS architectures for future communication networks. First, a scalable secure flat-VPLS architecture is proposed based on a Host Identity Protocol (HIP). It contains a session key-based security mechanism and an efficient broadcast mechanism that increase the forwarding and security plane scalability of VPLS networks. Second, a secure hierarchical-VPLS architecture is proposed to achieve control plane scalability. A novel encrypted label-based secure frame forwarding mechanism is designed to transport L2 frames over a hierarchical VPLS network. Third, a novel Distributed Spanning Tree Protocol (DSTP) is designed to maintain a loop free Ethernet network over a VPLS network. With DSTP it is proposed to run a modified STP (Spanning Tree Protocol) instance in each remote segment of the VPLS network. In addition, two Redundancy Identification Mechanisms (RIMs) termed Customer Associated RIMs (CARIM) and Provider Associated RIMs (PARIM) are used to mitigate the impact of invisible loops in the provider network. Lastly, a novel SDN (Software Defined Networking) based VPLS (Soft-VPLS) architecture is designed to overcome tunnel management limitations in legacy secure VPLS architectures. Moreover, three new mechanisms are proposed to improve the performance of legacy tunnel management functions: 1) A dynamic tunnel establishment mechanism, 2) a tunnel resumption mechanism and 3) a fast transmission mechanism. The proposed architecture utilizes a centralized controller to command VPLS tunnel establishment based on real-time network behavior. Hence, the results of the thesis will help for more secure, scalable and efficient system design and development of VPLS networks. It will also help to optimize the utilization of network resources and further reduction in operational costs of future VPLS networks
Tiivistelmä Ethernet-pohjainen VPLS (Virtual Private LAN Service) on läpinäkyvä, protokollasta riippumaton monipisteverkkomekanismi (Layer 2 Virtual Private Network, L2VPN), jolla yhdistetään asiakkaan etäkohteet IP (Internet Protocol)- tai MPLS (Multiprotocol Label Switching) -yhteyskäytäntöön pohjautuvien palveluntarjoajan verkkojen kautta. VPLS-verkoista on yksinkertaisen protokollasta riippumattoman ja kustannustehokkaan toimintatapansa ansiosta tullut kiinnostavia monien yrityssovellusten kannalta. Tällaisia sovelluksia ovat esimerkiksi DCI (Data Center Interconnect), VoIP (Voice over IP) ja videoneuvottelupalvelut. Uusilta VPLS-sovelluksilta vaaditaan kuitenkin uusia asioita, kuten parempaa tietoturvaa ja skaalautuvuutta, optimaalista verkkoresurssien hyödyntämistä ja käyttökustannusten pienentämistä entisestään. Tämän väitöskirjan tarkoituksena onkin kehittää turvallisia ja skaalautuvia VPLS-arkkitehtuureja tulevaisuuden tietoliikenneverkoille. Ensin väitöskirjassa esitellään skaalautuva ja turvallinen flat-VPLS-arkkitehtuuri, joka perustuu Host Identity Protocol (HIP) -protokollaan. Seuraavaksi käsitellään istuntoavaimiin perustuvaa tietoturvamekanismia ja tehokasta lähetysmekanismia, joka parantaa VPLS-verkkojen edelleenlähetyksen ja tietoturvatason skaalautuvuutta. Tämän jälkeen esitellään turvallinen, hierarkkinen VPLS-arkkitehtuuri, jolla saadaan aikaan ohjaustason skaalautuvuus. Väitöskirjassa kuvataan myös uusi salattu verkkotunnuksiin perustuva tietokehysten edelleenlähetysmekanismi, jolla L2-kehykset siirretään hierarkkisessa VPLS-verkossa. Lisäksi väitöskirjassa ehdotetaan uuden Distributed Spanning Tree Protocol (DSTP) -protokollan käyttämistä vapaan Ethernet-verkkosilmukan ylläpitämiseen VPLS-verkossa. DSTP:n avulla on mahdollista ajaa muokattu STP (Spanning Tree Protocol) -esiintymä jokaisessa VPLS-verkon etäsegmentissä. Väitöskirjassa esitetään myös kaksi Redundancy Identification Mechanism (RIM) -mekanismia, Customer Associated RIM (CARIM) ja Provider Associated RIM (PARIM), joilla pienennetään näkymättömien silmukoiden vaikutusta palveluntarjoajan verkossa. Viimeiseksi ehdotetaan uutta SDN (Software Defined Networking) -pohjaista VPLS-arkkitehtuuria (Soft-VPLS) vanhojen turvallisten VPLS-arkkitehtuurien tunnelinhallintaongelmien poistoon. Näiden lisäksi väitöskirjassa ehdotetaan kolmea uutta mekanismia, joilla voidaan parantaa vanhojen arkkitehtuurien tunnelinhallintatoimintoja: 1) dynaaminen tunnelinluontimekanismi, 2) tunnelin jatkomekanismi ja 3) nopea tiedonsiirtomekanismi. Ehdotetussa arkkitehtuurissa käytetään VPLS-tunnelin luomisen hallintaan keskitettyä ohjainta, joka perustuu reaaliaikaiseen verkon käyttäytymiseen. Tutkimuksen tulokset auttavat suunnittelemaan ja kehittämään turvallisempia, skaalautuvampia ja tehokkaampia VLPS järjestelmiä, sekä auttavat hyödyntämään tehokkaammin verkon resursseja ja madaltamaan verkon operatiivisia kustannuksia

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jieke, Pan. „Cooperative Intrusion Detection For The Next Generation Carrier Ethernet“. Master's thesis, Department of Informatics, University of Lisbon, 2008. http://hdl.handle.net/10451/13881.

Der volle Inhalt der Quelle

Annotation:

Current OSI model layer 2 network elements (NEs, e.g., bridges, switches) are complex hardware and software boxes, often running an operating system, service and administration software, that can be vulnerable to attacks, including to remote code execution inside them. The purpose of this thesis is to present an architecture to protect the Carrier Ethernet network infrastructure from attacks performed by malicious NEs against the link management protocol, Spanning Tree Protocol, and its variations. This thesis proposes that NEs are equipped with an intrusion detection component. Each detector uses a specification-based intrusion detection mechanism in order to inspect the behaviour of other NEs through the analysis of the received messages. The correct behaviour of the NEs is crafted from the standard specification of the STP protocol. If there is a deviation between current and expected behaviour, then the NE is considered to be malicious. The specification is extended with temporal pattern annotations, in order to detect certain deviations from the protocol. The results of the local detection are then transmitted to the other NEs, in order to cooperatively establish a correlation between all the NEs, so that malicious NEs can be logically removed from the network (disconnecting the ports connected to them)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Saputro, Nico. „Performance Optimization of Network Protocols for IEEE 802.11s-based Smart Grid Communications“. FIU Digital Commons, 2016. http://digitalcommons.fiu.edu/etd/2555.

Der volle Inhalt der Quelle

Annotation:

The transformation of the legacy electric grid to Smart Grid (SG) poses numerous challenges in the design and development of an efficient SG communications network. While there has been an increasing interest in identifying the SG communications network and possible SG applications, specific research challenges at the network protocol have not been elaborated yet. This dissertation revisited each layer of a TCP/IP protocol stack which basically was designed for a wired network and optimized their performance in IEEE 802.11s-based Advanced Metering Infrastructure (AMI) communications network against the following challenges: security and privacy, AMI data explosion, periodic simultaneous data reporting scheduling, poor Transport Control Protocol (TCP) performance, Address Resolution Protocol (ARP) broadcast, and network interoperability. To address these challenges, layered and/or cross-layered protocol improvements were proposed for each layer of TCP/IP protocol stack. At the application layer, a tree-based periodic time schedule and a time division multiple access-based scheduling were proposed to reduce high contention when smart meters simultaneously send their reading. Homomorphic encryption performance was investigated to handle AMI data explosion while providing security and privacy. At the transport layer, a tree-based fixed Retransmission Timeout (RTO) setting and a path-error aware RTO that exploits rich information of IEEE 802.11s data-link layer path selection were proposed to address higher delay due to TCP mechanisms. At the network layer, ARP requests create broadcast storm problems in IEEE 802.11s due to the use of MAC addresses for routing. A secure piggybacking-based ARP was proposed to eliminate this issue. The tunneling mechanisms in the LTE network cause a downlink traffic problem to IEEE 802.11s. For the network interoperability, at the network layer of EPC network, a novel UE access list was proposed to address this issue. At the data-link layer, to handle QoS mismatch between IEEE 802.11s and LTE network, Dual Queues approach was proposed for the Enhanced Distributed Channel Access. The effectiveness of all proposed approaches was validated through extensive simulation experiments using a network simulator. The simulation results showed that the proposed approaches outperformed the traditional TCP/IP protocols in terms of end to end delay, packet delivery ratio, throughput, and collection time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kung, Yi-Ming, und 鞏怡明. „A Study on the Operations of Spanning Tree Algorithm and Protocol in the VLAN Environment“. Thesis, 1998. http://ndltd.ncl.edu.tw/handle/09633672046122414716.

Der volle Inhalt der Quelle

Annotation:

碩士
國立交通大學
資訊管理研究所
86
The Spanning Tree Algorithm and Protocol will configure a simplyconnected active topology from the arbitrarily connected componentsof a Bridged Local Area Network into a single spanning tree,such that there is at most one data route between any two end stations,eliminating data loops.This thesis proposes a Virtual LAN Spanning Tree Algorithm and Protocol.This algorithm is proposed according to the features of Virtual LAN.With the operation of this algorithm, all the members belong to thesame VLAN will be included in an isolated Spanning Tree. And the spann-ing tree formed for a given VLAN will use as many connection devicesthat still not participate in any spanning tree topology before aspossible.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Rapid Spanning Tree Protocol"

Lopes, João, Susana Sargento und André Zúquete. „A Dependable Alternative to the Spanning Tree Protocol“. In Lecture Notes in Computer Science, 148–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38789-0_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Domagała, Wojciech. „Spanning Tree Protocol in Wireless Industrial Communication System“. In Computer Networks, 306–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13861-4_32.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Irawati, Indrarini Dyah, und Mohammad Nuruzzamanirridha. „Spanning Tree Protocol Simulation Based on Software Defined Network Using Mininet Emulator“. In Communications in Computer and Information Science, 395–403. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46742-8_36.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Horváth, Dániel, Gábor Kapitány, Sándor Plósz, István Moldován und Csaba Lukovszki. „Ring Flushing for Reduced Overload in Spanning Tree Protocol Controlled Ethernet Networks“. In The Internet of the Future, 11–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03700-9_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Islam, Nazrul, S. M. Shamim, Md Fazla Rabbi, Md Saikat Islam Khan und Mohammad Abu Yousuf. „Building Machine Learning Based Firewall on Spanning Tree Protocol over Software Defined Networking“. In Advances in Intelligent Systems and Computing, 557–68. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-33-4673-4_45.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Inoue, Koki, Yuichi Sudo, Hirotsugu Kakugawa und Toshimitsu Masuzawa. „A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault“. In Structural Information and Communication Complexity, 353–56. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24922-9_28.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baranidharan, B., und B. Shanthi. „An Energy Efficient Clustering Protocol Using Minimum Spanning Tree for Wireless Sensor Networks“. In Advances in Parallel Distributed Computing, 1–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24037-9_1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Dancheng, Chen Zheng, Chunyan Han und Yixian Liu. „Research and Application of Heterogeneous Network Topology Discovery Algorithm Based on Multiple Spanning Tree Protocol“. In Advances in Intelligent and Soft Computing, 437–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27708-5_60.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fortz, Bernard, Luís Gouveia und Martim Moniz. „Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol“. In Lecture Notes in Computer Science, 242–54. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09174-7_21.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Rapid Spanning Tree Protocol"

Marchese, M., M. Mongelli und G. Portomauro. „Simple Protocol Enhancements of Rapid Spanning Tree Protocol over Ring Topologies“. In GLOBECOM 2010 - 2010 IEEE Global Communications Conference. IEEE, 2010. http://dx.doi.org/10.1109/glocom.2010.5683943.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pallos, Richard, Janos Farkas, Istvan Moldovan und Csaba Lukovszki. „Performance of rapid spanning tree protocol in access and metro networks“. In 2007 Second International Conference on Access Networks & Workshops. IEEE, 2007. http://dx.doi.org/10.1109/accessnets.2007.4447112.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Azcorra, A., und G. Ibanez. „Application of rapid spanning tree protocol for automatic hierarchical address assignment to bridges“. In 11th International Telecommunications Network Strategy and Planning Symposium. IEEE, 2004. http://dx.doi.org/10.1109/netwks.2004.241225.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Karthickraja, N. P., und V. Sumathy. „A study of routing protocols and a hybrid routing protocol based on Rapid Spanning Tree and Cluster Head Routing in Wireless Sensor Networks“. In 2010 International Conference on Wireless Communication and Sensor Computing (ICWCSC). IEEE, 2010. http://dx.doi.org/10.1109/icwcsc.2010.5415893.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krishnan, Y. Navaneeth, Chandan N. Bhagwat und Aparajit P. Utpat. „Optimizing spanning tree protocol using port channel“. In 2014 International Conference on Electronics and Communication Systems (ICECS). IEEE, 2014. http://dx.doi.org/10.1109/ecs.2014.6892831.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lai, Yingxu, Qiuyue Pan, Zenghui Liu, Yinong Chen und Zhizheng Zhou. „Trust-Based Security for the Spanning Tree Protocol“. In 2014 IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2014. http://dx.doi.org/10.1109/ipdpsw.2014.150.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

HePeng PanHeng, LiXiangdong und ZhengQiusheng. „Physical topology discovery based on spanning tree protocol“. In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccasm.2010.5622296.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Antonova, G. S. „Spanning Tree Protocol Interoperability with Other Loop Prevention Algorithms“. In 2007 Canadian Conference on Electrical and Computer Engineering. IEEE, 2007. http://dx.doi.org/10.1109/ccece.2007.280.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buregoni, Ravi Kumar. „Handling Routed Traffic Over Ports Participating in Spanning Tree Protocol“. In The 9th International Conference on Advanced Communication Technology. IEEE, 2007. http://dx.doi.org/10.1109/icact.2007.358765.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gomes, Tome, Lucas Guardalben, Paulo Salvador und Susana Sargento. „A Spanning Tree Protocol over mobile wireless ad hoc networks“. In 2013 ICC - 2013 IEEE International Conference on Communication Workshop (ICC). IEEE, 2013. http://dx.doi.org/10.1109/iccw.2013.6649399.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Rapid Spanning Tree Protocol"

Levi, D., und D. Harrington. Definitions of Managed Objects for Bridges with Rapid Spanning Tree Protocol. RFC Editor, Dezember 2005. http://dx.doi.org/10.17487/rfc4318.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, M., H. Wen und J. Hu. Spanning Tree Protocol (STP) Application of the Inter-Chassis Communication Protocol (ICCP). RFC Editor, Januar 2016. http://dx.doi.org/10.17487/rfc7727.

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!