Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
PERF join: an alternative to two-way semijoin and bloomjoin
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
PPP and L2TP: remote access communications
PPP and L2TP: remote access communications
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Load Balancing and Hot Spot Relief for Hash Routing among a Collection of Proxy Caches
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A parameterizable methodology for Internet traffic flow profiling
IEEE Journal on Selected Areas in Communications
The effect of packet reordering in a backbone link on application throughput
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Link Load balancing serves as a useful abstraction for achieving bandwidth aggregation by means of aggregating multiple physical links into a sigle logical link. It is a key component of traffic engineering, link aggregation, and equal cost multi-path routing. Dynamic link load balancing needs schemes that dynamically distribute traffic across multiple paths at a fine granularity without disrupting the packet flows. this distribution should be fair in terms traffic distribution and link usage to ensure effective utilization of the available link capacity. Existing solutions exhibit a tussle between their efficiency in distributing flows uniformly across the links and their ability to avoid packet reordering within a flow. This paper exsmines tha inadequacies and limitations manifested in the existing solutions and introduce a new scalable dynamic load balancing scheme that guarantees with a very high and programmable probability that the heavily loaded link is never assigned a new flow. The porposed method also guarantees that the packets belonging to a flow are never distrubuted among the links, thus avoiding reordering and packet loss.