CN103220221A - Method and device capable of noticing link information - Google Patents
Method and device capable of noticing link information Download PDFInfo
- Publication number
- CN103220221A CN103220221A CN2012100188168A CN201210018816A CN103220221A CN 103220221 A CN103220221 A CN 103220221A CN 2012100188168 A CN2012100188168 A CN 2012100188168A CN 201210018816 A CN201210018816 A CN 201210018816A CN 103220221 A CN103220221 A CN 103220221A
- Authority
- CN
- China
- Prior art keywords
- expense
- link
- equipment
- multicast
- nbr tlv
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
Abstract
The invention provides a method and a device capable of noticing link information. The method capable of noticing the link information comprises the following steps: enabling a first device to generate a first adjacency relation type length value NBR TLV and a second NBR TLV, wherein the first NBRTLV carries a first pay expense which is the pay expense of a shortest link in expenses of a plurality of paralleled links, the second NBR TLV carries identification of multicast routing and a second pay expense, the identification of the multicast routing is used for representing that the second pay expense carried by the second NBR TLV is the pay expense of the multicast routing, and the first device carries the first NBR TLV of the first pay expense and the identification of the multicast routing and the second NBR TLV of the second pay expense to a network in a flooding mode. The above-mentioned technical scheme is capable of enabling devices participating calculation of the multicast routing in the network to calculate the pay expense of the multicast routing according to the accurate pay expense of the multicast routing between two adjacent devices, and due to the fact that the pay expense of the least path in pay expenses is kept flooded too, normal calculation of a unicast path is not affected.
Description
Technical field
The present invention relates to network communication field, and more specifically, relate to the method and apparatus of announcing link information.
Background technology
Multilink is transparent, and interconnected (English full name is Transparent Interconnection of Lots of Links, english abbreviation is TRILL) agreement is the Routing Protocol that calculates based on Link State on a kind of double layer network, (English full name is Intermediate System to Intermediate System by the expansion Intermediate System-to-Intermediate System for it, english abbreviation is ISIS) agreement realizes, this is because ISIS can directly move based on link layer.Can realize big two layers of networking by the TRILL agreement, be applicable to the scene that virtual machine in the data center market (English full name is Virtual Machine, and english abbreviation is VM) moves in the network segment.It compares two layers of technology of tradition following advantage:
1. clean culture and multicast are all supported equal cost multipath (English full name is Equal-Cost Multi-Path Routing, and english abbreviation is ECMP), bandwidth availability ratio height.
2. unicast traffic is transmitted and is shortest path, avoids converging step by step flow and saves the network bandwidth, is fit to CLOS (CLOS is inventor's a name) networking mode.
Wherein the COLS network is meant to count for a kind of intersection of the cost that reduces multistage switching network and increases slower switching network with going into, occur number, and it all is to adopt a plurality of crosspoints on a small scale to couple together the formation multistage switching network according to certain connected mode basically.
3. convergence time is fast.
After convergence time was meant that router finds that topology of networks changes, the synchronous process of whole routing iinformation was total to the time of cost.
4. network size is big, does not have the restriction of network diameter 7.
Network diameter is meant the maximum of the number of switches of passing through when connecting between any two station terminals.Usually network diameter is no more than 7, in case otherwise network break down and be difficult to link or the node that detection failure takes place.
5.TRILL head comprises jumping figure (English full name is Hop count) field, the broadcast storm that can further avoid loop to cause.
TTL is a numerical value in the IP protocol package, and whether be used for designation data oversize and should be dropped in time of network.Broadcast storm is simply said, can't handle when broadcast data is full of network, and take a large amount of network bandwidths, causes regular traffic not move, even thoroughly paralysis, and " broadcast storm " just taken place for this.
When TRILL carried out forwarding-table item calculating in calculating, because temporary transient LSD (English full name is Link State DataBase, and english abbreviation is LSDB) is asynchronous, the path that may cause calculating between the distinct device formed loop.Causing the nonsynchronous reason of temporary transient database can be that the broadcasting of receiving between each equipment is asynchronous, perhaps equipment suspension, perhaps device link information-change etc.Transmit for clean culture,, therefore can use jumping figure cancellation loop hidden danger because message can not duplicate distribution in repeating process.For multicast message, if can not in time find loop, the distribution of duplicating owing to message may cause the offered load flow to be doubled and redoubled, and causes network paralysis.Therefore, (English full name is Reverse Path Forwarding must to carry out neighbours' inspection and reverse path forwarding before TRILL agreement regulation multicast message is transmitted, english abbreviation is RPF) check, check that the flow of failure will be dropped, thereby avoided the loop risk of multicast.
In the TRILL agreement, for the multilink between two equipment, regulation can only be issued a syntople type lengths values (English full name is Neighbor Relationship Type Length Value, and english abbreviation is NBR TLV).Carried the expense of the link of expense minimum in the described multilink of described two equipment identifications among this NBR TLV.
2 links are arranged between two equipment, for example when link 1 and link 2, suppose that the bandwidth of link 1 is bigger, its expense is 1, and the bandwidth of link 2 is less, and its expense is 10.Because the expense of link 1 is little, so the expense of link 1 can be flooded in the network.That is to say that in the process of the expense of follow-up calculating multicast path, link 1 can be identified as the multicast link of bear multicast flow between described two equipment, and the expense of this multicast link is 1.
Yet, when local route is calculated, calculate for multicast, require two adjacent equipment to select a link as multicast link according to the multicast parallel link choice mechanism of RFC6325 agreement regulation, guarantee to choose on same the physical link, check failure to avoid multicast RPF and neighbours.The multicast link that chooses according to multicast parallel link choice mechanism might not be the link of expense minimum.For example, the multicast link of the reality between two equipment may be chosen as link 2, and the expense of link 2 is 10, and promptly the expense of multicast link may be 10.
Like this, the equipment that participates in route calculating in the network is when carrying out multicast path calculating, can cause and to calculate correct expense for multicast path by mistake the expense of the expense of the link of the expense minimum of described two equipment rooms as the multicast link of described two equipment rooms through described two equipment.
Summary of the invention
Embodiments of the invention provide a kind of method and apparatus of announcing link information, can guarantee to calculate exactly in the network expense of multicast path.
On the one hand, a kind of method of announcing link information is provided, comprise: first equipment generates the first syntople type lengths values NBR TLV and the 2nd NBR TLV, wherein, described first equipment links to each other by many parallel links with second equipment, and described second equipment is the adjacent device of described first equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent the expense that described second expense that described the 2nd NBR TLV carries is a multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links; Described first equipment floods the NBR TLV that carries described first expense and carries the described multicast Route Distinguisher and second expense in network the 2nd NBR TLV.
On the other hand, a kind of method of announcing link information is provided, comprise: second equipment receives the first syntople type lengths values NBR TLV and the 2nd NBR TLV that first equipment sends, wherein said first equipment links to each other by many parallel links with described second equipment, and described first equipment is the adjacent device of described second equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent that second expense that described the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links; In network, the flood NBRTLV that carries described first expense and carry the 2nd NBR TLV of the described multicast Route Distinguisher and second expense of described second equipment.
On the other hand, a kind of first equipment is provided, comprise generation unit, be used to generate the first syntople type lengths values NBR TLV and the 2nd NBR TLV, wherein, described first equipment links to each other by many parallel links with second equipment, and described second equipment is the adjacent device of described first equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent the expense that described second expense that described the 2nd NBR TLV carries is a multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links; Described first equipment also comprises transmitting element, is used for to flood a NBR TLV who carries described first expense that described generation unit generates and carry the 2nd NBR TLV of the described multicast Route Distinguisher and second expense of network.
On the other hand, a kind of second equipment is provided, comprise receiving element, be used to the first syntople type lengths values NBR TLV and the 2nd NBR TLV that first equipment that receives sends, wherein said first equipment links to each other by many parallel links with described second equipment, and described first equipment is the adjacent device of described second equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent that second expense that described the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links; Also comprise transmitting element, be used for to the flood NBRTLV that carries described first expense and carry the 2nd NBR TLV of the described multicast Route Distinguisher and second expense of network.
When technique scheme has many parallel links between two adjacent devices, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a network topological diagram.
Fig. 2 is that the equipment in the network shown in Figure 1 generates the schematic diagram of transmitting.
Fig. 3 is the schematic diagram of the application scenarios of one embodiment of the present of invention.
Fig. 4 is the schematic flow diagram of one embodiment of the present of invention.
Fig. 5 is the schematic flow diagram of one embodiment of the present of invention.
Fig. 6 is the network topology schematic diagram of one embodiment of the present of invention.
Fig. 7 A and Fig. 7 B are the schematic block diagrams of first equipment of one embodiment of the present of invention.
Fig. 8 A and Fig. 8 B are the schematic block diagrams of second equipment of one embodiment of the present of invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
In addition, term " equipment " and " node " often are used interchangeably in this article herein.Herein term " and/or ", only be a kind of incidence relation of describing affiliated partner, can there be three kinds of relations in expression, for example, A and/or B, can represent: individualism A exists A and B, these three kinds of situations of individualism B simultaneously.In addition, character "/" herein, generally represent forward-backward correlation to as if a kind of " or " relation.
At first, the simple TRILL protocol massages encapsulation format down of introducing, as shown in table 1 below.
Table 1
| DA | SA | VLAN | TRILL Header | Original Frame | FCS |
The TRILL message comprises that from front to back (English full name is Media Access Control for the outer purpose medium access control of 6 bytes, english abbreviation is MAC) address " DA ", the outer source MAC " SA " of 6 bytes, (English full name is Virtual Local Area Network to the outer VLAN of 4 bytes, english abbreviation is VLAN,) label (English is TAG) head " VLAN ", the TRILL head of 4 bytes " TRILL Header ", (English full name is LAN Layer 2 QoS/CoS Protocol for Traffic Prioritization to user's 802.1p besides, the Chinese full name is the traffic priority control criterion) message " Original Frame ", be the frame check and the Frame Check Sequence (English full name is Frame Check Sequence, and english abbreviation is FCS) " FCS " of 4 bytes at last.
Outer field MAC Address is bridge (the English Bridge of the being) MAC Address of equipment, it when unicast message the bridge MAC Address of two adjacent equipment, when broadcasting packet, source MAC is the bridge MAC Address of a last jumping equipment, source MAC is every all can be upgraded through a jumping equipment, and target MAC (Media Access Control) address is specific multicast mac address.
Wherein, the encapsulation format of TRILL head is as shown in table 2 below.
Table 2
The version of " V " TRILL agreement, current is 0, if discovery is not 0 the direct dropping packets of version meeting.
Whether " M " is multicast flags for message, and 0 is clean culture, and 1 is multicast.
" OpLng " defined the length of TRILL scaling option, is unit with the nybble, and maximum can be supported the option definition of 124 bytes.
" Hop " is meant jumping figure.
(English is Identity to the device identifier of message inlet (Ingress) and outlet (Egress), english abbreviation is ID) correspond to the inlet routing bridge another name (English full name is Ingress RBridge Nickname) of one 16 bit, Ingress RBridge Nickname as shown in table 2 and outlet routing bridge another name (English full name is Egress RBridge Nickname) respectively.The M position of unicast message is 0, and the routing bridge another name of inlet routing bridge another name and outlet is respectively the another name of the network equipment of correspondence; And the M position of broadcasting packet is 1, and inlet routing bridge another name is the access device another name, and the routing bridge of outlet is called the equipment another name for broadcasting tree root (Root) node that uses.
The RB node of TRILL agreement identifies with another name, no symbol short (English full name is unsigned short int, and english abbreviation the is ushort) number that another name is one 2 byte.A RB node can have a plurality of another names.Another name can generate automatically, also can manual configuration, but must guarantee that the whole network can not repeat.
Fig. 1 is a kind of network topological diagram.
Comprise 5 equipment among Fig. 1, Dui Ying another name is respectively A, B, C, D and E as shown in Figure 1, respectively by 101 to 105 indications.In Fig. 1, the next door of each equipment shows corresponding with these 5 equipment respectively tabulation 111 to 115 respectively.Every tabulation comprised and this tabulation corresponding equipment and each adjacent device between the expense (English be Metric) of a link, described expense can flood to network by Link State Protocol Data Unit (English full name is Link State PDU, and english abbreviation is LSP).For example, tabulation 111 expenses that comprised between A 101 and the adjacent device B 102, also comprised the expense between A 101 and the adjacent device D 104, each expense all is kept in the syntople type lengths values (English full name is NeighBorhood Relationship, and english abbreviation is NBR).Particularly, the expense of the link between A101 and the B102 is the expense 10 among the NBR-B in the tabulation 111, and the expense of the link between A101 and the D104 is the expense 20 among the NBR-D in the tabulation 111.These 5 equipment to the expense in the tabulation of self correspondence in network behind the inundation (English is flooding), make and have identical LSD by these 5 equipment (English full name is Link Status DataBase, english abbreviation is LSDB), this LSDB is as shown in table 3 below.
Table 3
Fig. 2 is that the equipment in the network shown in Figure 1 generates the schematic diagram of transmitting.For convenience of description, be example with device A 101.Among Fig. 2 201 is neighbor table (English full name is ADJacency Table) of A.Device A 101 is based on the LSDB among Fig. 1, (English full name is Shortest Path First according to SPF, english abbreviation is SPF) algorithm computation arrives the shortest path of other each equipment, generation transmits 202, transmit the path and can be load balancing, VLAN wherein is an outside VLAN.
Inlet RB node from the client edge (English full name is Customer Edge, and english abbreviation is CE) port receive after the first unicast data message from the user, search MAC according to the described first unicast data message inner VLAN identification and transmit.If exist the clean culture MAC corresponding with described message inner VLAN identification to transmit, and the list item outgoing interface is the TRILL tunnel, then at first carries out the TRILL encapsulation, and then carries out outer Ethernet (English be Ethernet, english abbreviation is ETH) head encapsulation.
After switching (English is Transit) RB node is received the first unicast data message of described TRILL encapsulation of process and Ethernet header encapsulation from specific port, peel off the ETH head, another name according to purpose RB is searched forwarding-table item, obtain next-hop mac address and outbound port, outer target MAC (Media Access Control) address is replaced, be forwarded to next device.
Outlet RB node receives behind the described first unicast data message of described switching RB node processing determines that the another name of purpose RB is self, then peel off the TRILL head, and search local mac according to inner VLAN identification and transmit, the described first unicast data message is forwarded.
If after inlet RB node is received the described first unicast data message, can't find the another name that exports the RB node, then need to carry out unknown unicast and transmit i.e. broadcasting according to the target MAC (Media Access Control) address in the described first unicast data message.The difference that broadcasting is transmitted and known unicast is transmitted is, known unicast is that each RB node is oneself to be root (English is root) node calculating forward-path, and broadcasting is to select one or more RB nodes as root node in TRILL network (the English Campus of being), and the RB node of the whole network is that root calculates forward-path with the same or a plurality of RB that choose all.Broadcast when transmitting, at first user's message is encapsulated as the TRILL message, then the TRILL message is forwarded to root node, duplicate distribution to each branch behind the arrival root node.Use the purpose of a plurality of root nodes to be with the broadcast traffic load balancing.
The flow process of multicast forwarding is the same with broadcasting, and summary is got up as follows:
Inlet RB node is searched MAC according to the inner VLAN identification of user data message and is transmitted after the CE port is received the user data message.If find to find the another name of corresponding target MAC (Media Access Control) address, perhaps the user data message is a multicast message, then at first carry out the TRILL encapsulation as the another name of purpose MAC with the another name of the root node of multicast/broadcast distribution tree, and then carry out the encapsulation of outer ETH head, outer purpose MAC is a specific multicast MAC Address by the agreement appointment, abbreviates ALL-RB MAC as at the described English that is provided by a specific multicast MAC Address of agreement appointment in the TRILL agreement.
Switching RB node is resolved the ETH head and is found to be the broadcast/group broadcast message when particular port is received data message, searches the multicast distribution tree forwarding-table item according to another name, is forwarded to next device according to the distribution tree path.
Root RB node determines that another name is self, then according to the distribution tree that with oneself is root flow is duplicated and is distributed to each branch.
After the leaf RB of distribution tree node is received multicast message, peel off the TRILL head, be forwarded to the CE side.
When forwarding-table item calculating was carried out in calculating, because the temporary transient LSDB database that a variety of causes causes is asynchronous, the path that may cause calculating between the distinct device formed loop in the TRILL agreement.Cause that the nonsynchronous reason of temporary transient database can be that the broadcasting of receiving between each equipment is asynchronous, perhaps equipment suspension, perhaps device link information-change etc.Transmit for clean culture,, therefore can use TTL cancellation loop hidden danger because message can not duplicate distribution in repeating process.For multicast message, if can not in time find loop, the distribution of duplicating owing to message may cause the offered load flow to be doubled and redoubled, and causes network paralysis.Therefore, must carry out neighbours before TRILL agreement regulation multicast message is transmitted and check and rpf check, check that the flow of failure will be dropped, thereby avoid the loop risk of multicast.
In the TRILL agreement, for two equipment that have neighborhood, the link between the equipment of adjacent device each other just, regulation can only be issued a unique NBR TLV.When local route is calculated, calculate for multicast simultaneously, two equipment that require to link to each other are selected link according to the agreement regulation, guarantee to choose on same the physical link, check failure to avoid multicast RPF and neighbours.
Yet, between above-mentioned two equipment, exist in the scene of many parallel physical links, the multicast link of selecting might not be the link of link overhead minimum, but used the expense of the link of the link overhead minimum of carrying among the described unique N BR TLV during expense of calculating multicast path, cause accurately to calculate the expense of multicast path, thereby mistake is distributed in more multithread amount on the big link of the relatively poor for example expense of Link State and transmits, and causes flow congestion so that dropping packets.In addition, (English full name is Maximum Transmission Unit can also to carry the maximum transfer unit of the link of described link overhead minimum among the described unique N BR TLV, english abbreviation is MTU), the equipment in the network can calculate the MTU of multicast path according to the MTU of the link of described link overhead minimum.But may be different owing to be used for the MTU of the multicast path of bear multicast flow between the MTU of the link of described link overhead minimum and described two equipment, so the MTU of the multicast path that calculates also may make mistakes, thus cause traffic loss.
Fig. 3 is the schematic diagram of the application scenarios of one embodiment of the present of invention.
Fig. 3 schematically comprises the RB node that establishes the connection of TRILL agreement between two, RB1 31 and RB2 32, and between two RB nodes three parallel link a33, link b34 and link c35 are arranged.Therefore RB1 31 and RB2 32 establish neighborhood, adjacent device each other.The bandwidth of link a33 is greater than the bandwidth of link b and link c, and the expense of link a33 (English is metric) Y is minimum in three links herein.The present invention does not do qualification to the parallel physical link number and the size of concrete bandwidth, expense, herein only for the relation of size is shown.Therefore in the NBR TLV of issue, select the expense of link a33.But when multicast calculates, may select link b34 to come the forwarding multicasting flow, and what multicast calculated use is the expense of link a33, this is because only issue a unique NBR TLV among the LSP, to cause flux of multicast on the littler link b34 of bandwidth, to be transmitted in this case, may cause flow congestion so that dropping packets.In addition, when the MTU of link a33 and link b34 not simultaneously, also may cause flow to be dropped.
Fig. 4 is 40 a schematic flow diagram according to one embodiment of present invention.The equipment of carrying out embodiment 40 can be the arbitrary equipment (being called first equipment in the context) that establishes syntople in the network with another equipment (being called second equipment in the context), and wherein first equipment and second equipment all can be routing bridges.
41, first equipment generates first syntople type lengths values (english abbreviation is NBR TLV) and the 2nd NBR TLV, wherein, first equipment links to each other by many parallel links with second equipment, and second equipment is the adjacent device of first equipment, the one NBR TLV carries first expense, first expense is the expense of the link of expense minimum in many parallel links, the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, the multicast Route Distinguisher is used to represent that second expense that the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links.Alternatively, described multicast path is to comprise the multistage path of continuous link successively, is used for the transport multicast flow.
42, the first equipment flood the NBR TLV that carries first expense and carry the multicast Route Distinguisher and second expense in network the 2nd NBR TLV.
It is the NBR TLV that the particular link in many parallel links between first equipment and second equipment generates that first equipment floods in network, and particular link comprises the link of expense minimum in many parallel links and is used for the multicast link of bear multicast flow.
Preferably, when the described maximum transfer unit (english abbreviation is MTU) of also having carried the link of described expense minimum among the NBR TLV of described first expense of carrying, when described the 2nd NBR TLV that carries the described multicast Route Distinguisher and second expense has also carried the MTU of described multicast link, method 40 in the present embodiment also comprises: described first equipment is that every link in other links in described many parallel links generates a NBR TLV respectively, and wherein said other links are except that the link of described expense minimum and the link the described multicast link in described many parallel links; The NBR TLV of every link in described other links carries corresponding M TU respectively; In network, the flood NBR TLV of every link in described other links that carry corresponding MTU of described first equipment.Because being every link in other links in described many parallel links, first equipment generates a NBR TLV respectively, so all corresponding NBR TLV of every link in other links.Therefore and because every link in other links all has a corresponding M TU, every link all has NBR TLV and MTU of a correspondence.So, there is corresponding relation in NBR and the MTU corresponding to same link in other links.For example, when other links comprised a link 1, there were corresponding relation in the NBR TLV of link 1 and the MTU of link 1, and the MTU that is to say link 1 is the corresponding M TU of the NBR TLV of link 1.In the present embodiment, in fact the NBR TLV of a link is meant the NBR TLV that generates into this link.
Preferably, described first equipment the 2nd NBR TLV that floods the NBR TLV that carries described first expense and carry the described multicast Route Distinguisher and second expense in network comprises: described first equipment is by Link State Protocol Data Unit (english abbreviation is LSP) flood in network a NBR TLV who carries described first expense and the 2nd NBR TLV that carries the described multicast Route Distinguisher and second expense.
The preferably described multicast Route Distinguisher that carries comprises: use the subtype length value (english abbreviation is sub-TLV) of new expansion among described the 2nd NBR TLV to carry described multicast Route Distinguisher, perhaps, use the reservation position of described the 2nd NBR TLV to carry described multicast path by identification information.
Preferably, establish syntople between described first equipment and described second equipment, described syntople is set up by multilink transparent interconnected (english abbreviation is TRILL) agreement.
Preferably, in the present embodiment, the expense of link and/or MTU are link information.Link information also can be understood to include the information of expense and/or MTU.
When between two adjacent devices, many parallel links being arranged in the foregoing description, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.Application scenarios with Fig. 3 is an example, RB131 (referring to first equipment herein) will generate two NBR TLV, an expense Y who carries link a33, another carries expense 2Y and the multicast Route Distinguisher of link b34, and sends to RB2 32 on two links of correspondence respectively.
Corresponding with embodiment 40, Fig. 5 is the schematic flow diagram of one embodiment of the present of invention 50.The equipment of carrying out embodiment 50 can be the arbitrary equipment (being called second equipment in the context) that establishes syntople in the network with another equipment (first equipment in the context) equally, wherein first equipment and second equipment all can be routing bridges, and second equipment establishes multilink with first equipment as the method 40 of adjacent device.
51, second equipment receives the first syntople type lengths values NBR TLV and the 2nd NBR TLV that first equipment sends, wherein said first equipment links to each other by many parallel links with described second equipment, and described first equipment is the adjacent device of described second equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent that second expense that described the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBRTLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links.Alternatively, described multicast path is to comprise the multistage path of continuous link successively, is used for the transport multicast flow.
52, described second equipment floods the NBR TLV that carries described first expense and carries the described multicast Route Distinguisher and second expense in network the 2nd NBR TLV.
When between two adjacent devices, many parallel links being arranged in the foregoing description, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.
In addition, optionally, in the NBR TLV who carries first expense that second equipment receives, also carried the maximum transfer unit MTU of the link of expense minimum, when the 2nd NBR TLV that carries the multicast Route Distinguisher and second expense has also carried the MTU of multicast link, second equipment also receives a NBR TLV respectively by every link in other links in many parallel links, wherein other links be in many parallel links except that the link of expense minimum and the link the multicast link, the NBR TLV of every link in other links carries corresponding M TU.In the present embodiment, the NBR TLV of a link is meant the NBR TLV that generates into this link.Therefore, NBR TLV and the MTU corresponding to same link has corresponding relation.
Preferably, second equipment receives first equipment the one NBR TLV that flood, that carry first expense and carries the multicast Route Distinguisher and the 2nd NBR TLV of second expense by Link State Protocol Data Unit (english abbreviation is LSP) in network.
Preferably, the subtype length value of a new expansion among the NBR TLV of second equipment reception carries the multicast Route Distinguisher; Perhaps the reservation position of a NBR TLV carries multicast path by identification information.
Preferably, second equipment and first equipment establish syntople, and described syntople is set up by the TRILL agreement.
Preferably, in the present embodiment, the expense of link and/or MTU are link information.Link information also can be understood to include the information of expense and/or MTU.
Fig. 6 is the network topology schematic diagram of one embodiment of the present of invention 60.
As shown in Figure 6, comprise 4 nodes in the network, root node 61 and RB1 62, RB2 63 and RB364.RB1 62 and RB2 63 also can be called first equipment and second equipment, between establish syntople by the TRILL agreement, comprise three parallel physical link a65, link b66 and link c67 between first equipment and second equipment, expense is respectively 10,100 and 50.The expense of unique link is 10 between root node 61 and the RB1 62, and the expense of unique link is 20 between RB2 63 and the RB3 64, and the expense of unique link is 50 between RB1 and the RB3.
In the prior art, the NBR TLV that RB1 62 and RB2 63 flood in network is the information of link a65, but might actual selection during multicast link b66 come transmitted traffic, can cause using the shortest multicast path that the expense 10 of link a65 calculates and the shortest multicast path really not to be inconsistent.When dispense flow rate, more flow may be placed on the less multicast path of bandwidth thus, for example on a multicast path, send, cause flow congestion thus or abandon through link b66.Shown in solid arrow among the figure, the link b66 of flux of multicast between root node 61, RB1 62 and RB2 63 transmits along this path to RB3 64.
When link a65 is the link of expense minimum in many parallel links, and link b66 is when being multicast link in many parallel links, and when using the method for the embodiment of the invention, concrete situation is as described below.
Like this, receive the expense of the routing bridge of the NBR TLV that carries described multicast Route Distinguisher according to the overhead computational multicast path of multicast link.When clear and definite on the multicast path during expense of each bar multicast link, then participate in the node that multicast path calculates and can calculate the expense of multicast path exactly, distribute so that reasonably carry out network traffics, avoid flow congestion or abandon.Be specifically described below.
Two NBR TLV of RB1 62 above-mentioned generation of inundation in network.
For prior art, in unicast path was calculated, the expense 10 of link a65 will be used to carry out the calculating of unicast path.For prior art, in the calculating of multicast path, link a65 and link b66 might the selected multicast links that becomes the bear multicast flow.But, even link b66 selected be multicast link, when calculating the expense of multicast path, because the expense of the link a65 that only flooded, therefore still can use the expense 10 of link a65 to participate in multicast paths and calculate.Like this, the expense of first multicast path of process root node 61, RB1 62, RB2 63 to RB3 64 can be considered to less than the expense that arrives second multicast path of RB3 64 successively through root node 61, RB1 62, RB2 63 successively, and first multicast path can be selected as the preferred multicast path.When distributing flux of multicast, might cause flux of multicast congested or lose because flux of multicast is excessive according to the expense of first multicast path that calculates.
The embodiment of the invention in the NBR TLV of the selected multicast link of RB1 62 except carrying the expense of multicast link, also carried the multicast Route Distinguisher, other network equipments that receive the NBRTLV that carries described multicast Route Distinguisher thus can calculate the expense of multicast path exactly according to the expense of multicast link.
For example in the NBR TLV that RB1 62 generates for link b66, carry the multicast Route Distinguisher.The multicast Route Distinguisher can carry by the subtype length value (english abbreviation is sub-TLV) that uses new expansion among the current NBR TLV, wherein the subtype length value of new expansion is meant the subtype length value of redetermination, also can use reservation position among the current NBR TLV (English be Reserved Bit) to carry, perhaps the method that other can mark TLV.
The sub-TLV form that carries the multicast Route Distinguisher can be shown in the example of following table 4, but the embodiment of the invention is not done qualification to this form, can otherwise carry the multicast Route Distinguisher yet.
Table 4
The multicast Route Distinguisher of 1 byte length is the type (the English Type of being) of sub-TLV in the table 4, the length of numerical value is defined as 1 byte, and preceding 7 of numerical value is to keep the position, shown in " R " in the table, last position is a multicast bits, shown in " M " in the table (English full name is Multicast bit).
When carrying the multicast Route Distinguisher among the NBR TLV of the link b66 that RB1 62 sends, when carrying out multicast path by calculating this moment, the expense 100 of link b66 participates in calculating.After the calculating, as dotted line among Fig. 6 represent through the expense of second multicast path of root node 61, RB1 62, RB2 63 to RB3 64 less than first multicast path as described in representing as solid line, so second multicast path is only real shortest path.
When between two adjacent devices, many parallel links being arranged in the foregoing description, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.
Optionally, can also carry MTU among the NBR TLV in the embodiment of the invention, help selecting the flow size of transmission, further avoid flow on the less link of MTU, to be dropped according to MTU.
In addition, optionally, first equipment is that every link in other links in many parallel links generates a NBR TLV respectively, and wherein other links are except that the link of expense minimum and the link the multicast link in many parallel links.
In the embodiment of method 60, RB1 62 can also generate a NBR TLV for link c67.The NBR TLV of link c67 carries the MTU of link c67, perhaps also can carry expense and the MTU of link c67.RB1 62 can be by the NBR TLV of LSP above-mentioned generation of inundation in network.
Fig. 7 A and Fig. 7 B are the schematic block diagrams of first equipment 70 according to an embodiment of the invention.
Shown in Fig. 7 A, first equipment 70 comprises generation unit 71 and transmitting element 72.As a kind of implementation alternatively, first equipment 70 can be the routing bridge in the network service etc., and first equipment also establishes syntople with second equipment.
Generation unit 71 is used to generate first syntople type lengths values NBR TLV and the 2nd NBRTLV, wherein, first equipment links to each other by many parallel links with second equipment, and second equipment is the adjacent device of first equipment, a described NBR TLV carries first expense, described first expense is the expense of the link of expense minimum in described many parallel links, described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent the expense that described second expense that described the 2nd NBR TLV carries is a multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links.Described multicast path is to comprise the multistage path of continuous link successively, is used for the transport multicast flow.
Transmitting element 72 is used for to flood a NBR TLV who carries first expense that generation unit 71 generates and carry the 2nd NBR TLV of the multicast Route Distinguisher and second expense of network.
When between two adjacent devices, many parallel links being arranged in the foregoing description, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.
In addition, optionally, in the NBR TLV who carries first expense that generation unit 71 generates, also carried the MTU of the link of expense minimum, when the 2nd NBRTLV that carries the multicast Route Distinguisher and second expense has also carried the MTU of multicast link, generation unit 71 also is used to every link in other links in many parallel links to generate a NBR TLV respectively, wherein other links be in many parallel links except that the link of expense minimum and the link the multicast link, and the NBR TLV of every link in other links carries corresponding M TU.Transmitting element 72 also is used for the NBR TLV of every link in network floods other links that carry corresponding M TU that generation unit 71 generates.Because being every link in other links in described many parallel links, first equipment generates a NBR TLV respectively, so all corresponding NBR TLV of every link in other links.Therefore and because every link in other links all has a corresponding M TU, every link all has NBR TLV and MTU of a correspondence.So, there is corresponding relation in NBR and the MTU corresponding to same link in other links.For example, when other links comprised a link 1, there were corresponding relation in the NBR TLV of link 1 and the MTU of link 1, and the MTU that is to say link 1 is the corresponding M TU of the NBR TLV of link 1.In the present embodiment, in fact the NBR TLV of a link is meant the NBR TLV that generates into this link.
Alternatively, transmitting element 72 specifically is used for the 2nd NBR TLV that floods the NBR TLV that carries first expense and carry the multicast Route Distinguisher and second expense to network by Link State Protocol Data Unit (english abbreviation is LSP).
In the present embodiment, can use the subtype length value (english abbreviation is sub-TLV) of the new expansion among the 2nd NBR TLV to carry the multicast Route Distinguisher; Perhaps, use the reservation position of the 2nd NBR TLV to carry the multicast Route Distinguisher.Present embodiment does not limit other modes of use and carries the multicast Route Distinguisher.
Preferably, in the present embodiment, the expense of link and/or MTU are link information.Link information also can be understood to include the information of expense and/or MTU.
Shown in Fig. 7 B, first equipment 70 can also comprise that syntople sets up unit 73.Syntople is set up unit 73 and is used for setting up syntople with second equipment, and described syntople is set up by the TRILL agreement.
Pass through technique scheme, clean culture calculating and multicast calculate and no longer influence each other, and under the prerequisite that does not influence the clean culture shortest path, have realized that multicast tree also can use shortest path, and it is in full accord to guarantee that multicast forwarding list item and route are calculated routing, has further avoided flow congestion and abandons.
Fig. 8 A and Fig. 8 B are the schematic block diagrams of second equipment 80 of the embodiment of the invention.
Shown in Fig. 8 A, second equipment 80 comprises receiving element 81 and transmitting element 82.As a kind of implementation method, second equipment 80 can be the routing bridge in the network service etc., and establishes syntople with first equipment.
Receiving element 81 is used to first syntople type lengths values (english abbreviation is NBR TLV) and the 2nd NBR TLV that first equipment that receives sends, wherein first equipment links to each other by many parallel links with second equipment, and first equipment is the adjacent device of second equipment, the one NBR TLV carries first expense, first expense is the expense of the link of expense minimum in many parallel links, the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, the multicast Route Distinguisher is used to represent that second expense that the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of the 2nd NBR TLV according to the second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links.Described multicast path is to comprise the multistage path of continuous link successively, is used for the transport multicast flow.
Transmitting element 82 is used for the 2nd NBR TLV from second expense to network that flood the NBR TLV that carries first expense and carry the multicast Route Distinguisher and.
When between two adjacent devices, many parallel links being arranged in the foregoing description, the expense in the expense that can be by the multicast link in described many parallel links that flood in the network and the path of expense minimum, thereby can make the expense of the equipment of participation multicast path calculating in the network according to the correct overhead computational multicast path of the multicast link between described two adjacent devices, and, therefore can not influence the normal calculating of unicast path owing to keep the expense in the path of described expense minimum to be flooded yet.
In addition, optionally, in the NBR TLV who carries first expense that receiving element 81 receives, also carried the maximum transfer unit MTU of the link of expense minimum, when the 2nd NBR TLV that carries the multicast Route Distinguisher and second expense has also carried the MTU of multicast link, receiving element 81 also is used for receiving a NBR TLV respectively by every link in other links of many parallel links, wherein other links be in many parallel links except that the link of expense minimum and the link the multicast link, the NBR TLV of every link in other links carries corresponding M TU.In the present embodiment, the NBR TLV of a link is meant the NBR TLV that generates into this link.Therefore, NBRTLV and the MTU corresponding to same link has corresponding relation.
Receiving element 81 specifically is used for receiving first equipment the one NBR TLV that flood to network, that carry first expense and carrying the multicast Route Distinguisher and the 2nd NBR TLV of second expense by Link State Protocol Data Unit (english abbreviation is LSP).
The subtype length value of a new expansion among the NBR TLV that receiving element 81 receives carries the multicast Route Distinguisher; Perhaps the reservation position of a NBR TLV carries multicast path by identification information.
Shown in Fig. 8 B, second equipment 80 can also comprise that syntople sets up unit 83.Syntople is set up unit 83 and is used for setting up syntople with first equipment, and described syntople is set up by the TRILL agreement.
Preferably, in the present embodiment, the expense of link and/or MTU are link information.Link information also can be understood to include the information of expense and/or MTU.
One embodiment of the present of invention are the network system that comprises first equipment 70 and second equipment 80, and this network system can realize embodiment 60.
Those of ordinary skills can recognize, the unit and the algorithm steps of each example of describing in conjunction with embodiment disclosed herein can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions still are that software mode is carried out with hardware actually, depend on the application-specific and the design constraint of technical scheme.The professional and technical personnel can use distinct methods to realize described function to each specific should being used for, but this realization should not thought and exceeds scope of the present invention.
The those skilled in the art can be well understood to, and is the convenience described and succinct, and the concrete course of work of the system of foregoing description, device and unit can not repeat them here with reference to the corresponding process among the preceding method embodiment.
In several embodiment that the application provided, should be understood that disclosed system, apparatus and method can realize by other mode.For example, device embodiment described above only is schematic, for example, the division of described unit, can only be that a kind of logic function is divided, during actual the realization other dividing mode can be arranged, for example a plurality of unit or assembly can in conjunction with or can be integrated into another system, or some features can ignore, or do not carry out.Another point, the shown or coupling each other discussed or directly to be coupled or to communicate to connect can be by some interfaces, the indirect coupling of device or unit or communicate to connect can be electrically, machinery or other form.
Described unit as separating component explanation can or can not be physically to separate also, and the parts that show as the unit can be or can not be physical locations also, promptly can be positioned at a place, perhaps also can be distributed on a plurality of network element.Can select wherein some or all of unit to realize the purpose of present embodiment scheme according to the actual needs.
In addition, each functional unit in each embodiment of the present invention can be integrated in the processing unit, also can be that the independent physics in each unit exists, and also can be integrated in the unit two or more unit.
If described function realizes with the form of SFU software functional unit and during as independently production marketing or use, can be stored in the computer read/write memory medium.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words or the part of this technical scheme can embody with the form of software product, this computer software product is stored in the storage medium, comprise that some instructions are with so that a computer equipment (can be a personal computer, server, the perhaps network equipment etc.) carry out all or part of step of the described method of each embodiment of the present invention.And aforesaid storage medium comprises: (english abbreviation is ROM for USB flash disk, portable hard drive, read-only memory, English full name is Read-Only Memory), various media that can be program code stored such as random access memory (english abbreviation is RAM, and English full name is Random Access Memory), magnetic disc or CD.
The above; only be the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by described protection range with claim.
Claims (10)
1. a method of announcing link information is characterized in that, comprising:
First equipment generates the first syntople type lengths values NBR TLV and the 2nd NBR TLV, wherein,
Described first equipment links to each other by many parallel links with second equipment, and described second equipment adjacent device that is described first equipment,
A described NBR TLV carries first expense, and described first expense is the expense of the link of expense minimum in described many parallel links,
Described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent the expense that described second expense that described the 2nd NBR TLV carries is a multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links;
Described first equipment floods the NBR TLV that carries described first expense and carries the described multicast Route Distinguisher and second expense in network the 2nd NBR TLV.
2. method according to claim 1, it is characterized in that, wherein, in a described NBR TLV who carries described first expense, also carried the maximum transfer unit MTU of the link of described expense minimum, when described the 2nd NBR TLV that carries the described multicast Route Distinguisher and second expense had also carried the MTU of described multicast link, described method also comprised:
Described first equipment is that every link in other links in described many parallel links generates a NBR TLV respectively, wherein said other links be in described many parallel links except that the link of described expense minimum and the link the described multicast link, the NBR TLV of every link in described other links carries corresponding M TU respectively;
In network, the flood NBR TLV of every link in described other links that carry corresponding MTU of described first equipment.
3. method according to claim 1 is characterized in that, described first equipment floods the NBR TLV that carries described first expense and carries the described multicast Route Distinguisher and second expense in network the 2nd NBR TLV comprises:
Described first equipment is by flood in the network NBR TLV that carries described first expense and carry the 2nd NBRTLV of the described multicast Route Distinguisher and second expense of Link State Protocol Data Unit LSP.
4. according to any described method of claim 1 to 3, it is characterized in that, establish syntople between wherein said first equipment and described second equipment, described syntople is set up by the transparent interconnected TRILL agreement of multilink.
5. a method of announcing link information is characterized in that, comprising:
Second equipment receives the first syntople type lengths values NBR TLV and the 2nd NBR TLV that first equipment sends, wherein
Described first equipment links to each other by many parallel links with described second equipment, and described first equipment adjacent device that is described second equipment,
A described NBR TLV carries first expense, and described first expense is the expense of the link of expense minimum in described many parallel links,
Described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent that second expense that described the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links;
Described second equipment floods the NBR TLV that carries described first expense and carries the described multicast Route Distinguisher and second expense in network the 2nd NBR TLV.
6. an equipment is characterized in that, comprising:
Generation unit is used to generate first syntople type lengths values NBR TLV and the 2nd NBRTLV, wherein,
Described first equipment links to each other by many parallel links with second equipment, and described second equipment adjacent device that is described first equipment,
A described NBR TLV carries first expense, and described first expense is the expense of the link of expense minimum in described many parallel links,
Described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent the expense that described second expense that described the 2nd NBR TLV carries is a multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links;
Transmitting element is used for to flood a NBR TLV who carries described first expense that described generation unit generates and carry the 2nd NBR TLV of the described multicast Route Distinguisher and second expense of network.
7. first equipment according to claim 6, it is characterized in that, wherein, in the NBR TLV who carries described first expense that described generation unit generates, also carried the maximum transfer unit MTU of the link of described expense minimum, when described the 2nd NBRTLV that carries the described multicast Route Distinguisher and second expense has also carried the MTU of described multicast link
Described generation unit also is used to every link in other links in described many parallel links to generate a NBR TLV respectively, wherein said other links be in described many parallel links except that the link of described expense minimum and the link the described multicast link, the NBRTLV of every link in described other links carries corresponding M TU respectively;
Described transmitting element also is used for the NBR TLV of every link in network floods described other links that carry corresponding MTU that described generation unit generates.
8. first equipment according to claim 6 is characterized in that, described transmitting element specifically is used for:
The 2nd NBR TLV that in network, floods the NBR TLV that carries described first expense and carry the described multicast Route Distinguisher and second expense by Link State Protocol Data Unit LSP.
9. according to any described first equipment of claim 6 to 8, it is characterized in that described first equipment also comprises:
Syntople is set up the unit, is used for setting up syntople with described second equipment, and described syntople is set up by the transparent interconnected TRILL agreement of multilink.
10. an equipment is characterized in that, comprising:
Receiving element is used to the first syntople type lengths values NBR TLV and the 2nd NBR TLV that first equipment that receives sends, wherein
Described first equipment links to each other by many parallel links with described second equipment, and described first equipment adjacent device that is described second equipment,
A described NBR TLV carries first expense, and described first expense is the expense of the link of expense minimum in described many parallel links,
Described the 2nd NBR TLV carries the multicast Route Distinguisher and second expense, described multicast Route Distinguisher is used to represent that second expense that described the 2nd NBR TLV carries is the expense of multicast link, so that receive the expense of the routing bridge of described the 2nd NBR TLV according to the described second overhead computational multicast path, described multicast link is the link that is used for the bear multicast flow in described many parallel links;
Transmitting element is used for the 2nd NBR TLV that floods the NBR TLV that carries described first expense and carry the described multicast Route Distinguisher and second expense to network.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210018816.8A CN103220221B (en) | 2012-01-20 | 2012-01-20 | Method and device capable of noticing link information |
| PCT/CN2013/070354 WO2013107323A1 (en) | 2012-01-20 | 2013-01-11 | Method and device for noticing link information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210018816.8A CN103220221B (en) | 2012-01-20 | 2012-01-20 | Method and device capable of noticing link information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103220221A true CN103220221A (en) | 2013-07-24 |
| CN103220221B CN103220221B (en) | 2017-04-12 |
Family
ID=48798621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210018816.8A Active CN103220221B (en) | 2012-01-20 | 2012-01-20 | Method and device capable of noticing link information |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103220221B (en) |
| WO (1) | WO2013107323A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105247823A (en) * | 2013-09-13 | 2016-01-13 | 华为技术有限公司 | Method and apparatus for adjusting link overhead |
| CN105306613A (en) * | 2014-07-24 | 2016-02-03 | 中兴通讯股份有限公司 | MAC address notification method and device and acquisition device for ESADI |
| CN106506366A (en) * | 2016-11-07 | 2017-03-15 | 瑞斯康达科技发展股份有限公司 | A kind of method for realizing multi protocol label exchange path inquiry and node |
| CN107248954A (en) * | 2017-08-04 | 2017-10-13 | 山西大学 | A kind of intra-area routes guard method based on network intersection degree |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100544350C (en) * | 2004-09-10 | 2009-09-23 | 华为技术有限公司 | A kind of method of obtaining link to the end interface details |
| US8060649B2 (en) * | 2007-06-26 | 2011-11-15 | Aruba Networks Cayman | Method and system for dynamic metric and wireless hello protocol |
| CN101562577A (en) * | 2009-06-09 | 2009-10-21 | 华为技术有限公司 | Router, routing next-hop-information offline computing method and device thereof |
| US10033650B2 (en) * | 2010-06-08 | 2018-07-24 | Brocade Communication Systems Llc | Preserving quality of service across trill networks |
| CN101984596B (en) * | 2010-11-04 | 2012-05-30 | 北京星网锐捷网络技术有限公司 | Method, device and routing equipment for avoiding black holes |
-
2012
- 2012-01-20 CN CN201210018816.8A patent/CN103220221B/en active Active
-
2013
- 2013-01-11 WO PCT/CN2013/070354 patent/WO2013107323A1/en active Application Filing
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105247823A (en) * | 2013-09-13 | 2016-01-13 | 华为技术有限公司 | Method and apparatus for adjusting link overhead |
| CN105247823B (en) * | 2013-09-13 | 2018-10-02 | 华为技术有限公司 | The method and apparatus for adjusting link overhead |
| CN105306613A (en) * | 2014-07-24 | 2016-02-03 | 中兴通讯股份有限公司 | MAC address notification method and device and acquisition device for ESADI |
| CN106506366A (en) * | 2016-11-07 | 2017-03-15 | 瑞斯康达科技发展股份有限公司 | A kind of method for realizing multi protocol label exchange path inquiry and node |
| CN106506366B (en) * | 2016-11-07 | 2019-10-25 | 瑞斯康达科技发展股份有限公司 | A kind of method and node for realizing multi protocol label exchange path inquiry |
| CN107248954A (en) * | 2017-08-04 | 2017-10-13 | 山西大学 | A kind of intra-area routes guard method based on network intersection degree |
| CN107248954B (en) * | 2017-08-04 | 2020-06-12 | 山西大学 | Intra-domain route protection method based on network crossing degree |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103220221B (en) | 2017-04-12 |
| WO2013107323A1 (en) | 2013-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9876707B2 (en) | Method and apparatus for multicast implementation in a network | |
| CN105379197B (en) | It establishes the method in tunnel, distribute method, equipment and the network system of label | |
| CN102037685B (en) | IP forwarding across a link state protocol controlled Ethernet network | |
| CN105933228B (en) | Traffic engineering for bit indexed explicit replication | |
| CN102986176B (en) | Method and apparatus for MPLS label allocation for a BGP MAC-VPN | |
| US8588081B2 (en) | Monitoring a flow set to detect faults | |
| CN106656794B (en) | Message transmission method and device | |
| CN102055665B (en) | OSPF point-to-multipoint over broadcast or NBMA mode | |
| CN102217238A (en) | Service instance applied to mpls networks | |
| CN104396197B (en) | Selected in 802.1aq networks using the tie breaker of separation between minimum cost path footpath is waited | |
| CN107592262A (en) | File transmitting method and the network architecture of the cross-domain forwarding of device, message | |
| WO2010148500A1 (en) | Utilizing betweenness to determine forwarding state in a routed network | |
| US9112711B2 (en) | Optimizing OTV multicast traffic flow for site local receivers | |
| CN103067286A (en) | Multicast data transmission method and equipment | |
| CN107623630B (en) | Bit index explicit copy information transfer method and device | |
| CN113709034A (en) | Bit mask route targets in directed information distribution using routing protocols | |
| CN114465946A (en) | Method, device and system for obtaining forwarding table item | |
| JP4890239B2 (en) | RPR transmission route designation method and apparatus | |
| CN103220221A (en) | Method and device capable of noticing link information | |
| CN106027352A (en) | Service message forwarding method and device | |
| CN101483591B (en) | Route implementing method and route generating apparatus | |
| CN103152257B (en) | A kind of data transmission method and device thereof | |
| CN102857417A (en) | Method and system for transmitting data in TRILL (transparent interconnection of lots of links) network | |
| US20170141997A1 (en) | Multicast routing via non-minimal paths | |
| CN114520762A (en) | Method for sending BIERv6 message and first network equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |