CN100504836C - Method for processing each unit in stacked network device according to fast spanning tree protocol - Google Patents
Method for processing each unit in stacked network device according to fast spanning tree protocol Download PDFInfo
- Publication number
- CN100504836C CN100504836C CNB031429548A CN03142954A CN100504836C CN 100504836 C CN100504836 C CN 100504836C CN B031429548 A CNB031429548 A CN B031429548A CN 03142954 A CN03142954 A CN 03142954A CN 100504836 C CN100504836 C CN 100504836C
- Authority
- CN
- China
- Prior art keywords
- port
- identification code
- unit
- priority
- bridge
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention is a method for making each unit process according to the rapid spanning tree protocol in the stack type network device, the method utilizes the function provided by the rapid spanning tree protocol, cooperates with the role bridging processing program selected by the port role of the invention, quickly selects the port with the best tree root priority on the stack type network device, and executes the work of the spanning tree protocol and the related operation by the port, thus, the work of the spanning tree protocol and the related operation which must be completed by the main unit in the traditional stack type network device can be dispersed to each slave unit, so as to effectively share the work load of the main unit, and further improve the network transmission efficiency of the stack type network system, and greatly improve the quality and the speed of the network information transmission.
Description
Technical field
The present invention is that a kind of each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast.
Background technology
In recent years, because the world, networking is flourish, network apparatus miscellaneous constantly is developed, and be used in widely in life and the working environment by all trades and professions, this development trend, not only quickened the speed and the efficient of information circulation, also in life and work, brought great convenience for people.In numerous network systems, especially with stack (Stacking) network system or rack (Chassis) second layer (Layer2)/3'sth layer (Layer3) networking switch, liked by market, these network apparatus not only are applied in all trades and professions widely, and may become the main flow of following network system development, employed networking switch in this kind stack network system, be according to the agreement of expansion tree, the networking topology (active topology) that construction one is active, selected spendable path (alternative path), cause gross error to avoid on the networking, the forming loop, effectively improve the confidence level (reliability) of regional network (LAN).
General speech, on the stack network apparatus, realize the mode of expansion tree agreement, many kinds are arranged, wherein the simplest a kind of, be by a certain unit on the stack network apparatus, generally be to number minimum unit (as: unit 1), carry out agreement of expansion tree and related operation (algorithm) thereof, this unit master unit (Master Unit) that is otherwise known as, other unit then is called as servant unit (Slave Unit), the title of these unit, though its exclusive naming method is arranged, in the switch of various types of networkings, but still has some differences, yet, no matter its title why, in narration of the present invention, is will be in order to carry out the unit of agreement of expansion tree and computing, be called master unit, and other unit is called the servant unit.Because, in the actual operation of expansion tree agreement, comprising: such as; Bridge joint agreement information unit package (the BridgeProtocol Data Unit that record is received, hereinafter to be referred as the BPDU package, be meant the special package of group's address), calculate expansion tree prioritized vector value (Spanning Tree priority vectors) and expansion tree timer numerical value (Spanning Tree timer values) ... wait processing, finished by master unit, so working load of master unit, the network apparatus quantity that will be connected along with each port mouth on the stack network apparatus, being linear increases, this phenomenon, not only will cause the networking transmission usefulness of stack network system significantly to reduce, also will badly influence the quality and the speed of network information transmission.
Summary of the invention
Because in the aforementioned conventional stack network apparatus, the working load of master unit is too big, cause the unclear problem of network information transmission quality and speed, the invention provides a kind of each unit that can in the stack network apparatus, make according to expanding the method that the tree agreement is handled fast, in the hope of utilizing the agreement of quick expansion tree, the work of agreement of expansion tree and related operation thereof will be carried out, be dispersed to the unit of respectively falling forward fifty-fifty, effectively to share the working load of master unit, and then improve the networking transmission usefulness of stack network system, significantly promote the quality and the speed of network information transmission.
A purpose of the present invention, it is the function of in the stack network apparatus, utilizing expansion tree agreement fast to be provided, make each unit in the network apparatus when the processing of expanding tree agreement, can carry out required necessity and change, so that the ability of configuration settings (reconfiguration) to be provided fast again.
Another object of the present invention, it is the function of in the stack network apparatus, utilizing expansion tree agreement fast to be provided, and cooperate bicker look in port to select Updt Roles the Bridge () handling procedure of (Port role Selection), promptly to select the Bu Kou that has best right of priority on this stack network apparatus, to carry out the work of agreement of expansion tree and related operation by this Bu Kou.
Another purpose of the present invention, be when handling according to the agreement of quick expansion tree, respectively the bridge joint parameter in this unit is necessary for identical value, and when arbitrary bridge joint parameter changes in to a unit, must change this bridge joint parameter in other unit synchronously, and pile up when being transmitted on the Bu Kou when a BPDU package.The agreement identification code field of two bit groups will be obtained the Bridge Port ID value in the mouth right of priority vector of port in this BPDU package, when this BPDU package is received between each unit, this message right of priority vector (message priority vector) is to be resolved by this agreement identification code field value, so need not in addition this agreement identification code (Protocol Identifier), protocol revision identification code (Protocol VersionIdentifier) and bpdu type (Type) to be checked.
Another purpose again of the present invention, be when being enabled (enabled) at Dang Bukou, port mouth right of priority vector (port priority vector) is by obtaining in the assigned priorities vector (designated priority vector), realizing expanding fast in the distribution of tree right of priority (Distributed Rapid Spanning TreePriority), pile up the assigned priorities vector of Bu Kou, then be to get identical value by duplicating in the tree root right of priority vector (rootpriority vector), sole exception, be when this unit when being a tree root bridge (root Port ID is zero), be this to be piled up port mouth identification code insert Bridge Port ID field, this practice, can avoid the Bu Kou that piles up on each unit to become an appointment Bu Kou, exchange and cause that unnecessary information often takes place, therefore, only allow the minimum port mouth identification code of piling up, become one and specify Bu Kou, then be tree root Bu Kou (Root Port) as for other the role who piles up Bu Kou.
Above-mentioned purpose of the present invention is realized by following technical scheme.
A kind of each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, this method is to be applied in the stacked type network apparatus, make this stack network apparatus can utilize role's bridge joint handling procedure in the defined port bicker look selected state machine of quick expansion tree agreement, make a plurality of unit on it, when this role's bridge joint handling procedure is triggered, finish following processing, to select the Bu Kou that has best right of priority on this stack network apparatus, to carry out agreement of expansion tree and relevant computing work by this Bu Kou:
At first, tree root right of priority in each unit and tree root time fences place value are replaced with bridge joint right of priority and bridging time respectively;
With the tree root right of priority field value in each unit, compare with the port mouth right of priority that receives each Bu Kou after the message, and upgrade this tree root right of priority field value according to this, and respectively whether this port mouth right of priority is good to judge tree root right of priority field value;
Respectively this port mouth right of priority is not good as if tree root right of priority field value, then increases the numbering of port mouth identification code, and to next Bu Kou, whether the identification code of judging this Bu Kou again is less than the port mouth identification code of maximum;
If the identification code of this Bu Kou is less than the port mouth identification code of maximum, and the Bu Kou of this identification code has received message, then heavily cover aforementioned activities again, continuation compares tree root right of priority field value in each unit and the port mouth right of priority that receives this Bu Kou after the message, and upgrade this tree root right of priority field value according to this, and respectively whether this port mouth right of priority is good to judge tree root right of priority field value;
Wherein, when fast the agreement of expansion tree is handled, respectively the bridge joint parameter in this unit is necessary for identical value, and when arbitrary bridge joint parameter changes in to a unit, must change this bridge joint parameter in other unit synchronously; When bridge joint agreement information unit package is piling up when being transmitted on the Bu Kou, agreement identification code field in this bridge joint agreement information unit package, with the bridge joint port mouth identity value that obtains in the mouth right of priority vector of port, when this bridge joint agreement information unit package was received between each unit, described port mouth right of priority vector was to be resolved by this agreement identification code field value; Realizing that expansion is set in the distribution of right of priority fast, pile up the assigned priorities vector of Bu Kou, then be to get identical value by duplicating in the tree root right of priority vector.
Described each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, it is characterized in that: wherein working as this unit is a tree root bridge, be that its tree root Bu Kou is when knowing identification code and being zero, be this to be piled up port mouth identification code insert bridge joint port mouth identification code field, only allow the minimum port mouth identification code of piling up, become one and specify Bu Kou, then be tree root Bu Kou as for other the role who piles up Bu Kou.
Described each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, it is characterized in that: wherein respectively this port mouth right of priority is good as if tree root right of priority field value, then tree root right of priority in each unit and tree root time fences place value is replaced with port mouth right of priority and port mouth time respectively;
Increase the numbering of port mouth identification code again, to next Bu Kou, continue abovementioned steps, whether the identification code of judging this Bu Kou is less than the port mouth identification code of maximum.
Described each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, it is characterized in that: wherein if the identification code of this Bu Kou less than the port mouth identification code of maximum, but the Bu Kou of this identification code does not receive message, then repeat aforementioned activities, increase the numbering of port mouth identification code again, to next Bu Kou; Continue abovementioned steps, whether the identification code of judging this Bu Kou is less than the port mouth identification code of maximum.
Described each unit that can make in the stack network apparatus is characterized in that according to expanding the method that the tree agreement is handled fast: wherein if the identification code of this Bu Kou greater than the port mouth identification code of maximum, judges that more whether this Bu Kou is for piling up Bu Kou; And if bridge joint port mouth identification code equals port mouth identification code, that is tree root port mouth identification code is when equalling zero, with assigned priorities in each unit and fixed time field value, replace with tree root right of priority and tree root time respectively, and increase the numbering of port mouth identification code, to next Bu Kou.
Described each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, it is characterized in that: wherein if the non-Bu Kou of piling up of this port mouth, promptly upgrade assigned priorities, with the appointment bridge joint identification code in each unit, appointment port mouth identification code and bridge joint port mouth identification code field value, replace with bridge joint identification code, port mouth identification code and another port mouth identification code respectively; And the numbering of increase port mouth identification code, to next Bu Kou.
The described method that can make each unit handle according to quick expansion tree agreement in the stack network apparatus is characterized in that: whether the identification code that wherein can continue to judge this Bu Kou is less than the port mouth identification code of maximum; If the identification code of this Bu Kou, is the selected port bicker look of each Bu Kou greater than the port mouth identification code of maximum, finish the selection procedure of port bicker look.
Described each unit that can make in the stack network apparatus is according to expanding the method that the tree agreement is handled fast, it is characterized in that: wherein the identification code of this Bu Kou is less than the port mouth identification code of maximum, then continue abovementioned steps, judge this Bu Kou whether for piling up Bu Kou, and proceed the selection procedure of port bicker look.
The invention has the advantages that:
By the above as can be known, the present invention is a function of utilizing the agreement of aforementioned quick expansion tree to be provided, cooperate selected the UpdtRolesBridge () handling procedure of port bicker look of the present invention, can promptly select the Bu Kou that has best tree root right of priority on this stack network apparatus B, to carry out the work of agreement of expansion tree and related operation by this Bu Kou, so, can be with the expansion tree agreement that must finish by master unit in the traditional stack formula network apparatus and the work of related operation, be dispersed to the unit of respectively falling forward, so utilize the present invention not only can effectively share the working load of master unit, and can and then improve the networking transmission usefulness of stack network system, significantly promote the quality and the speed of network information transmission.
For more clearly expressing technological means of the present invention and operation, conjunction with figs. is lifted a preferred embodiment now, is described as follows:
Description of drawings
Shown in Figure 1 is the line synoptic diagram of network apparatus in the most preferred embodiment of the present invention.
The present invention of being shown in Figure 2 utilizes Updt the RolesBridge () handling procedure in quick expansion tree agreement (being IEEE802.1W) defined port bicker look selected (Port Role Selection) state machine (state machine), when making this Updt Roles Bridge () be triggered (triggered), bridge B shown in Figure 1 goes up the treatment scheme synoptic diagram of each unit.
Shown in Figure 3 is the follow-up processing flow synoptic diagram of hookup 2.
Fig. 4 is one of expansion tree root right of priority vector synoptic diagram.
Fig. 5 is two of an expansion tree root right of priority vector synoptic diagram.
Fig. 6 is three of an expansion tree root right of priority vector synoptic diagram.
Fig. 7 is four of an expansion tree root right of priority vector synoptic diagram.
Fig. 8 is the right of priority vector that bridge B goes up each unit b1, b2, b3.
Embodiment
The quick expansion tree agreement that the present invention is alleged, be IEEE802.1W, this agreement is according to IEEE802.1D and the agreement of IEEE802.1t expansion tree, carry out revised invulnerable release, the agreement of expansion tree can make each unit in the stack network apparatus fast, when expanding the processing of tree agreement, and can be according to expansion tree agreement fast, finish required necessity and change, and make each unit possess fast the ability of configuration (reconfiguration) again.Traditionally, defined expansion tree right of priority vector (Spanning Treepriority vector) in the agreement of expansion tree, it is a kind of information that can between different STP bridges (bridges), transmit, this information comprises such as configuration settings message (configuration messages), BPDU package ... etc., with at each Bu Kou (Ports) on this bridge respectively, assign (assign) role of answering (Port role), therefore, each expansion tree right of priority vector all should comprise following constitutive requirements basically:
(1) identification code (bridge identifier) of tree root bridge (Root Bridge) is called tree root identification code (hereinafter to be referred as RootBridgeID);
(2) arrive the path (Root path) (hereinafter to be referred as RootpathCost) of the required process of tree root bridge by transmission bridge (Transmitting Bridge);
(3) identification code (bridge identifier) of transmission bridge (Transmitting Bridge) is called designated bridge identification code (hereinafter to be referred as DesignatedBridgeID);
(4) in order to the identification code (identifier) of the Bu Kou (port) that transmits message (message), be called and specify port mouth identification code (hereinafter to be referred as DesignatedportID);
(5) in order to the identification code of the Bu Kou that receives message (message), be called bridge joint port mouth identification code (hereinafter to be referred as BridgePortID).
In this expansion tree right of priority vector, definition has a kind of so-called port mouth right of priority vector (PortPriority Vector) at Bu Kou, this port mouth right of priority vector is to finish at a certain Bu Kou to receive the BPDU package, and when finishing the renewal of any data, in order to define the vector value of this Bu Kou;
Port mouth right of priority vector={ RootBridgeID:RootpathCost:DesignatedBridgeID:Designatedp ortID:BridgePortID}
In this expansion tree right of priority vector, definition has a kind of so-called message right of priority vector (MessagePriority Vector) in addition, it then is the vector value of in an allocation message that is received, passing on, now the bridge with an identification code B is that example is illustrated, identification code on this bridge B is the Bu Kou of PB, be that a identification code on the bridge of D is the appointment Bu Kou (designated port) of PD by an identification code, receive an allocation message, the knowledge identification code of having declared tree root bridge (Root Bridge) in this allocation message is RD, and declared that by the path of transmitting the required process of bridge arrival tree root bridge be RPCD, at this moment, the message right of priority vector among this bridge B is:
Message right of priority vector={ RD:RPCD:D:PD:PB}
In this expansion tree right of priority vector, at the defined a kind of so-called tree root right of priority vector of port mouth (Root Priority Vector), can get by a port mouth right of priority vector calculation that is received, its account form is to receive the path P PCPB that Bu Kou arrives the required process of tree root bridge, with the path addition that transmits the required process of bridge arrival tree root bridge, comprising the identification code that will receive Bu Kou as last constitutive requirements (final component), at this moment, the message right of priority vector among this bridge B is:
Tree root right of priority vector={ RD:RPCD+PPCPB:D:PD:PB}
In addition, in this example, the bridge right of priority vector (Bridge PriorityVector) of this bridge B, it also is a kind of expansion tree prioritized vector, mainly be when it is chosen to be tree root bridge (RootBridge), be sent to other bridge, the bridge right of priority vector in this bridge B is:
Bridge right of priority vector={ B:0:B:0:0}
Therefore, in aforementioned example,, and mutually after the computing, can obtain prepreerence right of priority vector by the right of priority that received among this bridge D vector when the tree root right of priority vector of this bridge B:
Tree root right of priority vector={ B:0:B:0:0} is when being good as if bridge B than tree root bridge RD;
Or
{ RD:RPCD+PPCPB:D:PD:PB} is when being difference as if bridge B than tree root bridge RD;
At this moment, by the identification code B on this bridge B is replaced DesignatedBridgeID, and with the identification code QB on the port mouth Q on this bridge B, replace DesignatedportID and BridgePortID, the assigned priorities vector of this port mouth Q (Designated Priority Vector) then promptly becomes tree root right of priority vector:
The assigned priorities vector=B:0:B:QB:QB), when being good than tree root bridge RD as if the B bridge;
Or
{ RD:RPCD+PPCPB:D:PD:PB} is when being difference as if the B bridge than tree root bridge RD;
If when this assigned priorities vector is good than port mouth right of priority vector, this Bu Kou will become the appointment Bu Kou of the local-area network that is connected, and this port mouth right of priority vector will be updated.In addition, the message right of priority vector in the RSTP BPDU package that a port mouth is transmitted often comprises preceding four constitutive requirements in the port mouth right of priority vector of this Bu Kou, and is also like this when both having made this Bu Kou be a tree root port mouth.
In all unit of stack network apparatus, because they must appear to a bridge, so the parameter of each bridge all keeps identical value, and all servant unit (slave unit) all must have the identical bridge identification code (BridgeID with master unit (master unit), be BridgePriority+MAC address (being the entity address)), same situation, also occur in bridge time (BridgeTime, comprise Forward Delay, Hello Time, Max Age, Message Age), rootPortID, on the parameter such as rootPriority and rootTime, so the respectively action of this variable value of any change all must be carried out synchronously.
In the stack network apparatus, the reception of BPDU package and transmission, be program or state machine (state machine) running fully according to defined among the IEEE802.1W, only piling up Bu Kou (stack port, promptly in order to be connected to the Bu Kou of other unit) on do to revise (modification) slightly, when piling up the port oral erotism BPDU package transmitted, the agreement identification code (protocolIdentifier) of two bit groups will be taken from the BridgePortID value in the mouth right of priority vector of port in the BPDU package, when between each unit at the stack network apparatus, when receiving the BPDU package, this piles up Bu Kou and need not agreement identification code (protocolIdentifier), the type (Type) of protocol revision identification code (protocol Version Identifier) and BPDU package checks that the BridgePortID value in the message right of priority vector is by parsing in agreement identification code (protocol Identifier) field.
Another is revised, and is to finish in the updtRolesBridge of IEEE802.1W defined () handling procedure, and this processing will be in the deep discussion of follow-up do.As for, all other fast expansion tree state machines (Rapid Spanning tree state machine) will keep identical with the IEEE802.1W defined.
The present invention is a function of utilizing the agreement of aforementioned quick expansion tree to be provided, cooperate the following stated method of the present invention, can make in the traditional stack formula network apparatus expansion tree agreement that must finish by master unit and the work of related operation, be dispersed to the unit of respectively falling forward fifty-fifty.
In a preferred embodiment of the present invention, be that network system with an active networking topology is an example, be illustrated, consult shown in Figure 1, this network system comprises an independent network apparatus A (stand alone device) and a stacked type network apparatus B of line each other, on this stack network apparatus B, the so-called Bu Kou of piling up (stack port) 26,52 and 78 is meant that this stack network apparatus B goes up in order to make each unit interconnect, to form the Bu Kou of a single stack device (single stacking device).In this embodiment, each unit of the network apparatus A that this is independent and this stack network apparatus B can be respectively a bridge (Bridge), but, this only is a specific embodiment of the present invention, when the present invention implements in reality, is not limited thereto, all any this skill persons that is familiar with, in field of the present invention, these bridges are replaced with other network apparatus, all should be encompassed in the claim scope.
In this embodiment, this bridge A is an independent network apparatus, this bridge B then is the stacked type network apparatus, and comprise three unit b1, b2 and b3 on it, wherein to have than this bridge B be good Bridge ID right of priority to this bridge A, and this bridge A is a tree root bridge (root bridge).In this embodiment, suppose that all Bu Kou all have identical PortPuthCost, as: 10, at this moment, the port mouth 1 of this bridge A is connected to the port mouth 53 (the 1st Bu Kou of the unit b3 that promptly falls forward) of this bridge B, the port mouth 2 of this bridge A is connected to the port mouth 27 (the 1st Bu Kou of the unit b2 that promptly falls forward) of this bridge B, and the port mouth 3 of this bridge A is connected to the port mouth 25 (being the 25th Bu Kou of master unit b1) of this bridge B, the port mouth 53 of unit b3 of wherein falling forward is a tree root Bu Kou (root port), it is the state that is in transmission (forwarding) message, master unit b1 and servant unit b2, the port mouth 26 of b3,52,78 etc., then be respectively and specify Bu Kou (designated port), it is the state that is in transmission (forwarding) message, the port mouth 25 and 27 of master unit b1 and servant unit b2, be change Bu Kou (alternate port), be to be in useless (discarding) state, as for, the port mouth 1 of this bridge A, 2 and 3, then being and specifying Bu Kou (designated port), is the state that is in transmission (forwarding) message.
When these bridges begin start, respectively this bridge A and B will begin to calculate tree root right of priority vector, at this moment, if respectively this bridge A and B do not connect appropriate hypothesis each other as yet, then this two bridge can oneself be considered as the tree root bridge with it, and calculates tree root right of priority vector (as shown in Figure 4).
When Bu Kou was enabled (enabled), port mouth right of priority vector was by obtaining in the assigned priorities vector; Realizing expanding fast in the distribution of tree right of priority (Distributed Rapid Spanning Tree Priority), pile up the assigned priorities vector of Bu Kou, then be to get identical value by duplicating in the tree root right of priority vector, sole exception, be when bridge when being a tree root bridge (its root Port ID is zero), be this to be piled up port mouth identification code insert Bridge Port ID field, this practice, can avoid the Bu Kou that piles up on each unit to become an appointment Bu Kou, exchange and cause that unnecessary information often takes place, therefore, only allow the minimum port mouth identification code of piling up, become one and specify Bu Kou, then be tree root Bu Kou (Root Port) as for other the role who piles up Bu Kou.
In the present invention, tree root right of priority vector is put into the assigned priorities of piling up Bu Kou, its effect is to allow that piling up Bu Kou is sent to other unit with right of priority best in its unit, to compare and to calculate.Value in the assigned priorities vector will be assigned in the mouth right of priority vector of port, and when beginning, the role who piles up Bu Kou in each unit all is set at and specifies Bu Kou (Designated port).So, piling up Bu Kou will be with broadcast mode (broadcast), message is sent to all send the state machine unit that (port transmitstate machine) controlled, that is received BPDU package is handled by port mouth information state machine (port information state machine) by the port oral instructions.At last, tree root right of priority vector (B:0:B:0:26) will be chosen to be in all unit best tree root right of priority vector, as for the value of the assigned priorities vector of other Bu Kou, then remain on and original identical value.Therefore, the port mouth 26 of this bridge B is to specify Bu Kou (designated port), and port mouth 52 and 78 then is tree root Bu Kou (rootport), with when each hello time, receives the repetition information (repeatinformation) that is transmitted by this port mouth 26.
In this embodiment, when this bridge A and B have connected appropriate, and before last each unit of this bridge B begins to exchange information each other, the preferable message (A:0:A:3:25) that the port mouth 25 of this bridge B transmits the port mouth 3 that receives earlier by this bridge A, and with its replacement port mouth right of priority vector, recomputate the role of this port mouth 25 again, and make the port mouth 25 of this bridge B become tree root Bu Kou, pile up port mouth 26 as on this bridge B this, then do not receive any BPDU package all the time, and be chosen to be appointment Bu Kou.At this moment, because the port mouth right of priority of this port mouth 26 vector is inequality with the assigned priorities vector, so updtInfo will be set as really, so that port mouth right of priority vector is upgraded operation (as shown in Figure 5).
When the port mouth 27 of this bridge B receives the preferable message (A:0:A:2:27) that the port mouth 2 by this bridge A transmits, to replace port mouth right of priority vector with it, recomputate the role of this Bu Kou, and make the port mouth 27 of this bridge B become tree root Bu Kou, pile up port mouth 52 as for this bridge A, then do not receive any BPDU package all the time, and be chosen to be and specify Bu Kou, at this moment, because the port mouth right of priority vector of this port mouth 52 is inequality with the assigned priorities vector, therefore updt Info will be set as really, so that port mouth right of priority vector is upgraded operation (as shown in Figure 6).
When the port mouth 53 of this bridge B receives the preferable message (A:0:A:1:53) that the port mouth 1 by this bridge A transmits, to replace port mouth right of priority vector with it, recomputate the role of this Bu Kou, and make the port mouth 53 of this bridge B become tree root Bu Kou, pile up port mouth 78 as for this bridge A, then do not receive any BPDU package all the time, and be chosen to be and specify Bu Kou, at this moment, because the port mouth right of priority vector of this port mouth 78 is inequality with the assigned priorities vector, therefore updtInfo will be set as really, so that port mouth right of priority vector is upgraded operation (as shown in Figure 7).
In this embodiment, when last each unit of this bridge B begins to exchange information each other, the piling up Bu Kou and will the right of priority vector be sent to all other unit of each unit with broadcast mode, wherein because servant unit b3 does not receive the preferable message that is transmitted by master unit b1 and servant unit b2, so can not recomputate its port bicker look, as for master unit b1 and servant unit b2, then { the preferable message that A:10:A:1:53} brought is so will recomputate its port bicker look respectively because of receiving message right of priority vector (mes sagepriority vector).So, master unit b1 and servant unit b2 will accept A:10:A:1:53}, and with it as tree root right of priority vector best in all unit, replace original tree root right of priority vector { A:10:A:3:25} and { A:10:A:2:27} respectively.At this moment,, will become change Bu Kou (alternate poth), and this bridge B goes up the right of priority vector (as shown in Figure 8) of each unit b1, b2, b3 in order to receive these port mouths 25 and 27 of the BPDU package that transmits by this bridge A (its infols=Mine).
In the aforementioned embodiment, because many control programs, all are relevant regulations according to the alleged quick expansion tree agreement (being IEEE802.1W) of the present invention, give unnecessary details so seldom give at this.Now only partly, illustrate as the back with regard to feature of the present invention:
The present invention utilizes the updtRolesBridge () handling procedure of expanding fast in tree agreement (being IEEE802.1W) defined port bicker look selected (Portrole Selection) state machine (state machine), when making this updtRolesBridge () be triggered (triggered), this bridge B goes up each unit can be according to the following step, consult shown in Fig. 2,3, handle, to calculate the Bu Kou that has best tree root right of priority on this stack network apparatus B:
(101) at first, consult shown in Figure 2ly, RootPriority in each unit and RootTimes field value are replaced with BridgePriority and BridgeTimes respectively;
(102), compare with the PortPriorit of each Bu Kou that receives message, and upgrade this RootPriority field value according to this with the RootPriority field value in each unit;
(103) respectively whether this PortPriorit is good to judge RootPriority field value; If, continue step (104), otherwise, carry out step (105);
(104) RootPriority in each unit and RootTimes field value are replaced with PortPriorit and PortTimes respectively;
(105) numbering of increase port mouth identification code is to next Bu Kou;
(106) whether the identification code of judging this Bu Kou is less than the port mouth identification code of maximum; If, continue step (107), otherwise, carry out step (108):
(107) whether the Bu Kou that judges this identification code has received message; If, continue step (102), otherwise, carry out step (105);
(108) judge that whether this Bu Kou is for piling up Bu Kou (stacking link port); If, continue step (109), otherwise, carry out step (110);
When (109) equaling ProtID (being that rootPortID equals zero), with DesignatedPriorty in each unit and DesignatedTimes field value, replace with RootPriority and RootTimes respectively, and continue step (111) as if BridgePortID;
(110) upgrade DesignatedPriorty,, replace with bridge identification code (BridgeID), PortID respectively the DesignatedBridgeID in each unit, DesignatedProtID and BridgePortID field value;
(111) consult shown in Figure 3ly, increase the numbering of port mouth identification code, to next Bu Kou;
(112) whether the identification code of judging this Bu Kou is less than the port mouth identification code of maximum; If, continue step (108), otherwise, carry out step (113);
(113) be the selected port bicker look of each Bu Kou;
(114) selection procedure of end port bicker look.
The above only is of the present invention one best specific embodiment, but, when the present invention implements in reality, be not limited thereto all any this skill persons that is familiar with, in field of the present invention, can think easily and variation or modification, all should be encompassed in the application right claimed range of being advocated.
Claims (8)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031429548A CN100504836C (en) | 2003-06-12 | 2003-06-12 | Method for processing each unit in stacked network device according to fast spanning tree protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031429548A CN100504836C (en) | 2003-06-12 | 2003-06-12 | Method for processing each unit in stacked network device according to fast spanning tree protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1567281A CN1567281A (en) | 2005-01-19 |
| CN100504836C true CN100504836C (en) | 2009-06-24 |
Family
ID=34471214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031429548A Expired - Fee Related CN100504836C (en) | 2003-06-12 | 2003-06-12 | Method for processing each unit in stacked network device according to fast spanning tree protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100504836C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100437482C (en) * | 2006-12-31 | 2008-11-26 | 中国建设银行股份有限公司 | Developing platform of application software, generating method and operation platform and operation method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5684798A (en) * | 1994-06-22 | 1997-11-04 | U.S. Philips Corporation | Communication system comprising a network and a multiplexing device and multiplexing device suitable for such a system |
| CN1336058A (en) * | 1998-12-10 | 2002-02-13 | 诺基亚网络有限公司 | System and method for pre-filtering low priority packets |
| CN1344087A (en) * | 2000-08-18 | 2002-04-10 | 阿尔卡塔尔公司 | Block method of mark data transfer stream, and marker of performing such method |
-
2003
- 2003-06-12 CN CNB031429548A patent/CN100504836C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5684798A (en) * | 1994-06-22 | 1997-11-04 | U.S. Philips Corporation | Communication system comprising a network and a multiplexing device and multiplexing device suitable for such a system |
| CN1336058A (en) * | 1998-12-10 | 2002-02-13 | 诺基亚网络有限公司 | System and method for pre-filtering low priority packets |
| CN1344087A (en) * | 2000-08-18 | 2002-04-10 | 阿尔卡塔尔公司 | Block method of mark data transfer stream, and marker of performing such method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1567281A (en) | 2005-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7558878B2 (en) | Optimal sync for rapid spanning tree protocol | |
| US6304575B1 (en) | Token ring spanning tree protocol | |
| JP4143544B2 (en) | Ingress card and packet transmission method using ingress card | |
| CN101170483B (en) | A method for routing and switching equipment stacking | |
| US7352707B2 (en) | Processing method enabling each unit in stacking network device to run rapid spanning tree protocol | |
| US7593320B1 (en) | Failover scheme for stackable network switches | |
| US9819572B2 (en) | Multiple ring identification and configuration protocol | |
| CN102576343A (en) | Computer system, and migration method of virtual machine | |
| CN106209689A (en) | From the multicast data packet forwarding method and apparatus of VXLAN to VLAN | |
| CN101335685A (en) | Method implementing priority process of special packet by redirecting technique | |
| US7280488B2 (en) | Communication device, network system using same, and method of constructing spanning tree | |
| US6724734B1 (en) | Creating a spanning tree of a network including clusters | |
| CN100504836C (en) | Method for processing each unit in stacked network device according to fast spanning tree protocol | |
| CN106059964B (en) | Message forwarding method and device | |
| WO2009062351A1 (en) | Method for stacking system merging | |
| CN106034071A (en) | Data message transmission method and edge routing bridge equipment | |
| CN118282940A (en) | Path finding method, message transmission method, device and medium | |
| US6718396B1 (en) | Network structure method and route determination equipment | |
| US20150036508A1 (en) | Method and Apparatus For Gateway Selection In Multilevel SPB Network | |
| CN102075374A (en) | Method and system for reconstructing single-ring network topology | |
| CN107733724B (en) | Configuration method and device of ring network and ring network | |
| EP1727318B1 (en) | Facilitating computation of role and state information for multiple spanning tree instances | |
| CN104410588A (en) | Method of implementing virtual switching on router equipment and router equipment | |
| CN117118893A (en) | Communication method, device and network, network element, forwarding enhancement system and storage medium | |
| CN109005120B (en) | Message processing method and network equipment |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090624 Termination date: 20100612 |