当前位置:网站首页>LACP details
LACP details
2022-06-27 16:54:00 【Garbage bags can be hidden】
Manual mode :
As long as the interface is added to eth-trunk In the group
Then it will up, It only cares about itself and whether the opposite end up
If up, Then the member link will be up , hypothesis
A link in the link group is connected to other devices , it
I don't know at all. I still think I am in link aggregation ,
And the state is still up Of . Everything has to be confirmed by people
In the manual mode, you can only judge whether the opposite end can
Normal forwarding , For example, the peer interface is not configured IP Address , that
It still thinks that when the device interface at the opposite end up Of , But I don't know
In the network layer, the peer has no ability to forward data .
lacp Pattern :
lacpdu Important content carried in :
System priority
mac Address
Interface priority
Interface number
Be careful : The number of active interfaces at both ends shall be consistent
Switch to switch through LACPDU Judge the priority
Then the election of the active end
System priority : The lower the value, the higher the priority ,
mac Address : The smaller the better
After the active end is elected , The active end elects active ports according to the information on its own interface
Interface priority : The smaller the better
Interface number : The smaller the better
The passive end selects the corresponding interface release according to the active interface selected by the active end
lacp There is an active interface threshold in mode , That is, when the port aggregation reaches a certain number , Extra ports
No more active interfaces , Instead, it will serve as a backup port
When lacp After the protocol detects that the port of the switch fails, the active end will automatically select the one with the highest priority , The election rules are the same as above , Then turn it into an active interface , The passive end follows the active end to release the corresponding backup interface .
See the link below for more details
边栏推荐
- 智慧风电 | 图扑软件数字孪生风机设备,3D 可视化智能运维
- 【Pygame小遊戲】這款“吃掉一切”遊戲簡直奇葩了?通通都吃掉嘛?(附源碼免費領)
- 10 minutes to master the installation steps of MySQL
- Kubernetes基础自学系列 | Ingress API讲解
- [multithreading] thread communication scheduling, waiting set wait(), notify()
- localDateTime类型的时间(2019-11-19T15:16:17) 用oracle的时间范围查询
- Determine the maximum number of specific words in a string
- National food safety risk assessment center: do not blindly and unilaterally pursue "zero addition" and "pure natural" food
- Four characteristics of transactions
- Alibaba cloud liupeizi: Inspiration from cloud games - innovation on the end
猜你喜欢
#yyds干货盘点# 解决剑指offer:二叉树中和为某一值的路径(三)
当发布/订阅模式遇上.NET
Oracle concept II
10 minutes to master the installation steps of MySQL
Determine the maximum number of specific words in a string
Sliding window + monotone queue concept and example (p1886 Logu)
Smart wind power | Tupu software digital twin wind turbine equipment, 3D visual intelligent operation and maintenance
[multithreading] thread communication scheduling, waiting set wait(), notify()
Hongmeng makes efforts! HDD Hangzhou station · offline salon invites you to build ecology
Event listening mechanism
随机推荐
tensorflow求解泊松方程
郎酒两大王牌产品成都联动共振,持续带动光瓶酒消费浪潮
Bit. Store: long bear market, stable stacking products may become the main theme
C語言教師工作量管理系統
[pygame Games] ce jeu "eat Everything" est fantastique? Tu manges tout? (avec code source gratuit)
LeetCode 124. Binary tree maximum path sum - binary tree series question 8
What should the ultimate LAN transmission experience be like
3.4 fixed number of cycles II
A robot is located in the upper left corner of an M x n grid. The robot can only move down or right one step at a time. The robot attempts to reach the lower right corner of the grid. How many differe
模拟进程调度
Popularization of MCU IO port: detailed explanation of push-pull output and open drain output
基于 Nebula Graph 构建百亿关系知识图谱实践
Solving Poisson equation by tensorflow
P.A.R.A 方法在思源的简易应用(亲测好用)
Alibaba cloud liupeizi: Inspiration from cloud games - innovation on the end
等保三级密码复杂度是多少?多久更换一次?
事件监听机制
域名绑定动态IP最佳实践
[multithreading] thread communication scheduling, waiting set wait(), notify()
QT audio playback upgrade (7)