An ethernet link aggregation algorithm
This study proposes an algorithm that will dynamically select and distribute the traffic of communicating hosts across multiple links available in a link aggregation system to optimize the use of aggregated links and minimize the occurrence of dropped packets. With the proliferation of bandwidth hun...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2002
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3027 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This study proposes an algorithm that will dynamically select and distribute the traffic of communicating hosts across multiple links available in a link aggregation system to optimize the use of aggregated links and minimize the occurrence of dropped packets. With the proliferation of bandwidth hungry applications, current network installations are having a hard time of coping up with the bandwidth requirements. A new set of networking technology equipment has to be deployed to support these applications. Even with the availability of higher bandwidth networks, it will still take time for companies to deploy these new technologies in their network. An interim solution has been devised which combines multiple network links to function as one and provides a global aggregated bandwidth from the individual links. Current existing systems provide a set of communicating hosts, which are communicating across a network, the maximum bandwidth of a single link. Whenever the traffic being serviced by each link exceeded its capacity, they start to drop packets. |
|---|