wlc edu

/default/send_redirects#注意区分网卡名字, the Amin two NICs are ENS33 and ENS37, respectively.echo 0 >/proc/sys/net/ipv4/conf/ens33/send_redirectsecho 0 >/proc/sys/net/ipv4/conf/ens37/send_redirects#director setting up a NAT firewallIptables-t nat-fIptables-t Nat-xIptables-t nat-a postrouting-s 192.168.133.0/24-j Masquerade#director设置ipvsadmIpvsadm= '/usr/sbin/ipvsadm '$IPVSADM-C$IPVSADM-A-T 192.168.142.147:80-s wlc-p 3$IPVSADM-T 192.168.142.147:80-r 192.168.

" scheduling algorithm can be used to balance the load well.4. Weighted minimum link (Weighted leastconnections) (WLC)In the case of the server performance difference in the cluster system, the scheduler uses the "Weighted least link" scheduling algorithm to optimize the load balancing performance, and the server with higher weights will bear a large proportion of active connection load. The scheduler can automatically inquire about the load of the re

respond to the client, no longer through the Director (4). Port mapping is also not supported in this model (5). Realserver only operating systems that support IP tunneling Three. LVs scheduling Method LVs Scheduling methods: 1.Fixed scheduling method for static adjustment of clothes (1). RR Polling (2). WRR Weighted Polling (3). DH Target Address Hash (4). SH Source Address Hash Method of dynamic adjustment

original address hash: Extract the User IP, according to the hash function to draw a key, and then according to the static mapping table, investigate the corresponding value, that is, target server IP. If the target machine is overloaded, it returns empty. 4, DH target address hash: Ditto, only now extract is the destination address IP to do the hash. Advantages: Both of the above algorithms can achieve the same user access to the same server. 5, LC Minimum connection. Prioritize requests to se

as the keyword to obtain the required RS Sh Source Address Hash Dispatch (source Hashing) finds a static hash table with the source address as a keyword to obtain the required RS Lc The minimum number of connections is dispatched (Least-connection), and the Ipvs table stores all active connections. Send a new connection request to the smallest current number of connections RS Wlc Weighted minim

algorithm can be used to balance the load well.4. Weighted Least link (Weighted Least Connections) (WLC) In the case of large differences in server performance in a clustered system, the scheduler uses a " weighted least-link" scheduling algorithm to optimize load-balancing performance, and servers with higher weights will withstand a large proportion of active connection loads. the scheduler can automatically inquire about the load real server adj

connection" scheduling algorithm can be used to balance the load well.4. Weighted minimum link (Weighted Least Connections) (WLC)In the case of the server performance difference in the cluster system, the scheduler uses the "Weighted least link" scheduling algorithm to optimize the load balancing performance, and the server with higher weights will bear a large proportion of active connection load. The scheduler can automatically inquire about the lo

inactive connections. It uses active connections * 256 + inactive connections as overhead connections.Who is the child of overhead?, To whom However, the inactive connection also affects the connection. When the active connection ratio is large, the result will be affected. 2. wlc weighted least-connection weighted least connections Weighted by machine performance. Overhead/weighted request to be forwarded to the small one The weighted algorithm i

vrrp_instance is consistent.. PriorityPriority. This identifier is also a number. A greater value indicates a higher priority. In the same vrrp_instance, the master has a higher priority than backup.. Advert_intSynchronous notification interval. The interval between the master and Backup Server Load balancer synchronization checks, in seconds.. AuthenticationVerify. Contains the authentication type and password. There are two main types: Pass and AH. The pass type is usually used. It is said th

names are LAP and WLC. The lightweight wireless access point is only responsible for receiving and sending 802.11 Gb/s. Other functions are implemented through the wireless LAN controller. Because this lightweight Wireless Access Point has fewer features than traditional wireless routers, we call it lightweight. This is also the name. Other processes are implemented by the wireless LAN controller. That is to say, the configuration files and security

libipvs. o Ar: creating libipvs. A-libipvs. o Make [1]: Leaving directory '/root/ipvsadm-1.24/lib1_s' Gcc-Wall-Wunused-Wstrict-prototypes-g-O2-I/usr/src/linux/include-I .. -I. -DVERSION = \ "1.24 \"-DSCHEDULERS = \ "" rr | wrr | lc | wlc | lblc | lblcr | dh | sh | sed | nq "\"-DHAVE_POPT-DHAVE_NET_IP_VS_H -c-o ipvsadm. o ipvsadm. c Gcc-Wall-Wunused-Wstrict-prototypes-g-O2-I/usr/src/linux/include-I .. -I. -DVERSION = \ "1.24 \"-DSCHEDULERS = \ "" rr |

address hash, indicates that the request from the same CIP is always directed to the same rs;session hold;Dh:destination hashing, target address hash, backend is generally cache server, can improve cache hit ratio⑵ dynamic method: Scheduling based on the algorithm and the current load status of each RSLc:least Connection, Minimum connectionOverhead=active*256+inactive #overhead值越小越优先被选中, if the Overhead value is the same, the top-down selection based on the real server listwlc:weighted LC, Defa

out, the number of connections decreases by one. Check the number of inactive connections and the number of inactive connections at the same time. based on overhead, whoever overhead is small will accept the next request.Example: overhead = number of connections in the active state * 256 + number of connections in the inactive state2. Weighted Least-Connection Scheduling)The weighted least connections (WLC) is the superset of the minimum connection s

weight value.Pros: Consider the difference in server processing power3,SH original address hash : Extract the User IP, according to the hash function to derive a key, and then according to the static mapping table, the corresponding value, that is, the target server IP. The target machine is overloaded, the return is empty.4,DH target address hash : Ibid, just now extract the destination address of the IP to do the hash.Advantages: Both of the above algorithms can achieve the same user access t

the server based on the weight. The number of times the server is called is proportional to the weight. Advantage: Different server processing capabilities are taken into account. 3. sh original address hash: extracts the user IP address and generates a key based on the hash function. Then, based on the static ing table, investigate the corresponding value, that is, the target server IP address. If the target machine is overloaded, null is returned. 4. dh target address hash: Same as above, but

weight value.Pros: Consider the difference in server processing power3,SH original address hash : Extract the User IP, according to the hash function to derive a key, and then according to the static mapping table, the corresponding value, that is, the target server IP. The target machine is overloaded, the return is empty.4,DH target address hash : Ibid, just now extract the destination address of the IP to do the hash.Advantages: Both of the above algorithms can achieve the same user access t

number of times the server is called is proportional to the weight value.Pros: Consider the difference in server processing power3,SH original address hash : Extract the User IP, according to the hash function to derive a key, and then according to the static mapping table, the corresponding value, that is, the target server IP. The target machine is overloaded, the return is empty.4,DH target address hash : Ibid, just now extract the destination address of the IP to do the hash.Advantages: Bot

external requests sequentially to the real servers in the cluster by using the "round call" scheduling algorithm, which treats each server equally, regardless of the actual number of connections and system load on the Server. 2the. weighted wheel (Weighted Round Robin) (WRR) Scheduler Dispatches access requests based on the different processing capabilities of real servers through the "weighted round call" scheduling algorithm. This ensures that the processing capacity of the server can handle

directly to the client by Realserver; Realserver cannot point the gateway to the dip; Only the tunnel-enabled OS can be used for realserver; Port mappings are not supported; LVS10 method of dispatching:Fixed scheduling: Static algorithm, regardless of the number of connectionsRR: Rotation, pollingWrr:weight, weightedSh:source hash, source address hash binding, such as session bindingDh:destination hash, destination address binding, the same type of request to the same server, s

#############################################Vrrp_instance Dr_cache {#VRRP热备实例名State Master #热备状态, Master (master); backup (back up)Interface Eth0 #承载VIP地址的物理接口Lvs_sync_daemon_inteface eth0 #负载均衡器之间的监控接口 (same as interface in DR Mode)virtual_router_id #虚拟路由器的ID号, the group is consistent in the preservationPriority #优先级, the higher the value the higher the precedence, the master should be higher than the backupAdvert_int 5 #主备之间的通告间隔秒数 (heart rate)Authentication {#认证信息, each hot standby group re