Equal-cost multi-path routing

packet routing strategy

Uses your system voice; voice and rate in settings.

Q5367790Snapshot

≈ 2 min read

Names in other languages

  • EnglishEqual-cost multi-path routing
  • FrançaisEqual-cost multi-path routing
  • ItalianoEqual-cost multi-path routing
  • 中文等價多路徑路由
  • 简体中文等价多路径路由
  • 繁體中文等價多路徑路由
  • 中文等價多路徑路由
  • 한국어ECMP

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

protocol Equal-cost multi-path routing (ECMP) is a routing strategy where packet forwarding to a single destination can occur over multiple best paths with equal routing priority. Multi-path routing can be used in conjunction with most routing protocols because it is a per-hop local decision made independently at each router.

It can substantially increase bandwidth by load-balancing traffic over multiple paths; however, there may be significant problems in deploying it in practice.

History

Load balancing by per-packet multipath routing was generally disfavored due to the impact of rapidly changing latency, packet reordering and maximum transmission unit (MTU) differences within a network flow, which could disrupt the operation of many Internet protocols, most notably TCP and path MTU discovery. RFC 2992 analyzed one particular multipath routing strategy involving the assignment of flows through hashing flow-related data in the packet header.

This solution is designed to avoid these problems by sending all packets from any particular network flow through the same path while balancing multiple flows over multiple paths in general.

See also

Link aggregation Shortest Path Bridging establishes multiple forward and reverse paths on Ethernet networks. Source routing TRILL enables per flow pair-wise load splitting without configuration and user intervention.

Etutorials: Equal-Cost Multi-Path (ECMP) Routing Paris-Traceroute: traceroute for ECMP networks Dublin-Traceroute: NAT-aware traceroute for ECMP networks Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective

Text derived from https://en.wikipedia.org/w/index.php?oldid=1321490376 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot equal-cost-multi-path-routing-611261-f8a9c716e55af7dd · hash f8a9c716e55af7dd4fc93fcebb33e283c06afe28d577deb56682871de9c0154e · captured 2025-11-10 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Equal-cost multi-path routing”, snapshot equal-cost-multi-path-routing-611261-f8a9c716e55af7dd. https://encyclopegia.org/a/equal-cost-multi-path-routing

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.