CN101854358B - Realization method of multiple-spanning-tree link switching performance optimization - Google Patents
Realization method of multiple-spanning-tree link switching performance optimization Download PDFInfo
- Publication number
- CN101854358B CN101854358B CN 201010173357 CN201010173357A CN101854358B CN 101854358 B CN101854358 B CN 101854358B CN 201010173357 CN201010173357 CN 201010173357 CN 201010173357 A CN201010173357 A CN 201010173357A CN 101854358 B CN101854358 B CN 101854358B
- Authority
- CN
- China
- Prior art keywords
- port
- message
- count
- switch
- instance
- 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.)
- Active
Links
Images
Abstract
The invention discloses a realization method of multiple-panning-tree link switching performance optimization, which aims at providing an optimization method of multiple-spanning-tree link switching performance in the communication field, and adopts the technical scheme that: multiple spanning trees are classified into a plurality of examples, all example information is collected tighter to be packed into a message to be sent out; sending treatment of restriction message is carried out at the place at which each example is treated, a packet is allowed to send until the flow required for each example is processed and completed in each state machine, and the packet brings about the information of all examples. The uniform packing and sending treatment is carried out at two places, the first place is of a processing function of each event, and the second place is of a place for receiving and sending the packet. The method has the advantages that: on the premise that the basic function of the multiple spanning tree is ensured, the spanning tree link switching performance is greatly improved, and the switching performance of two layers can reach 40 to 70 ms.
Description
Technical field
The present invention relates to the communications field, more particularly, belong to the optimization of multiple spanning tree link performance.
Background technology
On the standard 802.1Q that IEEE provides, the MSTP agreement there is a description on the principle, the general implementation algorithm that also writes out simultaneously, but listed this algorithm on the standard not to the performance boost aspect, has more mentioning.
Along with society, the develop rapidly that science and technology is maked rapid progress, the people are more and more higher to the efficient requirement, for industrial communication equipment, faster exchange velocity is arranged, just mean in the per second and can process more magnitudes of traffic flow, just mean that each second, businessman can produce more product, production and life with regard to means safe ... existing spanning-tree technology can not reach the performance of comparatively optimizing, and can not satisfy the needs of the industrialization society of sustainable development.
In the process of the optimization of MSTP performance, attempted several method, selected at last a kind of method, this method can effectively improve performance, and can not cause other some problems.
When beginning to analyze switching performance, decompose the links in the reversed process, the time that links consumes is carried out statistical analysis, find that the time that handshake procedure expends in whole process of switching is maximum, so determine to set about from optimizing handshake procedure, optimize the switching performance of MSTP.
The number that MSTP gives out a contract for a project, certain restriction is arranged, a value is arranged in code, the effect that this value plays is MSTP sends message in a second number, tentatively make it be the upper limit of giving out a contract for a project (TX_HOLD_COUNT), the message that surpasses the upper limit of giving out a contract for a project can't send within a current second, the variable record number of giving out a contract for a project of each second is arranged in the program, whenever program sends a message, this variable counting increases 1, and this variable and the upper limit (TX_HOLD_COUNT) compared, when number has equaled the upper limit of giving out a contract for a project (TX_HOLD_COUNT) of maximum if counting messages is given out a contract for a project, if program also needs to send message, that can only wait until next second.
The upper limit of giving out a contract for a project is a constant, and the recommended value in the agreement document is to be no more than 10 at per second usually, takes charge of in the code of realization at me, and this value has been modified to a larger value, is far longer than 10.
And each example might send message by event activated, and each example sends separately message, like this, if Multi-instance is arranged, just have more message interaction, in the process of two switch message interactions, if the number that message sends surpasses the maximum that the upper limit of giving out a contract for a project sets, will wait until that so next second sends.Therefore affect the interaction time of handshake information, indirectly prolonged switching time, brought very large obstacle to switching performance.
MSTP is divided into Multi-instance, each example is given out a contract for a project separately, each example has event to arrive, the capital drives the MSTP protocol stack and sends message, each example not only will send message, also will receive message, finishes reciprocal process, this is if Multi-instance just has more message interaction, and each also can cause some other message interaction process according to the difference of the flag bit of message alternately.
Put together with the upper limit of giving out a contract for a project like this and consider that many examples are given out a contract for a project number must be many, and the upper limit of giving out a contract for a project to limit the number of giving out a contract for a project, these two mutual contradictions in aspect.
On the structure of message, contain in each message, the information of Multi-instance, message of every transmission, all information that all can carry other example have the transmission of more repeatability in network, and state machine also has the processing of a lot of repeatability.
For example, 10 examples of configuration in the territory, example 1 needs to send message, and example 1 can drive protocol stack send this message, in this message except the message of carrying example 1, the message of also carrying other 9 examples simultaneously, these 9 examples are repeated to send, and such message is received in the opposite end, and do not know which example is only the example that this message of driving sends, so the information that each example is entrained all will be carried out one time.Be equivalent to have 9x9=81 processing procedure to be wasted.
Restriction for the number of giving out a contract for a project, the inventor also once attempted revising the switching performance that the number of giving out a contract for a project improves MSTP, can improve in a way performance really to the certain modification of this value, its cardinal principle is exactly, the txcount value is increased, be allowed to condition at the bag that can send out more a second, the message of the required transmission of MSTP all sent in a second as far as possible.After tested, originally the switching performance of MSTP is maximum 3 seconds, through revising the value of txcount, switching performance is brought up in 600 milliseconds.
Simultaneously also have some problems but revise like this, first caused more serious problem is in the network of the topological structures that encircle more, can produce MSTP protocol massages storm when restarting a main equipment, and irrecoverable; The second, MSTP BPDUs mutual in network is more, can affect like this flow of business datum in the network.
Summary of the invention
The objective of the invention is to overcome deficiency of the prior art, a kind of implementation method technology of more optimizing is provided.
Technical scheme of the present invention is, a kind of implementation method of multiple-spanning-tree link switching performance optimization, and multiple spanning tree is divided into Multi-instance, and all example informations are sent together to being packaged into together a message; Limit the transmission processing of message in the place that each single instance is handled, until after each example finishes dealing with in each state machine of program by required flow process, allow to send a bag, the information of carrying whole examples in this bag.Have two kinds of places to do the processing that uniform packing sends, first place is the processing function of each event, and second place is exactly the place of transmitting-receiving bag.
Processing on the event, such as being treated in port UP event:
(1) at first to carry out initialization to each example on this port;
(2) the current message of each port is sent number tx_count and preserve first, then tx_count is set to TX_HOLD_COUNT, in the process that whole port role recomputates, just do not have message and send like this; (3) call state machine and carry out reselecting of each instance port role; Take example as parameter, call the PRS state machine, the completing port role selecting; Until all instance port selections are complete.
(4) tx_count with port arranges back original number, is parameter with this port, calls at each port and sends message of message status machine transmission, thereby reach the effective information that carries Multi-instance in a message.
In other event handling, if relate to reselecting of topological middle port role, processing procedure is with (2)-(4) step of claim 4.
Processing for transmitting-receiving bag place:
(1) the current message of each port is sent number tx_count and preserve first, then tx_count is set to TX_HOLD_COUNT;
(2) take example as parameter, call the port information state machine, program can be collected information by the PIM state machine, again according to collected information, again all of the port role of each example in the whole topology is reselected.
(3) after all example is finished the topology renewal by PIM, again the tx_count value of the port under preserving in (1) step is fetched, be parameter with each port, call transmission message status machine at each port and send a message, thereby reach the effective information that in a message, carries Multi-instance.
In the above processing procedure, if the tx_count of port equals TX_HOLD_COUNT, tx_count being subtracted one, is parameter with this port, calls to send message of message status machine transmission.
The invention has the beneficial effects as follows: under the prerequisite that guarantees the multiple spanning tree basic function, greatly improve spanning tree link switchover performance, two layers of switching performance can reach 40-70ms.
Description of drawings
Fig. 1 port events flow chart of giving out a contract for a project;
Fig. 2 receives and dispatches the bag flow chart;
Four high-end switch connection layouts of Fig. 3;
Fig. 4 switch 1 is each port role figure of root;
Fig. 5 switch 2 is each port role figure of root;
Fig. 6 port-mark schematic diagram;
Fig. 7 optimizes the reciprocal process triggering figure of many examples at front two ends;
The mutual triggering figure that shakes hands after Fig. 8 optimization.
Embodiment
MSTP represents Multiple Spanning Tree Protocol;
Instance: example;
Vlans Mapped: VLAN mapping;
Dtring-2: represent Multiple Spanning Tree Regions;
Tx_count: message sends number;
TX_HOLD_COUNT: allow the maximum number of giving out a contract for a project a second;
The present invention will be described below in conjunction with width of cloth figure.
Fig. 1 has indicated the port events flow chart of giving out a contract for a project;
Multiple spanning tree is divided into Multi-instance, and all example informations are sent together to being packaged into together a message; Limit the transmission processing of message in the place that each single instance is handled, until after each example finishes dealing with in each state machine of program by required flow process, allow to send a bag, the information of carrying whole examples in this bag.Have two kinds of places to do the processing that uniform packing sends, first place is the processing function of each event, and second place is exactly the place of transmitting-receiving bag.
Processing on the event, such as being treated in port UP event:
(1) whether MSTP enables this port, is not to withdraw from; Down to process.Each example in the example list on this port is carried out initialization one by one;
(2) the current message of each port is sent number tx_count and preserve first, then tx_count is set to TX_HOLD_COUNT, in the process that whole port role recomputates, just do not have message and send like this;
(3) call state machine and carry out reselecting of each instance port role; Take example as parameter, call the PRS state machine, the completing port role selecting; Until all instance port selections are complete.
(4) tx_count with port arranges back original number, is parameter with this port, calls at each port and sends message of message status machine transmission, thereby reach the effective information that carries Multi-instance in a message.If the tx_count of port equals TX_HOLD_COUNT, tx_count is subtracted one, be parameter with this port, call and send message of message status machine transmission.
In other event handling, if relate to reselecting of topological middle port role, processing procedure is with (2)-(4) step of claim 4.
Fig. 2 has indicated transmitting-receiving bag flow chart;
Processing for transmitting-receiving bag place:
(1) MSTP receives the BPDU message and decodes and finish, and the current message of each port is sent number tx_count preserve first, and then tx_count is set to TX_HOLD_COUNT;
(2) if the BPDU message from the territory, take example as parameter, call the port information state machine, program can be collected information by the PIM state machine, according to collected information, again all of the port role of each example in the whole topology reselected again.If the BPDU message is not from the territory, directly enter next step.
(3) after all example is finished the topology renewal by PIM, be parameter with each port, successively the tx_count value of the port under preserving in (1) step is fetched, call transmission message status machine at each port and send a message, thereby reach the effective information that in a message, carries Multi-instance.
In the above processing procedure, if the tx_count of port equals TX_HOLD_COUNT, tx_count being subtracted one, is parameter with this port, calls to send message of message status machine transmission.
Below each figure indicated environment for use, implementation procedure and the effect of this invention.
Fig. 3 has indicated the connection layout that is comprised of four high-end switch, each is with the packet of four arrows among the figure, represent a high-end switch, solid black lines among the figure represents the line (optical cable or netting twine) of inter-exchange, can find out that this topology is the network configuration of ring more than, for example, switch 12 and 3 has formed a loop configuration, switch 124 has formed a loop configuration, switch 1234 has also formed a loop configuration, according to the forwarding characteristic of switch, in such topology, must avoid producing in the network storm with Spanning-Tree Protocol.
The spanning tree configuration information of four equipment is:
Identical for four above-mentioned information of equipment, just mean that also four equipment in same territory, it can also be seen that from this configuration information, 10 examples are arranged in this territory.
Priority arranges, and each equipment is different, and numerical value is less, and priority is higher; The priority of equipment 1 is configured to:
dtring-2
dtring-2?mst?0?priority?4096
dtring-2?mst?2?priority?8192
dtring-2?mst?3?priority?4096
dtring-2?mst?4?priority?8192
dtring-2?mst?5?priority?4096
dtring-2?mst?6?priority?8192
dtring-2?mst?7?priority?4096
dtring-2?mst?8?priority?8192
dtring-2?mst?9?priority?4096
dtring-2?mst?10?priority?8192
The priority configuration of equipment 2, and the configuration of the priority of equipment 1 just is opposite:
dtring-2
dtring-2?mst?0?priority?8192
dtring-2?mst?2?priority?4096
dtring-2?mst?3?priority?8192
dtring-2?mst?4?priority?4096
dtring-2?mst?5?priority?8192
dtring-2?mst?6?priority?4096
dtring-2?mst?7?priority?8192
dtring-2?mst?8?priority?4096
dtring-2?mst?9?priority?8192
The priority configuration of dtring-2 mst 10 priority 4096 equipment 3 and the priority configuration of equipment 4 keep default configuration, and namely the priority of all examples all is 32768.
Fig. 4 has indicated switch 1 to be each port role figure of root; According to above priority setting, be root for example 03579 switches 1, agreement is set each port role according to the base attribute value of setting, and each port role is as shown in the figure.
Fig. 5 has indicated switch 2 to be each port role figure of root; Be root for example 2468 10 switches 2, each port role as shown in the figure.
Fig. 6 has indicated the port-mark schematic diagram; The circle of white represents root port, and the circle of black represents designated port, and the square of white represents to replace port, and the square of black represents backup port; Root port and designated port business datum can inflow and outflows in the port role, replace the inflow and outflow of port prevention business datum, so although whole network has a plurality of rings, it is tree-shaped that but the individual port role that in fact calculates by the MSTP agreement has become to optimize with network calculations, each example is one tree, has not had loop in the actual topology.
For the basic operation of above-mentioned configuration and the basic procedure of data
The flow direction of data sends data from switch 3, from switch 4 receive datas, perhaps sends data at switch 3 receive datas from switch 4 simultaneously, the transmission that transmitting terminal continues, the reception that receiving terminal continues.
Data wire in this process on a certain path of interruption carrying data, cause data to be switched at link, with performance testing apparatus record its in a second quantity with interior lost data packets, what of packet loss in the set time can judge the quality of its switching performance by.
Data flow when concrete initial, and disconnected which bar line cause data flow how to change, and two layers and three layers are different.Switch the handshake procedure process analysis for two layers
For the test of two layers of reversed process, the vlan9 transmission data from switch 3 at the vlan9 of switch 4 receive data, are equivalent to data and flow in example 9, and the message that sends is two layers clean culture or broadcasting packet.
According to figure four middle port roles' analysis, example 9 is take switch 1 as root, and the data in the example 9 can be sent from 1/3 port of switch 3, through switch 1, send from 1/1 port of switch 1, arrive switch 4, what Layer 2 data was walked is exactly such path, is exactly 3-1-4.
Generation for the trigger data link switchover, disconnect the line between switch 1 and the switch 4, a line of the formal bearer service data of this line, disconnect this line, data will look for path could arrive switch 4 in addition, the selected new path of data is 3-1-2-4, the road of data link from 1 to 4 be switched to 1 to 2 on 4, this reversed process can cause losing of some data, the amount of loss of data is exactly the performance of switching, if can reduce the quantity of loss of data, the performance of switching that namely improves.
Lower surface analysis is in the process that these data are switched, which evaluation work MSTP has done, disconnect the line between switch 1 and the switch 4, switch 4 root ports lose, recomputate and select new root port, can send message to adjacent switch this moment 4 take oneself as root, and in this topology, switch 4 can be to the message of switch 2 transmissions take oneself as root.
Switch 2 is received the bpdu that switch 4 is sent, compare with the own root priority vector of holding, through comparing, the root priority vector of in the message that switch 4 is sent, holding, the priority vector that does not have switch 2 to hold is excellent, switch 2 can be replied a bpdu to switch 4, in bpdu, comprise the priority vector that switch 2 is held, the priority vector that switch 2 is held is for switch 4, it is the more excellent root priority vector of root information of holding than switch 4, work as so switch 4 and receive the bpdu that switch 2 is sent, can get root priority among the bpdu as new priority vector through calculating relatively, switch 4 has been selected new priority, also thinks it oneself is not root in the network simultaneously, 1/3 port is the source port that comes of new root priority vector, and 1/3 port just is chosen to be root port so.
Because 1/3 was port blocked originally, existing its need to change the forwarding port into, stipulate among the MSTP, if the designated port that root port opposite end connects is in forwarding state, so new root port can become forwarding state immediately without time-delay, so 1/3 port has become forwarding state immediately, the link process is very fast.
In above-mentioned analysis, 1/1 line on the disconnection switch 1, the whole handoff procedure of link does not cause other interacting message, process is comparatively fast finished.
Connect just disconnected switch 1 to the circuit between the switch 4, link is from just switch 1 switch to 2 to switch 4, switch into from switch 1 directly to switch 4.
1/1 port up of switch 1, port role becomes designated port and state is set to blocked state, sends the bpdu message that indicates with proposaling to switch 4; 1/1 port up of same switch 4, port role becomes designated port and state is set to blocked state, to the bpdu message of switch 1 transmission with proposaling.Switch 4 is received the bpdu message that switch 1 is sent, switch 4 compares the priority vector of holding in the bpdu message of receiving and the priority vector of self holding, discovery is better than the root information that receives from port one/3 from the received root information in port one/1, path cost is less from the priority vector that receive port one/1, so that root port will re-start is selected.
Re-start the calculating that port role is selected through MSTP, port one/3 are calculated as designated port, get clogged rapidly, 1/1 port is calculated as new root port, in the message that receive port one/1, also carried the agreement flag bit in addition, send proposing for the port one of switch 4/1 and received agreement, root port is forwarding state sending proposing and receive that the agreement port status moves.
Though this moment, 1/1 port of switch 4 became forwarding state, but 1/1 of switch 1 not yet changes forwarding state into, if 1/1 of switch 1 will transfer forwarding state to, also need finish once and shake hands, be that switch 1 sends proposing to switch 4,1/1 of switch 4 sends agreement message take root as the role, receives the agreement that switch 4 sends when switch 1, and the port one of switch 1/1 will transfer forwarding state to.
It should be noted that agreement that switch 4 sends is if not sending with the root role, the port one of switch 1/1 can not transfer forwarding state to yet so, namely 1/1 of switch 4 to become the agreement that sends behind the root just effective, otherwise the agreement that sends, all be invalid, all can not make 1/1 port of switch 1 change forwarding state into.
1/1 port of switch 1 becomes forwarding state switch 1 just real leading to the road between the switch 4, in the process of the switching of this link, the port one/3 that at first is switch 4 becomes obstruction, data path between switch 4 and the switch 3 has been broken to come, then become forwarding state through the port one of a handshake exchange machine 4/1, then become forwarding state through the port one of a handshake exchange machine 1/1 again, 1/1 port of switch 1 becomes when transmitting, and switch 3 and switch 4 have transferred logical state to from disconnected state again.
As mentioned above, data path leads at new path from being disconnected to again, the length of this time, and the quality of decision switching performance, for single instance, above process is no problem.For Multi-instance, each example of above-mentioned handshake procedure will be finished.
Handshake procedure for Multi-instance, MSTP has three following characteristics, one, send message take event and timer event as driving, Multi-instance ought wherein have an example that certain event has occured, MSTP will send immediately a bpdu and go out so, no matter whether other example has the demand that sends message.Carry all example information in two, one bpdu messages, that is to say 10 examples, if there is an example will send bpdu, this bpdu will carry the information of other 9 10 examples so.Three, when receiving end was received bpdu, receiving end was to judge that this bpdu is that driving owing to that example events is sent out away, thus receiving end to process all example information of carrying among the bpdu, no matter whether need.
Fig. 7 has indicated the reciprocal process triggering figure of many examples of optimizing front two ends; Initiatively handshaking party is A, and passive handshaking party is B.
The information that sends bpdu and carry other 9 examples under example 0 event-driven, the B end is received this message, not only will process the information of example 0, but also will process other 9 examples, each example may have message to be issued in processing procedure.
The B end is handled example 0 and is replied at once bpdu of A end; This port of 0 example sends a bpdu after becoming root port, and the bpdu that sent before this port of 0 example does not become root port is invalid (designated port is become to be transmitted).But the opposite end is received still and will be processed.
The B end will send out the message to other instance processes of unknown number behind the bpdu that sends example 0 event.An example not necessarily can only feed back a bpdu, may return a plurality of bpdu.
The A end is received after the message of unknown number, also will return to according to the content of message the countless message of B end, and each message is carried the content of 10 examples.
A holds 2 examples to send handshake request, 2 examples send out the identical interacting message that also can cause many times with 1 example of request, reasoning can get, 10 examples are all shaken hands to finish and are had a considerable amount of interacting messages, so a large amount of interacting messages causes, and 10 examples are shaken hands and all finished, can be slow, and instance number more backward, and reciprocal process is just slower.
The reciprocal process of many examples at two ends has triggered interacting message very repeatedly, interacting message so repeatedly, the state machine at two ends will ceaselessly be processed, and processing procedure is repeatedly arranged may be repetition, and the identical information of certain example can be carried repeatedly and send, after receiving, each receiving end all to process, the processing of a lot of repeatability is arranged, and this process has been wasted a large amount of time and resource, causes the link switchover process very slow.
Giving out a contract for a project of each example events initiation is packaged in together, sends together.For example, 10 examples are arranged, these 10 examples have some time transmission message to go out, 0 example will send bpdu and not send immediately, but wait other 9 example events all to finish, with unified the beating in a bag of event information of these 9 examples, the unified message of such 10 examples sends.
Receiving end is received the message of making a start, can process each example in the message, but not that the sign of whenever handling an example just sends message and goes out, but process the information of all 10 examples, with the information after processing, in uniform packing to a message, a unified message, the information of carrying all examples of sending.
After processing like this, so that the interacting message at two ends reduces greatly, make the very large minimizing of state machine number of run of each end, saved greatly device resource, improved greatly speed.
The mutual triggering figure that Fig. 8 has shaken hands after having indicated and having optimized; Initiatively handshaking party is A, and passive handshaking party is B.
The A end sends handshake message to the B end, gives the event that comprises all examples in the message, and each example needn't send separately bpdu, because it all has been packaged in together.
Shaking hands to reply in the message sends back to the A end with the packing of the result after the processing of all example events, each event in the individual example is not replied separately, but waits all examples all to handle, and unified form with a message is replied.
Receive that message square end mouth becomes forwarding at once, and each example that needs change to transmit, this corresponding port all becomes forwarding.
Reciprocal process is complete, and whole process has improved efficient greatly as long as two message have just been finished, and has discharged very many resources.Make switching performance that qualitative leap arranged.
With Fig. 7 contrast, can find out clearly the quality before and after optimizing.The result of actual measurement also shows such optimization, and program feature also has larger lifting, and two layers of switching performance maximum can reach 3s before optimizing, and the switching performance of program can reach maximum 50ms after optimizing.
This optimizing process not only is suitable for the reciprocal process of shaking hands, and is applicable to too other message interaction process of MSTP, only does to illustrate to shake hands as example here.
The above only is process of the present invention and embodiment of the method, not in order to limiting the present invention, all any modifications of making, is equal to replacement, improvement etc. within spirit of the present invention and essence, all should be included within the protection range of the present invention.
Claims (6)
1. the implementation method of a multiple-spanning-tree link switching performance optimization is characterized in that, multiple spanning tree is divided into Multi-instance, and initiatively handshaking party is A, and passive handshaking party is B, and the A end sends handshake message to the B end, comprises the event of all examples in this message; Limit the transmission processing of message in the place that each single instance is handled, until after each example finishes dealing with in each state machine of program by required flow process, allow to send a bag, the information of carrying whole examples in this bag, wherein, event comprises: the processing of port UP event and transmitting-receiving bag.
2. method according to claim 1 is characterized in that, being treated in port UP event:
(1) at first to carry out initialization to each example on this port;
(2) the current message of each port is sent number tx_count and preserve first, then tx_count is set to TX_HOLD_COUNT, in the process that whole port role recomputates, just do not have message and send like this;
(3) call state machine and carry out reselecting of each instance port role, take example as parameter, call the PRS state machine, the completing port role selecting is until all instance port selections are complete;
(4) tx_count with port arranges back original number, is parameter with this port, calls at each port and sends message of message status machine transmission, thereby reach the effective information that carries Multi-instance in a message.
3. method according to claim 2 is characterized in that, in other event handling, if relate to reselecting of topological middle port role, processing procedure is with (2)-(4) step of claim 2.
4. method according to claim 2 is characterized in that, in (3) step, take example as parameter, calls the PRS state machine, the completing port role selecting; Until all instance port selections are complete.
5. method according to claim 1 is characterized in that, the processing at transmitting-receiving bag place:
(1) the current message of each port is sent number tx_count and preserve first, then tx_count is set to TX_HOLD_COUNT;
(2) take example as parameter, call the port information state machine, program can be collected information by the PIM state machine, again according to collected information, again all of the port role of each example in the whole topology is reselected;
(3) after all example is finished the topology renewal by PIM, again the tx_count value of the port under preserving in (1) step is fetched, be parameter with each port, call transmission message status machine at each port and send a message, thereby reach the effective information that in a message, carries Multi-instance.
6. according to claim 2 or 5 described methods, it is characterized in that, (4) step of claim 2 or (3) step of claim 5, if the tx_count of port equals TX_HOLD_COUNT, tx_count is subtracted one, be parameter with this port, call and send the message status machine and send a message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010173357 CN101854358B (en) | 2010-05-10 | 2010-05-10 | Realization method of multiple-spanning-tree link switching performance optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010173357 CN101854358B (en) | 2010-05-10 | 2010-05-10 | Realization method of multiple-spanning-tree link switching performance optimization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101854358A CN101854358A (en) | 2010-10-06 |
| CN101854358B true CN101854358B (en) | 2013-01-23 |
Family
ID=42805625
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010173357 Active CN101854358B (en) | 2010-05-10 | 2010-05-10 | Realization method of multiple-spanning-tree link switching performance optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101854358B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102624630B (en) * | 2012-03-28 | 2015-09-23 | 杭州华三通信技术有限公司 | A kind of avoiding method of temporary loop and equipment |
| CN113972957B (en) * | 2020-07-24 | 2022-12-13 | 维沃移动通信有限公司 | Information control method and device and communication equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1525715A (en) * | 2003-02-26 | 2004-09-01 | 华为技术有限公司 | A method for implementing multiple spanning tree protocol on single spanning tree switching chip |
| CN101005498A (en) * | 2005-12-15 | 2007-07-25 | 阿尔卡特朗讯 | System and method for implementing multiple spanning tree protocol automatic 802.1q trunking |
| CN101188564A (en) * | 2007-11-21 | 2008-05-28 | 中兴通讯股份有限公司 | A method for realizing multi-span tree protocol |
-
2010
- 2010-05-10 CN CN 201010173357 patent/CN101854358B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1525715A (en) * | 2003-02-26 | 2004-09-01 | 华为技术有限公司 | A method for implementing multiple spanning tree protocol on single spanning tree switching chip |
| CN101005498A (en) * | 2005-12-15 | 2007-07-25 | 阿尔卡特朗讯 | System and method for implementing multiple spanning tree protocol automatic 802.1q trunking |
| CN101188564A (en) * | 2007-11-21 | 2008-05-28 | 中兴通讯股份有限公司 | A method for realizing multi-span tree protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101854358A (en) | 2010-10-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101132320B (en) | Method for detecting interface trouble and network node equipment | |
| CN102368727B (en) | Crossed IP network TRILL network communication method, system thereof and devices | |
| WO2012075204A1 (en) | Systems and methods for recovery from network changes | |
| CN101494549B (en) | Method for transmitting multicast data by RPR and RPR node | |
| CN110351286A (en) | Link flood attack detects response mechanism in a kind of software defined network | |
| CN102821050A (en) | Processing method for applying rapid spanning tree protocol to monocyclic network topology | |
| CN105933947B (en) | The method for routing of greedy geographic routing protocol tangent line switching cavity processing | |
| CN104980302B (en) | A kind of method for eliminating redundant link based on STP under SDN frames | |
| CN107317707A (en) | A kind of SDN topological management method based on vertex covering set | |
| CN106789635A (en) | A kind of message forwarding method and device | |
| CN103368849A (en) | OAM (Operations, Administration and Management) message processing method and device | |
| CN101854358B (en) | Realization method of multiple-spanning-tree link switching performance optimization | |
| CN103259687B (en) | Air traffic control data access platform in civil aviation | |
| CN109347520A (en) | The communication means and system of dual-mode communications network | |
| CN1825832A (en) | Ring rapid spanning tree protocol | |
| CN102801622A (en) | Transmitting method and device for data messages | |
| CN103731285B (en) | The switching handling method and device of distributed elastic network interconnection DRNI | |
| CN102255758B (en) | Method for increasing convergence rate of RSTP (Rapid Spanning Tree Protocol) | |
| CN106330728B (en) | Method, the equipment of standby Designated Router and Designated Router troubleshooting are waited in election | |
| CN102014035A (en) | Networking method and device based on Ethernet ring | |
| CN101867513B (en) | Method for implementing reversing performance optimization of three-layer network multiple spanning tree link | |
| CN105338127B (en) | MAC address table updating method, interchanger and system | |
| CN1510873A (en) | Multiple generation tree protocol based domain roots switching method | |
| CN104717140B (en) | The fault handling method and device of edge route bridge device in TRILL network | |
| CN103532954B (en) | The coding network system at a kind of data-oriented center and method of work thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |