Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Equal-cost multi-path routing

Known as: ECMP, Equal Cost Multipath Protocol, Equal-cost multipath routing 
In 2014, the Institute of Electrical and Electronics Engineers (IEEE) incorporated Equal Cost Multiple Paths (ECMP) or IEEE standard 802.1Qbp into… Expand
Wikipedia

Related topics

Related topics

6 relations
Channel bondingIEEE 802.1aqMultipath routingRouting
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Traffic engineering in segment routing networks
Abstract Segment routing (SR) has been recently proposed as an alternative traffic engineering (TE) technology enabling relevant… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 4
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Three-Dimensional Bipedal Walking Control Based on Divergent Component of Motion
In this paper, the concept of divergent component of motion (DCM, also called “Capture Point”) is extended to 3-D. We introduce… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Traffic engineering with Equal-Cost-Multipath: An algorithmic perspective
To efficiently exploit network resources operators do traffic engineering (TE), i.e., adapt the routing of traffic to the… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A routing optimization algorithm of equal-cost-multi-paths based on Link Criticality
To effectively avoid congestion and take full advantage of bandwidth inside a network, routing optimization is needed for path… Expand
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2007
2007
Valid inequalities for a shortest-path routing optimization problem
In autonomous systems of the Internet packets are routed on shortest paths to their destinations, for example according to the… Expand
  • figure 1
  • table 1
Is this relevant?
2006
2006
Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing
In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest… Expand
  • figure 1
  • figure 2
Is this relevant?
2006
2006
Traffic Distribution over Equal-Cost-Multi-Paths using LRU-based Caching with Counting Scheme
In order to reduce network congestion and fully use link bandwidth, when there are equal-cost-multi-paths (ECMPs) between a… Expand
  • figure 3
  • figure 1
  • figure 2
  • table 1
  • table 3
Is this relevant?
2004
2004
Traffic distribution over equal-cost-multi-paths
To effectively manage the traffic distribution inside a network, traffic splitting is needed for load sharing over a set of equal… Expand
  • figure 1
  • figure 3
  • figure 6
  • table I
  • figure 7
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Environmental indicator frameworks to design and assess environmental monitoring programs
Monitoring is fundamental to environmental impact assessment (EIA) both to assess adherence to standards and to support… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Analysis of an Equal-Cost Multi-Path Algorithm
Equal-cost multi-path (ECMP) is a routing technique for routing packets along multiple paths of equal cost. The forwarding engine… Expand
  • figure 1
  • figure 2
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE