Academic literature on the topic 'Rapid Spanning Tree Protocol'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Rapid Spanning Tree Protocol.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Rapid Spanning Tree Protocol"
Marchese, M., and M. Mongelli. "Simple protocol enhancements of Rapid Spanning Tree Protocol over ring topologies." Computer Networks 56, no. 4 (March 2012): 1131–51. http://dx.doi.org/10.1016/j.comnet.2011.10.008.
Full textChen, Wei, Qiang Yu, Peng Fei Yu, Jie Ren, and Zhi Huang. "Research of Ethernet Ring Protection Technology." Applied Mechanics and Materials 556-562 (May 2014): 6026–29. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6026.
Full textAljohani, Sarah L., and Mohammed J. F. Alenazi. "MPResiSDN: Multipath Resilient Routing Scheme for SDN-Enabled Smart Cities Networks." Applied Sciences 11, no. 4 (February 22, 2021): 1900. http://dx.doi.org/10.3390/app11041900.
Full textGrandoni, Fabrizio, Gaia Nicosia, Gianpaolo Oriolo, and Laura Sanità. "Stable routing under the Spanning Tree Protocol." Operations Research Letters 38, no. 5 (September 2010): 399–404. http://dx.doi.org/10.1016/j.orl.2010.05.001.
Full textSingh, Gurdip, and Arthur J. Bernstein. "A highly asynchronous minimum spanning tree protocol." Distributed Computing 8, no. 3 (March 1995): 151–61. http://dx.doi.org/10.1007/bf02242717.
Full textSeo, Seok Weon, Seong Mun Kim, and Sung Gi Min. "Extensible Multiple Spanning Tree Protocol for Virtual eXtensible LAN." International Journal of Computer and Communication Engineering 5, no. 2 (2016): 120–29. http://dx.doi.org/10.17706/ijcce.2016.5.2.120-129.
Full textKatayama, Yoshiaki, Toshiyuki Hasegawa, and Naohisa Takahashi. "A superstabilizing spanning tree protocol for a link failure." Systems and Computers in Japan 38, no. 14 (2007): 41–51. http://dx.doi.org/10.1002/scj.20656.
Full textBathla, Gaurav. "Minimum Spanning Tree based Protocol for Heterogeneous Wireless Sensor Networks." i-manager’s Journal on Wireless Communication Networks 1, no. 4 (March 15, 2013): 12–23. http://dx.doi.org/10.26634/jwcn.1.4.2189.
Full textUppal, Ankush, and Ramanjot Kaur. "To Find Energy Efficient Protocol by using Minimum Spanning Tree." International Journal of Computer Applications 178, no. 33 (July 17, 2019): 6–11. http://dx.doi.org/10.5120/ijca2019919199.
Full textTakashima, I., and M. Ikezaki. "An expanded spanning-tree protocol for home-oriented network management." IEEE Transactions on Consumer Electronics 37, no. 3 (1991): 379–87. http://dx.doi.org/10.1109/30.85540.
Full textDissertations / Theses on the topic "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.
Full textLindströ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.
Full textEisazadeh, Ali Akbar, and 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.
Full textOne 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.
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.
Full textAbstract
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.
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.
Full textLiyanage, M. (Madhusanka). "Enhancing security and scalability of Virtual Private LAN Services." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526213767.
Full textTiivistelmä 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
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.
Full textSaputro, Nico. "Performance Optimization of Network Protocols for IEEE 802.11s-based Smart Grid Communications." FIU Digital Commons, 2016. http://digitalcommons.fiu.edu/etd/2555.
Full textKung, Yi-Ming, and 鞏怡明. "A Study on the Operations of Spanning Tree Algorithm and Protocol in the VLAN Environment." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/09633672046122414716.
Full text國立交通大學
資訊管理研究所
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.
Book chapters on the topic "Rapid Spanning Tree Protocol"
Lopes, João, Susana Sargento, and 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.
Full textDomagał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.
Full textIrawati, Indrarini Dyah, and 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.
Full textHorváth, Dániel, Gábor Kapitány, Sándor Plósz, István Moldován, and 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.
Full textIslam, Nazrul, S. M. Shamim, Md Fazla Rabbi, Md Saikat Islam Khan, and 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.
Full textInoue, Koki, Yuichi Sudo, Hirotsugu Kakugawa, and 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.
Full textBaranidharan, B., and 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.
Full textLi, Dancheng, Chen Zheng, Chunyan Han, and 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.
Full textFortz, Bernard, Luís Gouveia, and 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.
Full textFortz, Bernard, Luís Gouveia, and 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-14115-2_21.
Full textConference papers on the topic "Rapid Spanning Tree Protocol"
Marchese, M., M. Mongelli, and 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.
Full textPallos, Richard, Janos Farkas, Istvan Moldovan, and 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.
Full textAzcorra, A., and 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.
Full textKarthickraja, N. P., and 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.
Full textKrishnan, Y. Navaneeth, Chandan N. Bhagwat, and 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.
Full textLai, Yingxu, Qiuyue Pan, Zenghui Liu, Yinong Chen, and 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.
Full textHePeng PanHeng, LiXiangdong, and 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.
Full textAntonova, 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.
Full textBuregoni, 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.
Full textGomes, Tome, Lucas Guardalben, Paulo Salvador, and 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.
Full textReports on the topic "Rapid Spanning Tree Protocol"
Levi, D., and D. Harrington. Definitions of Managed Objects for Bridges with Rapid Spanning Tree Protocol. RFC Editor, December 2005. http://dx.doi.org/10.17487/rfc4318.
Full textZhang, M., H. Wen, and J. Hu. Spanning Tree Protocol (STP) Application of the Inter-Chassis Communication Protocol (ICCP). RFC Editor, January 2016. http://dx.doi.org/10.17487/rfc7727.
Full text