Thematische Bibliographien / Multiple Spanning Tree Protocol

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Buchteile
  4. Konferenzberichte
  5. Berichte der Organisationen

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

Zeitschriftenartikel zum Thema "Multiple Spanning Tree Protocol"

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
Mehr Quellen

Dissertationen zum Thema "Multiple Spanning Tree Protocol"

1

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 Ethernet’s 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
2

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
3

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
4

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
5

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
6

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
7

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
8

Van, Staden Teaan. „Investigation into the optimization of low speed communication protocols for narrow band networks“. Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71884.

Der volle Inhalt der Quelle
Annotation:
Thesis (MScEng)--Stellenbosch University, 2012.
ENGLISH ABSTRACT: In this thesis, the investigation into the optimization of low speed communication protocols for narrow band networks will be presented. The main focus will be on analysing commonly used low speed communication protocols and investigate an alternative to these protocols to provide an optimized low speed narrow band network that provides better performance at high and low channel utilization. A study of existing low speed communication networks within the field of water supply has been used to identify the most appropriate protocols to be included in the analysis. The analysis of each protocol discussed includes the development of a simulation and theoretical model, with parameters based on those obtained from implemented communication networks focusing on the parameters used within the Namib water supply scheme of NamWater in Namibia. Of the currently implemented contention protocols, the non-persistent Carrier Sense Multiple Access (CSMA) protocol is implemented the most. Current models used for modelling these protocols make use of various assumptions. These models have been expanded to provide a more accurate representation of the non-persistent CSMA model. The Round Robin Polling (RRP) protocol is another well known protocol used within the telemetry industry and has also been modelled as an alternative to the non-persistent CSMA model. The Adaptive Tree Walk (ATW) protocol has been identified as the limited contention protocol to be modelled as a possible alternative to the conventional methods used. A new model has been developed for modelling this protocol by making use of the same strategies and tools used in the modelling of the non-persistent CSMA and RRP protocols. The Simulation modelling has been developed by making use of DESMO-J, an Object Orientated Simulation API based in Java, developed by the Faculty of Informatics at the University of Hamburg. DESMO-J has been chosen as an alternative to the more traditional simulation languages due to its complete documentation, support structures, ease of use and flexibility. All theoretical models have been implemented in Matlab.
AFRIKAANSE OPSOMMING: In hierdie tesis sal die ondersoek na die optimering van laespoed protokolle vir kommunikasie oor nouband netwerke voorgelê word. Die hoof fokus is op die analise van algemene laespoed kommunikasie protokolle en die ondersoek van alternatiewe wat ’n meer optimale laespoed nouband netwerk sal lewer deur beter werkverigting by lae en hoë kanaalverkeer. ’n Studie van praktiese laespoed nouband netwerke in die veld van waterverspreiding word gebruik om die mees algemene protokolle te identifiseer wat in die analise ingesluit moet word. Die analise van die protokolle sluit in teoretiese en simulasie modelle, met parameters soos geidentifiseer uit die studie van ‘n praktiese netwerk, naamlik die Namib waterverspreidingskema van NamWater in Namibië. Die ’Non-persistent Carrier Sense Multiple Access’ en ’Round Robin Polling’ protokolle is geidentifiseer as dié wat meeste geimplementeer word. Die werkverigting van die protokolle is geanaliseer deur gebruik te maak van teoretiese en simulasie modeleringstegnieke. Huidige modelle van die CSMA protokol is gebaseer op sekere aannames. Hierdie aannames word aangepas en verbeter vir implementering van die teoretiese model. Die model word ook verder uitgebrei om beter resultate te lewer oor ’n groter parameterstel. Die ’Adaptive Tree Walk’ protokol is geidentifiseer as ’n moontlike optimale protokol en word gemodeleer en vergelyk teen die CSMA en RRP protokolle se werkverigting. Die simulasiemodelle is ontwikkel deur gebruik te maak van die DESMO-J sagteware, soos ontwikkel as ’n Java program-koppelvlak deur die Universiteit van Hamburg se Fakulteit van Informatika. DESMO-J is gekies as ’n alternatief vir die meer tradisionele simuleringstale omrede goeie dokumentasie, maklike gebruik en buigbaarheid. Alle teoretiese modelering is uitgevoer in Matlab.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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
10

Qiao, Wenbao. „GPU component-based neighborhood search for Euclidean graph minimization problems“. Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCA020.

Der volle Inhalt der Quelle
Annotation:
Dans cette thèse, nous proposons des solutions parrallèles basées sur le systèmes actuel GPU (graphics processing unit) pour deux problèmes de minimisation de graphe Euclidien, à savoir le problème de forêt/arbre couvrant minimum Euclidien (EMSF / EMST) et le problème du voyageur commerce (TSP). Les solutions proposées résolvent également aussi le problème d'une paire bichromatique la plus proche (BCP), et suivent la technique de ``contrôle décentralisé, du parallélisme des données et des mémoires partagées par GPU".Nous proposons une technique de recherche dans le voisinage le plus proche de dimension K Euclidienne basée sur les approches classiques de NNS d’Elias qui divisent l’espace Euclidien en cellules congruentes et ne se chevauchant pas, où la taille des points de chaque cellule est délimitée. Nous proposons aussi une technique d'élagage pour obtenir le NNS à base de composants afin de trouver le point de sortie le plus proche de l'ensemble de points de requête de Q dans la complexité temporelle linéaire séquentielle lorsque les données sont uniformément réparties. Ces techniques sont utilisées conjointement avec deux GPU algorithmes proposés pour arbre traversement, à savoir la recherche en largeur bidirectionnelle GPU et la liste chaînée dynamique distribuée, afin d'adresser le BCP. Basé sur la solution BCP, un algorithme parallèle Divide and Conquer est implémenté pour construire EMSF et EMST totalement côté GPU. Le TSP est adressé avec différents algorithmes de recherche locaux parallèles 2-opt, dans lesquels nous proposons une méthodologie ``évaluation multiple K-opt, mouvements multiples K-opt" afin d’exécuter simultanément, sans interférence, des processus massifs 2-/3-opt mouvements qui se retrouvent globalement sur le même circuit TSP pour de nombreux bords. Cette méthodologie est expliquée en détail pour montrer comment nous obtenons un calcul haute performance à la fois du côté du GPU et CPU. Nous testons les solutions proposées et rapportons des résultats de comparaison expérimentale par rapport aux algorithmes de pointe
In this thesis, we propose parallel solutions based on current graphics processing unit (GPU) system for two Euclidean graph minimization problems, namely the Euclidean minimum spanning forest/tree (EMSF/EMST) and the travelling salesman problem (TSP). The proposed solutions also solve the bichromatic closest pair (BCP) problem, and follow technique of ``decentralized control, data parallelism, GPU shared memories".We propose a Euclidean K-dimensional nearest neighbourhood search (NNS) technique based on classical Elias' NNS approaches that divide the Euclidean space into congruent and non-overlapping cells where size of points in each cell is bounded. We propose a pruning technique to obtain component-based NNS to find a query point set Q's closest outgoing point within sequential linear time complexity when the data is uniformly distributed. These techniques are used together with two proposed GPU tree traversal algorithms, namely the GPU two-direction Breadth-first search and distributed dynamic linked list, to address the BCP. Based on the BCP solution, a divide and conquer parallel algorithm is implemented for building EMSF and EMST totally on GPU side. The TSP is addressed with different parallel 2-opt local search algorithms, in which we propose a ``multiple K-opt evaluation, multiple K-opt moves" methodology in order to simultaneously execute, without interference, massive 2-/3-opt moves that are globally found on the same TSP tour for many edges. This methodology is explained in details to show how we obtain high performance computing both on GPU and CPU side. We test the proposed solutions and report experimental comparison results against the state-of-the-art algorithms
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Multiple Spanning Tree Protocol"

1

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
2

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
3

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-14115-2_21.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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
5

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
6

Ruzika, Stefan, und Horst W. Hamacher. „A Survey on Multiple Objective Minimum Spanning Tree Problems“. In Algorithmics of Large and Complex Networks, 104–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02094-0_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Li, Dancheng, Chen Zheng, Chunyan Han und Yixian Liu. „Research and Application of Multiple Spanning Tree Network Topology Discovery Algorithm“. In Lecture Notes in Electrical Engineering, 165–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25541-0_22.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Santos, Dorabella, Amaro de Sousa und Filipe Alvelos. „Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing“. In Traffic Management and Traffic Engineering for the Future Internet, 114–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04576-9_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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
10

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

Konferenzberichte zum Thema "Multiple Spanning Tree Protocol"

1

Son, Myunghee, Jong-Hyup Lee und Yoo-Kyoung Lee. „Multiple spanning tree protocols in 10-Gb Ethernet edge system“. In Asia-Pacific Optical and Wireless Communications 2002, herausgegeben von Wanyi Gu, Cedric F. Lam und Yuan-Hao Lin. SPIE, 2002. http://dx.doi.org/10.1117/12.480730.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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
3

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
4

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
5

Mei-Jie Zhu, Gui-Wu Hu, Qi-Lun Zheng und Hong Peng. „Multiple sequence alignment using minimum spanning tree“. In Proceedings of 2005 International Conference on Machine Learning and Cybernetics. IEEE, 2005. http://dx.doi.org/10.1109/icmlc.2005.1527521.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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
7

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
8

Mirjalily, Ghasem, F. Akhavan Sigari und Reza Saadat. „Best Multiple Spanning Tree in Metro Ethernet Networks“. In 2009 Second International Conference on Computer and Electrical Engineering. IEEE, 2009. http://dx.doi.org/10.1109/iccee.2009.200.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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
10

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 "Multiple Spanning Tree Protocol"

1

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
2

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
Die Auswahlen zum Thema "Multiple Spanning Tree Protocol" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel
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!

Zur Bibliographie