WO2018184487A1 - Bier message forwarding method and device - Google Patents

Bier message forwarding method and device Download PDF

Info

Publication number
WO2018184487A1
WO2018184487A1 PCT/CN2018/080637 CN2018080637W WO2018184487A1 WO 2018184487 A1 WO2018184487 A1 WO 2018184487A1 CN 2018080637 W CN2018080637 W CN 2018080637W WO 2018184487 A1 WO2018184487 A1 WO 2018184487A1
Authority
WO
WIPO (PCT)
Prior art keywords
bier
forwarding
cache entry
packet
cache
Prior art date
Application number
PCT/CN2018/080637
Other languages
French (fr)
Chinese (zh)
Inventor
彭少富
金飞蔡
徐本崇
韩杰
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018184487A1 publication Critical patent/WO2018184487A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/742—Route cache; Operation thereof
    • 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

Definitions

  • the present disclosure relates to the field of communications, and in particular, to a method and an apparatus for forwarding a BIER message.
  • Bit Indexed Explicit Replication describes a new architecture for multicast data packet forwarding. It provides optimal path forwarding for multicast data packets in the multicast domain. No protocol is used. A multicast distribution tree is established and no flow state is maintained at the intermediate node.
  • the BFIR Bit-Forwarding Ingress Router
  • the BFIR first determines which BIER SD (sub-domain) the packet will be sent to and which BFER (Bit-Forwarding Egress). Router, bit forwarding egress router).
  • BFIR then inserts a "BIER header" in the message header containing a BitString, each bit of the BitString representing the BFR-id of the corresponding BFER.
  • the number of BFERs that a message can be forwarded depends on the BSL (BitString Length, the length of the BitString). It is possible that the number of BFERs included in the sub-domain will exceed the BSL. To support this situation, SI (Set Identifier) is introduced in the BIER header. The SI and BitString together determine which BFER the message is to be forwarded to. If SI is n and the Kth bit in BitString is 1 (the lowest bit is the 1st bit), the message will be sent to the BFER with BFR-id of n*BSL+K.
  • Draft-ietf-bier-architecture-05 describes the rules for forwarding BIER encapsulated packets in the BIER domain.
  • To forward BIER-encapsulated packets 1) determine the sub-domain, BSL, BitString, and SI of the packet. The information determines the destination BFERs of the message; 2) uses the routing information corresponding to the sub-domain to determine the next hop to each BFER (possibly some BFR-ids are invalid or non-reachable forwarding information, then these BFRs The next hop of the -id is empty; 3) the BFERs are divided by the same next hop; 4) the BitString fragment corresponding to each next hop: copy the message, and clear the bits in the BitString that do not belong to the fragment.
  • the embodiment of the present disclosure provides a method and an apparatus for forwarding a BIER message.
  • a method for forwarding a BIER message including: receiving a bit index to explicitly copy a BIER message; and parsing the BIER message to obtain forwarding information of the BIER message; Forwarding information creates a cache cache entry corresponding to the BIER message; and forwarding the BIER message according to the cache entry.
  • forwarding the BIER packet according to the cache entry includes: forwarding the current BIER packet according to the cache entry; and when the BIER packet is forwarded next, according to the cache that is hit The forwarding information in the entry forwards the BIER message.
  • the forwarding information includes: a next hop node of the BIER packet, and a bit string BitString fragment corresponding to each next hop node.
  • the method further includes at least one of the following: when the forwarding information of the BIER packet changes, And the cache entry is deleted.
  • the cache entry is deleted when the BIER packet does not hit the cache entry within a preset time or a preset number of times during the forwarding of the BIER packet. .
  • updating the cache entry includes: determining, when the packet misses the cache entry, determining that the forwarding information of the BIER packet occurs.
  • the BIER message is parsed to obtain the forwarding information after the BIER packet is changed; and the cache entry is updated according to the changed forwarding information.
  • a forwarding apparatus for a BIER message including: a receiving module configured to receive a bit index to explicitly copy a BIER message; and a parsing module configured to parse the BIER message
  • the forwarding information of the BIER message is set, and the setting module is configured to: establish a cache cache entry corresponding to the BIER message according to the forwarding information; and the forwarding module is configured to forward the BIER report according to the cache entry Text.
  • the forwarding module includes: a first forwarding unit configured to forward the current BIER packet according to the cache entry; and a second forwarding unit configured to: when the BIER packet is forwarded next time, And forwarding the BIER packet according to the forwarding information in the cache entry that is hit.
  • the forwarding information includes: a next hop node of the BIER packet, and a bit string BitString fragment corresponding to each next hop node.
  • the apparatus further includes at least one of the following: an update module, configured to: after the creating module establishes a cache cache entry corresponding to the BIER message according to the forwarding information, in the BIER When the forwarding information of the packet changes, the cache entry is updated; and the deleting module is configured to: after the creating module establishes a cache cache entry corresponding to the BIER packet according to the forwarding information, During the forwarding process of the BIER packet, when the BIER packet does not hit the cache entry within a preset time or a preset number of times, the cache entry is deleted.
  • an update module configured to: after the creating module establishes a cache cache entry corresponding to the BIER message according to the forwarding information, in the BIER When the forwarding information of the packet changes, the cache entry is updated
  • the deleting module is configured to: after the creating module establishes a cache cache entry corresponding to the BIER packet according to the forwarding information, During the forwarding process of the BIER packet, when the BIER packet does not hit the cache
  • the updating module includes: a determining unit, configured to: when the packet misses the cache entry, determine that the forwarding information of the BIER packet changes; the parsing unit is configured to parse the BIER The packet obtains the forwarding information after the BIER packet is changed; the updating unit is configured to update the cache entry according to the changed forwarding information.
  • a storage medium is also provided.
  • the storage medium is arranged to store program code for performing the following steps:
  • the receiving bit index explicitly copies the BIER message
  • the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information And forwarding the BIER message according to the cache entry.
  • the BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.
  • FIG. 1 is a flowchart of a method for forwarding a BIER message according to an embodiment of the present disclosure
  • FIG. 2 is a structural block diagram of a forwarding apparatus of a BIER message according to an embodiment of the present disclosure
  • FIG. 3 is a schematic structural diagram of a cache entry in an embodiment of the present disclosure.
  • FIG. 4 is a schematic diagram of forwarding BIER packets according to an embodiment of the present disclosure.
  • FIG. 5 is a schematic diagram of establishing a cache entry according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic diagram of updating a cache entry according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic diagram of aging deletion of a cache entry in an embodiment of the present disclosure.
  • Figure 8 is a network topology diagram of an embodiment.
  • FIG. 1 is a flowchart of a method for forwarding a BIER message according to an embodiment of the present disclosure. As shown in FIG. 1 , the process includes the following steps:
  • Step S102 the receiving bit index explicitly copies the BIER message
  • Step S104 parsing the BIER message to obtain forwarding information of the BIER message
  • Step S106 Establish a cache cache entry corresponding to the BIER message according to the forwarding information.
  • Step S108 forwarding the BIER message according to the cache entry.
  • the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain the forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information. And forwarding the BIER message according to the cache entry.
  • the BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.
  • the execution body of the foregoing step may be a multicast router or the like, but is not limited thereto.
  • forwarding the BIER message according to the cache entry includes:
  • the forwarding information in this embodiment includes: a next hop node of the BIER packet, and a bit string BitString corresponding to each next hop node.
  • the keywords of the specific cache entry may be ⁇ SI, BSL, Entropy, BitString ⁇ , or compression information calculated based on ⁇ SI, BSL, Entropy, BitString ⁇ , such as using the HASH algorithm.
  • the method further includes at least one of the following:
  • the specific process of updating the cache entry includes:
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is The commonly used embodiment.
  • the solution of the present disclosure may be embodied in the form of a software product stored in a storage medium (such as a ROM/RAM, a magnetic disk, an optical disk), and includes a plurality of instructions for making one
  • the terminal device (which may be a cell phone, computer, server, or network device, etc.) performs the methods described in various embodiments of the present disclosure.
  • the embodiment of the present disclosure further provides a forwarding device for a BIER message, which is used to implement the foregoing embodiments and exemplary embodiments, and has not been described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the devices described in the following embodiments are typically implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 2 is a structural block diagram of a forwarding apparatus of a BIER message according to an embodiment of the present disclosure. As shown in FIG. 2, the apparatus includes:
  • the receiving module 20 is configured to receive the bit index to explicitly copy the BIER message
  • the parsing module 22 is configured to parse the BIER message to obtain forwarding information of the BIER message;
  • the creating module 24 is configured to establish a cache cache entry corresponding to the BIER message according to the forwarding information
  • the forwarding module 26 is configured to forward the BIER message according to the cache entry.
  • the forwarding module includes: a first forwarding unit configured to forward the current BIER packet according to the cache entry; and a second forwarding unit configured to: when the BIER packet is forwarded next, according to the cache entry in the hit Forward the message to forward the BIER message.
  • the forwarding information includes: a next hop node of the BIER message, and a bit string BitString corresponding to each next hop node.
  • the device further includes at least one of the following: an update module, configured to: after the creation module establishes a cache cache entry corresponding to the BIER message according to the forwarding information, update the BIER packet when the forwarding information changes The cache entry is deleted.
  • the module is configured to set the cache cache entry corresponding to the BIER packet according to the forwarding information, and the BIER packet is forwarded during the preset time or preset. When the cache entry is missed, the cache entry is deleted.
  • the updating module includes: a determining unit, configured to determine that the forwarding information of the BIER packet changes when the packet misses the cache entry; and the parsing unit is configured to parse the BIER packet to obtain the forwarding of the BIER packet.
  • the information update unit is configured to update the cache entry according to the changed forwarding information.
  • the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the above modules are all located in the same processor; or, the above modules are respectively located in different combinations. In the processor.
  • the embodiment of the present disclosure describes a cache-based BIER packet forwarding method, which can improve the forwarding performance of BIER encapsulated packets.
  • the method described in this embodiment cannot be simply considered to violate the BIER architecture to avoid maintaining the flow state on the intermediate node. It does not introduce a multicast protocol on the control plane to maintain the state of the specific multicast service flow and deliver the forwarding plane. Instead, the forwarding plane caches the forwarding result of the BIER encapsulation that is independent of the specific multicast service.
  • a cache link is added to the forwarding rule, and the specific BIER packet is forwarded according to the normal forwarding process defined by draft-ietf-bier-architecture-05, and the next hop to which the packet is sent is analyzed.
  • the forwarding plane When forwarding the BIER-encapsulated packet, the forwarding plane first parses the packet according to the conventional forwarding process defined by draft-ietf-bier-architecture-05 and draft-ietf-bier-mpls-encapsulation-06 (hereinafter referred to as the normal forwarding process).
  • the message needs to continue to be forwarded according to the information contained in the BitString. Then, according to ⁇ SD, SI, BSL, Entropy, BitString ⁇ , the cache table corresponding to the SD is attempted to hit a cache entry. If the packet is hit, it is directly forwarded according to the forwarding information contained in the cached entry. The normal forwarding process is skipped. If there is no hit, the packet is forwarded according to the normal forwarding process, and a cache miss is reported to the control plane. , SI, BSL, Entropy, BitString ⁇ " events. After receiving the event, the control plane will create a corresponding cache entry in the cache table corresponding to the SD.
  • the keyword of the cache entry may be ⁇ SI, BSL, Entropy, BitString ⁇ or based on ⁇ SI, BSL, Entropy, BitString.
  • the calculated compression information (for example, using the HASH algorithm), the forwarding information of the cache entry will include all the next hops to which the message is sent and the BitString fragments corresponding to each next hop according to the normal forwarding process, especially under If one hop is empty, the message is discarded.
  • the control plane sends the newly created cache entry to the forwarding plane, and the forwarding plane puts it into the cache table corresponding to the SD.
  • the forwarding plane maintains the corresponding cache table for each SD.
  • Some special forwarding hardware may directly generate cache entries by itself without reporting events to the control plane.
  • the control plane maintains the F-BM (Forwarding Bit Mask) information corresponding to each next hop, that is, the next hop is reachable when the shortest path is forwarded. All BFER information.
  • F-BM Forwarding Bit Mask
  • the F-BM information corresponding to each next hop is updated in real time and the latest BIFT (Bit Index Forwarding Table) table is delivered to the forwarding plane.
  • this patent also requires that when the F-BM corresponding to the next hop changes and some of the BFERs included in the old F-BM are no longer included in the new F-BM, even the next hop itself is no longer available.
  • the next hop is included in the forwarding information of the cache entry. If the information is included, the forwarding information of the cache entry is recalculated according to the normal forwarding process, and the updated cache entry is forwarded. The plane is updated. Note that if the F-BM corresponding to the next hop changes, but the new F-BM contains the BFER contained in the old F-BM and other more BFERs, there is no need to check the cache entries.
  • the forwarding plane can be timed out with the control plane for those cache entries that have not been hit for a long time. This can be configured with policies, such as deleting more than one hour without being hit, to save resources of the cache table. Specifically, the forwarding plane sets a hit statistics count field in each cache entry, and increments by 1 each time it is hit (if the count is reversed, it directly flips to 1, do not flip to 0), and periodically (such as The cache entries that are owned by the cache table are reported to the control plane in batches. The only keywords that contain the cache entries and their hit statistics are included in the report. The control plane deletes the cache entries whose hit statistics are 0, and sends them to the forwarding plane. The control plane modifies the statistics of the cache entries whose value is not 0. Then send an update to the forwarding plane.
  • FIG. 3 is a schematic structural diagram of a cache entry in the embodiment of the present disclosure.
  • the schematic diagram of the cache entry shown in FIG. 3 maintains a corresponding cache table for each BIER sub-domain in the forwarding plane.
  • the specific cache entries in sub-domain 0 are described.
  • the cache entry has two types of keywords, one is the original keyword such as ⁇ SI, BSL, Entropy, BitString ⁇ , and the other is based on the original keyword calculation.
  • the resulting compressed keyword is the cache id.
  • a BIER packet in the BIER sub-domain attempts to hit a cache entry, it can first perform compression calculation according to the ⁇ SI, BSL, Entropy, and BitString ⁇ related to the packet, obtain the corresponding cache id, and then search for the sub-domain. Corresponding cache table.
  • the specific compression algorithm is not covered by this patent, but it is recommended that different ⁇ SI, BSL, Entropy, BitString ⁇ should be able to calculate different cache ids as much as possible, otherwise there will be multiple ⁇ SI, BSL, Entropy under the same cache id.
  • BitString ⁇ corresponding child table item, at this time the message should be matched according to ⁇ SI, BSL, Entropy, BitString ⁇ to see which cache child table is actually hit.
  • the BitString fragment corresponding to the next hop is Sub-BitString_1, and also needs to be sent to ⁇ nexthop2, port2 ⁇ , the BitString fragment corresponding to the next hop is Sub-BitString_2, and so on.
  • the BIFT-id field corresponding to the corresponding next hop has the same meaning as the BIFT-id in the BIER header defined by the draft-ietf-bier-mpls-encapsulation-06, that is, the next hop is allocated to the corresponding ⁇ SD, SI, BSL ⁇ .
  • MPLS Label for MPLS network
  • BIFT-id for non-MPLS network allocated globally for the corresponding ⁇ SD, SI, BSL ⁇ .
  • the embodiment may also be slightly changed.
  • Entropy is not used as one of the cache keywords, but in the forwarding information of the cache entry, and then multiple sets of forwarding information are maintained according to the value of Entropy. After hitting the cache, the corresponding forwarding information is obtained from the hit cache entry according to Entropy in the message BIER Header.
  • FIG. 4 is a schematic diagram of BIER packet forwarding according to an embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of forwarding BIER packets, for example:
  • Step S210 The forwarding plane receives the BIER encapsulated packet, which may be received from the control plane of the node or received from other nodes.
  • step S220 the forwarding plane first parses the specific BIER encapsulation information, such as SD, SI, BSL, BitString, Entropy, TTL, etc. according to the conventional forwarding process.
  • specific BIER encapsulation information such as SD, SI, BSL, BitString, Entropy, TTL, etc.
  • Step S230 The forwarding plane continues to determine whether the TTL of the packet is less than or equal to 1 according to the normal forwarding process to determine whether the packet is to be forwarded.
  • step S240 if the TTL is less than 1, the packet is discarded. If the packet is sent to the control plane, the packet cannot be forwarded.
  • step S250 if the TTL is > 1, the packet can be forwarded.
  • the conventional forwarding process is not taken, but the compressed cache id is calculated according to ⁇ SI, BSL, Entropy, BitString ⁇ , and the corresponding cache entry is found in the cache table corresponding to the SD according to the cache id.
  • step S260 if the cache entry is hit, the packet is directly forwarded according to the forwarding information given in the cache entry, that is, the packet is forwarded to all next hops included in the forwarding information, according to the next hop corresponding to the given packet.
  • the BitString shards and the corresponding BIER Header of the BIFT-id package, the other field assignments in the BIER Header are no different from the regular forwarding process, and are not described here.
  • step S270 if the cache entry is not hit, the packet continues to be forwarded according to the normal forwarding process. At the same time, an event of "cache miss ⁇ SD, SI, BSL, Entropy, BitString ⁇ " is reported to the control plane.
  • FIG. 5 is a schematic diagram of establishing a cache entry according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram of establishing a cache entry, for example:
  • Step S310 the control plane receives an event of "cache miss ⁇ SD, SI, BSL, Entropy, BitString ⁇ " reported by the forwarding plane.
  • step S320 the control plane searches whether there is already a corresponding cache entry.
  • the control plane also calculates the compressed cache id according to ⁇ SI, BSL, Entropy, BitString ⁇ , and searches for the corresponding cache entry in the cache table corresponding to the SD according to the cache id.
  • step S330 if the cache entry does not exist, the control plane creates a corresponding cache entry, where the forwarding information included is the next hop to which the control plane obtains the packet according to the normal forwarding process, and the next hop corresponding to each subsequent hop. BitString sharding and BIFT-id.
  • step S340 the control plane sends a new cache entry to the forwarding plane, or sends an existing cache entry to the forwarding plane if the cache entry already exists.
  • FIG. 6 is a schematic diagram of a cache entry update according to an embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of a cache entry update, for example:
  • step S410 the control plane senses that the topology changes or the BFR-id information changes.
  • Step S420 the control plane updates the F-BM information corresponding to each next hop. It is possible that the new F-BM no longer contains the BFER contained in the old F-BM, and even the next hop itself is no longer available, both of which are incompatible variations. Another variation is the compatibility change, that is, the new F-BM contains all the BFERs included in the old F-BM and other additional BFERs.
  • step S430 when an incompatible change occurs in the corresponding F-BM of a certain next hop, the cache entry including the next hop in the forwarding information is triggered to recalculate the forwarding information.
  • step S440 the update is performed on the forwarding plane for the cache entry that recalculates the forwarding information.
  • FIG. 7 is a schematic diagram of the aging deletion of a cache entry in the embodiment of the present disclosure, and the aging of the cache entry shown in FIG. 7 is deleted, for example:
  • step S510 the forwarding plane periodically reports all the cache entries owned by the forwarding plane to the control plane according to the policy configuration, such as every hour or every other day. You can only include the cache keyword and the hit statistics count field when reporting.
  • step S520 the control plane checks whether the hit statistics count value of the reported cache entry is 0.
  • step S530 if the hit count value is 0, the control plane deletes the cache entry of the same keyword that it maintains, and sends the delete to the forwarding plane.
  • step S540 if the hit statistics count value is not 0, the control plane modifies the hit count value of the corresponding cache entry to 0 and sends an update to the forwarding plane.
  • the hit statistics count value is initially 0.
  • BIER 8 is a network topology diagram of an embodiment of the present disclosure. As shown in FIG. 8, in the BIER sub-domain 0, a multicast packet is sent to four BFERs: G, H, J, and K, where The next hop of G and H is B, and the next hop of J and K is C.
  • the control plane of node A will construct a BIER-encapsulated message.
  • the key segment of BIER Header is as follows:
  • the BIER-encapsulated packet is sent for the first time and fails when the forwarding plane attempts to hit the cache. Therefore, the forwarding plane is copied to the next hop B and the next hop C for the first time according to the normal forwarding process.
  • the control plane sends the cache entry to the forwarding plane.
  • the subsequent multicast packets are forwarded directly on the forwarding plane.
  • This example is based on the specific example 1, and describes how the cache table entries are updated when the topology changes.
  • the next hop from the A node to G and H will change from B to C, that is, before the fault occurs, the F-BM of the next hop B is ⁇ G, H. , I ⁇ , C's F-BM is ⁇ I, J, K ⁇ , and after the fault occurs, the F-BM of the next hop B is empty, and the F-BM of C is ⁇ G, H, I, J, K ⁇ , the F-BM of the next hop B has an incompatible change, and the F-BM of the next hop C has undergone a compatible change.
  • the control plane re-delivers the updated cache entry to the forwarding plane.
  • This example describes the forwarding effect of load balancing based on the specific example 1.
  • the BFER I node is also added to the queue that receives the multicast stream.
  • A can set the packet in the BIER Header.
  • the Entropy value controls the message to go to B or C to reach destination node I. For example, when the Entropy value is 0, the message goes B, and when the Entropy value is 1, the message goes C.
  • control plane can construct a BIER-encapsulated message.
  • the key fields of the BIER Header are as follows:
  • the forwarding plane will forward it according to the normal forwarding process when forwarding it for the first time.
  • the key segment of the BIER Header of the packet copied to the next hop B is as follows:
  • the control plane sends the cache entry to the forwarding plane.
  • the subsequent multicast packets are forwarded directly on the forwarding plane.
  • the forwarding plane will forward it according to the normal forwarding process when forwarding it for the first time.
  • the key segment of the BIER Header of the packet copied to the next hop B is as follows:
  • the control plane sends the cache entry to the forwarding plane.
  • the subsequent multicast packets are forwarded directly on the forwarding plane.
  • Embodiments of the present disclosure also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • a mobile hard disk e.g., a hard disk
  • magnetic memory e.g., a hard disk
  • the processor performs a receiving bit index to explicitly copy the BIER message according to the stored program code in the storage medium
  • the processor performs the parsing of the BIER packet according to the stored program code in the storage medium to obtain forwarding information of the BIER packet.
  • the processor performs, according to the stored program code in the storage medium, a cache cache entry corresponding to the BIER packet according to the forwarding information.
  • the processor performs forwarding the BIER packet according to the cache entry according to the stored program code in the storage medium.
  • computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridge, magnetic tape, magnetic disk storage or other magnetic storage device, or may Any other medium used to store the desired information and that can be accessed by the computer.
  • communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .
  • the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information And forwarding the BIER message according to the cache entry.
  • the BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Provided are a BIER message forwarding method and device, said method comprising: receiving a bit index explicit replication (BIER) message; analyzing the BIER message to obtain forwarding information of the BIER message; according to the forwarding information, establishing a high-speed cache storage device table entry corresponding to the BIER message; forwarding the BIER message according to the cache table entry.

Description

BIER报文的转发方法及装置BIER message forwarding method and device 技术领域Technical field
本公开涉及通信领域，具体而言，涉及一种BIER报文的转发方法及装置。The present disclosure relates to the field of communications, and in particular, to a method and an apparatus for forwarding a BIER message.
背景技术Background technique
位索引显式复制(Bit Indexed Explicit Replication，简称为BIER)描述了组播数据报文转发的一种新的架构，为组播数据报文在组播域中提供最优路径转发，不使用协议建立组播分发树，也不在中间节点维护任何流状态。当组播报文从域外到达BFIR(Bit-Forwarding Ingress Router，位转发入口路由器)时，BFIR先确定报文将在哪个BIER SD(sub-domain)内发送并发往哪些BFER(Bit-Forwarding Egress Router，位转发出口路由器)。BFIR然后在报文头中***“BIER header”，其中包含一个BitString，BitString的每一位表示相应BFER的BFR-id。一个报文能转发至的BFER的个数，取决于BSL(BitString Length，BitString的长度)。有可能，sub-domain中包含的BFER个数会超过BSL，为了支持这种情况，在BIER header中再引入SI(Set Identifier，集合标识)。SI与BitString一起确定报文要转发至哪些BFER。若SI为n，BitString中的第K位为1(记最低位为第1位)，则报文将会发给BFR-id为n*BSL+K的BFER。Bit Indexed Explicit Replication (BIER) describes a new architecture for multicast data packet forwarding. It provides optimal path forwarding for multicast data packets in the multicast domain. No protocol is used. A multicast distribution tree is established and no flow state is maintained at the intermediate node. When a multicast packet arrives at the BFIR (Bit-Forwarding Ingress Router), the BFIR first determines which BIER SD (sub-domain) the packet will be sent to and which BFER (Bit-Forwarding Egress). Router, bit forwarding egress router). BFIR then inserts a "BIER header" in the message header containing a BitString, each bit of the BitString representing the BFR-id of the corresponding BFER. The number of BFERs that a message can be forwarded depends on the BSL (BitString Length, the length of the BitString). It is possible that the number of BFERs included in the sub-domain will exceed the BSL. To support this situation, SI (Set Identifier) is introduced in the BIER header. The SI and BitString together determine which BFER the message is to be forwarded to. If SI is n and the Kth bit in BitString is 1 (the lowest bit is the 1st bit), the message will be sent to the BFER with BFR-id of n*BSL+K.
draft-ietf-bier-architecture-05描述了BIER domain内转发BIER封装报文的规则，为了转发BIER封装的报文，要进行：1)确定报文的sub-domain、BSL、BitString、SI，这些信息即确定了报文的目的BFERs集；2)使用sub-domain对应的路由信息，确定至每个BFER的下一跳(有可能某些BFR-id无效或者无可达转发信息，则这些BFR-id的下一跳为空)；3)按相同下一跳对BFERs划分；4)对于每个下一跳对应的BitString分片：拷贝报文，清除BitString中不属于该分片内的位，向该下一跳发送报文(下一跳为空的分片被丢弃)。这种转发规则将导致很差的转发性能，因为要对报文的BitString多次遍历，处理完某个下一跳对应的BitString分片后，才能 确定其它下一跳对应的BitString分片。草案中也声明这些规则不代表具体实现，只要具体实现时能达到这些规则的结果即可。Draft-ietf-bier-architecture-05 describes the rules for forwarding BIER encapsulated packets in the BIER domain. To forward BIER-encapsulated packets, 1) determine the sub-domain, BSL, BitString, and SI of the packet. The information determines the destination BFERs of the message; 2) uses the routing information corresponding to the sub-domain to determine the next hop to each BFER (possibly some BFR-ids are invalid or non-reachable forwarding information, then these BFRs The next hop of the -id is empty; 3) the BFERs are divided by the same next hop; 4) the BitString fragment corresponding to each next hop: copy the message, and clear the bits in the BitString that do not belong to the fragment. Send a message to the next hop (the fragment with the next hop being empty is discarded). This kind of forwarding rule will result in poor forwarding performance. Because the BitString of the packet is traversed multiple times, after the BitString fragment corresponding to a next hop is processed, the BitString fragment corresponding to the other next hop can be determined. The draft also states that these rules do not represent concrete implementations, as long as the results of these rules can be achieved in the specific implementation.
发明内容Summary of the invention
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.
本公开实施例提供了一种BIER报文的转发方法及装置。The embodiment of the present disclosure provides a method and an apparatus for forwarding a BIER message.
根据本公开的一个实施例，提供了一种BIER报文的转发方法，包括：接收位索引显式复制BIER报文；解析所述BIER报文得到所述BIER报文的转发信息；根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；根据所述cache表项转发所述BIER报文。According to an embodiment of the present disclosure, a method for forwarding a BIER message is provided, including: receiving a bit index to explicitly copy a BIER message; and parsing the BIER message to obtain forwarding information of the BIER message; Forwarding information creates a cache cache entry corresponding to the BIER message; and forwarding the BIER message according to the cache entry.
可选地，根据所述cache表项转发所述BIER报文包括：根据所述cache表项转发当前的所述BIER报文；在所述BIER报文在下一次转发时，根据命中的所述cache表项中的转发信息转发所述BIER报文。Optionally, forwarding the BIER packet according to the cache entry includes: forwarding the current BIER packet according to the cache entry; and when the BIER packet is forwarded next, according to the cache that is hit The forwarding information in the entry forwards the BIER message.
可选地，所述转发信息包括：所述BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。Optionally, the forwarding information includes: a next hop node of the BIER packet, and a bit string BitString fragment corresponding to each next hop node.
可选地，在根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项之后，所述方法还包括以下至少之一：在所述BIER报文的转发信息发生变化时，更新所述cache表项；在所述BIER报文的转发过程中，当所述BIER报文在预设时间内或预设次数内都未命中所述cache表项时，删除所述cache表项。Optionally, after the cache cache entry corresponding to the BIER packet is established according to the forwarding information, the method further includes at least one of the following: when the forwarding information of the BIER packet changes, And the cache entry is deleted. The cache entry is deleted when the BIER packet does not hit the cache entry within a preset time or a preset number of times during the forwarding of the BIER packet. .
可选地，在所述BIER报文的转发信息发生变化时，更新所述cache表项，包括：在所述报文未命中所述cache表项时，确定所述BIER报文的转发信息发生变化；解析所述BIER报文得到所述BIER报文变化后的转发信息；根据变化后的转发信息更新所述cache表项。Optionally, when the forwarding information of the BIER packet is changed, updating the cache entry includes: determining, when the packet misses the cache entry, determining that the forwarding information of the BIER packet occurs. The BIER message is parsed to obtain the forwarding information after the BIER packet is changed; and the cache entry is updated according to the changed forwarding information.
根据本公开的另一个实施例，提供了一种BIER报文的转发装置，包括：接收模块，设置为接收位索引显式复制BIER报文；解析模块，设置为解析所述BIER报文得到所述BIER报文的转发信息；创建模块，设置为根据所 述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；转发模块，设置为根据所述cache表项转发所述BIER报文。According to another embodiment of the present disclosure, a forwarding apparatus for a BIER message is provided, including: a receiving module configured to receive a bit index to explicitly copy a BIER message; and a parsing module configured to parse the BIER message The forwarding information of the BIER message is set, and the setting module is configured to: establish a cache cache entry corresponding to the BIER message according to the forwarding information; and the forwarding module is configured to forward the BIER report according to the cache entry Text.
可选地，所述转发模块包括：第一转发单元，设置为根据所述cache表项转发当前的所述BIER报文；第二转发单元，设置为在所述BIER报文在下一次转发时，根据命中的所述cache表项中的转发信息转发所述BIER报文。Optionally, the forwarding module includes: a first forwarding unit configured to forward the current BIER packet according to the cache entry; and a second forwarding unit configured to: when the BIER packet is forwarded next time, And forwarding the BIER packet according to the forwarding information in the cache entry that is hit.
可选地，所述转发信息包括：所述BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。Optionally, the forwarding information includes: a next hop node of the BIER packet, and a bit string BitString fragment corresponding to each next hop node.
可选地，所述装置还包括以下至少之一：更新模块，设置为在所述创建模块根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项之后，在所述BIER报文的转发信息发生变化时，更新所述cache表项；删除模块，设置为在所述创建模块根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项之后，在所述BIER报文的转发过程中，当所述BIER报文在预设时间内或预设次数内都未命中所述cache表项时，删除所述cache表项。Optionally, the apparatus further includes at least one of the following: an update module, configured to: after the creating module establishes a cache cache entry corresponding to the BIER message according to the forwarding information, in the BIER When the forwarding information of the packet changes, the cache entry is updated; and the deleting module is configured to: after the creating module establishes a cache cache entry corresponding to the BIER packet according to the forwarding information, During the forwarding process of the BIER packet, when the BIER packet does not hit the cache entry within a preset time or a preset number of times, the cache entry is deleted.
可选地，所述更新模块包括：确定单元，设置为在所述报文未命中所述cache表项时，确定所述BIER报文的转发信息发生变化；解析单元，设置为解析所述BIER报文得到所述BIER报文变化后的转发信息；更新单元，设置为根据变化后的转发信息更新所述cache表项。Optionally, the updating module includes: a determining unit, configured to: when the packet misses the cache entry, determine that the forwarding information of the BIER packet changes; the parsing unit is configured to parse the BIER The packet obtains the forwarding information after the BIER packet is changed; the updating unit is configured to update the cache entry according to the changed forwarding information.
根据本公开的又一个实施例，还提供了一种存储介质。该存储介质设置为存储用于执行以下步骤的程序代码：According to still another embodiment of the present disclosure, a storage medium is also provided. The storage medium is arranged to store program code for performing the following steps:
接收位索引显式复制BIER报文；The receiving bit index explicitly copies the BIER message;
解析所述BIER报文得到所述BIER报文的转发信息；Parsing the BIER message to obtain forwarding information of the BIER message;
根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；Establishing a cache cache entry corresponding to the BIER message according to the forwarding information;
根据所述cache表项转发所述BIER报文。Forwarding the BIER packet according to the cache entry.
通过本公开，接收位索引显式复制BIER报文；解析所述BIER报文得到所述BIER报文的转发信息；根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；根据所述cache表项转发所述BIER报文。 通过使用cache表项直接转发BIER报文，解决了BIER报文转发机制性能差的问题，提高了BIER报文的转发效率。Through the disclosure, the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information And forwarding the BIER message according to the cache entry. The BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.
在阅读并理解了附图和详细描述后，可以明白其他方面。Other aspects will be apparent upon reading and understanding the drawings and detailed description.
附图说明DRAWINGS
图1是根据本公开实施例的BIER报文的转发方法的流程图；1 is a flowchart of a method for forwarding a BIER message according to an embodiment of the present disclosure;
图2是根据本公开实施例的BIER报文的转发装置的结构框图；2 is a structural block diagram of a forwarding apparatus of a BIER message according to an embodiment of the present disclosure;
图3是本公开实施例的cache表项结构示意图；3 is a schematic structural diagram of a cache entry in an embodiment of the present disclosure;
图4是本公开实施例的BIER报文转发示意图；4 is a schematic diagram of forwarding BIER packets according to an embodiment of the present disclosure;
图5是本公开实施例的cache表项建立示意图；FIG. 5 is a schematic diagram of establishing a cache entry according to an embodiment of the present disclosure;
图6是本公开实施例的cache表项更新示意图；6 is a schematic diagram of updating a cache entry according to an embodiment of the present disclosure;
图7是本公开实施例的cache表项老化删除示意图；7 is a schematic diagram of aging deletion of a cache entry in an embodiment of the present disclosure;
图8是实施例的网络拓扑图。Figure 8 is a network topology diagram of an embodiment.
具体实施方式detailed description
下文中将参考附图并结合实施例来详细说明本公开。The present disclosure will be described in detail below with reference to the drawings in conjunction with the embodiments.
本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。The terms "first", "second" and the like in the specification and claims of the present disclosure and the above-mentioned figures are used to distinguish similar objects, and are not necessarily used to describe a particular order or order.
示例1Example 1
本公开实施例提供了一种BIER报文的转发方法，图1是根据本公开实施例的BIER报文的转发方法的流程图，如图1所示，该流程包括如下步骤：The embodiment of the present disclosure provides a method for forwarding a BIER message. FIG. 1 is a flowchart of a method for forwarding a BIER message according to an embodiment of the present disclosure. As shown in FIG. 1 , the process includes the following steps:
步骤S102，接收位索引显式复制BIER报文；Step S102, the receiving bit index explicitly copies the BIER message;
步骤S104，解析BIER报文得到BIER报文的转发信息；Step S104, parsing the BIER message to obtain forwarding information of the BIER message;
步骤S106，根据转发信息建立与BIER报文对应的高速缓冲存储器cache表项；Step S106: Establish a cache cache entry corresponding to the BIER message according to the forwarding information.
步骤S108，根据cache表项转发BIER报文。Step S108, forwarding the BIER message according to the cache entry.
通过上述步骤，接收位索引显式复制BIER报文；解析所述BIER报文得到所述BIER报文的转发信息；根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；根据所述cache表项转发所述BIER报文。通过使用cache表项直接转发BIER报文，解决了BIER报文转发机制性能差的问题，提高了BIER报文的转发效率。Through the above steps, the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain the forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information. And forwarding the BIER message according to the cache entry. The BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.
可选地，上述步骤的执行主体可以为组播路由器等，但不限于此。Optionally, the execution body of the foregoing step may be a multicast router or the like, but is not limited thereto.
可选的，根据cache表项转发BIER报文包括：Optionally, forwarding the BIER message according to the cache entry includes:
S11，根据cache表项转发当前的BIER报文；S11. Forward the current BIER packet according to the cache entry.
S12，在BIER报文在下一次转发时，根据命中的cache表项中的转发信息转发BIER报文。S12: When the BIER message is forwarded next time, the BIER message is forwarded according to the forwarding information in the hit cache entry.
可选的，本实施例的转发信息包括：BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。具体的cache表项的关键字可以为{SI,BSL,Entropy,BitString}，或者基于{SI,BSL,Entropy,BitString}计算得到的压缩信息，比如采用HASH算法。Optionally, the forwarding information in this embodiment includes: a next hop node of the BIER packet, and a bit string BitString corresponding to each next hop node. The keywords of the specific cache entry may be {SI, BSL, Entropy, BitString}, or compression information calculated based on {SI, BSL, Entropy, BitString}, such as using the HASH algorithm.
在根据本实施例的可选实施方式中，在根据转发信息建立与BIER报文对应的高速缓冲存储器cache表项之后，方法还包括以下至少之一：In an optional implementation manner of this embodiment, after the cache cache entry corresponding to the BIER packet is established according to the forwarding information, the method further includes at least one of the following:
S13，在BIER报文的转发信息发生变化时，更新cache表项；S13. Update the cache entry when the forwarding information of the BIER packet changes.
S14，在BIER报文的转发过程中，在预设时间内或预设次数内都未命中cache表项时，删除cache表项。S14: During the forwarding process of the BIER packet, the cache entry is deleted when the cache entry is missed within the preset time or the preset number of times.
具体的更新cache表项的过程包括：The specific process of updating the cache entry includes:
S21，在报文未命中cache表项时，确定BIER报文的转发信息发生变化；S21: When the packet misses the cache entry, determining that the forwarding information of the BIER packet changes;
S22，解析BIER报文得到BIER报文变化后的转发信息；S22. Parsing the BIER packet to obtain the forwarding information after the BIER packet is changed.
S23，根据变化后的转发信息更新cache表项。S23. Update the cache entry according to the changed forwarding information.
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是通常使用的实施方式。基于这样的理解，本公开的方案本质上可以以软件产品的形式体现出来，该计算机软件产品存 储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is The commonly used embodiment. Based on this understanding, the solution of the present disclosure may be embodied in the form of a software product stored in a storage medium (such as a ROM/RAM, a magnetic disk, an optical disk), and includes a plurality of instructions for making one The terminal device (which may be a cell phone, computer, server, or network device, etc.) performs the methods described in various embodiments of the present disclosure.
示例2Example 2
本公开实施例还提供了一种BIER报文的转发装置，该装置用于实现上述实施例及示例性实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置通常以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。The embodiment of the present disclosure further provides a forwarding device for a BIER message, which is used to implement the foregoing embodiments and exemplary embodiments, and has not been described again. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the devices described in the following embodiments are typically implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
图2是根据本公开实施例的BIER报文的转发装置的结构框图，如图2所示，该装置包括：FIG. 2 is a structural block diagram of a forwarding apparatus of a BIER message according to an embodiment of the present disclosure. As shown in FIG. 2, the apparatus includes:
接收模块20，设置为接收位索引显式复制BIER报文；The receiving module 20 is configured to receive the bit index to explicitly copy the BIER message;
解析模块22，设置为解析BIER报文得到BIER报文的转发信息；The parsing module 22 is configured to parse the BIER message to obtain forwarding information of the BIER message;
创建模块24，设置为根据转发信息建立与BIER报文对应的高速缓冲存储器cache表项；The creating module 24 is configured to establish a cache cache entry corresponding to the BIER message according to the forwarding information;
转发模块26，设置为根据cache表项转发BIER报文。The forwarding module 26 is configured to forward the BIER message according to the cache entry.
可选的，转发模块包括：第一转发单元，设置为根据cache表项转发当前的BIER报文；第二转发单元，设置为在BIER报文在下一次转发时，根据命中的cache表项中的转发信息转发BIER报文。Optionally, the forwarding module includes: a first forwarding unit configured to forward the current BIER packet according to the cache entry; and a second forwarding unit configured to: when the BIER packet is forwarded next, according to the cache entry in the hit Forward the message to forward the BIER message.
在本实施例中，转发信息包括：BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。In this embodiment, the forwarding information includes: a next hop node of the BIER message, and a bit string BitString corresponding to each next hop node.
可选的，装置还包括以下至少之一：更新模块，设置为在创建模块根据转发信息建立与BIER报文对应的高速缓冲存储器cache表项之后，在BIER报文的转发信息发生变化时，更新cache表项；删除模块，设置为在创建模块根据转发信息建立与BIER报文对应的高速缓冲存储器cache表项之后，在BIER报文的转发过程中，在预设时间内或预设次数内都未命中cache表项时，删除cache表项。Optionally, the device further includes at least one of the following: an update module, configured to: after the creation module establishes a cache cache entry corresponding to the BIER message according to the forwarding information, update the BIER packet when the forwarding information changes The cache entry is deleted. The module is configured to set the cache cache entry corresponding to the BIER packet according to the forwarding information, and the BIER packet is forwarded during the preset time or preset. When the cache entry is missed, the cache entry is deleted.
可选的，更新模块包括：确定单元，设置为在报文未命中cache表项时， 确定BIER报文的转发信息发生变化；解析单元，设置为解析BIER报文得到BIER报文变化后的转发信息；更新单元，设置为根据变化后的转发信息更新cache表项。Optionally, the updating module includes: a determining unit, configured to determine that the forwarding information of the BIER packet changes when the packet misses the cache entry; and the parsing unit is configured to parse the BIER packet to obtain the forwarding of the BIER packet. The information update unit is configured to update the cache entry according to the changed forwarding information.
上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。The above modules may be implemented by software or hardware. For the latter, the foregoing may be implemented by, but not limited to, the above modules are all located in the same processor; or, the above modules are respectively located in different combinations. In the processor.
示例3Example 3
本公开实施例描述了一种基于cache的BIER报文转发方法，可以提升BIER封装报文的转发性能。本实施例所描述的方法不能简单的认为是违背BIER架构避免在中间节点上维护流状态，它并没有在控制平面引入组播协议用于维护具体组播业务流的状态以及下发转发平面，而是转发面将与具体组播业务无关的BIER封装的转发结果进行cache。The embodiment of the present disclosure describes a cache-based BIER packet forwarding method, which can improve the forwarding performance of BIER encapsulated packets. The method described in this embodiment cannot be simply considered to violate the BIER architecture to avoid maintaining the flow state on the intermediate node. It does not introduce a multicast protocol on the control plane to maintain the state of the specific multicast service flow and deliver the forwarding plane. Instead, the forwarding plane caches the forwarding result of the BIER encapsulation that is independent of the specific multicast service.
本实施例采用以下方案：在转发规则中增加cache环节，特定的BIER报文在首次转发时按照draft-ietf-bier-architecture-05定义的常规转发流程，解析出报文将向哪些下一跳转发以及每个下一跳对应的BitString分片；然后建立该特定BIER报文相应的cache表项，表项中包含上述解析得到的转发信息；该特定的BIER报文在下一次转发时，将直接命中cache表项，根据cache表项中给出的下一跳以及每个下一跳对应的BitString分片快速地转发，略过draft-ietf-bier-architecture-05定义的常规转发流程；当BFR-id或者拓扑发生变化时，及时更新cache表项；当某个cache表项长时间没有被命中时，其将根据策略超时老化。In this embodiment, the following scheme is adopted: a cache link is added to the forwarding rule, and the specific BIER packet is forwarded according to the normal forwarding process defined by draft-ietf-bier-architecture-05, and the next hop to which the packet is sent is analyzed. Forwarding and corresponding BitString fragments of each next hop; then establishing a corresponding cache entry of the specific BIER message, the entry containing the parsing information obtained by the parsing; the specific BIER message will be forwarded the next time Directly hit the cache entry, and quickly forward according to the next hop given in the cache entry and the BitString fragment corresponding to each next hop, skipping the regular forwarding process defined by draft-ietf-bier-architecture-05; When a BFR-id or topology changes, the cache entry is updated in time. When a cache entry is not hit for a long time, it will age according to the policy timeout.
本实施例的一种基于cache的BIER报文转发方法包括以下步骤：A cache-based BIER packet forwarding method in this embodiment includes the following steps:
转发平面在转发BIER封装的报文时，首先根据draft-ietf-bier-architecture-05与draft-ietf-bier-mpls-encapsulation-06定义的常规转发流程(以下简称常规转发流程)，解析出报文所属的SD，以及报文的SI、BSL、BitString、Entropy、TTL等信息。若根据常规转发流程，报文需要丢弃(比如因为TTL<1)，则报文丢弃，或需要终结上送控制平面(比如因为TTL＝1)，则报文终结上送，禁止转发；否则如果报文需要继续按照BitString包含的信息转发，则直接根据{SD,SI,BSL,Entropy,BitString}去该 SD对应的cache表中尝试命中某个cache表项。如果命中，则根据命中的cache表项中包含的转发信息直接转发，略过常规转发流程；如果没有命中，则继续按照常规转发流程转发报文，并且向控制平面上报一个“cache未命中{SD,SI,BSL,Entropy,BitString}”的事件。控制平面收到该事件后将在该SD对应的cache表中新建相应的cache表项，cache表项的关键字可以为{SI,BSL,Entropy,BitString}或者基于{SI,BSL,Entropy,BitString}计算得到的压缩信息(比如采用HASH算法)，cache表项的转发信息将根据常规转发流程包含报文要发往的所有下一跳以及每个下一跳对应的BitString分片，特别是下一跳如果为空则表示报文要丢弃。控制平面将新建的cache表项向转发平面下发，转发平面将之放入该SD对应的cache表中。转发平面为每个SD都维护相应的cache表。When forwarding the BIER-encapsulated packet, the forwarding plane first parses the packet according to the conventional forwarding process defined by draft-ietf-bier-architecture-05 and draft-ietf-bier-mpls-encapsulation-06 (hereinafter referred to as the normal forwarding process). The SD to which the text belongs, as well as the SI, BSL, BitString, Entropy, TTL, etc. of the message. If the packet is to be discarded according to the normal forwarding process (for example, because TTL<1), the packet is discarded, or the packet is sent to the control plane (for example, because TTL=1), the packet is terminated and sent, and forwarding is prohibited. Otherwise, The message needs to continue to be forwarded according to the information contained in the BitString. Then, according to {SD, SI, BSL, Entropy, BitString}, the cache table corresponding to the SD is attempted to hit a cache entry. If the packet is hit, it is directly forwarded according to the forwarding information contained in the cached entry. The normal forwarding process is skipped. If there is no hit, the packet is forwarded according to the normal forwarding process, and a cache miss is reported to the control plane. , SI, BSL, Entropy, BitString}" events. After receiving the event, the control plane will create a corresponding cache entry in the cache table corresponding to the SD. The keyword of the cache entry may be {SI, BSL, Entropy, BitString} or based on {SI, BSL, Entropy, BitString. } The calculated compression information (for example, using the HASH algorithm), the forwarding information of the cache entry will include all the next hops to which the message is sent and the BitString fragments corresponding to each next hop according to the normal forwarding process, especially under If one hop is empty, the message is discarded. The control plane sends the newly created cache entry to the forwarding plane, and the forwarding plane puts it into the cache table corresponding to the SD. The forwarding plane maintains the corresponding cache table for each SD.
某些特殊的转发硬件可能直接自己产生cache表项，而不向控制平面上报事件。Some special forwarding hardware may directly generate cache entries by itself without reporting events to the control plane.
根据draft-ietf-bier-architecture-05，控制平面维护了每个下一跳对应的F-BM(Forwarding Bit Mask，转发位掩码)信息，即最短路径转发时每个下一跳可达的所有BFER信息。在感知拓扑变化或者BFR-id发生变化时，将实时更新每个下一跳对应的F-BM信息并向转发平面下发最新的BIFT(Bit Index Forwarding Table，位索引转发表)表。除此之外，本专利还要求当下一跳对应的F-BM发生变化并且旧的F-BM中包含的一些BFER不再包含在新的F-BM中时，甚至下一跳本身不再可用时，则检查有哪些cache表项的转发信息中包含了该下一跳，如果包含了，则这些cache表项的转发信息要根据常规转发流程重新计算，并将更新后的cache表项向转发平面下发更新。注意如果下一跳对应的F-BM虽然发生了变化，但只不过是新的F-BM包含了旧F-BM包含的BFER以及其它更多的BFER，则无需检查cache表项。According to the draft-ietf-bier-architecture-05, the control plane maintains the F-BM (Forwarding Bit Mask) information corresponding to each next hop, that is, the next hop is reachable when the shortest path is forwarded. All BFER information. When the perceptual topology change or the BFR-id changes, the F-BM information corresponding to each next hop is updated in real time and the latest BIFT (Bit Index Forwarding Table) table is delivered to the forwarding plane. In addition, this patent also requires that when the F-BM corresponding to the next hop changes and some of the BFERs included in the old F-BM are no longer included in the new F-BM, even the next hop itself is no longer available. If the cache information of the cache entry is included, the next hop is included in the forwarding information of the cache entry. If the information is included, the forwarding information of the cache entry is recalculated according to the normal forwarding process, and the updated cache entry is forwarded. The plane is updated. Note that if the F-BM corresponding to the next hop changes, but the new F-BM contains the BFER contained in the old F-BM and other more BFERs, there is no need to check the cache entries.
转发平面可以和控制平面一起对那些长期未被命中的cache表项做超时老化，这个可以配置策略，比如超过一个小时未被命中即可删除，以节约cache表的资源。具体可以为，转发平面在每个cache表项中设置一个命中统计计数字段，每次被命中时自增1(若计数发生翻转，则直接翻转为1，不要翻转为0)，并定期(比如每隔一小时)将其拥有的cache表项分批上 次上报给控制平面，上报时只需要包含cache表项的关键字以及其命中统计计数值。控制平面对那些命中统计计数值为0的cache表项执行删除，并向转发平面下发删除；控制平面对那些命中统计计数值不为0的cache表项，将其统计计数值修改为0，然后向转发平面下发更新。The forwarding plane can be timed out with the control plane for those cache entries that have not been hit for a long time. This can be configured with policies, such as deleting more than one hour without being hit, to save resources of the cache table. Specifically, the forwarding plane sets a hit statistics count field in each cache entry, and increments by 1 each time it is hit (if the count is reversed, it directly flips to 1, do not flip to 0), and periodically (such as The cache entries that are owned by the cache table are reported to the control plane in batches. The only keywords that contain the cache entries and their hit statistics are included in the report. The control plane deletes the cache entries whose hit statistics are 0, and sends them to the forwarding plane. The control plane modifies the statistics of the cache entries whose value is not 0. Then send an update to the forwarding plane.
图3是本公开实施例的cache表项结构示意图，如图3所示的cache表项结构示意图，在转发平面，为每个BIER sub-domain维护相应的cache表。如图中描述了sub-domain 0内的具体cache表项，cache表项有两类关键字，一类是原始关键字如{SI,BSL,Entropy,BitString}，一类是基于原始关键字计算得到的压缩关键字如cache id。BIER sub-domain内的BIER报文在尝试命中cache表项时，可以先根据报文相关的{SI,BSL,Entropy,BitString}进行压缩计算，得到相应的cache id，然后去查找该sub-domain对应的cache表。具体压缩算法不在本专利讨论范围内，但是建议不同的{SI,BSL,Entropy,BitString}要能尽量计算得到不同的cache id，否则相同的cache id下将会有多个{SI,BSL,Entropy,BitString}对应的子表项，此时报文要再根据{SI,BSL,Entropy,BitString}去匹配看真正命中哪个cache子表项，比如cache id＝200时包含了多个子表项。cache表项中包含的转发信息给出了相应BIER报文按照常规转发流程欲发往的所有下一跳以及下一跳对应的BitString分片，如cache id＝100的表项中，报文需发往{nexthop1,port1}，该下一跳对应的BitString分片为Sub-BitString_1，也需发往{nexthop2,port2}，该下一跳对应的BitString分片为Sub-BitString_2，等等。相应下一跳对应的BIFT-id字段与draft-ietf-bier-mpls-encapsulation-06定义的BIER Header中的BIFT-id含义相同，即表示该下一跳为相应{SD,SI,BSL}分配的MPLS Label(MPLS网络时)或者全局为相应{SD,SI,BSL}分配的BIFT-id(非MPLS网络时)。当下一跳是非直连邻居时，报文转发时还要迭代外层隧道。3 is a schematic structural diagram of a cache entry in the embodiment of the present disclosure. The schematic diagram of the cache entry shown in FIG. 3 maintains a corresponding cache table for each BIER sub-domain in the forwarding plane. As shown in the figure, the specific cache entries in sub-domain 0 are described. The cache entry has two types of keywords, one is the original keyword such as {SI, BSL, Entropy, BitString}, and the other is based on the original keyword calculation. The resulting compressed keyword is the cache id. When a BIER packet in the BIER sub-domain attempts to hit a cache entry, it can first perform compression calculation according to the {SI, BSL, Entropy, and BitString} related to the packet, obtain the corresponding cache id, and then search for the sub-domain. Corresponding cache table. The specific compression algorithm is not covered by this patent, but it is recommended that different {SI, BSL, Entropy, BitString} should be able to calculate different cache ids as much as possible, otherwise there will be multiple {SI, BSL, Entropy under the same cache id. , BitString} corresponding child table item, at this time the message should be matched according to {SI, BSL, Entropy, BitString} to see which cache child table is actually hit. For example, cache id=200 contains multiple child table entries. The forwarding information contained in the cache entry indicates that all the next hops and the next hops corresponding to the BIER packet are sent according to the normal forwarding process. For example, in the case of cache id=100, the packet needs to be sent. Sended to {nexthop1, port1}, the BitString fragment corresponding to the next hop is Sub-BitString_1, and also needs to be sent to {nexthop2, port2}, the BitString fragment corresponding to the next hop is Sub-BitString_2, and so on. The BIFT-id field corresponding to the corresponding next hop has the same meaning as the BIFT-id in the BIER header defined by the draft-ietf-bier-mpls-encapsulation-06, that is, the next hop is allocated to the corresponding {SD, SI, BSL}. MPLS Label (for MPLS network) or BIFT-id (for non-MPLS network) allocated globally for the corresponding {SD, SI, BSL}. When the next hop is a non-directly connected neighbor, the outer tunnel is iterated when the packet is forwarded.
可选的，本实施方式也可以稍作变动，不将Entropy作为cache关键字之一，而是在cache表项的转发信息中，再根据Entropy取值的不同，维护多组转发信息，报文命中cache后，再根据报文BIER Header中的Entropy从命中的cache表项中获取相应的那套转发信息。Optionally, the embodiment may also be slightly changed. Entropy is not used as one of the cache keywords, but in the forwarding information of the cache entry, and then multiple sets of forwarding information are maintained according to the value of Entropy. After hitting the cache, the corresponding forwarding information is obtained from the hit cache entry according to Entropy in the message BIER Header.
图4是本公开实施例的BIER报文转发示意图，如图4所示的BIER报 文转发示意图，例如：FIG. 4 is a schematic diagram of BIER packet forwarding according to an embodiment of the present disclosure, and FIG. 4 is a schematic diagram of forwarding BIER packets, for example:
步骤S210，转发平面收到BIER封装的报文，这可能是从本节点的控制平面收到的或者从其它节点收到的。Step S210: The forwarding plane receives the BIER encapsulated packet, which may be received from the control plane of the node or received from other nodes.
步骤S220，转发平面先按照常规转发流程解析出具体的BIER封装信息，如SD、SI、BSL、BitString、Entropy、TTL等信息。In step S220, the forwarding plane first parses the specific BIER encapsulation information, such as SD, SI, BSL, BitString, Entropy, TTL, etc. according to the conventional forwarding process.
步骤S230，转发平面继续按照常规转发流程，判断报文TTL是否小于等于1，以确定报文是否要继续转发。Step S230: The forwarding plane continues to determine whether the TTL of the packet is less than or equal to 1 according to the normal forwarding process to determine whether the packet is to be forwarded.
步骤S240，若TTL小于1则报文丢弃，若等于1则报文上送控制平面，都不能继续转发。In step S240, if the TTL is less than 1, the packet is discarded. If the packet is sent to the control plane, the packet cannot be forwarded.
步骤S250，若TTL>1，则表明报文可以继续转发。此时不走常规转发流程，而是根据{SI,BSL,Entropy,BitString}计算压缩后的cache id，根据cache id去该SD对应的cache表中查找是否存在相应的cache表项。In step S250, if the TTL is > 1, the packet can be forwarded. At this time, the conventional forwarding process is not taken, but the compressed cache id is calculated according to {SI, BSL, Entropy, BitString}, and the corresponding cache entry is found in the cache table corresponding to the SD according to the cache id.
步骤S260，若命中cache表项，则报文将直接按照cache表项中给出的转发信息转发，即报文向转发信息中包含的所有下一跳转发，根据给出的下一跳对应的BitString分片以及BIFT-id封装相应的BIER Header，BIER Header中的其它字段赋值与常规转发流程无异，此处不赘述。In step S260, if the cache entry is hit, the packet is directly forwarded according to the forwarding information given in the cache entry, that is, the packet is forwarded to all next hops included in the forwarding information, according to the next hop corresponding to the given packet. The BitString shards and the corresponding BIER Header of the BIFT-id package, the other field assignments in the BIER Header are no different from the regular forwarding process, and are not described here.
步骤S270，若没有命中cache表项，则报文继续按照常规转发流程转发。同时向控制平面上报一个“cache未命中{SD,SI,BSL,Entropy,BitString}”的事件。In step S270, if the cache entry is not hit, the packet continues to be forwarded according to the normal forwarding process. At the same time, an event of "cache miss {SD, SI, BSL, Entropy, BitString}" is reported to the control plane.
图5是本公开实施例的cache表项建立示意图，如图5所示的cache表项建立示意图，例如：FIG. 5 is a schematic diagram of establishing a cache entry according to an embodiment of the present disclosure, and FIG. 5 is a schematic diagram of establishing a cache entry, for example:
步骤S310，控制平面收到转发平面上报的“cache未命中{SD,SI,BSL,Entropy,BitString}”的事件。Step S310, the control plane receives an event of "cache miss {SD, SI, BSL, Entropy, BitString}" reported by the forwarding plane.
步骤S320，控制面查找是否已经存在有相应cache表项。控制面同样根据{SI,BSL,Entropy,BitString}计算压缩后的cache id，根据cache id去该SD对应的cache表中查找是否存在相应的cache表项。In step S320, the control plane searches whether there is already a corresponding cache entry. The control plane also calculates the compressed cache id according to {SI, BSL, Entropy, BitString}, and searches for the corresponding cache entry in the cache table corresponding to the SD according to the cache id.
步骤S330，如果cache表项不存在，则控制平面新建相应的cache表项，其中包含的转发信息是控制平面根据常规转发流程获得的报文欲发往哪些 下一跳以及各下一跳对应的BitString分片和BIFT-id。In step S330, if the cache entry does not exist, the control plane creates a corresponding cache entry, where the forwarding information included is the next hop to which the control plane obtains the packet according to the normal forwarding process, and the next hop corresponding to each subsequent hop. BitString sharding and BIFT-id.
步骤S340，控制平面向转发平面下发新建的cache表项，或者如果cache表项已经存在时向转发平面下发已存在的cache表项。In step S340, the control plane sends a new cache entry to the forwarding plane, or sends an existing cache entry to the forwarding plane if the cache entry already exists.
图6是本公开实施例的cache表项更新示意图，如图6所示的cache表项更新示意图，例如：FIG. 6 is a schematic diagram of a cache entry update according to an embodiment of the present disclosure, and FIG. 6 is a schematic diagram of a cache entry update, for example:
步骤S410，控制平面感知拓扑发生变化或者BFR-id信息发生变化。In step S410, the control plane senses that the topology changes or the BFR-id information changes.
步骤S420，控制平面更新每个下一跳对应的F-BM信息。可能新的F-BM不再包含旧F-BM所包含的BFER，甚至该下一跳本身不再可用，这两种都属于不兼容变化。还有一种变化是兼容变化，即新的F-BM里包含旧F-BM所包含的所有BFER以及其它额外的BFER。Step S420, the control plane updates the F-BM information corresponding to each next hop. It is possible that the new F-BM no longer contains the BFER contained in the old F-BM, and even the next hop itself is no longer available, both of which are incompatible variations. Another variation is the compatibility change, that is, the new F-BM contains all the BFERs included in the old F-BM and other additional BFERs.
步骤S430，对于某个下一跳其对应F-BM发生了不兼容变化时，触发那些转发信息中包含有该下一跳的cache表项重新计算转发信息。In step S430, when an incompatible change occurs in the corresponding F-BM of a certain next hop, the cache entry including the next hop in the forwarding information is triggered to recalculate the forwarding information.
步骤S440，对于重新计算了转发信息的cache表项，将向转发平面下发更新。In step S440, the update is performed on the forwarding plane for the cache entry that recalculates the forwarding information.
图7是本公开实施例的cache表项老化删除示意图，如图7所示的cache表项老化删除示意图，例如：FIG. 7 is a schematic diagram of the aging deletion of a cache entry in the embodiment of the present disclosure, and the aging of the cache entry shown in FIG. 7 is deleted, for example:
步骤S510，转发平面定期(根据策略配置，比如每隔一个小时或每隔一天)将其拥有的所有cache表项上报控制平面。上报时可以只包含cache关键字和命中统计计数字段。In step S510, the forwarding plane periodically reports all the cache entries owned by the forwarding plane to the control plane according to the policy configuration, such as every hour or every other day. You can only include the cache keyword and the hit statistics count field when reporting.
步骤S520，控制平面检查上报的cache表项的命中统计计数值是否为0。In step S520, the control plane checks whether the hit statistics count value of the reported cache entry is 0.
步骤S530，如果命中统计计数值为0，则控制平面删除其维护的相同关键字的cache表项，并向转发平面下发删除。In step S530, if the hit count value is 0, the control plane deletes the cache entry of the same keyword that it maintains, and sends the delete to the forwarding plane.
步骤S540，如果命中统计计数值不为0，则控制平面将相应cache表项的命中统计计数值修改为0后向转发平面下发更新。In step S540, if the hit statistics count value is not 0, the control plane modifies the hit count value of the corresponding cache entry to 0 and sends an update to the forwarding plane.
注意控制平面向转发平面下发新建的cache表项时，其命中统计计数值初始为0。When the control plane sends a new cache entry to the forwarding plane, the hit statistics count value is initially 0.
本实施还包括多个具体示例，用于结合具体的使用场景对本申请进行详 细说明：The present implementation also includes a plurality of specific examples for explaining the present application in detail in conjunction with specific usage scenarios:
具体示例一Specific example one
图8是本公开实施例的网络拓扑图，如图8所示，BIER sub-domain 0内，节点A上要将组播报文发往4个BFER：G、H、J、K，其中至G、H的下一跳为B，至J、K的下一跳为C，则节点A的控制平面将构造BIER封装的报文，BIER Header的关键字段比如如下：8 is a network topology diagram of an embodiment of the present disclosure. As shown in FIG. 8, in the BIER sub-domain 0, a multicast packet is sent to four BFERs: G, H, J, and K, where The next hop of G and H is B, and the next hop of J and K is C. The control plane of node A will construct a BIER-encapsulated message. The key segment of BIER Header is as follows:
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{G,H,J,K}BitString: {G, H, J, K}
该BIER封装的报文由于是首次发送，在转发平面尝试命中cache时失败，所以将被转发平面首次按照常规转发流程分别向下一跳B和下一跳C复制。The BIER-encapsulated packet is sent for the first time and fails when the forwarding plane attempts to hit the cache. Therefore, the forwarding plane is copied to the next hop B and the next hop C for the first time according to the normal forwarding process.
向下一跳B复制的报文的BIER Header的关键字段如下：The key field of the BIER Header of the message copied to the next hop B is as follows:
BIFT-id：label_BBIFT-id:label_B
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{G,H}BitString: {G, H}
向下一跳C复制的报文的BIER Header的关键字段如下：The key field of the BIER Header of the message copied to the next hop C is as follows:
BIFT-id：label_CBIFT-id:label_C
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{J,K}BitString: {J, K}
由于命中cache失败，转发平面同时会向控制平面上报一个“cache未命中{SD＝0,SI＝0,BSL＝64,Entropy＝0,BitString＝{G,H,J,K}}”的事件。控制平面收到后，在SD 0内新建相应的cache表项，比如如下：Due to the failure of the hit cache, the forwarding plane also reports an event of "cache miss {SD=0, SI=0, BSL=64, Entropy=0, BitString={G, H, J, K}}" to the control plane. . After receiving the control plane, create a new cache entry in SD 0, as follows:
cache id：100Cache id: 100
cache key：SI＝0,BSL＝64,Entropy＝0,BitString＝{G,H,J,K}Cache key: SI=0, BSL=64, Entropy=0, BitString={G,H,J,K}
forwarding info：Forwarding info:
nexthop1：nexthop＝B,BIFT-id＝label_B,sub-BitString＝{G,H}Nexthop1:nexthop=B,BIFT-id=label_B,sub-BitString={G,H}
nexthop2：nexthop＝C,BIFT-id＝label_C,sub-BitString＝{J,K}Nexthop2:nexthop=C,BIFT-id=label_C,sub-BitString={J,K}
控制平面将上述cache表项向转发平面下发，后续同样的组播报文将直接在转发平面命中cache表项被快速地转发。The control plane sends the cache entry to the forwarding plane. The subsequent multicast packets are forwarded directly on the forwarding plane.
具体示例二Concrete example two
本示例是在具体示例一的基础上，描述拓扑发生变化时，cache表项如何更新。如图8所示，当链路B-D发生故障时，A节点上至G、H的下一跳将从B改为C，即故障发生前，下一跳B的F-BM为{G,H,I}，C的F-BM为{I,J,K}，而故障发生后，下一跳B的F-BM为空，C的F-BM为{G,H,I,J,K}，则下一跳B的F-BM发生了不兼容变化，下一跳C的F-BM发生了兼容变化。This example is based on the specific example 1, and describes how the cache table entries are updated when the topology changes. As shown in Figure 8, when the link BD fails, the next hop from the A node to G and H will change from B to C, that is, before the fault occurs, the F-BM of the next hop B is {G, H. , I}, C's F-BM is {I, J, K}, and after the fault occurs, the F-BM of the next hop B is empty, and the F-BM of C is {G, H, I, J, K }, the F-BM of the next hop B has an incompatible change, and the F-BM of the next hop C has undergone a compatible change.
针对下一跳B的F-BM发生的不兼容变化，控制平面检查发现cache id＝100的表项中包含有下一跳B，则触发该表项重新计算转发信息，更新为：For the incompatible change of the F-BM of the next hop B, the control plane checks that the entry with the cache id=100 contains the next hop B, and then triggers the entry to recalculate the forwarding information, and the update is:
cache id：100Cache id: 100
cache key：SI＝0,BSL＝64,Entropy＝0,BitString＝{G,H,J,K}Cache key: SI=0, BSL=64, Entropy=0, BitString={G,H,J,K}
forwarding info：Forwarding info:
nexthop1：nexthop＝C,BIFT-id＝label_C,sub-BitString＝{G,H,J,K}Nexthop1:nexthop=C,BIFT-id=label_C,sub-BitString={G,H,J,K}
控制平面将上述更新的cache表项重新下发至转发平面。The control plane re-delivers the updated cache entry to the forwarding plane.
具体示例三Specific example three
本示例是在具体示例一的基础上，描述负载均衡的转发效果。如图8所示，BFER I节点也加入到接收组播流的队伍中，A节点上至目的节点I存在两个下一跳B、C形成负载分担，A可以通过设置报文BIER Header中的Entropy值来控制报文走B或者C到达目的节点I。比如Entropy值为0时，报文走B，Entropy值为1时，报文走C。This example describes the forwarding effect of load balancing based on the specific example 1. As shown in Figure 8, the BFER I node is also added to the queue that receives the multicast stream. There are two next hops B and C on the node A to the destination node I to form load sharing. A can set the packet in the BIER Header. The Entropy value controls the message to go to B or C to reach destination node I. For example, when the Entropy value is 0, the message goes B, and when the Entropy value is 1, the message goes C.
与具体示例一类似，控制平面可以构造如下BIER封装的报文，BIER Header的关键字段如下：Similar to the specific example 1, the control plane can construct a BIER-encapsulated message. The key fields of the BIER Header are as follows:
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{G,H,I,J,K}BitString: {G, H, I, J, K}
以及构造如下BIER封装的报文，BIER Header的关键字段如下：And construct the BIER-encapsulated message, the key field of BIER Header is as follows:
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：1Entropy: 1
BFIR-id：ABFIR-id: A
BitString：{G,H,I,J,K}BitString: {G, H, I, J, K}
这两份报文的BIER Header的区别是Entropy不相同。The difference between the BIER Headers of the two messages is that Entropy is different.
对于第一份报文，转发面首次转发它时将按照常规转发流程将其转发，例如，向下一跳B复制的报文的BIER Header的关键字段如下：For the first packet, the forwarding plane will forward it according to the normal forwarding process when forwarding it for the first time. For example, the key segment of the BIER Header of the packet copied to the next hop B is as follows:
BIFT-id：label_BBIFT-id:label_B
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{G,H,I}BitString: {G, H, I}
向下一跳C复制的报文的BIER Header的关键字段如下：The key field of the BIER Header of the message copied to the next hop C is as follows:
BIFT-id：label_CBIFT-id:label_C
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：0Entropy: 0
BFIR-id：ABFIR-id: A
BitString：{J,K}BitString: {J, K}
并上报控制平面相应的cache未命中事件，使得控制平面新建相应的cache表项，如下：And report the corresponding cache miss event on the control plane, so that the control plane creates a corresponding cache entry, as follows:
cache id：200Cache id: 200
cache key：SI＝0,BSL＝64,Entropy＝0,BitString＝{G,H,I,J,K}Cache key: SI=0, BSL=64, Entropy=0, BitString={G,H,I,J,K}
forwarding info：Forwarding info:
nexthop1：nexthop＝B,BIFT-id＝label_B,sub-BitString＝{G,H,I}Nexthop1:nexthop=B,BIFT-id=label_B,sub-BitString={G,H,I}
nexthop2：nexthop＝C,BIFT-id＝label_C,sub-BitString＝{J,K}Nexthop2:nexthop=C,BIFT-id=label_C,sub-BitString={J,K}
控制平面将上述cache表项向转发平面下发，后续同样的组播报文将直接在转发平面命中cache表项被快速地转发。The control plane sends the cache entry to the forwarding plane. The subsequent multicast packets are forwarded directly on the forwarding plane.
同理，对于第二份报文，转发面首次转发它时将按照常规转发流程将其转发，例如，向下一跳B复制的报文的BIER Header的关键字段如下：Similarly, for the second packet, the forwarding plane will forward it according to the normal forwarding process when forwarding it for the first time. For example, the key segment of the BIER Header of the packet copied to the next hop B is as follows:
BIFT-id：label_BBIFT-id:label_B
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：1Entropy: 1
BFIR-id：ABFIR-id: A
BitString：{G,H}BitString: {G, H}
向下一跳C复制的报文的BIER Header的关键字段如下：The key field of the BIER Header of the message copied to the next hop C is as follows:
BIFT-id：label_CBIFT-id:label_C
TTL：255TTL: 255
BSL：64BSL: 64
Entropy：1Entropy: 1
BFIR-id：ABFIR-id: A
BitString：{I,J,K}BitString: {I, J, K}
并上报控制平面相应的cache未命中事件，使得控制平面新建相应的cache表项，如下：And report the corresponding cache miss event on the control plane, so that the control plane creates a corresponding cache entry, as follows:
cache id：300Cache id: 300
cache key：SI＝0,BSL＝64,Entropy＝1,BitString＝{G,H,I,J,K}Cache key: SI=0, BSL=64, Entropy=1, BitString={G,H,I,J,K}
forwarding info：Forwarding info:
nexthop1：nexthop＝B,BIFT-id＝label_B,sub-BitString＝{G,H}Nexthop1:nexthop=B,BIFT-id=label_B,sub-BitString={G,H}
nexthop2：nexthop＝C,BIFT-id＝label_C,sub-BitString＝{I,J,K}Nexthop2:nexthop=C,BIFT-id=label_C,sub-BitString={I,J,K}
控制平面将上述cache表项向转发平面下发，后续同样的组播报文将直接在转发平面命中cache表项被快速地转发。The control plane sends the cache entry to the forwarding plane. The subsequent multicast packets are forwarded directly on the forwarding plane.
通过本公开实施例的方案，提供一种提升BIER报文转发性能的方法，解决了BIER报文转发机制性能很差的问题。Through the solution of the embodiment of the present disclosure, a method for improving BIER packet forwarding performance is provided, and the problem that the BIER packet forwarding mechanism performance is poor is solved.
示例4Example 4
本公开的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：Embodiments of the present disclosure also provide a storage medium. Optionally, in the embodiment, the foregoing storage medium may be configured to store program code for performing the following steps:
S1，接收位索引显式复制BIER报文；S1, the receiving bit index explicitly copies the BIER message;
S2，解析所述BIER报文得到所述BIER报文的转发信息；S2. Parsing the BIER packet to obtain forwarding information of the BIER packet.
S3，根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；S3. Establish a cache cache entry corresponding to the BIER packet according to the forwarding information.
S4，根据所述cache表项转发所述BIER报文。S4. Forward the BIER packet according to the cache entry.
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读 存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。Optionally, in this embodiment, the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory. A variety of media that can store program code, such as a disc or a disc.
可选地，在本实施例中，处理器根据存储介质中已存储的程序代码执行接收位索引显式复制BIER报文；Optionally, in this embodiment, the processor performs a receiving bit index to explicitly copy the BIER message according to the stored program code in the storage medium;
可选地，在本实施例中，处理器根据存储介质中已存储的程序代码执行解析所述BIER报文得到所述BIER报文的转发信息；Optionally, in this embodiment, the processor performs the parsing of the BIER packet according to the stored program code in the storage medium to obtain forwarding information of the BIER packet.
可选地，在本实施例中，处理器根据存储介质中已存储的程序代码执行根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；Optionally, in this embodiment, the processor performs, according to the stored program code in the storage medium, a cache cache entry corresponding to the BIER packet according to the forwarding information.
可选地，在本实施例中，处理器根据存储介质中已存储的程序代码执行根据所述cache表项转发所述BIER报文。Optionally, in this embodiment, the processor performs forwarding the BIER packet according to the cache entry according to the stored program code in the storage medium.
可选地，本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。For example, the specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the optional embodiments, and details are not described herein again.
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、***、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些组件或所有组件可以被实施为由处理器，如数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介 质。Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and functional blocks/units of the methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be composed of several physical The components work together. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer readable medium, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridge, magnetic tape, magnetic disk storage or other magnetic storage device, or may Any other medium used to store the desired information and that can be accessed by the computer. Moreover, it is well known to those skilled in the art that communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .
以上所述仅为本公开的示例性实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。The above description is only exemplary embodiments of the present disclosure, and is not intended to limit the disclosure, and various changes and modifications may be made to the present disclosure. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and scope of the present disclosure are intended to be included within the scope of the present disclosure.
工业实用性Industrial applicability
通过本公开，接收位索引显式复制BIER报文；解析所述BIER报文得到所述BIER报文的转发信息；根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；根据所述cache表项转发所述BIER报文。通过使用cache表项直接转发BIER报文，解决了BIER报文转发机制性能差的问题，提高了BIER报文的转发效率。Through the disclosure, the receiving bit index explicitly copies the BIER message; parsing the BIER message to obtain forwarding information of the BIER message; and establishing a cache cache entry corresponding to the BIER message according to the forwarding information And forwarding the BIER message according to the cache entry. The BIER packet is directly forwarded by using the cache entry, which solves the problem of poor performance of the BIER packet forwarding mechanism and improves the forwarding efficiency of the BIER packet.

Claims (11)

  1. 一种BIER报文的转发方法，包括：A method for forwarding BIER packets includes:
    接收位索引显式复制BIER报文(S102)；The receiving bit index explicitly copies the BIER message (S102);
    解析所述BIER报文得到所述BIER报文的转发信息(S104)；Parsing the BIER message to obtain forwarding information of the BIER message (S104);
    根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项(S106)；Establishing a cache cache entry corresponding to the BIER message according to the forwarding information (S106);
    根据所述cache表项转发所述BIER报文(S108)。And forwarding the BIER message according to the cache entry (S108).
  2. 根据权利要求1所述的方法，其中，根据所述cache表项转发所述BIER报文(S108)包括：The method of claim 1, wherein forwarding the BIER message according to the cache entry (S108) comprises:
    根据所述cache表项转发当前的所述BIER报文；Forwarding the current BIER packet according to the cache entry;
    在所述BIER报文在下一次转发时，根据命中的所述cache表项中的转发信息转发所述BIER报文。When the BIER packet is forwarded, the BIER packet is forwarded according to the forwarding information in the cache entry that is hit.
  3. 根据权利要求1所述的方法，其中，所述转发信息包括：所述BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。The method of claim 1, wherein the forwarding information comprises: a next hop node of the BIER message, and a bit string BitString fragment corresponding to each next hop node.
  4. 根据权利要求1所述的方法，其中，在根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项(S106)之后，所述方法还包括以下至少之一：The method according to claim 1, wherein after establishing a cache cache entry corresponding to the BIER message according to the forwarding information (S106), the method further comprises at least one of the following:
    在所述BIER报文的转发信息发生变化时，更新所述cache表项；Updating the cache entry when the forwarding information of the BIER packet changes;
    在所述BIER报文的转发过程中，当所述BIER报文在预设时间内或预设次数内都未命中所述cache表项时，删除所述cache表项。During the forwarding of the BIER packet, when the BIER packet does not hit the cache entry within a preset time or a preset number of times, the cache entry is deleted.
  5. 根据权利要求4所述的方法，其中，在所述BIER报文的转发信息发生变化时，更新所述cache表项，包括：The method of claim 4, wherein when the forwarding information of the BIER packet changes, the cache entry is updated, including:
    在所述报文未命中所述cache表项时，确定所述BIER报文的转发信息发生变化；When the packet is missing the cache entry, determining that the forwarding information of the BIER packet changes;
    解析所述BIER报文得到所述BIER报文变化后的转发信息；Parsing the BIER message to obtain forwarding information after the BIER message is changed;
    根据变化后的转发信息更新所述cache表项。Updating the cache entry according to the changed forwarding information.
  6. 一种BIER报文的转发装置，包括：A forwarding device for a BIER message, comprising:
    接收模块(20)，设置为接收位索引显式复制BIER报文；The receiving module (20) is configured to receive the bit index to explicitly copy the BIER message;
    解析模块(22)，设置为解析所述BIER报文得到所述BIER报文的转发信息；The parsing module (22) is configured to parse the BIER message to obtain forwarding information of the BIER message;
    创建模块(24)，设置为根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项；a creating module (24), configured to establish a cache cache entry corresponding to the BIER message according to the forwarding information;
    转发模块(26)，设置为根据所述cache表项转发所述BIER报文。The forwarding module (26) is configured to forward the BIER packet according to the cache entry.
  7. 根据权利要求6所述的装置，其中，所述转发模块(26)包括：The apparatus of claim 6 wherein said forwarding module (26) comprises:
    第一转发单元，设置为根据所述cache表项转发当前的所述BIER报文；The first forwarding unit is configured to forward the current BIER packet according to the cache entry;
    第二转发单元，设置为在所述BIER报文在下一次转发时，根据命中的所述cache表项中的转发信息转发所述BIER报文。The second forwarding unit is configured to forward the BIER message according to the forwarding information in the cache entry that is hit when the BIER message is forwarded.
  8. 根据权利要求6所述的装置，其中，所述转发信息包括：所述BIER报文的下一跳节点，每个下一跳节点对应的位串BitString分片。The apparatus according to claim 6, wherein the forwarding information comprises: a next hop node of the BIER message, and a bit string BitString fragment corresponding to each next hop node.
  9. 根据权利要求6所述的装置，其中，所述装置还包括以下至少之一：The apparatus of claim 6 wherein said apparatus further comprises at least one of the following:
    更新模块，设置为在所述创建模块(24)根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项之后，在所述BIER报文的转发信息发生变化时，更新所述cache表项；An update module, configured to: after the creation module (24) establishes a cache cache entry corresponding to the BIER message according to the forwarding information, when the forwarding information of the BIER packet changes, update the location The cache entry;
    删除模块，设置为在所述创建模块(24)根据所述转发信息建立与所述BIER报文对应的高速缓冲存储器cache表项之后，在所述BIER报文的转发过程中，当所述BIER报文在预设时间内或预设次数内都未命中所述cache表项时，删除所述cache表项。Deleting a module, after the creating module (24) establishes a cache cache entry corresponding to the BIER packet according to the forwarding information, in the forwarding process of the BIER packet, when the BIER The cache entry is deleted when the packet does not hit the cache entry within the preset time or the preset number of times.
  10. 根据权利要求9所述的装置，其中，所述更新模块包括：The apparatus of claim 9, wherein the update module comprises:
    确定单元，设置为在所述报文未命中所述cache表项时，确定所述BIER报文的转发信息发生变化；a determining unit, configured to: when the packet misses the cache entry, determine that the forwarding information of the BIER packet changes;
    解析单元，设置为解析所述BIER报文得到所述BIER报文变化后的转发信息；The parsing unit is configured to parse the BIER packet to obtain forwarding information after the BIER packet is changed;
    更新单元，设置为根据变化后的转发信息更新所述cache表项。And an update unit, configured to update the cache entry according to the changed forwarding information.
  11. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现权利要求1-5中任一项所述的方法。A computer readable storage medium storing computer executable instructions that, when executed by a processor, implement the method of any of claims 1-5.
PCT/CN2018/080637 2017-04-05 2018-03-27 Bier message forwarding method and device WO2018184487A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710218992.9A CN108696438A (en) 2017-04-05 2017-04-05 The retransmission method and device of BIER messages
CN201710218992.9 2017-04-05

Publications (1)

Publication Number Publication Date
WO2018184487A1 true WO2018184487A1 (en) 2018-10-11

Family

ID=63712332

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/080637 WO2018184487A1 (en) 2017-04-05 2018-03-27 Bier message forwarding method and device

Country Status (2)

Country Link
CN (1) CN108696438A (en)
WO (1) WO2018184487A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021121065A1 (en) * 2019-12-20 2021-06-24 中兴通讯股份有限公司 Bier packet forwarding method, device, apparatus, and storage medium
EP3979576A4 (en) * 2019-07-05 2022-08-10 Huawei Technologies Co., Ltd. Packet forwarding method, device, and computer-readable storage medium
CN115314436A (en) * 2022-07-11 2022-11-08 烽火通信科技股份有限公司 BIER message forwarding method and device
CN115460133A (en) * 2022-08-12 2022-12-09 武汉烽火技术服务有限公司 Hardware learning and forwarding method, device and equipment for BIER multicast
WO2022257798A1 (en) * 2021-06-10 2022-12-15 中兴通讯股份有限公司 Forwarding method, forwarding system, electronic device and computer-readable storage medium

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112995091B (en) * 2019-12-02 2023-06-23 中兴通讯股份有限公司 Data compression method, device, network equipment and storage medium
CN112511444A (en) * 2020-04-03 2021-03-16 中兴通讯股份有限公司 Multicast traffic transmission method, device, communication node and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (en) * 2014-01-24 2015-07-29 思科技术公司 Equal Cost Multi-path With Bit Indexed Explicit Replication
US20160119159A1 (en) * 2014-10-24 2016-04-28 Futurewei Technologies, Inc. Bit Index Explicit Replication Forwarding Using Replication Cache
US20160127142A1 (en) * 2014-11-04 2016-05-05 Telefonaktiebolaget L M Ericsson (Publ) Explicit block encoding of multicast group membership information with bit index explicit replication (bier)
CN105933228A (en) * 2015-02-26 2016-09-07 思科技术公司 Traffic engineering for bit indexed explicit replication
CN106330718A (en) * 2016-08-23 2017-01-11 杭州华三通信技术有限公司 Multicast message forwarding method and device

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9942053B2 (en) * 2013-09-17 2018-04-10 Cisco Technology, Inc. Bit indexed explicit replication using internet protocol version 6
US9705784B2 (en) * 2014-12-31 2017-07-11 Juniper Networks, Inc. Bit index explicit replication (BIER)forwarding for network device components
CN106341327A (en) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 BIER (Bit Indexed Explicit Replication) message transmission method and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (en) * 2014-01-24 2015-07-29 思科技术公司 Equal Cost Multi-path With Bit Indexed Explicit Replication
US20160119159A1 (en) * 2014-10-24 2016-04-28 Futurewei Technologies, Inc. Bit Index Explicit Replication Forwarding Using Replication Cache
US20160127142A1 (en) * 2014-11-04 2016-05-05 Telefonaktiebolaget L M Ericsson (Publ) Explicit block encoding of multicast group membership information with bit index explicit replication (bier)
CN105933228A (en) * 2015-02-26 2016-09-07 思科技术公司 Traffic engineering for bit indexed explicit replication
CN106330718A (en) * 2016-08-23 2017-01-11 杭州华三通信技术有限公司 Multicast message forwarding method and device

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3979576A4 (en) * 2019-07-05 2022-08-10 Huawei Technologies Co., Ltd. Packet forwarding method, device, and computer-readable storage medium
WO2021121065A1 (en) * 2019-12-20 2021-06-24 中兴通讯股份有限公司 Bier packet forwarding method, device, apparatus, and storage medium
WO2022257798A1 (en) * 2021-06-10 2022-12-15 中兴通讯股份有限公司 Forwarding method, forwarding system, electronic device and computer-readable storage medium
CN115314436A (en) * 2022-07-11 2022-11-08 烽火通信科技股份有限公司 BIER message forwarding method and device
CN115314436B (en) * 2022-07-11 2023-05-23 烽火通信科技股份有限公司 BIER message forwarding method and device
CN115460133A (en) * 2022-08-12 2022-12-09 武汉烽火技术服务有限公司 Hardware learning and forwarding method, device and equipment for BIER multicast
CN115460133B (en) * 2022-08-12 2023-11-03 烽火通信科技股份有限公司 Method, device and equipment for hardware learning and forwarding of BIER multicast

Also Published As

Publication number Publication date
CN108696438A (en) 2018-10-23

Similar Documents

Publication Publication Date Title
WO2018184487A1 (en) Bier message forwarding method and device
US11082342B2 (en) System and method to facilitate content forwarding using Bit Index Explicit Replication (BIER) in an Information-Centric Networking (ICN) environment
US8897134B2 (en) Notifying a controller of a change to a packet forwarding configuration of a network element over a communication channel
US9461907B2 (en) Data routing
WO2018032961A1 (en) Information management method, apparatus and system
US9736058B2 (en) Multi-region source routed multicast using sub-tree identifiers
US9973400B2 (en) Network flow information collection method and apparatus
WO2018032962A1 (en) Method, device and system for information synchronization
US10791051B2 (en) System and method to bypass the forwarding information base (FIB) for interest packet forwarding in an information-centric networking (ICN) environment
WO2017190559A1 (en) Routing searching method, device, allocation node, searching node, and ingress node
US10979340B2 (en) Link state addition and deletion based on reception of a single message in link state vector routing
US10153988B2 (en) Load balancing on multi-chip network switch without full bi-section bandwidth
US7099323B1 (en) Method, apparatus and system for management of multicast routes for a plurality of routing protocols in a network device
US11349757B2 (en) ICN packet forwarding method
US9628368B2 (en) Method and apparatus for compressing content name
KR20070005907A (en) Nested components for network protocols
WO2011150835A1 (en) Method for requesting to obtain route information and corresponding route device thereof
WO2022257798A1 (en) Forwarding method, forwarding system, electronic device and computer-readable storage medium
US20240163208A1 (en) Packet processing method and apparatus, and storage medium and electronic apparatus
JP2007096912A (en) Network repeater
Rogge Rules For Designing Protocols Using the RFC5444 Generalized Packet/Message Format draft-ietf-manet-rfc5444-usage-00

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18781168

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18781168

Country of ref document: EP

Kind code of ref document: A1