Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,301 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Channel bonding
IEEE 802.1aq
Multipath routing
Routing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
VLCcube: A VLC Enabled Hybrid Network Structure for Data Centers
Lailong Luo
,
Deke Guo
,
Jie Wu
,
Ting Qu
,
Tao Chen
,
Xueshan Luo
IEEE Transactions on Parallel and Distributed…
2017
Corpus ID: 6131413
Recent results have made a promising case for offering oversubscribed wired data center networks (DCN) with extreme costs. Inter…
Expand
2012
2012
On popularity-based load balancing in content networks
Tomasz Janaszka
,
Dariusz Bursztynowski
,
M. Dzida
International Test Conference
2012
Corpus ID: 17840660
The paper investigates the use of multipath routing and load balancing in content oriented architectures proposed for the next…
Expand
2010
2010
A routing optimization algorithm of equal-cost-multi-paths based on Link Criticality
Ming Tian
,
J. Lan
,
Xuan-yong Zhu
,
Jian-mei Huang
American Control Conference
2010
Corpus ID: 15672525
To effectively avoid congestion and take full advantage of bandwidth inside a network, routing optimization is needed for path…
Expand
2010
2010
Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks
D. Hock
,
Matthias Hartmann
,
M. Menth
,
Christian Schwartz
IEEE/IFIP Network Operations and Management…
2010
Corpus ID: 462904
Intradomain routing in IP networks follows shortest paths according to administrative link costs. When several equal-cost…
Expand
2010
2010
Study on electrochemical mechanical polishing process of copper circuit on PCB
N. Kulyk
,
C. An
,
+4 authors
C. Chung
2010
Corpus ID: 86865074
As an alternative to conventional chemical mechanical polishing (CMP) for the planarization of copper layers on electronic…
Expand
2009
2009
NetShare: Virtualizing Bandwidth within the Cloud
T. Lam
,
G. Varghese
2009
Corpus ID: 59045669
We present NetShare, a way of dividing a network into slices, such that that each network slice has the illusion of a network all…
Expand
2007
2007
Valid inequalities for a shortest-path routing optimization problem
A. Tomaszewski
,
M. Pióro
,
M. Dzida
,
M. Mycek
,
M. Zagozdzon
2007
Corpus ID: 73532871
In autonomous systems of the Internet packets are routed on shortest paths to their destinations, for example according to the…
Expand
2006
2006
Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing
M. Dzida
,
M. Zagozdzon
,
M. Pióro
,
A. Tomaszewski
International Conference on Transparent Optical…
2006
Corpus ID: 18816992
In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest…
Expand
Review
2005
Review
2005
Cu planarization for ULSI processing by electrochemical methods: a review
I. Suni
,
Bing Du
IEEE transactions on semiconductor manufacturing
2005
Corpus ID: 31192306
The planned introduction of porous, low-k dielectric materials into Si-based semiconductor devices will provide substantial…
Expand
2002
2002
Estructura factorial y propiedades de la Escala de Comportamientos para Madres y Padres con Niños Pequeños (ECMP)
R. P. Solís-Cámara
,
M. D. Romero
,
Y. Cuevas
,
Lorena Jiménez
,
Hazel Montejano García
,
Alma Tiscareño López
2002
Corpus ID: 142594959
Factor Structure and Properties of a Measure of Parenting Young Children (ECMP). This stud y analyzes the factor structure of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE