The scheduling algorithm of LVS

LVS scheduling algorithm (scheduling method) A total of 10 kinds

one, static method: Only according to the algorithm itself scheduling

1. RR (Round Robin): Polling

2. WRR (werghted Round Robin): Weighted polling

3, SH (source Hashing): Source Address Hash

4, DH (DH): Target Address Hash

Ii. Dynamic Method: Based on the algorithm and the current load status of Rs

1, LC (Least Connection): Minimum connection

Algorithm: overhead=active*256+inactive

Overhead: Minimum load

Active: Active Connection

Inactive: Inactive Connections

The smallest winner in the result

2. WLC (werghted LC): Weighted minimum connection (default algorithm)

Algorithm: overhead= (active*256+inactive)/weight

Weight: Weight

3. SED (shortest Expect delay): Minimum expected latency (improved WLC)

Algorithm: overhead= (active+1) *256/weight

4, NQ (nerver queue): Never queue

5, LBLC (locality-based Least Connection): Minimum local connection based

6, LBLCR (Replicated and locality-based Least Connection): local-based minimum connection with replication

The scheduling algorithm of LVS