CN110611577A - Service fast switching method, switching device, network equipment and storage medium - Google Patents

Service fast switching method, switching device, network equipment and storage medium Download PDF

Info

Publication number
CN110611577A
CN110611577A CN201810614269.7A CN201810614269A CN110611577A CN 110611577 A CN110611577 A CN 110611577A CN 201810614269 A CN201810614269 A CN 201810614269A CN 110611577 A CN110611577 A CN 110611577A
Authority
CN
China
Prior art keywords
link
switching
aggregation group
calculating
flow
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810614269.7A
Other languages
Chinese (zh)
Inventor
周佳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN201810614269.7A priority Critical patent/CN110611577A/en
Publication of CN110611577A publication Critical patent/CN110611577A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0663Performing the actions predefined by failover planning, e.g. switching to standby network elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • H04L45/245Link aggregation, e.g. trunking

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the invention discloses a method for rapidly switching services, a switching device, network equipment and a storage medium, belonging to the field of communication. The method for rapidly switching the service comprises the following steps: when a failure of one member link of the link aggregation group is detected, calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy; and switching the flow loaded by the fault link to the new outlet link in a balanced manner. The embodiment of the invention can ensure the load sharing balance between the link member failure and the LACP protocol re-convergence period, and does not influence the original normal service on the link for re-sharing the flow.

Description

Service fast switching method, switching device, network equipment and storage medium
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a method, a device, network equipment and a storage medium for fast service switching in a link aggregation networking scene.
Background
In recent years, as the deployment demand of operators and customers for services such as big data and big video increases, the throughput of data services of a bearer network increases rapidly, and the bandwidth of a single port cannot meet the requirement, networking modes in which a plurality of physical ports are bound to form a link aggregation group (Smartgroup) through a link aggregation protocol lacp (link aggregation Control protocol) are applied to actual networking more and more, so that the bandwidth pressure of the single port can be reduced, and the probability of packet loss caused by network congestion is reduced.
Under the condition of the prior art, when a link of a member of a link aggregation group is interrupted, a Forwarding plane and a control plane are notified to perform fast switching on a flow on a failed link within 50ms through BFD (Bidirectional Forwarding detection) detection configured on the link, so that a service is guaranteed to be switched to one of normal member links of the link aggregation group as soon as possible, but the flow on the normal link for re-sharing the flow is increased suddenly, congestion packet loss is possibly generated, and the original normal service is influenced. Although, eventually, as the LACP protocol renegotiates the calculation, the control plane will update the member links of the link aggregation group, and the new member links will achieve the load sharing effect. However, since the convergence time of the LACP protocol is relatively slow (generally 30 seconds), during the period from the failure of the link aggregation group member link to the convergence of the recalculated LACP protocol, the link that shares the traffic again is in a state of unbalanced load, which causes congestion and packet loss, and affects the original normal service on the link that shares the traffic again.
Disclosure of Invention
In view of this, an embodiment of the present invention provides a method, a device, a network device, and a storage medium for fast switching a service, so as to solve the technical problems of bandwidth congestion and packet loss caused by unbalanced load during a convergence period of a link that re-shares a traffic after the traffic is fast switched from a failed link to other aggregated member links.
The technical scheme adopted by the embodiment of the invention for solving the technical problems is as follows:
according to an aspect of the embodiments of the present invention, a method for fast service handover is provided, where the method includes:
and when a failure of one member link of the link aggregation group is detected, calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy.
And switching the flow loaded by the fault link to the new outlet link in a balanced manner.
According to another aspect of the embodiments of the present invention, a device for fast service switching is provided, where the device includes:
the detection module is used for detecting whether a link of a link aggregation group member fails;
the calculation module is used for calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy when a member link of the link aggregation group fails;
and the switching module is used for switching the flow loaded by the fault link to the new outlet link in a balanced manner.
According to still another aspect of the embodiments of the present invention, there is provided a network device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the computer program is executed by the processor, the steps of the above-mentioned service fast switching method are implemented.
According to another aspect of the embodiments of the present invention, a storage medium is provided, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, the steps of the above-mentioned service fast switching method are implemented.
According to the rapid service switching method, the switching device, the network equipment and the storage medium provided by the embodiment of the invention, when one or more member links in the link aggregation group are failed, a new exit link is calculated from other normal link aggregation group members according to a preset sharing strategy, and the flow borne by the failed link is switched to the new exit link in a balanced manner, so that the load sharing balance during the period from the failure of the link members to the re-convergence of the LACP can be ensured, and the original normal service of the link for re-sharing the flow is not influenced.
Drawings
FIG. 1 is a schematic diagram of link aggregation networking in accordance with the present invention;
fig. 2 is a flowchart of a method for fast service switching according to an embodiment of the present invention;
fig. 3 is a flowchart of a method for calculating a new egress link according to an embodiment of the present invention;
fig. 4 is a flowchart of another method for fast service handover according to an embodiment of the present invention;
fig. 5 is a block diagram of a fast service switching apparatus according to an embodiment of the present invention;
fig. 6 is a schematic diagram of link aggregation networking after fast switching provided by the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects to be solved by the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Fig. 1 is a schematic diagram of a LINK aggregation networking in the related art according to an embodiment of the present invention, where traffic passes through a network device R1, and an exit is a LINK aggregation group, member LINKs of which include LINK1, LINK2, and LINK3, and the traffic is shared in a balanced manner on the three LINKs through a preconfigured load sharing policy.
Example one
As shown in fig. 2, a method for fast service switching according to an embodiment of the present invention includes:
s201, when a failure of one member link of the link aggregation group is detected, calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy.
Specifically, in a link aggregation networking architecture, when a network device deploys networking for load sharing, a pre-configured sharing policy is usually adopted. When a member link of a link aggregation group configured on network equipment fails, BFD detection configured on the link detects the link failure firstly, and reports to a forwarding plane for flow switching, and simultaneously reports to a control plane for protocol convergence calculation. And the forwarding plane acquires the ID of the fault link according to the alarm session number, and uniformly shares the flow borne by the fault link to other normal member links. Wherein, the sharing strategy comprises: certain characteristic values or combinations of characteristic values based on the flow rate participate in the calculation. Such as: calculating according to a preset sharing strategy and a random value HASH polynomial algorithm to obtain a group of random values, performing modulus operation on a preset modulus by using the random values, obtaining an index of a load sharing table according to a modulus operation result, and searching from the load sharing table according to the index to obtain new outlet link information corresponding to flow.
In some preferred embodiments, in order to more evenly share the traffic to the member links of the link aggregation group, the preset modulo can adopt the current normal number of member links.
S202, the flow loaded by the fault link is switched to the new outlet link in a balanced manner.
According to the method for rapidly switching the services provided by the embodiment of the invention, when one or more member links in the link aggregation group are in failure, a new outlet link is calculated from other normal link aggregation group members according to a preset sharing strategy, and the flow borne by the failed link is switched to the new outlet link in a balanced manner, so that the load sharing balance can be ensured during the period from the failure of the link members to the reconvergence of the LACP, and the original normal services of the link for redistributing the flow are not influenced.
Example two
As shown in fig. 3, a method for calculating a new egress link according to an embodiment of the present invention includes:
s301, calculating a routing random value corresponding to the flow according to a preset sharing strategy.
Specifically, in this step, a set of routing random values is calculated based on the characteristic value or the combination of the characteristic values of the flow and a random value polynomial algorithm. Wherein, the characteristic value of the flow includes but is not limited to: one or any combination of a destination MAC, a source MAC, a destination IP or a source IP. Such as the destination MAC, source MAC, destination IP, or source IP of the traffic, or any combination of the destination MAC + source MAC, destination IP + source IP, or the like. Calculating to obtain a group of random values according to the configured sharing strategy and the random value HASH polynomial algorithm
S302, performing module calculation on the routing random value to a preset modulus, and searching a load sharing table according to a module calculation result to obtain a new exit link.
Specifically, the embodiment of the present invention is described by taking the modulus as the current normal link member number as an example. And when the ith link with the link member number of n fails and the current normal link member number is n-1, performing modulus extraction on the current normal link member number n-1 of the routing random value obtained in the step, and obtaining the index of the load sharing table according to a modulus extraction result. For a set of random values, by modulo the current normal link membership number n-1, then the resulting range of modulo values is 0-n-2; and searching the interface information from the load sharing table by using the modulus value result (0-n-2) as an index, so that the flow can be shared to the member links of the link aggregation group as uniformly as possible.
Similarly, when any link fault occurs again in the rest n-1 link aggregation groups, the BFD on the fault link reports to the forwarding plane for flow switching, and reports to the control plane for protocol convergence calculation. And the forwarding plane acquires the ID of the fault link according to the alarm session number, and uniformly shares the flow borne by the fault link to the other normal n-2 links.
EXAMPLE III
As shown in fig. 4, another method for fast service handover provided in the embodiment of the present invention includes:
s401, searching a prefix forwarding table and obtaining an outlet link attribute.
Specifically, the prefix forwarding table includes, but is not limited to, a routing table, a MAC table, or a label forwarding table, and the egress link attribute is obtained by table lookup.
S402, judging whether the exit link is a link aggregation group member, if not, executing the step S403 to process according to the common exit port, if so, executing the step S404 to perform load sharing processing.
S403, the forwarding information is encapsulated according to the common physical port, and the step S410 is switched to.
S404, obtaining a random value obtained by the calculation of the pre-configured load sharing strategy, and using the random value to perform modulo operation on the link member number.
S405, searching a load sharing table according to the modulus obtaining result, and obtaining the outlet link encapsulation information.
S406, judging whether the working state of the exit link is normal, if so, executing a step S407, and if not, executing a step S408.
S407, the exit link is adopted to package the forwarding information, and the step S410 is switched to.
S408, calculating a routing random value corresponding to the flow borne by the link, and performing modulo calculation on the current normal link number.
S409, searching a load sharing table according to the modulus result to obtain a new outlet link, and turning to the step S406.
Specifically, whether the new egress link is in a normal working state is determined again, and if the new egress link is in a normal working state, the step S407 is performed; if not, the process proceeds to step S408 until a normal egress link is found.
And S410, ending the flow.
For example, fig. 5 is a schematic diagram of a LINK aggregation networking after fast switching provided by the embodiment of the present invention, LINK1, LINK2, and LINK3 are traffic egress LINK aggregation group member LINKs passing through a network device R1, a load sharing policy based on a traffic destination IP is configured on an R1 device, due to different destination IPs of traffic, a set of different random values is obtained according to a random value HASH algorithm, a modulo operation is performed on the number n of load sharing LINKs by using the set of random values (where a modulo value corresponding to 3 LINKs is 3), a result (0, 1, 2) obtained by the modulo operation is used as an index of a load sharing table, the load sharing table is searched to obtain egress encapsulation information of LINK1, LINK2, and LINK3, and finally the traffic is shared in a balanced manner to 3 LINKs, such as LINK1, LINK2, and LINK 3.
When LINK2 fails, a detection module on network device R1 notifies a bottom forwarding plane to perform fast traffic switching first, and reports to a control plane to perform protocol convergence calculation to ensure that the final protocol plane and the forwarding plane are processed consistently, although protocol convergence of the control plane needs to take effect after 30s and is much slower than switching of the forwarding plane; the calculation module recalculates the route selection, removes LINK2 from the original modulus LINK number n (n is 3), obtains the LINK number n-1(3-1 is 2) in normal operation, performs modulus calculation on the current LINK number n-1(3-1 is 2) in normal operation by using a random value obtained by traffic calculation by using a load sharing strategy, and searches the load sharing table by using the result (0, 1) obtained by modulus calculation as an index of the load sharing table to obtain the encapsulation information of the egress LINK; and finally, the switching module evenly shares the traffic originally borne on the LINK2 to the LINK1 and the LINK 3.
Example four
As shown in fig. 6, an embodiment of the present invention provides a device for fast switching services, where the device includes a detection module 601, a calculation module 602, and a switching module 603. Wherein:
the detecting module 601 is configured to detect whether a link of a link aggregation group member fails.
Specifically, the detecting module 601 is configured to detect whether each member link in the link aggregation group works normally, and if a certain member link fails, if a failure occurs, the BFD detects that the link fails first, sends an alarm to the switching module 603 to perform flow switching, and reports to the control plane to perform protocol convergence calculation. The switching module 603 obtains which specific link is abnormal according to the reported alarm session number.
A calculating module 602, configured to calculate a new egress link from other normal link aggregation group members according to a preset sharing policy.
Specifically, when a link in the link aggregation group member fails, the switching module 603 may notify the calculation module 602 to calculate the new egress link to share the traffic on the failed link. The calculation module 602 calculates a routing random value corresponding to the traffic according to a preset sharing policy, performs a modulus calculation on the routing random value with respect to a preset modulus, and searches a load sharing table according to a modulus calculation result to obtain a new egress link.
The preset sharing strategy is based on the characteristic value or the combination of the characteristic values of the flow and a random value polynomial algorithm to calculate and obtain a group of routing random values. Wherein, the characteristic value of the flow includes but is not limited to: one or any combination of a destination MAC, a source MAC, a destination IP or a source IP. Such as the destination MAC, source MAC, destination IP, or source IP of the traffic, or any combination of the destination MAC + source MAC, destination IP + source IP, or the like. Calculating to obtain a group of random values according to the configured sharing strategy and the random value HASH polynomial algorithm
The embodiment of the invention takes the modulus as the current normal link member number as an example for explanation. And when the ith link with the link member number of n fails and the current normal link member number is n-1, performing modulus extraction on the current normal link member number n-1 of the routing random value obtained in the step, and obtaining the index of the load sharing table according to a modulus extraction result. For a set of random values, by modulo the current normal link membership number n-1, then the resulting range of modulo values is 0-n-2; and searching the interface information from the load sharing table by using the modulus value result (0-n-2) as an index, so that the flow can be shared to the member links of the link aggregation group as uniformly as possible.
Similarly, when any link fault occurs again in the rest n-1 link aggregation groups, the BFD on the fault link reports to the forwarding plane for flow switching, and reports to the control plane for protocol convergence calculation. And the forwarding plane acquires the ID of the fault link according to the alarm session number, and uniformly shares the flow borne by the fault link to the other normal n-2 links.
A switching module 603, configured to switch the traffic carried by the failed link to the new egress link in a balanced manner.
Specifically, the switching module 603 switches the traffic on the failed link to other member links that work normally according to the egress link information obtained by the calculating module 602, thereby achieving the effect of balanced sharing.
The service fast switching device of the embodiment of the present invention and the service fast switching method of the first to third embodiments belong to the same concept, and specific implementation processes thereof are detailed in the method embodiments, and technical features in the method embodiments are correspondingly applicable in the switching device embodiments, which are not described herein again.
EXAMPLE five
The network device provided by the embodiment of the invention comprises: the system comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein when the computer program is executed by the processor, the steps of the service fast switching method are realized.
The network device of the embodiment of the present invention and the service switching method of the first to third embodiments belong to the same concept, and specific implementation processes thereof are detailed in the method embodiments, and technical features in the method embodiments are correspondingly applicable in the network device embodiments, which is not described herein again.
EXAMPLE six
An embodiment of the present invention provides a storage medium, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, the steps of the service fast switching method according to any one of the first to third embodiments are implemented.
The computer-readable storage medium of the embodiment of the present invention and the method of the first to fourth embodiments belong to the same concept, and specific implementation processes thereof are detailed in the corresponding method embodiments, and technical features in the method embodiments are applicable in the computer-readable storage medium embodiments, and are not described herein again.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.
In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, and are not to be construed as limiting the scope of the invention. Any modifications, equivalents and improvements which may occur to those skilled in the art without departing from the scope and spirit of the present invention are intended to be within the scope of the claims.

Claims (10)

1. A method for fast switching service includes:
when a failure of one member link of the link aggregation group is detected, calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy;
and switching the flow loaded by the fault link to the new outlet link in a balanced manner.
2. The method of claim 1, wherein the calculating a new egress link from other normal link aggregation group members according to a preset sharing policy comprises:
calculating a routing random value corresponding to the flow according to a preset sharing strategy;
and performing modulus calculation on the routing random value to a preset modulus, and searching a load sharing table according to a modulus result to obtain a new exit link.
3. The method of claim 1, wherein the calculating the routing random value corresponding to the traffic according to a preset sharing policy comprises:
and calculating to obtain a routing random value based on the characteristic value or the combination of the characteristic values of the flow and a random value polynomial algorithm.
4. The method of claim 3, wherein the traffic characteristic value comprises: destination MAC, source MAC, destination IP, or source IP.
5. The fast traffic switching method according to claim 3, wherein the modulo comprises: the current normal number of member links.
6. The method for fast switching service according to any one of claims 1 to 5, wherein the method further comprises:
when a failure of a member link of the link aggregation group is detected, the bidirectional detection protocol BFD on the failed link reports to the forwarding plane for flow switching, and reports to the control plane for protocol convergence calculation.
7. The method for fast switching service according to claim 6, wherein the method further comprises:
and the forwarding plane acquires the ID of the fault link according to the alarm session number.
8. A method and device for fast switching service are disclosed, wherein the device comprises:
the detection module is used for detecting whether a link of a link aggregation group member fails;
the calculation module is used for calculating a new exit link from other normal link aggregation group members according to a preset sharing strategy when a member link of the link aggregation group fails;
and the switching module is used for switching the flow loaded by the fault link to the new outlet link in a balanced manner.
9. A network device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the fast traffic switching method according to any one of claims 1 to 7.
10. A storage medium, characterized in that the storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the service fast switching method according to any one of claims 1 to 7.
CN201810614269.7A 2018-06-14 2018-06-14 Service fast switching method, switching device, network equipment and storage medium Pending CN110611577A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810614269.7A CN110611577A (en) 2018-06-14 2018-06-14 Service fast switching method, switching device, network equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810614269.7A CN110611577A (en) 2018-06-14 2018-06-14 Service fast switching method, switching device, network equipment and storage medium

Publications (1)

Publication Number Publication Date
CN110611577A true CN110611577A (en) 2019-12-24

Family

ID=68887699

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810614269.7A Pending CN110611577A (en) 2018-06-14 2018-06-14 Service fast switching method, switching device, network equipment and storage medium

Country Status (1)

Country Link
CN (1) CN110611577A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111654448A (en) * 2020-05-06 2020-09-11 杭州迪普科技股份有限公司 Traffic scheduling method and device
CN111953590A (en) * 2020-07-14 2020-11-17 锐捷网络股份有限公司 Routing table entry outlet switching method and device, electronic equipment and storage medium
CN112165429A (en) * 2020-09-11 2021-01-01 烽火通信科技股份有限公司 Link aggregation convergence method and device for distributed switching equipment
WO2021164245A1 (en) * 2020-02-20 2021-08-26 华为技术有限公司 Load sharing method and first network device
CN113766032A (en) * 2021-09-14 2021-12-07 烽火通信科技股份有限公司 Service protection method and system of VBRAS (visual basic service architecture) of transfer control separation framework
CN113973092A (en) * 2020-07-24 2022-01-25 中国移动通信集团浙江有限公司 Link resource scheduling method and device, computing equipment and computer storage medium
CN114221735A (en) * 2021-12-23 2022-03-22 安徽皖通邮电股份有限公司 Method, storage medium and equipment based on OTN link dynamic redundancy
CN114268589A (en) * 2020-09-16 2022-04-01 北京华为数字技术有限公司 Flow forwarding method, device and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101232448A (en) * 2008-02-28 2008-07-30 中兴通讯股份有限公司 Reversing route selection method of multicast under single broadcast route equivalence multi path
CN101789902A (en) * 2009-12-25 2010-07-28 福建星网锐捷网络有限公司 Load balancing method for multicast data stream, route equipment and network system
CN102045253A (en) * 2010-12-06 2011-05-04 杭州华三通信技术有限公司 Method and device for sending video surveillance service messages in link aggregation network
CN102468973A (en) * 2010-11-12 2012-05-23 中兴通讯股份有限公司 Alarm control method and device for aggregation link in packet switching network
CN105791108A (en) * 2014-12-25 2016-07-20 中兴通讯股份有限公司 Tunnel bandwidth reservation method and device based on binding interface
CN106100988A (en) * 2016-07-26 2016-11-09 安徽皖通邮电股份有限公司 A kind of realize the method that link aggregation is switched fast
CN107566484A (en) * 2017-08-31 2018-01-09 深信服科技股份有限公司 A kind of traffic scheduling method and device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101232448A (en) * 2008-02-28 2008-07-30 中兴通讯股份有限公司 Reversing route selection method of multicast under single broadcast route equivalence multi path
CN101789902A (en) * 2009-12-25 2010-07-28 福建星网锐捷网络有限公司 Load balancing method for multicast data stream, route equipment and network system
CN102468973A (en) * 2010-11-12 2012-05-23 中兴通讯股份有限公司 Alarm control method and device for aggregation link in packet switching network
CN102045253A (en) * 2010-12-06 2011-05-04 杭州华三通信技术有限公司 Method and device for sending video surveillance service messages in link aggregation network
CN105791108A (en) * 2014-12-25 2016-07-20 中兴通讯股份有限公司 Tunnel bandwidth reservation method and device based on binding interface
CN106100988A (en) * 2016-07-26 2016-11-09 安徽皖通邮电股份有限公司 A kind of realize the method that link aggregation is switched fast
CN107566484A (en) * 2017-08-31 2018-01-09 深信服科技股份有限公司 A kind of traffic scheduling method and device

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021164245A1 (en) * 2020-02-20 2021-08-26 华为技术有限公司 Load sharing method and first network device
CN111654448A (en) * 2020-05-06 2020-09-11 杭州迪普科技股份有限公司 Traffic scheduling method and device
CN111953590A (en) * 2020-07-14 2020-11-17 锐捷网络股份有限公司 Routing table entry outlet switching method and device, electronic equipment and storage medium
CN113973092A (en) * 2020-07-24 2022-01-25 中国移动通信集团浙江有限公司 Link resource scheduling method and device, computing equipment and computer storage medium
CN113973092B (en) * 2020-07-24 2024-05-24 中国移动通信集团浙江有限公司 Link resource scheduling method, device, computing equipment and computer storage medium
CN112165429A (en) * 2020-09-11 2021-01-01 烽火通信科技股份有限公司 Link aggregation convergence method and device for distributed switching equipment
CN114268589A (en) * 2020-09-16 2022-04-01 北京华为数字技术有限公司 Flow forwarding method, device and storage medium
CN114268589B (en) * 2020-09-16 2024-05-03 北京华为数字技术有限公司 Traffic forwarding method, device and storage medium
CN113766032A (en) * 2021-09-14 2021-12-07 烽火通信科技股份有限公司 Service protection method and system of VBRAS (visual basic service architecture) of transfer control separation framework
CN114221735A (en) * 2021-12-23 2022-03-22 安徽皖通邮电股份有限公司 Method, storage medium and equipment based on OTN link dynamic redundancy

Similar Documents

Publication Publication Date Title
CN110611577A (en) Service fast switching method, switching device, network equipment and storage medium
US10454806B2 (en) SDN controller, data center system, and routing connection method
US9461909B2 (en) Method and system of shortest path bridging (SPB) enhanced resilience with loop mitigation
CN106464589B (en) Method and apparatus for partial software defined network switch replacement in IP networks
US11206210B2 (en) Packet processing method and system, and device
CN106209419B (en) Method for selecting network function to forward data and service function repeater
US20140341226A1 (en) Routing control system for l3vpn service network
US10063467B2 (en) Virtual extensible local area network performance routing
US9537785B2 (en) Link aggregation group (LAG) link allocation
US10110421B2 (en) Methods, systems, and computer readable media for using link aggregation group (LAG) status information
CN111092813B (en) Equivalent multipath ECMP switching method, network equipment and system
CN110191064B (en) Flow load balancing method, device, equipment, system and storage medium
CN112054969B (en) Method and device for realizing message mirror image
US20200099609A1 (en) Method for determining link state, and device
US11831549B2 (en) Device and method for load balancing
CN113615132B (en) Fast flood Hong Tapu protection
CN106130821B (en) Method and device for sending detection message
CN113366804A (en) Method and system for preventing micro-loops during network topology changes
WO2016138705A1 (en) Method and device for managing link in load sharing
US9113390B2 (en) Protecting packet traffic in a network including an adaptive bandwidth link
US11876680B2 (en) Method and apparatus for determining link for forwarding service flow
WO2021183262A1 (en) Elimination of address resolution protocol

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20191224

RJ01 Rejection of invention patent application after publication