CN109428825A - A kind of method for forwarding multicast message and device - Google Patents
A kind of method for forwarding multicast message and device Download PDFInfo
- Publication number
- CN109428825A CN109428825A CN201710785200.6A CN201710785200A CN109428825A CN 109428825 A CN109428825 A CN 109428825A CN 201710785200 A CN201710785200 A CN 201710785200A CN 109428825 A CN109428825 A CN 109428825A
- Authority
- CN
- China
- Prior art keywords
- bit string
- bit
- multicast message
- forwarding
- hop node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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/16—Multipoint routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of method for forwarding multicast message and devices, it is related to data communication field, for solving the problems, such as that multicast message forward efficiency is low in the prior art, method for forwarding multicast message in the embodiment of the present invention includes: to obtain the multicast message to be forwarded for carrying the first bit string and label, and each of first bit string is corresponding with one of target position forwarding unique identifier of egress router respectively；According to the label, the position of first bit string is handled, obtains second bit string that carries out that treated for position；According to second bit string, the bit string fragment for being forwarded to each next-hop node is determined；The bit string fragment is encapsulated into the multicast message to be forwarded, and the multicast message to be forwarded after progress bit string fragment encapsulation is sent to the corresponding next-hop node of the bit string fragment.The above embodiment of the present invention improves multicast message forward efficiency.
Description
Technical field
The present invention relates to data communication field, especially a kind of method for forwarding multicast message and device.
Background technique
BIER (Bit Indexed Explicit Replication, position index explicitly replicate) is that multicast data message turns
The new framework of one kind of hair, provides optimal forwarding for multicast data message in multicast domain.Its basic thought is: working as multicast message
When reaching BFIR (Bit-Forwarding Ingress Router, position forwarding entry router), BFIR first determines that message will be sent out
It is then multicast message encapsulation toward which BFER (Bit-Forwarding Egress Router, position forward egress router)
" BIER header (BIER heading) ", wherein include a BitString (bit string), all generations of each in BitString
Global ID's (unique identifier) of one BFER of table, referred to as BFR-ID.For each position, determine that its unicast turns by unicast protocol
Hair go out to.All positions in BitString may finally determine together it is multiple go out to, message will to this it is multiple go out to duplication,
But for by the same multiple BFER transferred to forwarding, needing to mention the Bit (position) for indicating these BFER from message
It takes out, only replicates a message and go out to this to forwarding, the BitString for including in message will be only capable of comprising unicast forwarding extremely
Should go out to those of position, avoid message repeat replication in subsequent node.
More specifically, BIER forwarding has following technology needs to focus particularly on:
1, the number for the BFER that BSL and SI: one message can be forwarded to, the length depending on BitString
(BitString Length, bit string length, abbreviation BSL).It is possible that BFER number for including in the domain BIER can be more than BSL, it is
Support such case, is re-introduced into SI (Set Identifier, set identification), SI and BitString in BIER header
Determine which BFER message will be forwarded to together.If SI is n, the k-th bit in BitString be 1 (to remember that lowest order is the 1st
Position), then message will issue the BFER that BFR-ID is n*BSL+K.
2, message forwarding process:
Draft-ietf-bier-architecture-05 describes the rule that BIER encapsulated message is forwarded in the domain BIER at present
Then:
1) BitString, BSL and SI of message, are determined, these information have determined the purpose BFERs collection of message.Wherein
In heading, BSL and SI can be expressed BitString by increasing BIER label；
2) it, using unicast routing information, determines to the next-hop of each BFER (it is possible that certain BFR-ID are invalid or nothing
Up to forwarding information, then the next-hop of these BFR-ID is sky)；
3), BFERs is divided by identical next-hop, the BitString fragment that next-hop can forward is formed, by this
BitString fragment is stored in F-BM table (Forwarding BitMap forwards bit-masks table)；
4), will include in original message BitString according to the F-BM table that this next-hop determines for each next-hop
All Bit in F-BM table take out, and are encapsulated in and E-Packet, and forward to this next-hop.It has been forwarded in original message
Bit reset；
5), continue the non-zero position Bit of traversal original message BitString, above-mentioned 2,3,4 operation is repeated, until message
Whole Bit in BitString are 0, complete the forwarding of message.
This forward rule will lead to very poor forwarding performance, since it is desired that traversing to the BitString of message more times, place
After having managed the corresponding BitString fragment of some next-hop, the corresponding BitString fragment of other next-hops just can determine that；And
And certain forwarding chips are unable to complete above-mentioned traversing operation at present.
Summary of the invention
Technical problems to be solved of the embodiment of the present invention are to provide a kind of method for forwarding multicast message and device, to realize
Improve the forward efficiency of multicast message.
In order to solve the above technical problems, method for forwarding multicast message provided in an embodiment of the present invention, comprising:
Obtain and carry the multicast message to be forwarded of the first bit string and label, each of first bit string respectively with its
In target position forwarding egress router unique identifier it is corresponding；
According to the label, the position of first bit string is handled, obtains second bit string that carries out that treated for position；
According to second bit string, the bit string fragment for being forwarded to each next-hop node is determined；
The bit string fragment is encapsulated into the multicast message to be forwarded, and by carry out the encapsulation of bit string fragment after wait turn
Hair multicast message is sent to the corresponding next-hop node of the bit string fragment.
Preferably, according to the label, the position of first bit string is handled, obtains and carries out that treated for position second
The step of bit string includes:
According to the label, the first unique identifier corresponding with the label in the label list being locally stored is determined；
Judge in first bit string with the presence or absence of position corresponding with first unique identifier；
If it exists, then position corresponding with first unique identifier in first bit string is purged processing, obtained
It must carry out bit clear treated the second bit string；
If it does not exist, then first bit string is determined as second bit string.
Preferably, according to second bit string, determine that the step of being forwarded to the bit string fragment of each next-hop node includes:
The forwarding bit-masks table being locally stored is obtained, includes at least one next-hop in the forwarding bit-masks table
The corresponding third bit string of node；
Each third bit string and second bit string are successively subjected to step-by-step and operation according to predetermined order, obtain every 1 the
The intersection position of three bit strings and the second bit string；
According to the intersection position, the bit string fragment for being forwarded to the corresponding next-hop node of each third bit string is determined.
Preferably, in the forwarding bit-masks table, the quantity of the corresponding third bit string of each next-hop node is
At least two, and the bit string length classification of the corresponding at least two thirds bit string of each next-hop node is different.
Preferably, each third bit string and second bit string are successively carried out to the step of step-by-step and operation according to predetermined order
Suddenly include:
According to the label, determine to be used for and institute in the corresponding at least two thirds bit string of each next-hop node respectively
State one of third bit string that the second bit string carries out step-by-step and operation；
To successively each third bit string after bit string length classification determines be carried out according to predetermined order and the second bit string carries out
Step-by-step and operation.
Preferably, each third bit string after bit string length classification determines and second will successively be carried out according to predetermined order
String carries out step-by-step with the step of operation
Judge whether it is for the first time to carry out bit string length classification determine after each third bit string and the second bit string carry out by
Position and operation；
If each third after bit string length classification determines will successively be carried out by then sorting according to the title of next-hop node
Bit string and the second bit string carry out step-by-step and operation；
If not then will successively be carried out according to the bit quantity sequence for the intersection position determined in previous step-by-step and operating process
Each third bit string and the second bit string after bit string length classification is determining carry out step-by-step and operation.
According to another aspect of the present invention, the embodiment of the invention also provides a kind of multicast message retransmission units, comprising:
First obtains module, for obtaining the multicast message to be forwarded for carrying the first bit string and label, described first
Each of string is corresponding with one of target position forwarding unique identifier of egress router respectively；
Second obtains module, for handling the position of first bit string according to the label, obtains and carries out at position
The second bit string after reason；
Determining module, for determining the bit string fragment for being forwarded to each next-hop node according to second bit string；
Sending module for encapsulating the bit string fragment into the multicast message to be forwarded, and will carry out bit string point
Multicast message to be forwarded after piece encapsulation is sent to the corresponding next-hop node of the bit string fragment.
Preferably, the second acquisition module includes:
First determination unit, for determining corresponding with the label in the label list being locally stored according to the label
First unique identifier；
Judging unit, for judging in first bit string with the presence or absence of corresponding with first unique identifier
Position；
First acquisition unit is used for if it exists, then will be corresponding with first unique identifier in first bit string
Position is purged processing, obtains progress bit clear treated the second bit string；
Second determination unit, for if it does not exist, then first bit string being determined as second bit string.
Preferably, determining module includes:
Second acquisition unit wraps in the forwarding bit-masks table for obtaining the forwarding bit-masks table being locally stored
Contain the corresponding third bit string of at least one next-hop node；
Third acquiring unit, for each third bit string and second bit string successively to be carried out step-by-step according to predetermined order
With operation, the intersection position of each third bit string Yu the second bit string is obtained；
Third determination unit, for according to the intersection position, determination to be forwarded to the corresponding next-hop section of each third bit string
The bit string fragment of point.
Preferably, in the forwarding bit-masks table, the quantity of the corresponding third bit string of each next-hop node is
At least two, and the bit string length classification of the corresponding at least two thirds bit string of each next-hop node is different.
Preferably, third acquiring unit includes:
It determines subelement, for according to the label, determines each next-hop node corresponding at least two the respectively
For carrying out one of third bit string of step-by-step and operation with second bit string in three bit strings；
Subelement is handled, for will successively carry out each third bit string after bit string length classification determines according to predetermined order
Step-by-step and operation are carried out with the second bit string.
Preferably, processing subelement includes:
Level-one judgment sub-unit, for judging whether it is each third position after determining for the first time to progress bit string length classification
String and the second bit string carry out step-by-step and operation；
Level-one first handles subelement, for if bit string will successively be carried out by then sorting according to the title of next-hop node
Each third bit string and the second bit string after length classification is determining carry out step-by-step and operation；
Level-one second processing subelement, if not for then according to the intersection determined in previous step-by-step and operating process
Position bit quantity sequence successively will carry out bit string length classification determine after each third bit string and the second bit string carry out step-by-step with
Operation.
Compared with prior art, method for forwarding multicast message and device provided in an embodiment of the present invention at least have following
The utility model has the advantages that
The position in bit strings fragment is no longer needed to inquire unicast routing information, it is only necessary to traverse the forwarding ratio of next-hop node
The forwarding of multicast message can be completed in special mask table, improves multicast message forward efficiency, further, it is possible to cannot to complete time
The forwarding chip for going through bit string fragment is also able to achieve forwarding to multicast message.
Detailed description of the invention
Fig. 1 is the flow diagram of method for forwarding multicast message described in the embodiment of the present invention；
Fig. 2 is the flow diagram of step 2 in the embodiment of the present invention；
Fig. 3 is the flow diagram of step 3 in the embodiment of the present invention；
Fig. 4 is the flow diagram of step 32 in the embodiment of the present invention；
Fig. 5 is the flow diagram of step 321 in the embodiment of the present invention；
Fig. 6 is one of the circuit theory schematic diagram of method for forwarding multicast message in the embodiment of the present invention；
Fig. 7 is one of the circuit theory schematic diagram of method for forwarding multicast message in the embodiment of the present invention；
Fig. 8 is the structural schematic diagram of the multicast message retransmission unit in the embodiment of the present invention.
Specific embodiment
To keep the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool
Body embodiment is described in detail.In the following description, such as specific configuration is provided and the specific detail of component is only
In order to help comprehensive understanding the embodiment of the present invention.It therefore, it will be apparent to those skilled in the art that can be to reality described herein
Example is applied to make various changes and modifications without departing from scope and spirit of the present invention.In addition, for clarity and brevity, it is omitted pair
The description of known function and construction.
Referring to Fig.1, the embodiment of the invention provides a kind of method for forwarding multicast message, comprising:
Step 1, the multicast message to be forwarded for carrying the first bit string and label is obtained.
Specifically, the first bit string is encapsulated in the BIER heading of multicast message to be forwarded, to be forwarded getting this
It after multicast message, needs to parse the multicast message to be forwarded, to obtain first bit string and label.Different target position turns
The unique identifier for sending out egress router is different.Each of first bit string forwards with one of target position export respectively
The unique identifier of router is corresponding.For example, the unique identifier BFR-ID of a certain target position forwarding egress router is 1,
Corresponding first bit string is 00001；The unique identifier BFR-ID of another target position forwarding egress router is 2, corresponding
First bit string is 00010, and so on.
Label is the bit string length classification and set by way of number to the first bit string in multicast message to be forwarded
What mark was indicated, first is determined representated by each digital form of label by agreement between sender and recipient
The bit string length classification and set identification of string.For example, label is 1001, indicate that the bit string length classification of the first bit string is 64,
Set mark is 1；Label is 1002, indicates that the bit string length classification of the first bit string is 64, set mark is 2.
Step 2, according to the label, the position of first bit string is handled, obtains and carries out that treated for position second
Bit string.
Specifically, referring to Fig. 2, which includes:
Step 21, according to the label, corresponding with the label first unique mark in the label list being locally stored is determined
Know symbol；
Step 22, judge in first bit string with the presence or absence of position corresponding with first unique identifier；
Step 23, and if it exists, be then purged position corresponding with first unique identifier in first bit string
Processing obtains and carries out bit clear treated the second bit string；
Step 24, if it does not exist, then first bit string is determined as second bit string.
In embodiments of the present invention, it is specially that position is set to " 0 " by " 1 " that contraposition, which is purged processing,.
A label list is locally stored in recipient, in the label list, including 3 column informations, every a line include successively wrapping
Include bit string length corresponding with a kind of label, set identification and the first unique identification for indicating local reception side address
Symbol.According to the bit string length of a line every in label list record, set mark and the first unique identifier, can determine first
Which position corresponding with recipient itself is specially in bit string, and then judges whether recipient itself is that target position transfers
Mouth router.It is the presence of position corresponding with the first unique identifier in the first bit string in the judgment result displays of step 22, shows
This node is that a target position of the multicast message of this forwarding forwards egress router, in order to guarantee that this multicast message is smooth
Forwarding, it is necessary first to be purged a position corresponding with the first unique identifier in the first bit string.If the judgement of step 22
As the result is shown for position corresponding with the first unique identifier is not present in the first bit string, show that target position forwards egress router
After this node.
Step 3, according to second bit string, the bit string fragment for being forwarded to each next-hop node is determined.
Specifically, referring to Fig. 3, step 3 includes:
Step 31, the forwarding bit-masks table being locally stored is obtained, includes at least one in the forwarding bit-masks table
The corresponding third bit string of a next-hop node；
Step 32, each third bit string and second bit string are successively subjected to step-by-step and operation according to predetermined order, obtained
Obtain the intersection position of each third bit string and the second bit string；
Step 33, according to the intersection position, the bit string point for being forwarded to the corresponding next-hop node of each third bit string is determined
Piece.
Specifically, in the forwarding bit-masks table, the quantity of the corresponding third bit string of each next-hop node is
At least two, and the bit string length classification of the corresponding at least two thirds bit string of each next-hop node is different.Of the invention real
It applies in example, the one of target position corresponding with next-hop node of each in third bit string forwards the unique of egress router
Identifier is corresponding.
In general, the bit string length classification of bit string includes: 64,128,256,1024,2048 and 4096
Position, in the forwarding bit-masks table, each next-hop node is corresponding with corresponding with above-mentioned 6 kinds of bit string length classifications
6 kinds of third bit strings.As shown in table 1 below, B, C, D are respectively three next-hop nodes, with next-hop node B citing, in the forwarding
In bit-masks table, next-hop node B is corresponding with the third bit string that bit string length BSL is 64 and bit string length is 128
Third bit string.
Table 1
Specifically, referring to Fig. 4, step 32 includes:
Step 321, it according to the label, is determined in the corresponding at least two thirds bit string of each next-hop node respectively
For carrying out one of third bit string of step-by-step and operation with second bit string；
Step 322, each third bit string and second after bit string length classification determines will successively be carried out according to predetermined order
Bit string carries out step-by-step and operation.
In upper table 1, it is assumed that according to the label carried in multicast message to be forwarded be 1002, the corresponding bit string of label 1002
Length is 128, it is determined that the bit string length for going out the first bit string is 128, then will forward next-hop node B in bit-masks table
Bit string length classification be 128 corresponding bit strings be determined as with the second bit string carry out step-by-step and operation one of them the
Three bit strings are determined for next-hop node C and next-hop node D, and using aforesaid way.
Specifically, referring to Fig. 5, step 322 includes:
Step 3221, judge whether it is each third bit string and second after determining for the first time to progress bit string length classification
String carries out step-by-step and operation；
Step 3222, if after then successively determining progress bit string length classification according to the title sequence of next-hop node
Each third bit string and the second bit string carry out step-by-step and operation；
Step 3223, if not then sorting according to the bit quantity for the intersection position determined in previous step-by-step and operating process
To successively each third bit string after bit string length classification determines be carried out and the second bit string carries out step-by-step and operation.
The quantity of intersection position obtained after carrying out step-by-step and operation from the second bit string due to different third bit strings is different, in order to
The forward efficiency to multicast message is improved, in step 3323, according to the bit quantity for the intersection position that previous step-by-step and operation obtain
Step-by-step and operation are carried out from high to low sequence.
As shown in fig. 6, multicast message to be forwarded is transmitted to node A, it includes the second bit string be 00011000, node A
It is next in the forwarding bit-masks table (solid box table 2 in Fig. 6) stored at node A including three next-hop nodes B, C and D
The corresponding third bit string of hop node B is 00000001, and the corresponding third bit string of next-hop node C is 00000110, next-hop section
The corresponding third bit string of point D is 00011000.If carrying out step-by-step with the second bit string at first according to the name order of next-hop node
It is the corresponding third bit string of next-hop node B with operation, is secondly the corresponding third node of next-hop node C, finally under
The corresponding third bit string of one hop node D.According to the corresponding third bit string corresponding with node A second of next-hop node B to D
Bit string is compared, with the bit quantity of the intersection position of step-by-step in the second bit string and operation it is most should be D pairs of next-hop node
The third bit string answered；And the corresponding third bit string of next-hop node B is not handed over then when carrying out step-by-step and operation with the second bit string
Collect position, therefore will appear the empty phenomenon of race, similarly, the corresponding third bit string of next-hop node C is carrying out step-by-step with the second bit string
When with operation, it equally also will appear the empty phenomenon of race.If continue according to next-hop node name order successively with the second bit string into
Row step-by-step and operation, the corresponding third bit string of next-hop node B and the corresponding third bit string of next-hop node C respectively with second
Step-by-step and operation between string can extend multicast message forwarding time, reduce forward efficiency.
Therefore, it in the embodiment of the present invention, after carrying out first time step-by-step and operation, can determine and the second bit string step-by-step
With the bit quantity of the intersection position of operation it is most should be that the corresponding third bit string of next-hop node D with second does not go out to carry out step-by-step
With (first time step-by-step and operation sequencing are solid box table 1 in Fig. 6) obtained after operation, in second of step-by-step and operation, then
Step-by-step and operation are successively carried out with the second bit string according to the sequence in the dotted line frame table 3 in Fig. 6, it is corresponding in next-hop node D
After third bit string and the second bit string carry out step-by-step and operation, then the target position forwarding outlet routing of message to be forwarded can be determined
Device should be all forwarded via next-hop node D.At this point, can dispense to the corresponding third of next-hop node B and C
Bit string with the step-by-step and operation of the second bit string, achievees the effect that improve to multicast message forward efficiency respectively.
Step 4, the bit string fragment is encapsulated into the multicast message to be forwarded, and will be after progress bit string fragment encapsulation
Multicast message to be forwarded be sent to the corresponding next-hop node of the bit string fragment.
After determining bit string fragment by step 3, which is encapsulated to treating forwarding multicasting message and is answered
It makes in the duplication multicast message to be forwarded obtained, and the duplication multicast message to be forwarded after progress bit string fragment encapsulation is sent to
The corresponding next-hop node of bit string fragment.
In the following, being illustrated with a specific example to above-mentioned steps of the present invention.
Referring to Fig. 7, it is assumed that in Fig. 7, the bit string length of the first bit string carried in multicast message to be forwarded is 128.
Node A is position forwarding entry router, and node B, C and D are the next-hop node of node A, and node B, E, F, G and H are that position turns
Egress router is sent out, node A includes a label list (other sections in Fig. 7, in addition to node E at each node into H
The label list of point is not indicated), it is 128 there are the corresponding bit string length of tag entry in the label list at node E,
Corresponding set identification is 0, and corresponding first unique identifier is 2.The first of the multicast message to be forwarded received at node A
Bit string is 00001110, and the forwarding bit-masks table stored from node A can determine the corresponding third position next-hop node B
String is 00000001, and the corresponding third bit string of next-hop node C is 00000110, and the corresponding third bit string of next-hop node D is
00011000.Since node A is position forwarding entry router, it can determine that the second bit string is 00001110.
When carrying out step-by-step and operation for the first time, according to the title sequence of next-hop node successively by each third bit string and the
Two bit strings carry out step-by-step and operation, that is, at first and the second bit string carry out step-by-step with to operate be next-hop node B corresponding the
Secondly three bit strings are the corresponding third node of next-hop node C, are finally the corresponding third bit string of next-hop node D；Carry out
First time step-by-step and operation after, can determine at most be with the bit quantity of the second bit string intersection position next-hop node C and under
One hop node D, therefore in second of step-by-step and operation, it is next-hop node that step-by-step and operation are carried out with the second bit string at first
Secondly the corresponding third bit string of C is the corresponding third node of next-hop node D, is finally the corresponding third position next-hop node B
String.
When multicast message to be forwarded is transmitted at node C, it can determine that the second bit string at this time is 00000110, section
The corresponding next-hop node of point C is E and F, and the corresponding third bit string of interior joint E is 00000010, the corresponding third position node F
String is 00000100.To the corresponding third bit string of node E and F and section in such a way that step 3221 to step 3223 is recorded
The second bit string at point C carries out step-by-step and operation, can obtain the second bit string at the corresponding third bit string of node E and node C
Between bit string fragment be 00000010, the bit string fragment between the second bit string at the corresponding third bit string of node F and node C
It is 00000100, the encapsulation of bit string fragment will be carried out respectively in the way of recording in step 4 into multicast message to be forwarded, and each
From being sent to corresponding node E and F.Turn of the multicast message at mode and node C for the multicast message forwarding at node D
Originating party formula is identical, here, repeating no more.
When multicast message to be forwarded is transmitted at node E, according to the first unique identification in the label list of node E storage
Symbol determines there is position corresponding with the first unique identifier in the first bit string in multicast message to be forwarded.At this point, then may be used
The target position forwarding egress router for determining the multicast message to be forwarded being transmitted at node E is node E, at this point, by message
On give.And it will be transmitted to the processing of the position clearing in the first bit string in the multicast message to be forwarded at node E.For node F, G
It is identical as the processing mode at node E with the processing mode at H, here, repeating no more.
Unicast road is inquired in the method for forwarding multicast message provided through the embodiment of the present invention, the position no longer in bit strings fragment
By information, it is only necessary to which the forwarding of multicast message can be completed in the forwarding bit-masks table for traversing next-hop node, improves multicast
Message forward efficiency, further, it is possible to be able to achieve the forwarding chip that cannot complete traversal bit string fragment also to multicast message
Forwarding.
Referring to Fig. 8, according to another aspect of the present invention, the embodiment of the invention also provides a kind of forwardings of multicast message to fill
It sets, comprising:
First obtains module 1, for obtaining the multicast message to be forwarded for carrying the first bit string and label, described first
Each of string is corresponding with one of target position forwarding unique identifier of egress router respectively；
Second obtains module 2, for handling the position of first bit string according to the label, obtains and carries out position
The second bit string that treated；
Determining module 3, for determining the bit string fragment for being forwarded to each next-hop node according to second bit string；
Sending module 4 for encapsulating the bit string fragment into the multicast message to be forwarded, and will carry out bit string point
Multicast message to be forwarded after piece encapsulation is sent to the corresponding next-hop node of the bit string fragment.
Preferably, the acquisition of root second module 2 includes:
First determination unit, for determining corresponding with the label in the label list being locally stored according to the label
First unique identifier；
Judging unit, for judging in first bit string with the presence or absence of corresponding with first unique identifier
Position；
First acquisition unit is used for if it exists, then will be corresponding with first unique identifier in first bit string
Position is purged processing, obtains progress bit clear treated the second bit string；
Second determination unit, for if it does not exist, then first bit string being determined as second bit string.
Preferably, determining module 3 includes:
Second acquisition unit wraps in the forwarding bit-masks table for obtaining the forwarding bit-masks table being locally stored
Contain the corresponding third bit string of at least one next-hop node；
Third acquiring unit, for each third bit string and second bit string successively to be carried out step-by-step according to predetermined order
With operation, the intersection position of each third bit string Yu the second bit string is obtained；
Third determination unit, for according to the intersection position, determination to be forwarded to the corresponding next-hop section of each third bit string
The bit string fragment of point.
Preferably, in the forwarding bit-masks table, the quantity of the corresponding third bit string of each next-hop node is
At least two, and the bit string length classification of the corresponding at least two thirds bit string of each next-hop node is different.
Preferably, third acquiring unit includes:
It determines subelement, for according to the label, determines each next-hop node corresponding at least two the respectively
For carrying out one of third bit string of step-by-step and operation with second bit string in three bit strings；
Subelement is handled, for will successively carry out each third bit string after bit string length classification determines according to predetermined order
Step-by-step and operation are carried out with the second bit string.
Preferably, processing subelement includes:
Level-one judgment sub-unit, for judging whether it is each third position after determining for the first time to progress bit string length classification
String and the second bit string carry out step-by-step and operation；
Level-one first handles subelement, for if bit string will successively be carried out by then sorting according to the title of next-hop node
Each third bit string and the second bit string after length classification is determining carry out step-by-step and operation；
Level-one second processing subelement, if not for then according to the intersection determined in previous step-by-step and operating process
Position bit quantity sequence successively will carry out bit string length classification determine after each third bit string and the second bit string carry out step-by-step with
Operation.
Multicast message retransmission unit described in the embodiment of the present invention is dress corresponding with above-mentioned method for forwarding multicast message
It sets, all implementations in the above method can also reach identical technical effect suitable for the embodiment of the device.Energy
Enough realize improves multicast message forward efficiency.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, without departing from the principles of the present invention, several improvements and modifications can also be made, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (12)
1. a kind of method for forwarding multicast message characterized by comprising
It obtains and carries the multicast message to be forwarded of the first bit string and label, each of first bit string is respectively with wherein one
The unique identifier of a target position forwarding egress router is corresponding；
According to the label, the position of first bit string is handled, obtains second bit string that carries out that treated for position；
According to second bit string, the bit string fragment for being forwarded to each next-hop node is determined；
The bit string fragment is encapsulated into the multicast message to be forwarded, and by carry out the encapsulation of bit string fragment after to be forwarded group
Casting text is sent to the corresponding next-hop node of the bit string fragment.
2. method for forwarding multicast message according to claim 1, which is characterized in that according to the label, to described first
The step of position of bit string is handled, and second bit string that carries out that treated for position is obtained include:
According to the label, the first unique identifier corresponding with the label in the label list being locally stored is determined；
Judge in first bit string with the presence or absence of position corresponding with first unique identifier；
If it exists, then position corresponding with first unique identifier in first bit string is purged processing, obtain into
Line position removes treated the second bit string；
If it does not exist, then first bit string is determined as second bit string.
3. method for forwarding multicast message according to claim 1, which is characterized in that according to second bit string, determine and turn
The step of being sent to the bit string fragment of each next-hop node include:
The forwarding bit-masks table being locally stored is obtained, includes at least one next-hop node in the forwarding bit-masks table
Corresponding third bit string；
Each third bit string and second bit string are successively subjected to step-by-step and operation according to predetermined order, obtain each third position
The intersection position of string and the second bit string；
According to the intersection position, the bit string fragment for being forwarded to the corresponding next-hop node of each third bit string is determined.
4. method for forwarding multicast message according to claim 3, which is characterized in that in the forwarding bit-masks table,
The quantity of the corresponding third bit string of each next-hop node is at least two, and each next-hop node corresponding at least two
The bit string length classification of third bit string is different.
5. method for forwarding multicast message according to claim 4, which is characterized in that according to predetermined order successively by every 1
Three bit strings carry out step-by-step with the step of operation with second bit string
According to the label, determined in the corresponding at least two thirds bit string of each next-hop node respectively for described the
One of third bit string of two bit strings progress step-by-step and operation；
To successively each third bit string after bit string length classification determines be carried out according to predetermined order and the second bit string carries out step-by-step
With operation.
6. method for forwarding multicast message according to claim 5, which is characterized in that will successively carry out position according to predetermined order
Each third bit string and the second bit string after string length classification is determining carry out step-by-step with the step of operation
Judge whether it is for the first time to carry out bit string length classification determine after each third bit string and the second bit string carry out step-by-step with
Operation；
If each third bit string after bit string length classification determines will successively be carried out by then sorting according to the title of next-hop node
Step-by-step and operation are carried out with the second bit string；
If not then will successively carry out bit string according to the bit quantity sequence for the intersection position determined in previous step-by-step and operating process
Each third bit string and the second bit string after length classification is determining carry out step-by-step and operation.
7. a kind of multicast message retransmission unit characterized by comprising
First obtains module, for obtaining the multicast message to be forwarded for carrying the first bit string and label, first bit string
Each is corresponding with one of target position forwarding unique identifier of egress router respectively；
Second obtains module, for handling the position of first bit string according to the label, obtains after carrying out position processing
The second bit string；
Determining module, for determining the bit string fragment for being forwarded to each next-hop node according to second bit string；
Sending module for encapsulating the bit string fragment into the multicast message to be forwarded, and will carry out bit string fragment envelope
Multicast message to be forwarded after dress is sent to the corresponding next-hop node of the bit string fragment.
8. multicast message retransmission unit according to claim 7, which is characterized in that root second obtains module and includes:
First determination unit, for determining corresponding with the label first in the label list being locally stored according to the label
Unique identifier；
Judging unit, for judging in first bit string with the presence or absence of position corresponding with first unique identifier；
First acquisition unit, for if it exists, then by position corresponding with first unique identifier in first bit string into
Row removing processing, obtains and carries out bit clear treated the second bit string；
Second determination unit, for if it does not exist, then first bit string being determined as second bit string.
9. multicast message retransmission unit according to claim 7, which is characterized in that determining module includes:
Second acquisition unit includes in the forwarding bit-masks table for obtaining the forwarding bit-masks table being locally stored
The corresponding third bit string of at least one next-hop node；
Third acquiring unit, for each third bit string and second bit string successively to be carried out step-by-step and behaviour according to predetermined order
Make, obtains the intersection position of each third bit string Yu the second bit string；
Third determination unit, for according to the intersection position, determination to be forwarded to the corresponding next-hop node of each third bit string
Bit string fragment.
10. multicast message retransmission unit according to claim 9, which is characterized in that in the forwarding bit-masks table,
The quantity of the corresponding third bit string of each next-hop node is at least two, and each next-hop node corresponding at least two
The bit string length classification of third bit string is different.
11. multicast message retransmission unit according to claim 10, which is characterized in that third acquiring unit includes:
Subelement is determined, for determining each next-hop node corresponding at least two third position respectively according to the label
For carrying out one of third bit string of step-by-step and operation with second bit string in string；
Subelement is handled, for will successively carry out each third bit string and the after bit string length classification determines according to predetermined order
Two bit strings carry out step-by-step and operation.
12. multicast message retransmission unit according to claim 11, which is characterized in that handling subelement includes:
Level-one judgment sub-unit, for judge whether it is for the first time to carry out bit string length classification determine after each third bit string and
Second bit string carries out step-by-step and operation；
Level-one first handles subelement, for if bit string length will successively be carried out by then sorting according to the title of next-hop node
Each third bit string and the second bit string after classification is determining carry out step-by-step and operation；
Level-one second processing subelement, if not for then according to the intersection position determined in previous step-by-step and operating process
Bit quantity sequence will successively carry out each third bit string after bit string length classification determines and the second bit string carries out step-by-step and operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710785200.6A CN109428825A (en) | 2017-09-04 | 2017-09-04 | A kind of method for forwarding multicast message and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710785200.6A CN109428825A (en) | 2017-09-04 | 2017-09-04 | A kind of method for forwarding multicast message and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109428825A true CN109428825A (en) | 2019-03-05 |
Family
ID=65505094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710785200.6A Pending CN109428825A (en) | 2017-09-04 | 2017-09-04 | A kind of method for forwarding multicast message and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109428825A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112995091A (en) * | 2019-12-02 | 2021-06-18 | 中兴通讯股份有限公司 | Data compression method, device, network equipment and storage medium |
| CN113364694A (en) * | 2020-03-06 | 2021-09-07 | 烽火通信科技股份有限公司 | BIER message forwarding method and system |
| CN113992564A (en) * | 2021-09-17 | 2022-01-28 | 新华三信息安全技术有限公司 | Message processing method and device |
| WO2022088994A1 (en) * | 2020-10-30 | 2022-05-05 | 华为技术有限公司 | Performance measurement method, device, and system |
| CN114531369A (en) * | 2020-10-30 | 2022-05-24 | 华为技术有限公司 | Method, device and system for measuring performance |
| CN115001883A (en) * | 2022-07-14 | 2022-09-02 | 中国电信股份有限公司 | Message processing method and bit forwarding router |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150131660A1 (en) * | 2013-09-17 | 2015-05-14 | Cisco Technology, Inc. | Bit indexed explicit replication packet encapsulation |
| CN104811387A (en) * | 2014-01-24 | 2015-07-29 | 思科技术公司 | Equal Cost Multi-path With Bit Indexed Explicit Replication |
| CN105933228A (en) * | 2015-02-26 | 2016-09-07 | 思科技术公司 | Traffic engineering for bit indexed explicit replication |
| CN106572023A (en) * | 2015-10-12 | 2017-04-19 | 中兴通讯股份有限公司 | Method for realizing bit index display copying and bit forwarding router |
| CN106603407A (en) * | 2015-10-16 | 2017-04-26 | 中兴通讯股份有限公司 | Method and device for transmitting multicast address |
| CN106656524A (en) * | 2015-10-30 | 2017-05-10 | 中兴通讯股份有限公司 | Transmission method, apparatus and system of BIER control information |
| WO2017118879A1 (en) * | 2016-01-07 | 2017-07-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Optimized equal-cost multi-path (ecmp) forwarding decision in bit index explicit replication (bier) |
-
2017
- 2017-09-04 CN CN201710785200.6A patent/CN109428825A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150131660A1 (en) * | 2013-09-17 | 2015-05-14 | Cisco Technology, Inc. | Bit indexed explicit replication packet encapsulation |
| CN104811387A (en) * | 2014-01-24 | 2015-07-29 | 思科技术公司 | Equal Cost Multi-path With Bit Indexed Explicit Replication |
| CN105933228A (en) * | 2015-02-26 | 2016-09-07 | 思科技术公司 | Traffic engineering for bit indexed explicit replication |
| CN106572023A (en) * | 2015-10-12 | 2017-04-19 | 中兴通讯股份有限公司 | Method for realizing bit index display copying and bit forwarding router |
| CN106603407A (en) * | 2015-10-16 | 2017-04-26 | 中兴通讯股份有限公司 | Method and device for transmitting multicast address |
| CN106656524A (en) * | 2015-10-30 | 2017-05-10 | 中兴通讯股份有限公司 | Transmission method, apparatus and system of BIER control information |
| WO2017118879A1 (en) * | 2016-01-07 | 2017-07-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Optimized equal-cost multi-path (ecmp) forwarding decision in bit index explicit replication (bier) |
Non-Patent Citations (2)
| Title |
|---|
| CISCO: ""BRKIPM-2239"", 《WWW.CISCOLIVE.COM/C/DAM/R/CISCOLIVE/US/DOCS/2016/PDF/BRKIPM-2239.PDF》 * |
| IJ. WIJNANDS, ED.，等: ""draft-ietf-bier-architecture-07"", 《IETF》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112995091A (en) * | 2019-12-02 | 2021-06-18 | 中兴通讯股份有限公司 | Data compression method, device, network equipment and storage medium |
| CN113364694A (en) * | 2020-03-06 | 2021-09-07 | 烽火通信科技股份有限公司 | BIER message forwarding method and system |
| WO2022088994A1 (en) * | 2020-10-30 | 2022-05-05 | 华为技术有限公司 | Performance measurement method, device, and system |
| CN114531369A (en) * | 2020-10-30 | 2022-05-24 | 华为技术有限公司 | Method, device and system for measuring performance |
| CN114531369B (en) * | 2020-10-30 | 2023-12-15 | 华为技术有限公司 | Performance measurement method, device and system |
| CN113992564A (en) * | 2021-09-17 | 2022-01-28 | 新华三信息安全技术有限公司 | Message processing method and device |
| CN115001883A (en) * | 2022-07-14 | 2022-09-02 | 中国电信股份有限公司 | Message processing method and bit forwarding router |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109428825A (en) | A kind of method for forwarding multicast message and device | |
| CN102970227B (en) | The method and apparatus of VXLAN message repeating is realized in ASIC | |
| CN102238083B (en) | For the system and method for adapted packet process streamline | |
| CN105871602B (en) | A kind of control method, device and system counting flow | |
| CN100444563C (en) | Exchange node classifying and marking rules | |
| CN101155130B (en) | Method for learning MAC address and system and equipment for conveying VPLS client data | |
| CN105337852B (en) | The more method and device of the processing mode of new service flow message | |
| WO2016184334A1 (en) | Multi-region source routed multicast using sub-tree identifiers | |
| US11258698B2 (en) | Multicast forwarding method and related device | |
| CN108989209B (en) | BIER MPLS network equipment, message forwarding method and medium thereof | |
| CN105933228A (en) | Traffic engineering for bit indexed explicit replication | |
| US20130259050A1 (en) | Systems and methods for multi-level switching of data frames | |
| CN1536826A (en) | Local commission management equipment and method | |
| CN106603413A (en) | Method and device for transmitting traffics through specified path | |
| CN101656663B (en) | Method, device and system for forwarding MPLS multicast message | |
| CN108600021B (en) | Tunnel packaging chip implementation method and device capable of being flexibly programmed and configured | |
| CN110224935A (en) | A kind of method and device handling multicast data message | |
| CN109257279A (en) | A kind of message forwarding method and device | |
| CN109246018A (en) | Message forwarding method, node apparatus and storage medium based on BIER-TE | |
| CN105763457B (en) | Multicast message processing method and the network equipment | |
| CN101171802B (en) | Node, network, creating method of corresponding relation for transmitting information in network | |
| CN107104900A (en) | A kind of multicast information treating method and apparatus | |
| CN104052672B (en) | A kind of method of realizing group broadcasting and equipment based on LISP | |
| CN102801622A (en) | Transmitting method and device for data messages | |
| CN100488169C (en) | A method for data processing in bridging network and bridging network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190305 |
|
| RJ01 | Rejection of invention patent application after publication |