To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Equal-cost multi-path routing

From Wikipedia, the free encyclopedia

ECMP animation using IEEE 802.1aq 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.[1]

YouTube Encyclopedic

  • 1/3
    Views:
    553
    10 113
    1 505
  • Load Balancing Equal Cost Multi-Path (ECMP) Static Routing Packet Tracer
  • Routes That Must Win Twice | Cisco CCNA 200-301
  • SR-TE - Segment Routing - Path Computation Element (SR-PCE) - Introduction

Transcription

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.[2]

See also

References

  1. ^ Multipath Issues in Unicast and Multicast Next-Hop Selection. doi:10.17487/RFC2991. RFC 2991. Retrieved 16 December 2013.
  2. ^ Analysis of an Equal-Cost Multi-Path Algorithm. doi:10.17487/RFC2992. RFC 2992.

External links

This page was last edited on 5 October 2023, at 01:32
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.