Weighted HRW and its applications
draft-mohanty-bess-weighted-hrw-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2020-03-14 (latest revision 2019-09-11) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-mohanty-bess-weighted-hrw-01.txt
Abstract
Rendezvous Hashing also known as Highest Random Weight (HRW) has been used in many load balancing applications where the central problem is how to map an object to as server such that the mapping is uniform and also minimally affected by the change in the server set. Recently, it has found use in DF election algorithms in the EVPN context and load balancing using DMZ. This draft deals with the problem of achieving load balancing with minimal disruption when the servers have different weights. It provides an algorithm to do so and also describes a few use-case scenarios where this algorithmic technique can apply.
Authors
satyamoh@cisco.com
(satyamoh@cisco.com)
mankamana mishra
(mankamis@cisco.com)
Acee Lindem
(acee@cisco.com)
Ali Sajassi
(sajassi@cisco.com)
John Drake
(jdrake@juniper.net)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)