Re: Efficiency of link aggregation
- From: anoop <ghanwani@xxxxxxxxx>
- Date: Sun, 3 Aug 2008 11:07:13 -0700 (PDT)
On Aug 2, 9:38 am, Rich Seifert <use...@xxxxxxxxxxxxxxxxxxxxxxx>
wrote:
First, there is no requirement that a hash be used to select a link for
any particular flow. More important, the performance is more dependent
on applications, and not the aggregation method. If two flows are
assigned to separate links, and they can saturate their respective
links, you will get double the throughput of a single link.
That's correct. However the most common, cost effective
implementation is that of using a hash...other mechanisms
would need flow tables and possibly need to maintain state,
which make things more expensive.
Anoop
.
- References:
- Efficiency of link aggregation
- From: anoop
- Re: Efficiency of link aggregation
- From: Rich Seifert
- Efficiency of link aggregation
- Prev by Date: Re: Efficiency of link aggregation
- Next by Date: Re: Efficiency of link aggregation
- Previous by thread: Re: Efficiency of link aggregation
- Next by thread: Re: Efficiency of link aggregation
- Index(es):
Loading