COMPARISON OF HASH STRATEGIES FOR FLOW-BASED LOAD BALANCING

Abstract

Hashing is powerful tool and widely used for flow-based load balancing scheme in parallel processing. In this paper, we analyze and compare computing overhead and load dispersion characteristics of hash strategies using XOR and CRC operations under four hashing keys schemes (from 2-tuple to 5-tuple). We conduct experiments with a real-life 24-hour network traffic repository. The results show that XOR32 has the lowest computing overhead among all hash function groups. Moreover, XOR32 with 4-tuple and XOR32 with 5-tuple are the two outstanding strategies that provide very smooth distribution of traffic across multiple links thus balancing the load for flow-based applications.

To cite this document: Surasak Sanguanpong, Witsarut Pittayapitak, and Kasom Koht-Arsa, "Comparison of hash strategies for flow-based load balancing", International Journal of Electronic Commerce Studies, Vol.6, No.2, pp.259-268, 2015.

Permanent link to this document:
http://dx.doi.org/10.7903/ijecs.1346