The invention relates to network configuration protocols, and, more particularly, to protocols which enable remote loop detection and allow for isolation of those remote loops.
A computer network typically comprises a plurality of interconnected devices, These devices include any network device, such as a server or end station, that transmits or receives data frames. A common type of computer network is a local area network (“LAN”) which typically refers to a privately owned network within a single building or campus. LANs may employ a data communication protocol, such as Ethernet or token ring, that defines the functions performed by the data link and physical layers of a communications architecture in the LAN. In many instances, several LANs are interconnected by point-to-point links, microwave transceivers, satellite hook-ups, etc. to form a wide area network (“WAN”), that may span an entire country or continent.
One or more intermediate network devices are often used to couple LANs together and allow the corresponding entities to exchange information. For example, a bridge may be used to provide a bridging function between two or more LANs. Alternatively, a switch may be utilized to provide a switching function for transferring information among a plurality of LANs or end stations. In effect, a switch is a bridge among more than 2 networks or entities. The terms “bridge” and “switch” will be used interchangeably throughout this description. Bridges and switches are typically devices that operate at the Data Link layer (“layer 2”) of the Open Systems Interconnection (“OSI”) model. Their operation is defined in the American National Standards Institute (“ANSI”) Institute of Electrical and Electronics Engineers (“IEEE”) 802.1D standard. A copy of the ANSI/IEEE Standard 802.1D, 1998 Edition, is incorporated by referenced herein in its entirety.
Telecommunication traffic among network devices is divided into seven layers under the OSI model and the layers themselves split into two groups. The upper four layers are used whenever a message passes to or from a user. The lower three layers are used when any message passes through the host computer, whereas messages intended for the receiving computer pass to the upper four layers. “Layer 2” refers to the data-link layer, which provides synchronization for the physical level and furnishes transmission protocol knowledge and management.
Networks may be designed using a plurality of distinct topologies—that is the entities in the network may be coupled together in many different ways. Referring to
In
Ring topologies shown in
To prevent looping, one of the paths in the ring is blocked, as shown in
A network may be segregated into a series of logical network segments. For example, any number of physical ports of a particular switch may be associated with any number of other ports by using a virtual local area network (“VLAN”) arrangement that virtually associates the ports with a particular VLAN designation. Multiple ports may thus form a VLAN even though other ports may be physically disposed between these ports.
The VLAN designation for each local port is stored in a memory portion of the switch such that every time a message is received by the switch on a local port the VLAN designation of that port is associated with the message. Association is accomplished by a flow processing element which looks up the VLAN designation in the memory portion based on the local port where the message originated.
Most networks include redundant communications paths so that a failure of any given link or device does not isolate any portion of the network. For example, in the ring networks shown in
To avoid the formation of loops, many network devices execute a “spanning tree algorithm” that allows the network devices to calculate an active network topology which is loop-free (e.g. has a needed number of ports blocked) and yet connects every element in every VLAN within the network. The IEEE 802.1D standard defines a spanning tree protocol (“STP”) to be executed by 802.1D compatible devices (e.g., bridges, switches, and so forth). In the STP, Bridge Protocol Data Units (“BPDUs”) are sent around the network and are used to calculate the loop free network technology.
Other available protocols include that shown and described in now pending NETWORK CONFIGURATION PROTOCOL AND METHOD FOR RAPID TRAFFIC RECOVERY AND LOOP AVOIDANCE IN RING TOPOLOGIES, filed Mar. 4, 2002, Ser. No. 10/090,669 and now pending SYSTEM AND METHOD FOR PROVIDING NETWORK ROUTE REDUNDANCY ACROSS LAYER 2 DEVICES, filed Apr. 16, 2002, Ser. No. 10/124,449. The entirety of these applications are hereby incorporated by reference.
All of the current protocols require devices in a network to be protocol-aware. That is, each device must be able to run and understand the protocol that is globally running in the network. A misconfigured protocol or malfunctioning device could potentially cause a loop that would impact the whole network.
To illustrate this problem, referring to
Therefore, there is a need in the art for a system and method which can detect and isolate remote loops created in another network.
Systems and methods are described for enabling a first network to detect a loop in a second network connected thereto. The first network runs a first instance of a Spanning Tree Protocol and the second network runs either a different instance or no instance. The method includes sending a Remote Loop Detection Packet (“RLDP”) from the ports in bridges of the first network which are connected to the second network. The RLDP includes identifiers such as the source bridge, port and VLAN. The system and method further includes checking for receipt of the RLDP on the same bridge which sent the RLDP. If such a receipt occurs, a loop is detected and one of the ports of the receiving/sending bridge is blocked.
In one aspect of the invention, a method enables a first network to detect a loop in a second network. The second network is connected to the first network. The first network is running a first loop avoidance protocol such a STP. The second network is either running a different instance of a loop avoidance protocol or not running any protocol at all.
The method includes sending a first loop packet from a first port in a bridge running a loop avoidance protocol of the first network. The first loop packet includes a first identifier with a first reference to the first port. The method further includes receiving a second loop packet at the bridge, the second loop packet including a second identifier with a second reference to a second port. The method still further includes decoding the second loop packet to determine the second reference, comparing the second reference with the first reference, and detecting the loop in the second network when the first and second references match.
In another aspect of the invention a system enables a first network to detect a loop in a second network. The second network is communicably coupled to the first network. The first network is running a first loop avoidance protocol instance, the second network is not running the first loop avoidance protocol instance. The system comprises a first network, a bridge in the first network; and a first port in the bridge. The first port sends a first loop packet including a first identifier with a first reference to the first port. The bridge receives a second loop packet, the second loop packet including a second identifier with a second reference to a second port. The bridge further determines the second reference, compares the second reference with the first reference, and detects the loop in the second network when the first and second references match.
In yet another aspect of the invention, a bridge in a first network is communicably coupled to a second network. The first network is running a first loop avoidance protocol instance. The second network is not running the first loop avoidance protocol instance. The bridge comprises a first port. The first port sends a first loop packet including a first identifier with a first reference to the first port. The bridge receives a second loop packet, the second loop packet including a second identifier with a second reference to a second port. The bridge further determines the second reference, compares the second reference with the first reference, and detects a loop in a second network when the first and second references match.
In still yet another aspect of the invention, a computer readable storage medium includes computer executable code for enabling a first network to detect a loop in a second network. The second network is communicably coupled to the first network. The first network is running a first loop avoidance protocol instance. The second network is not running the first loop avoidance protocol instance. The code performs the steps of sending a first loop packet from a first port in a bridge of the first network, the first loop packet including a first identifier with a first reference to the first port. The code further performs receiving a second loop packet at the bridge, the second loop packet including a second identifier with a second reference to a second port. The code determines the second reference, compares the second reference with the first reference and detects the loop in the second network when the first and second references match.
In yet another aspect of the invention, a system enables a first network to detect a loop in a second network. The second network being communicably coupled to the first network. The first network running a first loop avoidance protocol instance, the second network not running the first loop avoidance protocol instance. The system comprises a first network and a plurality of bridges in the first network. The system further comprises a plurality of ports, at least one port for each of the bridges. Each port connected to the second network sends a respective first loop packet including a first identifier with a first reference to the respective port. Each bridge receives a respective second loop packet, each second loop packet including a respective second identifier with a respective second reference to a respective second port. Each respective bridge further determines the respective second reference, compares the respective second reference with the respective first reference, and detects a loop in the second network when the respective first and respective second references match.
Still yet another aspect of the invention is a method for enabling a first network to detect a loop in a second network communicably coupled to the first network. The first network is running a first loop avoidance protocol instance. The second network is not running the first loop avoidance protocol instance. The method comprises running a second protocol in the first network to detect a loop in the second network and protecting the first network when a loop is detected in the second network.
Yet still another aspect of the invention is a system for enabling a first network to detect a loop in a second network communicably coupled to the first network. The system comprises a first network running a first loop avoidance protocol instance. A second network is not running the first loop avoidance protocol instance. The first network runs a second loop avoidance protocol instance to detect for a loop in the second network. The first network further protects the first network when a loop is detected in the second network.
Still yet another aspect of the invention is a system comprising a first network running a first loop avoidance protocol instance. A second network is communicably coupled to the first network. The second network is not running the first loop avoidance protocol instance and has a loop. The first network is protected from the loop in the second network.
a is a flow chart detailing some of the functioning of the invention.
As stated above, it is not possible to assure that all network administrators adhere to their task of running a STP or that all network devices operate properly. It is therefore desirable to be able to isolate a first network from other networks coupled thereto in case a loop occurs. For example, in L2 metro provider cases, a network in San Jose should not be brought down because a network administrator in San Francisco forgot to enable STP or other loop avoidance protocol on his switches or because a device or other failure in San Francisco caused STP.
Referring now to
The RLDP allows for any switch in network 100 to remotely monitor any network connected to its ports. Upon detection of a loop in the remote network, the RLDP takes administrative action (discussed below) to block ports connected to the remote network with the loop. As shown in
Switch 104 is shown in a blow up 120 in
When the RLDP is enabled on a port of a switch, that port generates RLDP packets which are sent out at a constant interval—for example 0.1 seconds—which may be changed by the operator. The RLDP packets include unique information discussed below. The packets are L2 multicast packets with a MAC address of 0x030480000102. The packets are sent from ports in a VLAN where the RLDP is enabled and follow the tag mode of the particular port. If the port is tagged to a VLAN, an IEEE 802.1Q tag is added to the packet between the Media Control Access (“MAC”) address and the data portion of the packet.
Exemplary contents of a RLDP packet are shown immediately below:
Referring now to
The action taken by the RLDP includes blocking a data path either on the port 144 sending the RLDP packet or the port 142 that received the RLDP packet. The default option is that the RLDP will block the port that receives the RLDP packets. Such a situation is shown in
However, referring again to
The RLDP software continues to send and receive RLDP packets on ports that are in the blocking state. No other data is received because the port is in a blocked state. However, the RLDP packets are still received so that the switch knows when the loop is fixed. Continuing with the example shown in
Referring now to
Assuming that a RLDP packet has been received, at step S4, the RLDP decodes the bridge identifier received in the packet. At step S6, the RLDP determines whether the bridge identifier in the received RLDP packet matches the bridge identifier of the particular bridge. If the identifiers do not match, the frame in the RLDP packet is flooded to the applicable ports in the VLAN in step S14 and control branches back to step S1. If the bridge identifiers do match, control branch to step S8 where the VLAN and port IDs are decoded from the received RLDP packet.
Control then branches to step S10, where the RLDP software determines whether the RLDP program is running on the decoded port and VLAN. If the program is not running, control branches to step S12 where the frame is dropped because presumably there is a log error and then control branches back to step S1. If the program is running on the decoded port and VLAN, control branches to step S16 where the RLDP software determines whether the block receive mode is enabled. The block receive mode dictates whether the port sending RLDP packets or the port which received the RLDP packet should be blocked. If this mode is enabled, control branches to step S21 where the RLDP determines whether the receiving port is already blocked. If it is, control branches to step S1. If not, control branches to step S22 and the port which received the RLDP packet is blocked. If the blocking mode is not enabled at step S16, control branches to step S19 where the RLDP determines whether the port whose ID is in the received RLDP packet is blocked. If it is, control branches to step S1. If not, control branches to step S18 where the port whose ID is in the received RLDP packet is blocked. After either steps S18 or S22, control branches to step S20 where the current time is marked as the last time a RLDP packet was received and control branches back to S1.
Referring back to step S24, where the RLDP determines whether any port is blocked. If no port is blocked, control branches back to step S1. If a port is blocked, control branches to step S26 where the RLDP queries whether the current time minus the last time a RLDP packet was received is greater than or equal to the per port waiting time for the blocked port. If the answer is no, control branches to step S1. If the answer is yes, control branches to step S28 and the blocking port is set to a forwarding port and then control branches back to step S1.
Referring to
If the answer to the query at step S11 is yes, then control branches to step S15 where the RLDP queries whether the receiving port ID is less than or equal to the sending port ID. If the answer is yes, control branches to step S19 as discussed above. If the answer is no, control branches to step S21 as discussed above. Clearly, the decision made in step S15 could be effectuated using the port with a higher ID or any other method which ensures that one port is blocked even if more than one port receives a RLDP packet indicating a loop. Whatever method is chosen, such method will override any customer configuration.
Referring to
Thus, by broadcasting a unique packet from each port which includes an identifier of that port, determining whether packets received at a particular port include the identifier for the port, and blocking ports based on this determination, a system and method for isolating remote loops is achieved.
While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
5761435 | Fukuda et al. | Jun 1998 | A |
5878232 | Marimuthu | Mar 1999 | A |
5959968 | Chin et al. | Sep 1999 | A |
6163543 | Chin et al. | Dec 2000 | A |
6202114 | Dutt et al. | Mar 2001 | B1 |
6204114 | Clampitt et al. | Mar 2001 | B1 |
6304575 | Carroll et al. | Oct 2001 | B1 |
6628624 | Mahajan et al. | Sep 2003 | B1 |
6628661 | Goldman et al. | Sep 2003 | B1 |
6697339 | Jain | Feb 2004 | B1 |
6717922 | Kamat et al. | Apr 2004 | B2 |
6766482 | Yip et al. | Jul 2004 | B1 |
6795403 | Gundavelli | Sep 2004 | B1 |
6937576 | Di Benedetto et al. | Aug 2005 | B1 |
6985449 | Higashiyama | Jan 2006 | B2 |
7003705 | Yip et al. | Feb 2006 | B1 |
7126923 | Yang et al. | Oct 2006 | B1 |
7154861 | Merchant et al. | Dec 2006 | B1 |
7209435 | Kuo et al. | Apr 2007 | B1 |
7286491 | Smith | Oct 2007 | B1 |
20020154606 | Duncan et al. | Oct 2002 | A1 |
20020181413 | Kitagawa | Dec 2002 | A1 |
20030142680 | OPguchi | Jul 2003 | A1 |
20030169694 | Seaman | Sep 2003 | A1 |
20030223379 | Yang et al. | Dec 2003 | A1 |
20040081171 | Finn | Apr 2004 | A1 |
20040255050 | Takehiro et al. | Dec 2004 | A1 |
20050013260 | Ramanathan et al. | Jan 2005 | A1 |
20050259597 | Benedetto et al. | Nov 2005 | A1 |
20060206656 | Di Benedetto et al. | Sep 2006 | A1 |
20060233186 | Portolani et al. | Oct 2006 | A1 |