CN111526094A - RSTP state machine scheduling method and system - Google Patents
RSTP state machine scheduling method and system Download PDFInfo
- Publication number
- CN111526094A CN111526094A CN202010331060.7A CN202010331060A CN111526094A CN 111526094 A CN111526094 A CN 111526094A CN 202010331060 A CN202010331060 A CN 202010331060A CN 111526094 A CN111526094 A CN 111526094A
- Authority
- CN
- China
- Prior art keywords
- sub
- state
- state machine
- port
- machines
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding in a switch fabric
- H04L49/253—Routing or path finding in a switch fabric using establishment or release of connections between ports
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a method for scheduling an RSTP state machine, which comprises the following steps: s1: dividing the sub-state machines into a set A, a set B and a set C; the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages; s2: running the sub-state machines in the set A; s3: after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated; s4: and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated. According to the RSTP state machine scheduling method and system, after the state machines of the RSTP state machines are divided into three sets and the operation of the sets is sequentially set, the running disorder of the RSTP state machines can be reduced in the running process, the state abnormity is avoided, and the convergence time is shortened.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method and a system for scheduling an RSTP state machine.
Background
The RSTP Protocol (Rapid Spanning Tree Protocol) is a fast Spanning Tree Protocol, which can rapidly remove loops in a network and avoid storms in the network, and is widely applied in various network scenes, and the core for implementing the RSTP Protocol is a fast Spanning Tree state machine (Rapid Spanning Tree state machines) in the Protocol, but the complexity of the fast Spanning Tree state machine is high, and the fast Spanning Tree state machine is composed of nine sub-state machines, and the main functions and the shorthand names in the following text are respectively as follows:
Port Receive state machine
the port receiving state machine, which is abbreviated as prsm hereinafter, is used for performing preliminary analysis on the received BPDU message.
Port Protocol Migration state machine
The port protocol migration state machine, which is abbreviated as ppmsm hereinafter, is used for managing the spanning tree protocol version of port operation, and the RSTP protocol supports two protocol versions of STP and RSTP.
Bridge Detection state machine
The bridge probe state machine, hereinafter abbreviated bdsm, is used to manage the edge ports.
Port Transmit state machine
And the port sending state machine, which is abbreviated as ptsm hereinafter, completes the BPDU packet package and sends the BPDU packet package according to the current state of the port.
Port Information state machine
The port information state machine, which is abbreviated as "prism" hereinafter, performs deep analysis on the information in the BPDU message, and the analysis result affects the role and state of the port.
Port Role Selection state machine
The port role election state machine, hereinafter abbreviated as prssm, elects all port roles of the bridge.
Port Role Transitions state machine
The port role transition state machine, abbreviated as prtsm hereinafter, controls the transition of the port role state after the port role election is completed.
Port State Transition state machine
The port state transition state machine, hereinafter abbreviated as pstsm, directly transitions the state of the port.
Topology Change state machine
And the topology change state machine, hereinafter abbreviated as tcsm, determines whether the current topology state is changed or not according to the current port information.
The sub-state machines are affected with each other through variables, but the effects of some sub-state machines are bidirectional, some sub-state machines are based on ports and others are based on the whole bridge, if the operation of the sub-state machines cannot be reasonably scheduled, the problems of running disorder, abnormal state, overlong convergence time and the like of an RSTP protocol can be caused, and therefore in order to guarantee the ordered running of the rapid spanning tree state machines, the reasonable scheduling of the sub-state machines is the key for realizing the RSTP protocol.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method and a system for RSTP state machine scheduling, which solve the above problems, such as running disorder, abnormal state, and overlong convergence time, when running the RSTP protocol in the prior art.
The invention is realized by the following technical scheme:
a method for RSTP state machine scheduling comprises the following steps:
s1: dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
s2: running the sub-state machines in the set A;
s3: after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated;
s4: and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
When the method is applied, the running sequence of the sub-state machines in the single-time running of the RSTP protocol state machine is determined, and the running sequence of one sub-state machine can influence other sub-state machines, so that the running sequence of the sub-state machines is an important part.
The input information of the sub-state machines in the set A is directly or indirectly derived from the BPDU message, wherein prsm realizes the analysis of the information in the BPDU message, ppmsm realizes the control of the version running of the RSTP protocol (namely, running STP or RSTP) according to the type of the BPDU message, bdsm directly realizes the control of the edge port according to whether the BPDU message is received or not, and the processing result of the bdsm can influence the state machines of other sets, and the input information is divided into one set based on the characteristic, and can be preferentially processed when the state machines run.
The sub-state machines in the set B have the most complicated relationship, and may generate a bidirectional effect during the operation process, so that the sub-state machines in the combination may repeatedly operate for many times.
The set C only contains one ptsm sub-state machine, and the sub-state machine is influenced by the final result of the operation of all other sub-state machines, so that the RSTP protocol state machine is put into the final processing when in operation.
The invention divides the state machines of the RSTP state machines into three sets and sets the operation sequence of the sets, so that the RSTP state machines can reduce the operation disorder in the operation process, avoid the state abnormity and shorten the convergence time.
Further, the condition for judging the end of the running of the sub state machine is that the state of the sub state machine no longer meets the condition of any state change.
When the method is applied, the limit condition of the running end of the sub-state machine is reasonably formulated to avoid the abnormal state and improve the running performance of the RSTP protocol because the functions realized by the sub-state machines are different.
Further, the sub-state machines in the set a include a port receiving state machine, a port protocol migration state machine and a bridge probing state machine;
step S2 includes the following substeps:
when the sub-state machines in the set A are operated, all the ports are traversed, and the operation sequence of the sub-state machines in each traversed port is that the port receiving state machine, the port protocol migration state machine and the bridge detection state machine are sequentially arranged from first to last.
When the method is applied, the sub-state machines in the set A are operated firstly, the sub-state machines in the set A are all port-based state machines, all ports are traversed during operation, each traversed port operates according to the sequence of prsm- > ppmsm- > bdsm, the operation output of the prsm sub-state machine can be used as the input of the other two sub-state machines, and the operation output of the sub-state machine in the set A can be used as the input of the sub-state machines in the sets B and C.
Further, the sub-state machines in the set B include a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine, and a port state transition state machine;
step S3 includes the following substeps:
s31: when the sub-state machines in the set B are operated, traversing all the ports, wherein the operation sequence of the sub-state machines in each traversed port is sequentially a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last;
s32: running a port role election state machine;
s33: when the sub-state machines of the set B need to be re-run, the steps S31-S33 are repeatedly executed until all the sub-state machines in the set B are stable in state.
When the method is applied, after the sub-state machines in the set A run, the sub-state machines in the set B are run, wherein the prssm sub-state machines are bridge-based state machines, the other sub-state machines are port-based sub-state machines, and the pimm and the prssm, the prtsm and the pstsm are both influenced in two directions, so as to ensure efficient and reliable scheduling, the following processing method is adopted:
1) traversing all ports, and enabling each traversed port to be operated in the sequence of pimm- > tcsm- > prtsm- > pstsm
2) Running the prssm sub-state machine
3) Checking whether the sub state machine of the set B needs to be re-run, and returning to the step 1) from the new step if necessary
Due to the fact that bidirectional influence exists among the sub-state machines, the sub-state machines in the set B can run for many times, the judgment standard is that whether the states of the sub-state machines in the set B change when the state machines run, if the states of the sub-state machines in the set B change, the sub-state machines in the set B need to run again, and if the states of all the sub-state machines are stable, the sub-state machines in the set B are considered to finish running. To increase overall operating efficiency, the pstsm and prssm sub-state machines that would have a two-way effect are finally running.
Further, the sub-state machines in the set C include a port sending state machine;
step S4 includes the following substeps:
and when the sub-state machines in the set C are operated, traversing all the ports, and operating the port transmitting state machine in each traversed port.
When the method is applied, the sub-state machine of the set C is operated finally, and the ptsm sub-state machine is also a state machine based on the ports, so that all the ports are traversed during operation, and the traversed ports operate the ptsm sub-state machine.
A system for RSTP state machine scheduling, comprising:
a gathering unit: the method is used for dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
an operation unit: running the sub-state machines in the set A; after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated; and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
Further, the condition for judging the end of the running of the sub state machine is that the state of the sub state machine no longer meets the condition of any state change.
Further, the sub-state machines in the set a include a port receiving state machine, a port protocol migration state machine and a bridge probing state machine;
when the sub-state machines in the set A are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port is sequentially the port receiving state machine, the port protocol migration state machine and the bridge detection state machine from first to last.
Further, the sub-state machines in the set B include a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine, and a port state transition state machine;
when the sub-state machines in the set B are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port sequentially comprises a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last; after completion, the operation unit operates the port role election state machine;
when the sub-state machines of the set B need to be re-run, the running unit repeatedly executes traversal and running of the sub-state machines until all the sub-state machines in the set B are stable in state.
Further, the sub-state machines in the set C include a port sending state machine;
when the sub-state machines in the set C are operated, the operation unit traverses all the ports, and the port transmitting state machine is operated in each traversed port.
Compared with the prior art, the invention has the following advantages and beneficial effects:
according to the RSTP state machine scheduling method and system, after the state machines of the RSTP state machines are divided into three sets and the operation of the sets is sequentially set, the running disorder of the RSTP state machines can be reduced in the running process, the state abnormity is avoided, and the convergence time is shortened.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a partitioning diagram of a set of sub-state machines in the rapid spanning tree state machine of the present invention;
FIG. 2 is a flow chart of scheduling a single run of a sub-state machine of a set A of fast spanning tree state machines according to the present invention;
FIG. 3 is a flow chart of scheduling a single run of a sub-state machine of a set B of fast spanning tree state machines according to the present invention;
FIG. 4 is a flow chart of scheduling the sub-state machine in one-time operation of the set C of the rapid spanning tree state machines according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to examples and accompanying drawings, and the exemplary embodiments and descriptions thereof are only used for explaining the present invention and are not meant to limit the present invention.
Examples
As shown in fig. 1, a method for RSTP state machine scheduling according to the present invention includes the following steps:
s1: dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
s2: running the sub-state machines in the set A;
s3: after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated;
s4: and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
In the implementation of this embodiment, the running order of the sub-state machines in a single run of the RSTP protocol state machine is determined, and since the running of one sub-state may affect other sub-state machines, the running order of the sub-state machines is an important part.
The input information of the sub-state machines in the set A is directly or indirectly derived from the BPDU message, wherein prsm realizes the analysis of the information in the BPDU message, ppmsm realizes the control of the version running of the RSTP protocol (namely, running STP or RSTP) according to the type of the BPDU message, bdsm directly realizes the control of the edge port according to whether the BPDU message is received or not, and the processing result of the bdsm can influence the state machines of other sets, and the input information is divided into one set based on the characteristic, and can be preferentially processed when the state machines run.
The sub-state machines in the set B have the most complicated relationship, and may generate a bidirectional effect during the operation process, so that the sub-state machines in the combination may repeatedly operate for many times.
The set C only contains one ptsm sub-state machine, and the sub-state machine is influenced by the final result of the operation of all other sub-state machines, so that the RSTP protocol state machine is put into the final processing when in operation.
The invention divides the state machines of the RSTP state machines into three sets and sets the operation sequence of the sets, so that the RSTP state machines can reduce the operation disorder in the operation process, avoid the state abnormity and shorten the convergence time.
For further explanation of the working process of this embodiment, the condition for determining that the running of the sub-state machine is ended is that the state of the sub-state machine no longer satisfies any condition of state change.
In the implementation of this embodiment, the limitation condition of the operation end of the sub-state machine is different from the function of the sub-state machine, and the reasonable formulation of the condition of the operation end of the sub-state machine can avoid the occurrence of an abnormal state and improve the performance of the RSTP protocol operation.
As shown in fig. 2, to further illustrate the working process of this embodiment, the sub-state machines in the set a include a port receiving state machine, a port protocol migration state machine, and a bridge probing state machine;
step S2 includes the following substeps:
when the sub-state machines in the set A are operated, all the ports are traversed, and the operation sequence of the sub-state machines in each traversed port is that the port receiving state machine, the port protocol migration state machine and the bridge detection state machine are sequentially arranged from first to last.
In this embodiment, the sub-state machines in the set a are first run, the sub-state machines in the set a are all port-based state machines, all ports are traversed during running, and each traversed port runs according to the sequence of prsm- > ppmsm- > bdsm, because the run output of the prsm sub-state machine will be used as the input of the other two sub-state machines, and the run output of the sub-state machine in the set a will be used as the input of the sub-state machines in the sets B and C.
As shown in fig. 3, to further illustrate the working process of this embodiment, the sub-state machines in the set B include a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine, and a port state transition state machine;
step S3 includes the following substeps:
s31: when the sub-state machines in the set B are operated, traversing all the ports, wherein the operation sequence of the sub-state machines in each traversed port is sequentially a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last;
s32: running a port role election state machine;
s33: when the sub-state machines of the set B need to be re-run, the steps S31-S33 are repeatedly executed until all the sub-state machines in the set B are stable in state.
In this embodiment, after the sub-state machine in the set a runs, the sub-state machine in the set B is run, where the prssm sub-state machine is a bridge-based state machine, and the other sub-state machines are port-based sub-state machines, and the pimm and prssm, and the prtsm and the pstsm are all affected in two directions, in order to ensure efficient and reliable scheduling, the following processing method is adopted:
1) traversing all ports, and enabling each traversed port to be operated in the sequence of pimm- > tcsm- > prtsm- > pstsm
2) Running the prssm sub-state machine
3) Checking whether the sub state machine of the set B needs to be re-run, and returning to the step 1) from the new step if necessary
Due to the fact that bidirectional influence exists among the sub-state machines, the sub-state machines in the set B can run for many times, the judgment standard is that whether the states of the sub-state machines in the set B change when the state machines run, if the states of the sub-state machines in the set B change, the sub-state machines in the set B need to run again, and if the states of all the sub-state machines are stable, the sub-state machines in the set B are considered to finish running. To increase overall operating efficiency, the pstsm and prssm sub-state machines that would have a two-way effect are finally running.
As shown in fig. 4, to further illustrate the working process of this embodiment, the sub-state machines in the set C include a port sending state machine;
step S4 includes the following substeps:
and when the sub-state machines in the set C are operated, traversing all the ports, and operating the port transmitting state machine in each traversed port.
In the implementation of this embodiment, the sub-state machine of the set C is run finally, and the ptsm sub-state machine is also a state machine based on the port, so that all ports are traversed during the running, and the traversed port runs the ptsm sub-state machine.
A system for RSTP state machine scheduling, comprising:
a gathering unit: the method is used for dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
an operation unit: running the sub-state machines in the set A; after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated; and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
For further explanation of the working process of this embodiment, the condition for determining that the running of the sub-state machine is ended is that the state of the sub-state machine no longer satisfies any condition of state change.
For further explanation of the working process of this embodiment, the sub-state machines in the set a include a port receiving state machine, a port protocol migration state machine, and a bridge probing state machine;
when the sub-state machines in the set A are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port is sequentially the port receiving state machine, the port protocol migration state machine and the bridge detection state machine from first to last.
For further explaining the working process of this embodiment, the sub-state machines in the set B include a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine, and a port state transition state machine;
when the sub-state machines in the set B are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port sequentially comprises a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last; after completion, the operation unit operates the port role election state machine;
when the sub-state machines of the set B need to be re-run, the running unit repeatedly executes traversal and running of the sub-state machines until all the sub-state machines in the set B are stable in state.
To further illustrate the working process of this embodiment, the sub-state machines in the set C include a port sending state machine;
when the sub-state machines in the set C are operated, the operation unit traverses all the ports, and the port transmitting state machine is operated in each traversed port.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for scheduling RSTP state machines, comprising the following steps:
s1: dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
s2: running the sub-state machines in the set A;
s3: after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated;
s4: and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
2. The method of claim 1, wherein the condition for determining the end of the running of the sub-state machine is that the state of the sub-state machine no longer satisfies any condition for state change.
3. The method of claim 1, wherein the sub-state machines in set a comprise a port receiving state machine, a port protocol migration state machine and a bridge probing state machine;
step S2 includes the following substeps:
when the sub-state machines in the set A are operated, all the ports are traversed, and the operation sequence of the sub-state machines in each traversed port is that the port receiving state machine, the port protocol migration state machine and the bridge detection state machine are sequentially arranged from first to last.
4. The method of claim 1, wherein the sub-state machines in set B comprise a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine, and a port state transition state machine;
step S3 includes the following substeps:
s31: when the sub-state machines in the set B are operated, traversing all the ports, wherein the operation sequence of the sub-state machines in each traversed port is sequentially a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last;
s32: running a port role election state machine;
s33: when the sub-state machines of the set B need to be re-run, the steps S31-S33 are repeatedly executed until all the sub-state machines in the set B are stable in state.
5. The method of claim 1, wherein the sub-state machines in set C comprise port transmit state machines;
step S4 includes the following substeps:
and when the sub-state machines in the set C are operated, traversing all the ports, and operating the port transmitting state machine in each traversed port.
6. A system for RSTP state machine scheduling, comprising:
a gathering unit: the method is used for dividing the sub-state machines into three sets according to the receiving and sending functions of the sub-state machines in the RSTP state machine and the state of influence generated when a message is received: a set A, a set B and a set C;
wherein, the set A is a sub-state machine which can directly influence the received message; the set B is a sub-state machine which does not directly influence the received message; the set C is a sub-state machine for sending messages;
an operation unit: running the sub-state machines in the set A; after the operation of the sub-state machines in the set A is finished, the sub-state machines in the set B are operated; and after the operation of the sub-state machines in the set B is finished, the sub-state machines in the set C are operated.
7. The system of claim 6, wherein the condition for determining the end of the running of the sub-state machine is that the state of the sub-state machine no longer satisfies any condition for state change.
8. The system according to claim 6, wherein the sub-state machines in set a comprise a port receiving state machine, a port protocol migration state machine and a bridge probing state machine;
when the sub-state machines in the set A are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port is sequentially the port receiving state machine, the port protocol migration state machine and the bridge detection state machine from first to last.
9. The system according to claim 6, wherein the sub-state machines in set B comprise a port role election state machine, a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine;
when the sub-state machines in the set B are operated, the operation unit traverses all the ports, and the operation sequence of the sub-state machines in each traversed port sequentially comprises a port information state machine, a topology change state machine, a port role transition state machine and a port state transition state machine from first to last; after completion, the operation unit operates the port role election state machine;
when the sub-state machines of the set B need to be re-run, the running unit repeatedly executes traversal and running of the sub-state machines until all the sub-state machines in the set B are stable in state.
10. The system of claim 6, wherein the sub-state machines in set C comprise port transmit state machines;
when the sub-state machines in the set C are operated, the operation unit traverses all the ports, and the port transmitting state machine is operated in each traversed port.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010331060.7A CN111526094B (en) | 2020-04-24 | 2020-04-24 | RSTP state machine scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010331060.7A CN111526094B (en) | 2020-04-24 | 2020-04-24 | RSTP state machine scheduling method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111526094A true CN111526094A (en) | 2020-08-11 |
| CN111526094B CN111526094B (en) | 2022-02-11 |
Family
ID=71903288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010331060.7A Active CN111526094B (en) | 2020-04-24 | 2020-04-24 | RSTP state machine scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111526094B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559406A (en) * | 2020-12-22 | 2021-03-26 | 无锡众星微系统技术有限公司 | SATA transport layer state machine optimization method |
| CN112765078A (en) * | 2021-01-20 | 2021-05-07 | 无锡众星微系统技术有限公司 | STP transmission layer realizing method for supporting multi-disk PIO command concurrence |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070124498A1 (en) * | 2001-12-06 | 2007-05-31 | Kaluve Shyamasundar S | Optimal SYNC for rapid spanning tree protocol |
| CN101309254A (en) * | 2007-05-17 | 2008-11-19 | 上海宇梦通信科技有限公司 | Device and method for controlling multiple function of communication apparatus by related parallel state machine |
| US20130191916A1 (en) * | 2010-11-01 | 2013-07-25 | NSFOCUS Information Technology Co., Ltd. | Device and method for data matching and device and method for network intrusion detection |
| CN104133545A (en) * | 2014-07-29 | 2014-11-05 | 三星半导体(中国)研究开发有限公司 | State machines of power management module of system-on-chip and creating method thereof |
| CN104503733A (en) * | 2014-12-29 | 2015-04-08 | 中国科学院自动化研究所 | Merging method and device for state machine |
| CN107016214A (en) * | 2017-04-26 | 2017-08-04 | 上海工程技术大学 | A kind of parameter based on finite state machine relies on the generation method of model |
-
2020
- 2020-04-24 CN CN202010331060.7A patent/CN111526094B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070124498A1 (en) * | 2001-12-06 | 2007-05-31 | Kaluve Shyamasundar S | Optimal SYNC for rapid spanning tree protocol |
| CN101309254A (en) * | 2007-05-17 | 2008-11-19 | 上海宇梦通信科技有限公司 | Device and method for controlling multiple function of communication apparatus by related parallel state machine |
| US20130191916A1 (en) * | 2010-11-01 | 2013-07-25 | NSFOCUS Information Technology Co., Ltd. | Device and method for data matching and device and method for network intrusion detection |
| CN104133545A (en) * | 2014-07-29 | 2014-11-05 | 三星半导体(中国)研究开发有限公司 | State machines of power management module of system-on-chip and creating method thereof |
| CN104503733A (en) * | 2014-12-29 | 2015-04-08 | 中国科学院自动化研究所 | Merging method and device for state machine |
| CN107016214A (en) * | 2017-04-26 | 2017-08-04 | 上海工程技术大学 | A kind of parameter based on finite state machine relies on the generation method of model |
Non-Patent Citations (1)
| Title |
|---|
| 李延冰: "《第三层交换机软件的设计与实现》", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559406A (en) * | 2020-12-22 | 2021-03-26 | 无锡众星微系统技术有限公司 | SATA transport layer state machine optimization method |
| CN112765078A (en) * | 2021-01-20 | 2021-05-07 | 无锡众星微系统技术有限公司 | STP transmission layer realizing method for supporting multi-disk PIO command concurrence |
| CN112765078B (en) * | 2021-01-20 | 2022-02-08 | 无锡众星微系统技术有限公司 | STP transmission layer realizing method for supporting multi-disk PIO command concurrence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111526094B (en) | 2022-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10404581B2 (en) | Methods for managing transaction in software defined network | |
| CN111526094B (en) | RSTP state machine scheduling method and system | |
| US10498643B2 (en) | Method for constructing multipath forwarding rule, apparatus, and system | |
| WO2018010555A1 (en) | Northbound interface lte service automatic configuration method, northbound interface apparatus, and storage medium | |
| US20060253561A1 (en) | Method and apparatus for fast re-configuration of a network topology | |
| CN106453154B (en) | Real-time adjustment method and debugging system based on multicast copy packet | |
| CN1323522C (en) | Method for determining relation between routers at fringe of client site and virtual private network | |
| CN100459462C (en) | Communication system fault diagnosis method and system | |
| CN105743687A (en) | Method and device for determining node faults | |
| EP3691210B1 (en) | Flexible ethernet message forwarding method and apparatus | |
| US7257624B2 (en) | System for storing active and inactive configuration commands at a network node for managing its configuration state | |
| US9413603B2 (en) | Method for implementing virtual network, and network management system | |
| WO2017198052A1 (en) | Packet processing method and apparatus | |
| CN107995119B (en) | Method and system for realizing STP (spanning Tree protocol) of three or more layers of network equipment based on port model | |
| CN115514683A (en) | Method and device for determining packet loss reason, exchange chip and storage medium | |
| CN109495597A (en) | System and method, the equipment on-line management method of online modification device target address | |
| CN112543142B (en) | Method and device for realizing RSTP ring network protocol based on FPGA | |
| CN111835538B (en) | Management method and system for optical communication service and OAM dependency relationship | |
| CN111698163A (en) | OVS-based full-switching network communication method, device and medium | |
| CN112787834B (en) | Method and system for automatically generating network layer link | |
| CN112769650A (en) | Multi-VLAN loop detection method and system | |
| CN108667508B (en) | Shared link risk group generation method and device | |
| CN106301571A (en) | Cross time-slot connects the method and apparatus of configuration | |
| CN101222408A (en) | VLAN topological generating method and device | |
| CN111787434B (en) | Method for optimizing OMCI message |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |