Mechanisms for Optimizing Link Aggregation Group (LAG) and Equal-Cost Multipath (ECMP) Component Link Utilization in Networks

نویسندگان

  • Ram Krishnan
  • Lucy Yong
  • Anoop Ghanwani
  • Ning So
  • Bhumip Khasnabish
چکیده

Demands on networking infrastructure are growing exponentially due to bandwidth-hungry applications such as rich media applications and inter-data-center communications. In this context, it is important to optimally use the bandwidth in wired networks that extensively use link aggregation groups and equal-cost multipaths as techniques for bandwidth scaling. This document explores some of the mechanisms useful for achieving this.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks

This paper compares the efficiency of different routing and resilience mechanisms to avoid congestion in a network for a set of protected failures. A routing mechanism is more efficient than another one if it achieves a lower maximum link utilization in the same networking scenario. With resilience requirements, the maximum link utilization over the set of protected failure scenarios becomes th...

متن کامل

An efficient algorithm to enable path diversity in link state routing networks

1389-1286/$ see front matter 2010 Elsevier B.V doi:10.1016/j.comnet.2010.11.005 ⇑ Corresponding author. E-mail addresses: [email protected] [email protected] (P. Francois), olivier.bonav (O. Bonaventure), [email protected] (S. Cateloin (J.-J. Pansiot). Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the n...

متن کامل

Traffic Engineering with ECMP: An Algorithmic Perspective

To efficiently exploit network resources operators do traffic engineering (TE), i.e., adapt the routing of traffic to the prevailing demands. TE in large IP networks typically relies on configuring static link weights and splitting traffic between the resulting shortest-paths via the Equal-Cost-MultiPath (ECMP) mechanism. Yet, despite its vast popularity, crucial operational aspects of TE via E...

متن کامل

Trimming the Multipath for Efficient Dynamic Routing

Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do so to load balance the network. In this paper, we consider multipath routing with only a limited number of end-to-end paths for each source and destination,...

متن کامل

DiFS: Distributed Flow Scheduling for Data Center Networks

Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath (ECMP) use static flow-to-link assignment, which is loadoblivious. They may cause bandwidth loss due to flow collisions on a same link. Recently proposed ce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RFC

دوره 7424  شماره 

صفحات  -

تاریخ انتشار 2015