CN102215112A - Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards - Google Patents

Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards Download PDF

Info

Publication number
CN102215112A
CN102215112A CN2010101439802A CN201010143980A CN102215112A CN 102215112 A CN102215112 A CN 102215112A CN 2010101439802 A CN2010101439802 A CN 2010101439802A CN 201010143980 A CN201010143980 A CN 201010143980A CN 102215112 A CN102215112 A CN 102215112A
Authority
CN
China
Prior art keywords
switch
ils
message
neighbor
hlo
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
Application number
CN2010101439802A
Other languages
Chinese (zh)
Other versions
CN102215112B (en
Inventor
张长君
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
New H3C Technologies Co Ltd
Original Assignee
Hangzhou H3C Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou H3C Technologies Co Ltd filed Critical Hangzhou H3C Technologies Co Ltd
Priority to CN2010101439802A priority Critical patent/CN102215112B/en
Publication of CN102215112A publication Critical patent/CN102215112A/en
Application granted granted Critical
Publication of CN102215112B publication Critical patent/CN102215112B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides a method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing an FSPE (Fiber Shortest Path First) protocol and switchboards. The method is applied to an FCoE networking system comprising a plurality of switchboards; when one of the switchboards is a local-end switchboard, the other switchboards are opposite-end switchboards of the local-end switchboard; and the method comprises the following steps of: receiving HLO SW_ILS (Hello Switch Internal Link Services) messages from the opposite-end switchboards by the local-end switchboard, and searching whether neighbor state machines corresponding to the opposite-end switchboards are established in the local-end switchboard according to domain identifiers (ID) of the opposite-end switchboards carried in the HLO SW_ILS messages; and if the neighbor state machines are not established, establishing the neighbor state machines corresponding to the opposite-end switchboards to finish a neighbor discovery process of the opposite-end switchboards. By adopting the method and the switchboards, the neighbor switchboards of the switchboards in an FCoE network can be discovered by the switchboards in the FCoE network.

Description

Be applied to the method and the switch of the optimization FSPF agreement of FCoE networking
Technical field
The present invention relates to Ethernet optical-fibre channel (FCoE, Fiber Channel over Ethernet) technical field, relate in particular to a kind of method and switch of optimization optical fiber SPF (FSPF, FabricShortest Path First) agreement of the FCoE of being applied to networking.
Background technology
In the FC network, each switch identifies by relam identifier (Domain ID), and message is transmitted between different switches.The FSPF agreement is the employed dynamic route discovery agreement of FC network, and this agreement is described in the fs-sw-5 standard of T11 tissue issue.The FSPF agreement couples together switches all in the FC network, by synchronization link slip condition database (LSDB, Link StateDataBase), calculate in the FC network route of a switch, thereby realize of the visit of a N node pellucidly another one N node to other switch.
Above-mentioned LSDB is the set of the Link State number scale record (LSR, Link State Record) that all switches generated in the FC network, and switch is by generating the topological relation that LSR describes own and its neighbours.The process of LSDB is specially synchronously: in the FC network, each switch that enables FSPF generates LSR, is used to describe own and its neighbours' relation; The LSR that self is generated alternately between the neighboring switch if received than own database LSR new or that oneself does not have, then replaces original LSR with this LSR or is installed among the LSDB.All carry out same alternately between per two adjacent switches, the LSDB that then finally finishes in the whole FC network is synchronous.
The LSDB of FSPF agreement is realized by three kinds of messages synchronously, specifically comprise: calling (the HLO SW_ILS of switch inner link service, Hello Switch Internal Link Services) message, be used to check end-to-end (Two-Way) relation, and switch can generate LSR according to the Domain ID in this message; The Link State of switch inner link service upgrades (LSU SW_ILS, Links State UpdateSW_ILS) message, is used for a switch sends LSR from this switch to the another one switch; Link state acknowledgment (LSA SW_ILS, the Links StateAcknowledgement SW_ILS) message of switch inner link service is used for the LSR that receives is replied.
Synchronous in order to realize LSDB, the neighbor state machine of a correspondence is set up and safeguarded to switch for its each neighbor switch, the FSPF protocol definition different conditions of neighbor state machine, be used to represent the current state of corresponding neighbor switch; When different situations occurring, the neighbor state machine carries out transition between different conditions.
As Fig. 1 is the status change flow chart of FSFP neighbor state machine in the prior art.
The initial condition of neighbor state machine is for the machine of delaying (Down) state, under this state, and E port (E_Port) state notifying that port reported of respective neighbours switch to be connected such as switch.After receiving the E_Port state notifying, show that this port starts, be initialization (Init) state with the transition of neighbor state machine.
After reaching the Init state, switch will send HLO SW_ILS message to neighbor switch at interval with HLO SW_ILS_Interval (keeper can dispose).When receiving the HLOSW_ILS message that neighbor switch sends, wherein Domain_ID and port index (Port Index) are preserved, so that generating LSR, the back uses; If the Domain ID that receiving end relam identifier wherein (Recipient Domain_ID) field is carried is identical with the Domain ID of oneself, the Two-Way of this switch and neighbor switch relation is just set up so, the two just can begin mutual LSDB, and neighbor state machine transition this moment are database exchange (Database Exchange) state.
At Database Exchange state, two mutual self whole LSDB of neighbours' switch each other, promptly the LSR by mutual description chain line state finishes (LSR is carried by LSU SW_ILS message).If switch received than own database LSR new or that oneself does not have, so this LSR is replaced original LSR or be installed among the LSDB.From this state can transition be two kinds of different states, if that is: receive the LSU SW_ILS message that database is finished (Database Complete) mark that is provided with of corresponding neighbor switch transmission, the transition of neighbor state machine are that database identification is waited for (Database Ack Wait) state so; If what received this moment is the LSA SW_ILS message that is provided with Database Complete mark that corresponding neighbor switch sends, the transition of neighbor state machine are that database is waited for (Database Wait) state so.
When being in Database Ack Wait state, when receive that neighbor switch sends be provided with the LSA SW_ILS message of DatabaseComplete mark the time,, the transition of neighbor state machine are complete (Full) state.
When being in Database Wait state, when receive neighbor switch be provided with the LSU SW_ILS message of DatabaseComplete mark the time, the transition of neighbor state machine are the Full state.
In a single day the neighbor state machine becomes the Full state, and neighbours' two switches will become syntople (Adjacency) so each other, and the ISL that connect two adjoining switch this moment can be used to transmit user data.And terminal device regenerates LSR, and it reaches syntople to inform peripheral equipment.
Existing FSFP agreement designs from FC networking application point of view, in the FC networking, and the only corresponding neighbor switch of port, therefore existing FSFP agreement does not possess neighbours' discovery feature.On the contrary, in the FCoE networking, port can corresponding a plurality of neighbor switch, and this just requires to possess neighbours' discovery feature.This shows that existing FSFP agreement can not directly apply to the FCoE networking.
Summary of the invention
The invention provides a kind of method of optimization FSPF agreement of the FCoE of being applied to networking, can make the neighbor switch of the switch discovery self in the FCoE network.
The invention provides a kind of switch, can find the neighbor switch in the FCoE network.
Technical scheme of the present invention is achieved in that
A kind of method that is applied to the optimization FSPF agreement of FCoE networking, be applied to comprise the FCoE group network system of a plurality of switches, when in described a plurality of switches one of them is this end switch, other switch be this this end switch to end switch, described method comprises:
This end switch receives from the HLO SW_ILS message to end switch, according to the Domian ID to end switch that carries in the described HLOSW_ILS message, searches the described neighbor state machine to the end switch correspondence of self whether having created;
If do not create as yet, then create described neighbor state machine to the end switch correspondence, finish described neighbor discovery process end switch.
A kind of switch comprises:
Receiver module is used to receive the HLO SW_ILS message to end switch;
Neighbor discovery module, be used for the Domian ID that carries according to described HLO SW_ILS message to end switch, search this switch and whether created described neighbor state machine the end switch correspondence, if do not create as yet, then create described neighbor state machine, finish described neighbor discovery process to end switch to the end switch correspondence.
As seen, the present invention's proposition is applied to the method and the switch of the optimization FSPF agreement of FCoE networking, can utilize HLO SW_ILS message to find neighbours; When receiving the HLOSW_ILS message that end switch is sent, self do not create this neighbor state machine as yet if find to the end switch correspondence, then create this neighbor state machine, finish this neighbor discovery process end switch.
Description of drawings
Fig. 1 is the status change flow chart of FSFP neighbor state machine in the prior art;
Fig. 2 is applied to the method flow diagram of the optimization FSPF agreement of FCoE networking for the present invention;
Fig. 3 is the status change flow chart of FSFP neighbor state machine of the present invention;
The FCoE networking structure schematic diagram that Fig. 4 uses for the embodiment of the invention;
Fig. 5 is applied to the method flow diagram of the optimization FSPF agreement of FCoE networking for the embodiment of the invention.
Embodiment
The present invention proposes a kind of method of optimization FSPF agreement of the FCoE of being applied to networking, this method is applied to comprise the FCoE group network system of a plurality of switches, when in described a plurality of switches one of them is this end switch, other switch be this end switch to end switch, be applied to the method flow diagram of the optimization FSPF agreement of FCoE networking as Fig. 2 for the present invention, this method comprises:
Step 201: this end switch receives from the HLO SW_ILS message to end switch;
Step 202: this end switch is searched the described neighbor state machine to the end switch correspondence of self whether having created according to the Domian ID to end switch that carries in the described HLO SW_ILS message; If do not create as yet, then execution in step 203;
Step 203: this end switch is created described neighbor state machine to the end switch correspondence, finishes described neighbor discovery process to end switch.
After the above-mentioned steps 203, may further include:
This end switch judges whether described HLO SW_ILS message carries the Domian ID of this end switch, if carry, the state of then described neighbor state machine is set to the Up state; Otherwise the state of described neighbor state machine is set to the Down state.
In the above-mentioned steps 202, if lookup result for creating, then said method further comprises:
When the state of described neighbor state machine is the Down state, judge whether described HLO SW_ILS message carries the Domian ID of this end switch, if carry, then the status change with described neighbor state machine is startup (Up) state.
In the said method, the HLO SW_ILS message that switch sends comprises Recipient Domain_ID field, is used to carry all Domian ID to end switch that this switch has been found that.
In addition, in the FCoE networking, because a port of switch can corresponding a plurality of neighbor switch, if LSDB synchronously between per two neighbor switch will make mutual amount significantly rise, and mutual a large amount of duplicate message.Therefore, the present invention can elect main neighbours in a plurality of switches of neighbours each other in the FCoE networking, with other switch as non-main neighbours.Concrete way to elect is: after neighbor discovery process finishes, when this end switch is received HLO SW_ILS message, this end switch and have been found that to end switch in the maximum or minimum switch of election Domian ID, it as main neighbours, is generated and sent the HLO SW_ILS message that carries main neighbours Domian ID; After other switch is received this HLO SW_ILS message that carries main neighbours Domian ID, directly write down main neighbours' Domian ID.
Elect after the main neighbours, non-main neighbours are mutual LSU SW_ILS message only and between the main neighbours, carries out the mutual of LSDB; All information in the network all can be learnt and release by main neighbours, thereby reduce the mutual of message in a large number, increase network utilization.
In addition, by the status change flow process of FSFP neighbor state machine in the background technology as can be seen, existing FSFP neighbor state machine exists Database Ack Wait and these two intermediatenesses of Database Wait.The neighbor state machine can be a Database Ack Wait state from Database Exchange status change, and transition are the Full state again; Can be Database Ack state from Database Exchange status change also, transition be the Full state again.When being in Database Ack Wait state and Database Wait state, switch is not carried out any processing action, and visible Database Ack Wait state and Database Wait state are two unnecessary states; And in once normal mutual, a switch can not experience this two intermediatenesses simultaneously.Therefore, design these two intermediatenesses and can't play positive effect, increase the complexity of FSFP agreement on the contrary on foot.In order to solve aforementioned disadvantages, the present invention has deleted original Database Ack Wait state and Database Wait state, the status change process of FSFP neighbor state machine is simplified, and as the status change flow chart of Fig. 3 for FSFP neighbor state machine of the present invention, this transition process comprises:
Transition process one: when this end switch is received the HLO SW_ILS message of end switch, create this neighbor state machine to the end switch correspondence, the neighbor state machine is set to the Down state.
Transition process two: when being in the Down state, this end switch is received the HLOSW_ILS message that end switch is sent, and the Recipient Domain_ID field of this HLO SW_ILS message is carried the Domian ID of this end switch, is the Up state with these neighbor state machine transition then.
There are following difference in this transition process and prior art:
1) in the prior art, a port only can connect a neighbor switch, but when the port time spent, is the Init state with the transition of neighbor state machine, and this is actually a kind of the obscuring to port status and neighbor state machine state.The present invention is applied to the FCoE networking, and a port can connect a plurality of neighbor switch in the FCoE networking, and in this case, for fear of obscuring of port status and neighbor state machine state, the present invention has deleted the Init state of neighbor state machine.
2) in the prior art, receive the HLO SW_ILS message that end switch is sent after, be Database Exchange state with the neighbor state machine transition of correspondence, expression can be with the corresponding mutual LSDB of neighbor switch.And in the present invention, owing to have only between main neighbours and the non-master neighbours LSDB alternately, LSDB alternately between two non-main neighbours, so the language fails to express the meaning to represent this state general with Database Exchange, so the present invention changes this state into the Up state.
Transition process three: when being in the Up state, this end switch receives the LSA SW_ILS message that is provided with Database Complete mark that end switch is sent and is provided with the LSU SW_ILS message of Database Complete mark, is the Full state with the neighbor state machine transition of correspondence.
This process has been deleted Database Ack Wait state of the prior art and Database Wait state.
Below lifting specific embodiment introduces in detail.
As the FCoE networking structure schematic diagram of Fig. 4 for embodiment of the invention application.This FCoE networking comprises 4 switches, i.e. FCF 1, FCF 2, FCF 3 and FCF 4; If with one of them switch as this end switch, then other switch all be this switch to end switch.In 4 switches, the Domian ID maximum of FCF 1 elects FCF 1 as main neighbours the most at last, and other switch is non-main neighbours; By FCF 1 respectively with FCF 2, FCF 3 and FCF 4 mutual LSDB, the information of all switches is all learnt and is released by FCF 1 in the network.
In the present embodiment, find that the HLO SW_ILS message that sends between the switch is different with existing HLO SW_ILS message, below at first introduce the HLOSW_ILS message that present embodiment uses in order to realize neighbours.
As table 1 is existing HLO SW_ILS message structure:
Field Length Describe
FSFP?Header 20 Header field carries the Domian ID of switch
Reserved 4 Reserved field
Hello_Interval 4 The transmission of HLO SW_ILS message at interval
Dead_Interval 4 Carry out the time that neighbours find
Recipient?Domain_ID 4 The Domian ID that has been found that to end switch
Reserved 1 Reserved field
Qriginating?Port?Index 3 Port index
Table 1
Present embodiment is changed existing HLO SW_ILS message structure, the HLO SW_ILS message structure that uses for present embodiment as table 2:
Field Length Describe
FSFP?Header 20 Header field carries the Domian ID of switch
Recipient?Domain Number 4 Revised original Reserved field, the number of the neighbor switch that has been found that of expression, just Recipient thereafter
The number of Domain_ID
Hello_Interval 4 The transmission of HLO SW_ILS message at interval
Dead_Interval 4 Carry out the time that neighbours find
Recipient?Domain_ID 4 First that has been found that is to the Domian ID of end switch
Reserved 1 Reserved field
Qriginating?Port?Index 3 Port index
MasterNeighbor Domain_ID 4 Main neighbours' Domian ID
Recipient?Domain_ID 4 Other that has been found that is to the Domian ID of end switch
Table 2
Certainly, above-mentioned table 2 only is a kind of implementation of present embodiment, does not constitute the qualification to HLO SW_ILS message structure of the present invention; The present invention also can adopt other HLO SW_ILS message structure, as long as can carry all Domian ID to end switch that have been found that, and the Domian ID that further carries main neighbours gets final product.
Below be that example is introduced with the processing procedure of FCF 1 and FCF 2, be applied to the method flow diagram of the optimization FSPF agreement of FCoE networking as Fig. 5 for the embodiment of the invention, this embodiment comprises:
Step 501:FCF 1 sends HLO SW_ILS message to FCF 2, and this HLO SW_ILS message carries the Domian ID of FCF 1.
Step 502:FCF 2 searches the neighbor state machine of self whether having created FCF 1 correspondence according to the Domian ID of the FCF 1 that carries in this message; Owing to do not create as yet under initial condition, then FCF2 creates the neighbor state machine of FCF 1 correspondence, finishes the neighbor discovery process to FCF 1.And, because FCF 1 does not find FCF 2 as yet under initial condition, the Recipient Domain_ID field that FCF 1 sends to the HLO SW_ILS message of FCF 2 is not carried the Domian ID of FCF 2, and therefore, the state of FCF 2 these neighbor state machines is set to the Down state.
Step 503:FCF 2 sends HLO SW_ILS message to FCF 1, and this HLO SW_ILS message carries the Domian ID of FCF 2; And, because FCF 2 has had been found that FCF 1 in the step 502, therefore the Recipient Domain id field of this HLO SW_ILS message is also carried the Domian ID (if FCF 2 this moment has had been found that other switch, then the Recipient Domain_ID field of this HLO SW_ILS message also can be carried the Domian ID of this switch) of FCF 1.
Step 504:FCF 1 searches the neighbor state machine of self whether having created FCF 2 correspondences according to the Domian ID of the FCF 2 that carries in this message; Owing to do not create as yet under initial condition, then FCF1 creates the neighbor state machine of FCF 2 correspondences, finishes the neighbor discovery process to FCF 2.And because FCF 2 sends to the Domian ID that the Recipient Domain_ID field of the HLO SW_ILS message of FCF 1 has been carried FCF 1, therefore, the state of FCF 1 this neighbor state machine is set to the Up state.
Step 505:FCF 1 sends HLO SW_ILS message to FCF 2, and this HLO SW_ILS message carries the Domian ID of FCF 1; And because FCF 1 has had been found that FCF 2 in the step 504, so the Recipient Domain_ID field of this HLO SW_ILS message is also carried the Domian ID of FCF 2.
Step 506:FCF 2 searches the neighbor state machine of self whether having created FCF 1 correspondence according to the Domian ID of the FCF 1 that carries in this message; Owing to created the neighbor state machine of FCF 1 correspondence in the step 502, so the lookup result in this step is for creating.Because FCF 1 sends to the Domian ID that the Recipient Domain_ID field of the HLO SW_ILS message of FCF 2 has been carried FCF 2, therefore, FCF 2 is the Up state with the status change of this neighbor state machine.
So far, FCF 1 and FCF 2 have finished the neighbor discovery process to the other side, for other switch in the network, also take same process to carry out neighbours' discovery.In time period, the switch in the system is found all neighbours to Find Neighbor after neighbor discovery process begins (value that value can be carried for the Dead_Interval field).
Neighbor discovery process enters main neighbours and elects the stage after finishing, and is that example is introduced with FCF 1 and FCF 2 still.Present embodiment further comprises:
Step 507:FCF 1 receives the HLO SW_ILS message that FCF 2 sends, and the Master Neighbor Domain_ID field value of this HLO SW_ILS message is 0, does not just carry main neighbours' Domian ID, shows that main neighbours are not also elected.
Step 508:FCF 1 self and have been found that to end switch in the election main neighbours, just in FCF 1, FCF 2, FCF 3 and FCF 4, conduct an election, wherein the Domian ID maximum of FCF 1 is main neighbours so elect FCF 1.
Step 509:FCF 1 sends HLO SW_ILS message, and the MasterNeighbor Domain_ID field of this HLO SW_ILS message is carried the Domian ID of FCF 1.
Step 510:FCF 2 receives this HLO SW_ILS message, find that the Master Neighbor Domain_ID field of this HLO SW_ILS message carried main neighbours' Domian ID, then FCF 2 need not to conduct an election again, can directly write down these main neighbours' Domian ID.FCF 3 and FCF 4 also can receive this HLO SW_ILS message, and directly write down main neighbours' Domian ID.
So far, the switch in the network has been finished the election to main neighbours.Afterwards, it is mutual to carry out LSDB between main neighbours and the non-master neighbours, is that example is introduced with FCF 1 and FCF 2 still.Present embodiment further comprises:
It is mutual that step 511:FCF 1 and FCF 2 carry out LSDB.Concrete interactive mode is same as the prior art, and is not superfluous at this.
In addition, it is mutual also can to carry out LSDB between FCF 1 and FCF 3, FCF 1 and the FCF 4, and therefore the LSDB by all neighbor switch in FCF 1 study and the delivery system reduces the message interaction amount, increases network utilization.
After LSDB finishes alternately, can be the Full state with the transition of neighbor state machine, it is mutual that LSDB has been finished in expression.Be that example is introduced with FCF 1 and FCF 2 still, present embodiment further comprises:
Step 512:FCF 2 receives from the LSASW_ILS message that is provided with Database Complete mark of FCF 1 and the LSU SW_ILS message that is provided with Database Complete mark, is the Full state with the neighbor state machine transition of FCF1;
Step 513:FCF 1 receives from the LSASW_ILS message that is provided with Database Complete mark of FCF 2 and the LSU SW_ILS message that is provided with Database Complete mark, is the Full state with the neighbor state machine transition of FCF2.
The present invention also proposes a kind of switch, comprising:
Receiver module is used to receive the HLO SW_ILS message to end switch;
Neighbor discovery module, be used for the Domian ID that carries according to described HLO SW_ILS message to end switch, search this switch and whether created described neighbor state machine the end switch correspondence, if do not create as yet, then create described neighbor state machine, finish described neighbor discovery process to end switch to the end switch correspondence.
Above-mentioned switch can also comprise:
State setting module is used to judge whether the Recipient Domain_ID field of described HLO SW_ILS message carries the Domian ID of described switch, if carry, the state of then described neighbor state machine is set to the Up state; Otherwise the state of described neighbor state machine is set to the Down state.
When the lookup result of above-mentioned neighbor discovery module when creating, state setting module can also be used for: when the state of described neighbor state machine is the Down state, judge whether the RecipientDomain_ID field of described HLO SW_ILS message carries the Domian ID of described switch, if carry, then the status change with described neighbor state machine is the Up state.
Above-mentioned switch can also comprise:
The election module, be used for after described switch is finished neighbor discovery process, when receiver module receives to the HLO SW_ILS message of end switch the time, if the MasterNeighbor Domain_ID field of described HLO SW_ILS message is not carried main neighbours' Domian ID, then described switch and have been found that to end switch in the election main neighbours;
Sending module is used to generate and send the HLO SW_ILS message that carries described main neighbours Domian ID;
Logging modle, be used for after described switch is finished neighbor discovery process, when receiver module receives to the HLO SW_ILS message of end switch the time, if the MasterNeighbor Domain_ID field of described HLO SW_ILS message has been carried main neighbours' Domian ID, then write down described main neighbours' Domian ID.
Above-mentioned switch can also comprise:
Interactive module is used for when described switch is main neighbours, and mutual LSUSW_ILS message only and between the non-main neighbours carries out the mutual of LSDB; Perhaps, when described switch was non-main neighbours, mutual LSU SW_ILS message only and between the main neighbours carried out the mutual of LSDB
Above-mentioned receiver module can also be used for, and receives to the LSA SW_ILS message that is provided with Database Complete mark of end switch and the LSU SW_ILS message that is provided with Database Complete mark;
State setting module can also be used for, and according to described LSA SW_ILS message and LSU SW_ILS message, is the Full state with the status change of described neighbor state machine to the end switch correspondence.
As fully visible, the method and the switch of the optimization FSPF agreement that is applied to the FCoE networking that the present invention proposes have been revised the HLO SW_ILS message in original FSFP agreement, utilize HLO SW_ILS message to realize neighbours' discovery feature of switch in the FCoE network.In addition, the present invention with in the FCoE network each other a plurality of switches of neighbours divide into main neighbours and a plurality of non-main neighbours, only LSDB alternately between main neighbours and non-main neighbours utilizes main neighbours to carry out study and the issue of LSDB, thereby reduced the message interaction amount, improved network utilization.And the present invention has also deleted the unnecessary state of original FSFP agreement neighbor state machine, optimizes the state setting and the status change mode of neighbor state machine, makes that the setting of neighbor state machine is more simple and direct efficient.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within the scope of protection of the invention.

Claims (14)

1. method that is applied to the optimization optical fiber SPF FSPF agreement of Ethernet optical-fibre channel FCoE networking, be applied to comprise the FCoE group network system of a plurality of switches, when in described a plurality of switches one of them is this end switch, other switch be this this end switch to end switch, it is characterized in that described method comprises:
This end switch receives the calling HLOSW_ILS message of serving to the switch inner link of end switch, according to the relam identifier Domian ID that carries in the described HLO SW_ILS message, search the described neighbor state machine of self whether having created to the end switch correspondence to end switch;
If do not create as yet, then create described neighbor state machine to the end switch correspondence, finish described neighbor discovery process end switch.
2. method according to claim 1 is characterized in that, described foundation after the neighbor state machine further comprises:
Judge whether described HLO SW_ILS message carries the Domian ID of this end switch, if carry, the state of then described neighbor state machine is set to start the Up state; Otherwise, the state of the described neighbor state machine machine Down state that is set to delay.
3. method according to claim 2 is characterized in that, if described lookup result for creating, then described method further comprises:
When the state of described neighbor state machine is the Down state, judge whether described HLO SW_ILS message carries the Domian ID of this end switch, if carry, then the status change with described neighbor state machine is the Up state.
4. according to claim 1,2 or 3 described methods, it is characterized in that, the described HLO SW_ILS message that switch sends comprises receiving end relam identifier Recipient Domain_ID field, is used to carry all Domian ID to end switch that described switch has been found that.
5. according to claim 1,2 or 3 described methods, it is characterized in that described HLO SW_ILS message comprises main neighbor-id Master Neighbor Domain_ID field, is used to carry main neighbours' Domian ID;
After the described neighbor discovery process, further comprise:
This end switch receives HLO SW_ILS message, if the MasterNeighbor Domain_ID field of described HLO SW_ILS message is not carried main neighbours' Domian ID, then this end switch self and have been found that to end switch in the election main neighbours, generate and send the HLO SW_ILS message that carries described main neighbours Domian ID;
If the Master Neighbor Domain_ID field of described HLO SW_ILS message has been carried main neighbours' Domian ID, then this end switch writes down described main neighbours' Domian ID.
6. method according to claim 5 is characterized in that, described end switch elects main neighbours' mode to be: this end switch and have been found that to end switch in, the maximum or minimum switch of election Domian ID, with it as main neighbours.
7. method according to claim 5 is characterized in that, described method further comprises:
The Link State renewal LSU SW ILS message that described non-main neighbours only and mutual switch inner link is served between the main neighbours carries out the mutual of LSD LSDB.
8. method according to claim 1, it is characterized in that, described method further comprises: this end switch receives from the database that is provided with to end switch and finishes the link state acknowledgment LSA SW_ILS message of switch inner link service of Database Complete mark and the LSU SW_ILS message that is provided with the DatabaseComplete mark, is complete Full state with this status change to the neighbor state machine of end switch correspondence.
9. a switch is characterized in that, described switch comprises:
Receiver module is used to receive the HLO SW_ILS message to end switch;
Neighbor discovery module, be used for the Domian ID that carries according to described HLO SW_ILS message to end switch, search this switch and whether created described neighbor state machine the end switch correspondence, if do not create as yet, then create described neighbor state machine, finish described neighbor discovery process to end switch to the end switch correspondence.
10. switch according to claim 9 is characterized in that, described switch also comprises:
State setting module is used to judge whether described HLO SW_ILS message carries the Domian ID of described switch, if carry, the state of then described neighbor state machine is set to the Up state; Otherwise the state of described neighbor state machine is set to the Down state.
11. switch according to claim 10, it is characterized in that, when the lookup result of described neighbor discovery module when creating, described state setting module also is used for: when the state of described neighbor state machine is the Down state, judge whether described HLO SW_ILS message carries the Domian ID of described switch, if carry, then the status change with described neighbor state machine is the Up state.
12., it is characterized in that described switch also comprises according to claim 9,10 and 11 described switches:
The election module, be used for after described switch is finished neighbor discovery process, when receiver module receives to the HLO SW_ILS message of end switch the time, if the MasterNeighbor Domain_ID field of described HLO SW_ILS message is not carried main neighbours' Domian ID, then described switch and have been found that to end switch in the election main neighbours;
Sending module is used to generate and send the HLO SW_ILS message that carries described main neighbours Domian ID;
Logging modle, be used for after described switch is finished neighbor discovery process, when receiver module receives to the HLO SW_ILS message of end switch the time, if the MasterNeighbor Domain_ID field of described HLO SW_ILS message has been carried main neighbours' Domian ID, then write down described main neighbours' Domian ID.
13. switch according to claim 12 is characterized in that, described switch also comprises:
Interactive module is used for when described switch is main neighbours, and mutual LSUSW_ILS message only and between the non-main neighbours carries out the mutual of LSDB; Perhaps, when described switch was non-main neighbours, mutual LSU SW_ILS message only and between the main neighbours carried out the mutual of LSDB
14. switch according to claim 10, it is characterized in that, described receiver module also is used for, and receives to the LSA SW_ILS message that is provided with Database Complete mark of end switch and the LSU SW_ILS message that is provided with Database Complete mark;
State setting module also is used for, and according to described LSA SW_ILS message and LSU SW_ILS message, is the Full state with the status change of described neighbor state machine to the end switch correspondence.
CN2010101439802A 2010-04-08 2010-04-08 Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards Active CN102215112B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010101439802A CN102215112B (en) 2010-04-08 2010-04-08 Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010101439802A CN102215112B (en) 2010-04-08 2010-04-08 Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards

Publications (2)

Publication Number Publication Date
CN102215112A true CN102215112A (en) 2011-10-12
CN102215112B CN102215112B (en) 2013-11-27

Family

ID=44746254

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010101439802A Active CN102215112B (en) 2010-04-08 2010-04-08 Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards

Country Status (1)

Country Link
CN (1) CN102215112B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102546426A (en) * 2012-02-02 2012-07-04 杭州华三通信技术有限公司 Route generation method and route generation device for achieving fiber channel over Ethernet
CN102571604A (en) * 2012-02-14 2012-07-11 杭州华三通信技术有限公司 Route generation method and apparatus of priority protocol of shortest route of optical fiber
CN104717117A (en) * 2013-12-13 2015-06-17 思科技术公司 FIBRE CHANNEL OVER ETHERNET (FCoE) OVER VIRTUAL PORT CHANNEL (vPC)
CN105933252A (en) * 2016-04-01 2016-09-07 浪潮电子信息产业股份有限公司 Switch communication method and system and switch
CN108737273A (en) * 2018-05-10 2018-11-02 新华三技术有限公司 A kind of message processing method and device
CN108768624A (en) * 2018-04-26 2018-11-06 宁波大学科学技术学院 A kind of defence reverse-engineering encryption method based on Camellia algorithms

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050117593A1 (en) * 2003-12-01 2005-06-02 Shand Ian Michael C. Method and apparatus for synchronizing a data communications network
CN1725733A (en) * 2005-06-10 2006-01-25 杭州华为三康技术有限公司 Method of route backup in combination equipment and combination equipment
CN1866962A (en) * 2006-03-13 2006-11-22 华为技术有限公司 Method and system for rapidly building neighborhood
CN101087250A (en) * 2007-05-11 2007-12-12 华为技术有限公司 Establishment method and device of adjacent connection relation
CN101119304A (en) * 2007-08-24 2008-02-06 华为技术有限公司 Neighbourhood establishing method and router
CN101577679A (en) * 2009-06-26 2009-11-11 杭州华三通信技术有限公司 Configuration management method for realizing multicast service sharing among appointed routers and appliance thereof

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050117593A1 (en) * 2003-12-01 2005-06-02 Shand Ian Michael C. Method and apparatus for synchronizing a data communications network
CN1725733A (en) * 2005-06-10 2006-01-25 杭州华为三康技术有限公司 Method of route backup in combination equipment and combination equipment
CN1866962A (en) * 2006-03-13 2006-11-22 华为技术有限公司 Method and system for rapidly building neighborhood
CN101087250A (en) * 2007-05-11 2007-12-12 华为技术有限公司 Establishment method and device of adjacent connection relation
CN101119304A (en) * 2007-08-24 2008-02-06 华为技术有限公司 Neighbourhood establishing method and router
CN101577679A (en) * 2009-06-26 2009-11-11 杭州华三通信技术有限公司 Configuration management method for realizing multicast service sharing among appointed routers and appliance thereof

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9088499B2 (en) * 2012-02-02 2015-07-21 Hangzhou H3C Technologies Co., Ltd. Routing generation for implementation of fiber channel over ethernet
WO2013113285A1 (en) * 2012-02-02 2013-08-08 Hangzhou H3C Technologies Co., Ltd. Routing generation for implementation of fiber channel over ethernet
CN102546426B (en) * 2012-02-02 2014-09-24 杭州华三通信技术有限公司 Route generation method and route generation device for achieving fiber channel over Ethernet
US20140376562A1 (en) * 2012-02-02 2014-12-25 Hangzhou H3C Technologies Co., Ltd. Routing generation for implementation of fiber channel over ethernet
CN102546426A (en) * 2012-02-02 2012-07-04 杭州华三通信技术有限公司 Route generation method and route generation device for achieving fiber channel over Ethernet
CN102571604A (en) * 2012-02-14 2012-07-11 杭州华三通信技术有限公司 Route generation method and apparatus of priority protocol of shortest route of optical fiber
CN102571604B (en) * 2012-02-14 2015-04-15 杭州华三通信技术有限公司 Route generation method and apparatus of priority protocol of shortest route of optical fiber
CN104717117A (en) * 2013-12-13 2015-06-17 思科技术公司 FIBRE CHANNEL OVER ETHERNET (FCoE) OVER VIRTUAL PORT CHANNEL (vPC)
CN104717117B (en) * 2013-12-13 2018-08-10 思科技术公司 Realize the method and device of the Ethernet optical-fibre channel on virtual port channel
CN105933252A (en) * 2016-04-01 2016-09-07 浪潮电子信息产业股份有限公司 Switch communication method and system and switch
CN108768624A (en) * 2018-04-26 2018-11-06 宁波大学科学技术学院 A kind of defence reverse-engineering encryption method based on Camellia algorithms
CN108737273A (en) * 2018-05-10 2018-11-02 新华三技术有限公司 A kind of message processing method and device
CN108737273B (en) * 2018-05-10 2021-03-23 新华三技术有限公司 Message processing method and device

Also Published As

Publication number Publication date
CN102215112B (en) 2013-11-27

Similar Documents

Publication Publication Date Title
CN101047583B (en) Passive optical network system and correlation method for support virtual local network service
CN101356778B (en) Network system and data transfer device
CN101820435B (en) Synchronization method and device for MAC (Media Access Control) address table information of distributed network processing system
CN102215112B (en) Method applied to FCoE (Fiber Channel over Ethernet) networking and used for optimizing FSPE (Fiber Shortest Path First) protocol and switchboards
US9787496B2 (en) Communication system, communication apparatus, and protection method
JP4835422B2 (en) Network device and communication system
CN101599909B (en) Method and device for forwarding flow rate
CN102342050B (en) LDP IGP synchronization for broadcast networks
US10355962B2 (en) Network topology generation using traceroute data
CN103281247A (en) Universal routing method and universal routing system of data center network
US20110264795A1 (en) Communication network managment system, method and program, and management computer
CN107615721B (en) System and method for transmitting software defined network-logical link aggregation member signaling
CN101102325A (en) Method and device for notifying boundary connection information of autonomous system
US9729948B1 (en) Systems and methods for discovery of a controller in openflow networks
CN101242370B (en) Method for realizing Ethernet and frame-relay Internet and protocol conversion device
CN108540386B (en) Method and device for preventing service flow interruption
CN102946305A (en) Method and equipment for synchronizing link state protocol data unit (LSP)
CN107615722B (en) Transport Software Defined Network (SDN) -zero configuration adjacency via packet snooping
CN101248700B (en) Discovery of an adjacent network element within a network data plane
CN104168281A (en) Power line carrier ad-hoc network method, device and system
JP5449548B2 (en) Multicast processing method and apparatus
CN102685781B (en) Automatic protection switching method for main and auxiliary time sources
CN101783769A (en) Method and device for forwarding message during failure of link
CN100496023C (en) Method for transmitting link-state information
CN106941450B (en) Route synchronization method, equipment and communication system

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
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No.

Patentee after: Xinhua three Technology Co., Ltd.

Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base

Patentee before: Huasan Communication Technology Co., Ltd.