The present disclosure relates generally to wide area networks and more particularly to Ethernet wide area networks and methods.
Ethernet (IEEE 802.1D(2)) is the technology that dominates the local area networking market. As a result this technology is inexpensive and well known by most users. There has been an interest in using Ethernet technology for wide area networks. Unfortunately the technology purposefully has a number of built-in limitations. For instance, IEEE 802.1D(2) limits the maximum diameter as seven hubs. When the number of hubs exceeds the maximum diameter, the topology updates sent using BPDU (Broadcast Protocol Data Units) packets may never reach their intended nodes. As a result, such nodes may become isolated even though they are physically connected to the network. Another problem arises due to the MAC (Medium Access Control) address awareness requirements. Each bridge node in a spanning tree must be aware of all the MAC addresses and their locations in the spanning tree. In a wide area network (WAN) this results in the storage of huge numbers of MAC addresses and becomes technically and economically infeasible for large WANs. Thus there exists a need for an Ethernet wide area network and method that overcomes these limitations.
An Ethernet wide area network has a number of interconnected network Ethernet switches. A first local area network has a first local area Ethernet switch and is connected to one of the interconnected network Ethernet switches. A second local area network has a second local area Ethernet switch connected to a second of the interconnected network Ethernet switches. The network Ethernet switches include a translation table from a network address to a MAC address. This table allows for translation between network addresses and MAC addresses and this reduces the size of the spanning tree.
After the root node discovers its maximum diameter, the value is recorded at the root node and can propagate to all other bridge nodes on a request basis. The maximum diameter discovery algorithm may be executed periodically depending on the frequency of the network topology changes. In another embodiment, a timer governs the frequency of the execution of this algorithm. In another embodiment, the algorithm is executed every time the spanning tree is recalculated or any new bridge node participates in the bridged network. A delay timer postpones this discovery execution until the spanning tree converges in one embodiment. This avoids unnecessary overload of broadcast traffic on the network. The same diameter discovery algorithm is executed in the WAN to determine the diameter of the WAN.
Any node may request the root node to provide the maximum network diameter via a simple inquiry protocol. A bridge node receives a BPDU propagated from the root bridge that has the root bridge address. A specific inquiry PDU is formed to learn the maximum diameter information from the root. This PDU has a protocol identifier that signals the root of the inquiry and a bridge identifier that identifies the initiating bridge node. The return PDU answers the maximum diameter and forwards it to the originating bridge node of the inquiry.
At each WAN service interface, the maximum diameter of the connecting LAN must be registered with the WAN. The service interface, which behaves as a virtual bridge node, should trigger the diameter discovery with the root node in LAN.
The service interface is responsible to relay and respond to the root node the diameter of the virtual bridge that represents the WAN transparent LAN services. All service interfaces should have updated diameters of the connected LANs. Each service interface may request the diameter from the WAN.
The virtual bridge diameter calculation is based on the following set of parameters according to IEEE 802.1D and IEEE 802.1w: WAN diameters; near-end LAN maximum diameter; far-end LAN diameters; default hello time; maximum bridge transit delay; maximum BPDU transmission delay; maximum message age increment overestimate; and default hold time.
The local address translation function involves mapping a MAC address to a network address (e.g., IP address).
The root node non-competition function is a function that selects a MAC address of a service interface connected to a LAN root node to have a lower priority than the root node.
The translation table is a mapping between a MAC address to a network address (e.g., IP address).
The MAC address re-mapping function includes replacing a source host MAC address at a service interface with an ingress service interface MAC address for an inbound packet. Note an inbound packet is a packet headed from a LAN to the WAN. The MAC address re-mapping function further includes replacing an egress service interface MAC address with a destination host MAC address. This re-mapping function reduces the number of required MAC address that need to be learned. The re-mapping requires the network address of the destination in order to perform the re-mapping.
Thus there has been described an Ethernet wide area network and method that overcomes the limitation that do not allow nationwide or international Ethernet networks. In addition the invention overcomes the size limitations for Ethernet networks.
The methods described herein can be implemented as computer-readable instructions stored on a computer-readable storage medium that when executed by a computer will perform the methods described herein.
While the invention has been described in conjunction with specific embodiments thereof, it is evident that many alterations, modifications, and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended to embrace all such alterations, modifications, and variations in the appended claims.
This patent arises from a continuation of U.S. patent application Ser. No. 11/359,822, which was filed on Feb. 22, 2006 (now U.S. Pat. No. 7,633,951) and is a continuation of U.S. patent application Ser. No. 10/141,370, which was filed on May 8, 2002 (now U.S. Pat. No. 7,046,671). Both U.S. patent application Ser. Nos. 11/359,822 and 10/141,370 are hereby incorporated by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5426637 | Derby et al. | Jun 1995 | A |
5430728 | Narayanan et al. | Jul 1995 | A |
5436902 | McNamara et al. | Jul 1995 | A |
5796727 | Harrison et al. | Aug 1998 | A |
5818619 | Medved et al. | Oct 1998 | A |
5818842 | Burwell et al. | Oct 1998 | A |
5917820 | Rekhter | Jun 1999 | A |
5936963 | Saussy | Aug 1999 | A |
5978373 | Hoff et al. | Nov 1999 | A |
6047325 | Jain et al. | Apr 2000 | A |
6061728 | Mead et al. | May 2000 | A |
6141126 | Lahat et al. | Oct 2000 | A |
6151635 | Bare | Nov 2000 | A |
6178462 | Bass et al. | Jan 2001 | B1 |
6181695 | Curry et al. | Jan 2001 | B1 |
6222848 | Hayward et al. | Apr 2001 | B1 |
6226296 | Lindsey et al. | May 2001 | B1 |
6337863 | Nair et al. | Jan 2002 | B1 |
6343330 | Khanna et al. | Jan 2002 | B1 |
6389023 | Matsuzawa et al. | May 2002 | B1 |
6424650 | Yang et al. | Jul 2002 | B1 |
6442610 | Khanna et al. | Aug 2002 | B1 |
6490292 | Matsuzawa | Dec 2002 | B1 |
6577631 | Keenan et al. | Jun 2003 | B1 |
6591303 | Hendel et al. | Jul 2003 | B1 |
6603769 | Thubert et al. | Aug 2003 | B1 |
6704326 | Russell et al. | Mar 2004 | B2 |
6847620 | Meier | Jan 2005 | B1 |
7064671 | Vanderah et al. | Jun 2006 | B2 |
7633951 | Chang et al. | Dec 2009 | B2 |
7697549 | Eran | Apr 2010 | B2 |
20020027906 | Athreya et al. | Mar 2002 | A1 |
20020101868 | Clear et al. | Aug 2002 | A1 |
20020101875 | Lui et al. | Aug 2002 | A1 |
20030131105 | Czeiger et al. | Jul 2003 | A1 |
20050257039 | Marshall | Nov 2005 | A1 |
20060039321 | Thawani et al. | Feb 2006 | A1 |
20070002833 | Bajic | Jan 2007 | A1 |
20070204021 | Ekl et al. | Aug 2007 | A1 |
20080240106 | Schlenk | Oct 2008 | A1 |
20100165968 | Shpak | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
0 603 100 | Jun 1994 | EP |
WO03096591 | Nov 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20100103944 A1 | Apr 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11359822 | Feb 2006 | US |
Child | 12605117 | US | |
Parent | 10141370 | May 2002 | US |
Child | 11359822 | US |