Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
1998-08-28
2001-07-17
Olms, Douglas (Department: 2732)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S254000, C370S401000
Reexamination Certificate
active
06262977
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to network protocols and network intermediate devices executing such protocols; and more particularly to algorithms for managing a tree of network devices for a data network according to a spanning tree protocol.
2. Description of Related Art
Local area networks LANs specified according to IEEE Standards for Local and Metropolitan Area Networks under section 802.x of all types may be connected together with media access control MAC bridges. Bridges interconnect LAN segments so that stations connected to the LANs operate as if they were attached to a single LAN for many purposes. Thus a bridged local area network provides for interconnection of stations attached to LAN segments of different MAC types, for an increase in the physical extent, the number of permissible attachments and the total performance of a LAN, and for the partitioning of physical LAN support for administrative or maintenance reasons. The MAC bridge is specified according to the IEEE standard 802.1D (IEEE Std 802.1D-1990, IEEE Standards for Local and Metropolitan Area Networks: Media Access Control (MAC) Bridges.)
When a bridged network is established, it is possible to create loops in the network by providing more than one path through bridges and LAN segments between two points. Thus, according to the 802.1D standard, an active topology for the bridged network is maintained according to the spanning tree protocol which is described in the standard. The spanning tree protocol automatically establishes a fully connected (spanning) and loop-free (tree) bridged network topology. It uses a distributed algorithm that selects a root bridge and the shortest path to that root from each LAN. Tie breakers are used to ensure that there is a unique shortest path to the root, while uniqueness of the root is guaranteed by using one of its MAC addresses as part of a priority identifier.
Every LAN in the network has one and only one “designated port” providing that LANs shortest path to the root, through the bridge of which the designated port is a part. The bridge is known as the designated bridge for that LAN.
Thus, bridges other than the root bridge at the root of the network can be termed a branch bridge. Every branch bridge has a “root port” which is the port providing that bridge's shortest path to the root. Ports other than the root port are designated ports, or alternate ports according to the standard. An alternate port is connected to a LAN that for which another bridge is the designated bridge, and is placed in a blocking state so that frames are not forwarded through that port.
The frame forwarding path through any bridge is thus between its root port and designated ports. When spanning tree information has been completely distributed and is stable, this connectivity will connect all of the LANs in a loop free tree.
When a bridge first receives spanning tree information that dictates new connectivity through that bridge, it does not establish the new connectivity immediately. Ports that were connected previously as either the root port or a designated port, but are no longer to be connected, are immediately made blocking. However the transition to a forwarding state of ports that were previously not connected in a forwarding role is delayed. The delay serves two purposes:
(a) Frames forwarded on the previous topology may still be buffered by bridges in the network. Thus an instantaneous bridge to the new topology can cause these to be forwarded back to their LAN of origin, causing duplication of the frame once.
(b) New spanning tree information in the network may not have been filly distributed yet. Thus an immediate change to a new topology may cause temporary loops. These loops could generate high traffic volumes, disrupting end stations, causing frame loss in bridges, and possibly delaying the propagation of spanning tree information further.
The first of these two reasons (a), is far less important than it once was, since the protocols prevalent on LANs today deal with immediately duplicated frames. Some old implementations of LLC type 2 will reset connection under these circumstances, but they are no longer in wide spread deployment. Thus the issue presented by reason (a) is less important.
Reason (b) continues to be a fundamental to the spanning tree configuration.
According to the spanning tree protocol of the standard, each port on a bridge can assume a blocking state in which frames are not forwarded through the port, a forwarding state in which frames are forwarded through the port. For a transition from the blocking state to the forwarding state, the protocol requires the port to proceed through transitional states referred to as the listening state and the learning state. In the listening state, the port is preparing to participate in frame relay, however frame relay is temporarily disabled to prevent temporary loops. In the listening state, the port monitors bridge protocol data unit (BPDU) frames or other information related to the topology in the network for an interval referred to as the forward delay timer. If no information is received which causes a change in state of the port before expire of the forward delay timer, then the port transitions to the learning state.
In the learning state, the port continues to prepare for participation in frame relay. The relay is temporarily disabled to prevent loops. In this state, in addition to monitoring BPDU frames and other information related to operation of the spanning tree algorithm, the port learns information about end stations that are accessible through the port for use in the forwarding of frames once the frame enters the forwarding state. Upon expiration of the forward delay timer in the learning state, if no better information about the protocol is received, then the port assumes the forwarding state. Thus, the transition from a blocking state to the forwarding state takes two times the forward delay timer interval. From the time of detection of a change in topology causing a transition from the blocking to the forwarding state, until the time in which the forwarding state is assumed can be a significant amount of time, as much as 20 to 50 seconds in some cases.
For background information consider bridge initialization, the addition of a link, and link failure situations according to the spanning tree protocol.
On bridge initialization, the bridge becomes the Root (with root path cost of zero). The root port identity stored by the bridge is reserved (value 0). All the ports on the bridge become designated ports for the respective segments and go through the transition (blocking→listening→learning) before they start forwarding data packets. A BPDU is generated on all the connected ports with the advertising bridge as the root as well as designated bridge and with the transmitting port as the designated port for the segment.
On each segment, if the advertising bridge is the highest priority (higher priority than that recorded as the designated root by the receiving port), the receiving port updates the root and designated bridge information (the root bridge, root path cost, designated bridge, and designated port) and starts the message age timer. The root information (the root bridge and root path cost) is updated on the receiving bridge. The designated ports are selected next relative to the new root information. The designated ports should remain designated and update their root and designated bridge information while some blocked ports might become designated now as a result of receiving information from a higher priority bridge. The blocked ports go through the transition (blocked→listening→learning) before they start forwarding data packets. If this new information is heard on the root port by a receiving bridge, it generates a configuration BPDU to be sent out on all the designated ports with the new root information. This way new root information is propagated along all branches of spanning tree and after a while all the bridges
Jain Vipin K.
Seaman Michael John
3Com Corporation
McDonnell & Boehnen Hulbert & Berghoff
Olms Douglas
Vanderpuye Ken
LandOfFree
High availability spanning tree with rapid reconfiguration does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with High availability spanning tree with rapid reconfiguration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High availability spanning tree with rapid reconfiguration will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2468290