About: IEEE 802.1D is a research topic. Over the lifetime, 5 publications have been published within this topic receiving 41 citations. The topic is also known as: 802.1D.
TL;DR: In this article, the authors propose a method of minimizing the delay in convergence time for a complex spanning tree protocol topology following a topology change in the network system in the STP standard.
Abstract: An embodiment includes a method of minimizing the delay in convergence time for a complex STP topology following a topology change in the network system in the spanning tree protocol (STP) standard, including: receiving, by a root port of a first bridge, a data message that includes identification of a current root bridge and a priority value of the current root bridge; receiving, by a second port of the first bridge, a second data message from a second bridge; and if a message age timer of the first bridge has less than a limiting message age time value remaining before expiry, then blocking a reply, by the second port of the first bridge, to the second data message from the second bridge.
TL;DR: The correctness of STP algorithm is formally verified using Extended Rebeca using a compositional verification approach in order to not to be confined to a specific case or set of cases.
TL;DR: To enable multiple portals in WLAN mesh interworking, a new architecture for mesh portals is proposed to implement all but the port blocking function of IEEE 802.1D bridge; thus allowing bridge protocol data units (BPDUs) to be transparently forwarded inside the mesh network.
Abstract: In this paper we study IEEE 802.11s-based wireless local area network(WLAN) mesh interworking with external LANs. Interworking with multiple mesh portals is necessary not only for network reliability but also for load balancing and increased throughput. In case, however, two or more mesh portals connect the mesh to one external LAN segment, broadcast loops may occur and the IEEE 802.1D bridging protocol may cause the LAN ports of mesh portals to be closed, which results in interworking with the LAN through only one mesh portal. To enable multiple portals in WLAN mesh interworking, we propose a new architecture for mesh portals to implement all but the port blocking function of IEEE 802.1D bridge; thus allowing bridge protocol data units (BPDUs) to be transparently forwarded inside the mesh network. Our proposal is to eliminate the formation of broadcast loops while enabling multiple mesh portals to interwork with the same external LAN segment. This can be achieved by filtering frames at mesh portals making use of new fields we introduce in the portal announcement information element and mesh header so that no frame can be transmitted from a mesh portal to another portal more than once when both mesh portals are connected to the same LAN segment.
TL;DR: A dynamic algorithm named “Dynamic Spanning Tree Recovery” protocol (DSTR protocol) that gives fast recovery from the link failure and at the same time it is allowing the sender to go on with its normal execution.
Abstract: The failure recovery issue in Ethernet technology is becoming more important than it used to earlier, reason being now Ethernet is not restricted to LAN level only. Very widely it is getting used in the MAN level also. So network administrator can't handle if it takes the same time to recover the failure as in the LAN level. This paper presents a dynamic algorithm named “Dynamic Spanning Tree Recovery” protocol (DSTR protocol) that gives fast recovery from the link failure and at the same time it is allowing the sender to go on with its normal execution.