MC-LAG
   HOME

TheInfoList



OR:

A multi-chassis link aggregation group (MLAG or MC-LAG) is a type of
link aggregation group In computer networking, link aggregation is the combining ( aggregating) of multiple network connections in parallel by any of several methods. Link aggregation increases total throughput beyond what a single connection could sustain, and prov ...
(LAG) with constituent ports that terminate on separate chassis, primarily for the purpose of providing redundancy in the event one of the chassis fails. The IEEE 802.1AX-2008 industry standard for link aggregation does not mention MC-LAG, but does not preclude it. Its implementation varies by vendor; notably, the protocol for coordination between chassis is proprietary.


Background

A LAG is a method of
inverse multiplexing An inverse multiplexer (often abbreviated to inverse MUX or IMUX) allows a data stream to be broken into multiple lower data rate communication links. An inverse multiplexer differs from a demultiplexer because the multiple output streams from ...
over multiple Ethernet links, thereby increasing bandwidth and providing redundancy. It is defined by the IEEE 802.1AX-2008 standard, which states, "Link Aggregation allows one or more links to be aggregated together to form a Link Aggregation Group, such that a
MAC Mac or MAC may refer to: Common meanings * Mac (computer), a line of personal computers made by Apple Inc. * Mackintosh, a raincoat made of rubberized cloth * Mac, a prefix to surnames derived from Gaelic languages * McIntosh (apple), a Canadi ...
client can treat the Link Aggregation Group as if it were a single link." This layer 2 transparency is achieved by the LAG using a single
MAC address A MAC address (short for medium access control address or media access control address) is a unique identifier assigned to a network interface controller (NIC) for use as a network address in communications within a network segment. This use i ...
for all the device’s ports in the LAG group. LAG can be configured as either static or dynamic. Dynamic LAG uses a peer-to-peer protocol, called
Link Aggregation Control Protocol In computer networking, link aggregation is the combining ( aggregating) of multiple network connections in parallel by any of several methods. Link aggregation increases total throughput beyond what a single connection could sustain, and prov ...
(LACP), for control. This LACP protocol is also defined within the 802.1AX-2008 standard.


Multi-chassis

MC-LAG adds node-level redundancy to the normal link-level redundancy that a LAG provides. This allows two or more nodes to share a common LAG endpoint. The multiple nodes present a single logical LAG to the remote end. Note that MC-LAG implementations are vendor-specific, but cooperating chassis remain externally compliant to the IEEE 802.1AX-2008 standard. Nodes in an MC-LAG cluster communicate to synchronize and negotiate automatic switchovers in the event of failure. Some implementations may support administrator-initiated switchovers. The diagram here shows four configurations: # Switches A and B are each configured to group four discrete links (as indicated in green) into a single logical link with four times the bandwidth. Standard LACP protocol ensures that if any of the links go down, traffic will be distributed among the remaining three. # Switch A is replaced by two chassis, switches A1 and A2. They communicate between themselves using a proprietary protocol and are thereby able to masquerade as a single virtual switch A running a shared instance of LACP. Switch B is not aware that it is connected to more than one chassis. # Switch B is also replaced by two chassis B1 and B2. If these switches are from a different vendor, they may use a different proprietary protocol between themselves. But virtual switches A and B still communicate using LACP. # Crossing two links to form an X makes no difference logically, any more than crossing links in a normal LAG would. However, physically, it provides much improved fault tolerance. If any of the switches fail, LACP reconfigures paths in as little as a few seconds. Operation continues with paths existing between all sources and destinations, albeit with degraded bandwidth.


Implementations

The following table lists known vendor implementations of MC-LAG, all of which are proprietary.


Alternatives

The link aggregation configuration is superior to
Spanning Tree Protocol The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to prevent bridge loops and the broadcast radiation that results from them. Spanning tree al ...
as the load can be shared across all links during normal operation, whereas Spanning Tree Protocol must disable some links to prevent loops. With Spanning Tree Protocol there is a potential delay when recovering from failure. Link aggregation typically can recover quickly from failure.
IEEE 802.1aq IEEE 802.1aq is an amendment to the IEEE 802.1Q networking standard which adds support for Shortest Path Bridging (SPB). This technology is intended to simplify the creation and configuration of Ethernet networks while enabling multipath ...
(Shortest Path Bridging) is an alternative to MC-LAG that can be used for complex networks.
TRILL TRILL (Transparent Interconnection of Lots of Links) is a networking protocol for optimizing bandwidth and resilience in Ethernet networks, implemented by devices called TRILL switches. TRILL combines techniques from bridging and routing, and ...
(TRansparent Interconnection of Lots of Links) allows
Ethernet Ethernet ( ) is a family of wired computer networking technologies commonly used in local area networks (LAN), metropolitan area networks (MAN) and wide area networks (WAN). It was commercially introduced in 1980 and first standardized in 198 ...
to use an arbitrary
topology Topology (from the Greek language, Greek words , and ) is the branch of mathematics concerned with the properties of a Mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformat ...
, and enables per-flow pair-wise load splitting by way of
Dijkstra's algorithm Dijkstra's algorithm ( ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three ...
without configuration or user intervention.


References

{{DEFAULTSORT:Mc Lag Ethernet Link protocols