Internet traffic load balancing using dynamic hashing with flow volume

@inproceedings{Jo2002InternetTL,
  title={Internet traffic load balancing using dynamic hashing with flow volume},
  author={Ju-Yeon Jo and Yoohwan Kim and H. Jonathan Chao and Francis L. Merat},
  booktitle={SPIE ITCom},
  year={2002}
}
Sending IP packets over multiple parallel links is in extensive use in today's Internet and its use is growing due to its scalability, reliability and cost-effectiveness. [] Key Method To overcome these shortcomings, we have enhanced the dynamic hashing algorithm to utilize the flow volume information in order to reassign only the appropriate flows.
Internet Traffic Distribution over Multilink Where High Bandwidth Scalable Switch Port Aggregates Multiple Physical Links
TLDR
The simulation results show that the proposed method, dynamic hashing with flow volume, has the best load balancing performance and minimum impact on TCP throughput.
An Adaptive Load Balancer for Multiprocessor Routers
TLDR
The authors model flow popularity distributions as Zipf-like and prove that for typical Internet traffic, a hashing scheme cannot balance workload statistically, not even in the long run, and develop a novel load-balancing packet scheduler for parallel forwarding systems.
Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing
This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which is detrimental for the
An Efficient Hash-Based Load Balancing Scheme to Support Parallel NIDS
TLDR
HLPN (Hash-based Load balancing scheme suitable for Parallel NIDS) is proposed which satisfies the requirements of load balancing for parallel NIDS and represented 58% better performance in terms of the fairness of the traffic distribution than static hash-based scheme.
Sequence-preserving adaptive load balancers
  • W. Shi, L. Kencl
  • Computer Science
    2006 Symposium on Architecture For Networking And Communications Systems
  • 2006
TLDR
A novel hybrid scheme is demonstrated that combines best of the flow-based and burst-based load balancing techniques and excels in both of the key metrics of flow remapping and packet reordering.
A study on effective hash-based load balancing scheme for parallel NIDS
TLDR
This paper presents a flow based load balancing scheme which reflects characteristics of network traffic and performance of each NIDS node and shows the efficiency and accuracy of analysis increase.
A scalable load balancer for forwarding internet traffic
TLDR
This paper shows how the burstiness in Internet flows can be exploited to improve the performance of the scheduler and proposes a load balancing scheme based on this insight to achieve the scheduling goals.
REPLEX: dynamic traffic engineering based on wardrop routing policies
TLDR
ReplEx is presented, a distributed dynamic traffic engineering algorithm that dynamically changes the proportion of traffic that is routed along each path, exploiting the fact that most underlying routing protocols support multiple equal-cost routes to a destination.
Traffic-adaptive routing
TLDR
ReplEx, an universally applicable distributed algorithm for dynamic routing/traffic engineering, which is based on game theory, is described and it is shown through extensive realistic simulations that ReplEx does not oscillate, and that it achieves performance gains comparable to traditional static traffic engineering.
Load Balancing in IP/MPLS Networks: A Survey
TLDR
This document surveys various techniques proposed for load balancing that are available on the Internet and tries not to be exhaustive but analyze the important techniques in the literature.
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Performance of hashing-based schemes for Internet load balancing
  • Zhiruo Cao, Z. Wang, E. Zegura
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
This first comprehensive study of hashing-based load balancing schemes for distributing traffic over multiple links while preserving the order of packets within a flow finds that hashing using a 16-bit CRC over the five-tuple gives excellent load balancing performance.
Load-sensitive routing of long-lived IP flows
TLDR
A new hybrid approach is introduced that performs dynamic routing of long-lived flows, while forwarding short- lived flows on static preprovisioned paths, which significantly outperforms traditional static and dynamic routing schemes, by reacting to fluctuations in network load without introducing route flapping.
Trading packet headers for packet processing
TLDR
A new technique, source hashing, which can provide O(1) lookup costs at the Data Link, Routing, and Transport layers and is especially powerful when combined with the old idea of a flow ID; the flow identifier allows packet processing information to be cached, and source hashing allows efficient cache lookups.
Load balancing and hot spot relief for hash routing among a collection of proxy caches
  • Kun-Lung Wu, Philip S. Yu
  • Computer Science
    Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003)
  • 1999
TLDR
This work examines an adaptable controlled replication of non-assigned partition objects in each cache server to reduce the load imbalance and relieve the problem of hot-spot references and shows that ACR provides a very effective remedy for load imbalance due to hot- spot references.
Efficient policies for carrying Web traffic over flow-switched networks
TLDR
This work evaluates the processor and switch overheads for transferring HTTP server traffic through a flow-switched network and focuses on the full probability distributions of flow sizes and cost-performance metrics to highlight the subtle influence of the HTTP protocol and user behavior on the performance of flow switching.
Flow identification for supporting per-flow queueing
  • Zhiruo Cao, Z. Wang
  • Computer Science
    Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440)
  • 2000
TLDR
The findings show that, with hashing-based schemes, it is feasible to implement flow identification at high speeds to support hundreds of thousands of flows with resource reservation.
A Reliable and Scalable Striping Protocol
TLDR
It is argued that quasi-FIFO is adequate for most applications, and a simple technique for speedy restoration of synchronization in the event of loss is described.
Controlling high-bandwidth flows at the congested router
TLDR
Red-PD (Random Early Detection-Preferential Dropping) is presented, a mechanism that combines simplicity and protection by keeping state for just the high-bandwidth flows by using the packet drop history at the router to detect high- bandwidth flows in times of congestion and preferentially drops packets from these flows.
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing
TLDR
It is shown that IP flow state in a router can be bounded if the scheduling discipline used has finite memory, and the performance implications of different buffer management strategies in such a system are investigated.
Distributed packet rewriting and its application to scalable server architectures
TLDR
It is shown that DPR provides performance comparable to centralized alternatives, measured in terms of throughput and delay, and enhances the scalability of Web server clusters by eliminating the performance bottleneck exhibited when centralized connection routing techniques are utilized.
...
...