[go: up one dir, main page]

WO2018184487A1 - Procédé et dispositif de transfert de message bier - Google Patents

Procédé et dispositif de transfert de message bier 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
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2018/080637
Other languages
English (en)
Chinese (zh)
Inventor
彭少富
金飞蔡
徐本崇
韩杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Publication of WO2018184487A1 publication Critical patent/WO2018184487A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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

L'invention concerne un procédé et un dispositif de transfert de message BIER, ledit procédé consistant : à recevoir un message de réplication explicite d'indice de bit (BIER) ; à analyser le message BIER afin d'obtenir des informations de transfert du message BIER ; en fonction des informations de transfert, à établir une entrée de table de dispositif de stockage de mémoire cache à grande vitesse correspondant au message BIER ; à transférer le message BIER en fonction de l'entrée de table de mémoire cache.
PCT/CN2018/080637 2017-04-05 2018-03-27 Procédé et dispositif de transfert de message bier Ceased WO2018184487A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710218992.9 2017-04-05
CN201710218992.9A CN108696438A (zh) 2017-04-05 2017-04-05 Bier报文的转发方法及装置

Publications (1)

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

Family

ID=63712332

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/080637 Ceased WO2018184487A1 (fr) 2017-04-05 2018-03-27 Procédé et dispositif de transfert de message bier

Country Status (2)

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

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021121065A1 (fr) * 2019-12-20 2021-06-24 中兴通讯股份有限公司 Procédé de transfert de paquets bier, dispositif, appareil, et support de stockage
EP3979576A4 (fr) * 2019-07-05 2022-08-10 Huawei Technologies Co., Ltd. Procédé de transfert de paquet, dispositif, et support de stockage lisible par ordinateur
CN115314436A (zh) * 2022-07-11 2022-11-08 烽火通信科技股份有限公司 一种bier报文转发方法及装置
CN115460133A (zh) * 2022-08-12 2022-12-09 武汉烽火技术服务有限公司 一种bier组播的硬件学习及转发的方法、装置及设备
WO2022257798A1 (fr) * 2021-06-10 2022-12-15 中兴通讯股份有限公司 Procédé d'acheminement, système d'acheminement, dispositif électronique et support de stockage lisible par ordinateur

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112995091B (zh) * 2019-12-02 2023-06-23 中兴通讯股份有限公司 数据压缩方法、装置、网络设备及存储介质
CN112511444B (zh) 2020-04-03 2024-06-04 中兴通讯股份有限公司 一种组播流量传输方法、装置、通信节点及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径
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 (zh) * 2015-02-26 2016-09-07 思科技术公司 用于位索引显式复制的流量工程
CN106330718A (zh) * 2016-08-23 2017-01-11 杭州华三通信技术有限公司 组播报文转发方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3047604B1 (fr) * 2013-09-17 2021-03-24 Cisco Technology, Inc. Répétition explicite indexée de bit
US9705784B2 (en) * 2014-12-31 2017-07-11 Juniper Networks, Inc. Bit index explicit replication (BIER)forwarding for network device components
CN106341327A (zh) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 一种bier报文的传输方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径
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 (zh) * 2015-02-26 2016-09-07 思科技术公司 用于位索引显式复制的流量工程
CN106330718A (zh) * 2016-08-23 2017-01-11 杭州华三通信技术有限公司 组播报文转发方法及装置

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3979576A4 (fr) * 2019-07-05 2022-08-10 Huawei Technologies Co., Ltd. Procédé de transfert de paquet, dispositif, et support de stockage lisible par ordinateur
WO2021121065A1 (fr) * 2019-12-20 2021-06-24 中兴通讯股份有限公司 Procédé de transfert de paquets bier, dispositif, appareil, et support de stockage
US12192092B2 (en) 2019-12-20 2025-01-07 Zte Corporation BIER packet forwarding method, device, apparatus, and storage medium
WO2022257798A1 (fr) * 2021-06-10 2022-12-15 中兴通讯股份有限公司 Procédé d'acheminement, système d'acheminement, dispositif électronique et support de stockage lisible par ordinateur
US12395423B2 (en) 2021-06-10 2025-08-19 Zte Corporation Forwarding method for detecting a preset packet indicator by a bit-forwarding intermediate router
CN115314436A (zh) * 2022-07-11 2022-11-08 烽火通信科技股份有限公司 一种bier报文转发方法及装置
CN115314436B (zh) * 2022-07-11 2023-05-23 烽火通信科技股份有限公司 一种bier报文转发方法及装置
CN115460133A (zh) * 2022-08-12 2022-12-09 武汉烽火技术服务有限公司 一种bier组播的硬件学习及转发的方法、装置及设备
CN115460133B (zh) * 2022-08-12 2023-11-03 烽火通信科技股份有限公司 一种bier组播的硬件学习及转发的方法、装置及设备

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2018184487A1 (fr) Procédé et dispositif de transfert de message bier
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
CN110401599B (zh) 数据包的处理方法及装置、存储介质、电子装置
US9973400B2 (en) Network flow information collection method and apparatus
CN106059924B (zh) 一种管理信息的方法，装置及系统
CN104115472B (zh) 用于内容导向网络中可扩展路由的方法
US9736058B2 (en) Multi-region source routed multicast using sub-tree identifiers
CN107770073B (zh) 一种信息同步的方法，装置及系统
US10791051B2 (en) System and method to bypass the forwarding information base (FIB) for interest packet forwarding in an information-centric networking (ICN) environment
EP3442178B1 (fr) Procédé de recherche de routage et dispositif
US20180048591A1 (en) Load balancing on multi-chip network switch without full bi-section bandwidth
US20120147888A1 (en) Managing stale route removal in a routing information base of a network element
US11349757B2 (en) ICN packet forwarding method
US9628368B2 (en) Method and apparatus for compressing content name
KR20070005907A (ko) 네트워크 프로토콜을 위한 내포 컴포넌트
WO2011150835A1 (fr) Procédé de demande d'obtention d'informations de route et dispositif de route correspondant
CN115865844A (zh) 基于sdn与ndn的虚实结合动态流量调度方法及装置
CN104243224A (zh) 路由环路的检测方法和装置
WO2022257798A1 (fr) Procédé d'acheminement, système d'acheminement, dispositif électronique et support de stockage lisible par ordinateur
WO2025051150A1 (fr) Procédé et appareil de génération de topologie vpn, et dispositif et support de stockage
CN118301070A (zh) 一种高效跨层消息转发电路及控制方法
CN115604186A (zh) 路由方法及相关设备
CN119155236A (zh) 消息的通告方法、装置、存储介质及电子装置

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