[go: up one dir, main page]

WO2013029478A1 - Procédé, dispositif et système de transmission d'informations de nœud feuille - Google Patents

Procédé, dispositif et système de transmission d'informations de nœud feuille Download PDF

Info

Publication number
WO2013029478A1
WO2013029478A1 PCT/CN2012/080401 CN2012080401W WO2013029478A1 WO 2013029478 A1 WO2013029478 A1 WO 2013029478A1 CN 2012080401 W CN2012080401 W CN 2012080401W WO 2013029478 A1 WO2013029478 A1 WO 2013029478A1
Authority
WO
WIPO (PCT)
Prior art keywords
leaf node
message
node
information
protocol
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/CN2012/080401
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of WO2013029478A1 publication Critical patent/WO2013029478A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1881—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with schedule organisation, e.g. priority, sequence management

Definitions

  • the present invention relates to the field of network communications, and in particular, to a method, device and system for transmitting leaf node information. Background technique
  • MPLS Multi-Protocol Label Switching
  • mLDP Multicast Label Distribution Protocol
  • An aspect of the present invention provides a method for transmitting leaf node information, the method being applied to a multicast label distribution protocol mLDP network, including:
  • An aspect of the present invention provides an apparatus for transmitting leaf node information, where the apparatus is applied to a multicast label distribution protocol mLDP network, including:
  • a generating unit configured to generate a protocol message, where the protocol message includes leaf node information of the mLDP network;
  • a sending unit configured to send the protocol message to an upstream node in the mLDP network, so that the leaf node information is hop by hop to a root node in the mLDP network.
  • An aspect of the present invention provides a system for transmitting leaf node information, the system being applied to a multicast label distribution protocol mLDP network, including:
  • a root node configured to send a request message for collecting the leaf node information to the downstream node, so that the request message for collecting the leaf node information is sent to the leaf node by the intermediate nodes hop by hop;
  • the leaf node is configured to: after receiving the request message from the root node, generate a protocol message including the leaf node information, and send the protocol message to an upstream node of the leaf node, so that the The information of the leaf node is passed to the root node hop by hop by each intermediate node.
  • the LDP protocol packet or other protocol packet is extended to transmit the leaf node information, which belongs to the In-band (in-band) transmission, and the additional neighbors may not be maintained between the root node and the leaf node. Relationships, save network resources, and enhance the ease of use of multicast networks.
  • FIG. 1 is a flowchart of a method for transmitting leaf node information according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a mLDP network according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of another method for transmitting leaf node information according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of still another method for transmitting leaf node information according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of an apparatus for transmitting leaf node information according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a system for transmitting leaf node information according to an embodiment of the present invention. detailed description
  • FIG. 1 is a flowchart of a method for transmitting leaf node information according to an embodiment of the present invention. Referring to FIG. 1, the method is applied to an mLDP network, and may include :
  • Protocol message includes leaf node information of the mLDP network.
  • the leaf node information may be carried in a Leaf Node Address List TIN (Type-Length-Value) of the generated protocol message, where the leaf node address is used to identify a specific leaf node.
  • the protocol message may be an LDP Label Mapping message, and the leaf node information is a current leaf node list.
  • the protocol message may be an LDP Label Withdraw message
  • the leaf node information is a deleted leaf node list.
  • the protocol message may be an LDP Notification message or a multicast ping message
  • the leaf node information is a current leaf node list.
  • the protocol message is sent to the root node; otherwise, the protocol message is sent to the upstream node, and the leaf node information is further hop-by-hop to the mLDP network. Root node.
  • the method may further include:
  • the request message may be an extended LDP Label Request message or an LDP Notification message or a multicast ping message or other protocol message.
  • the execution body of each step described above may be an intermediate node or a leaf node.
  • the following is a detailed description of a method for transmitting leaf node information according to an embodiment of the present invention.
  • a scenario in which a leaf node is added and a protocol message is an LDP Label Mapping message is taken as an example.
  • 2 is a schematic diagram of an mLDP network according to an embodiment of the present invention.
  • the three leaf nodes have a common upstream node, that is, The intermediate node 24 is connected to the root node 25.
  • FIG. 3 is a flowchart of another method for transmitting leaf node information according to an embodiment of the present invention. Referring to FIG. 2 and FIG. 3, the method may include:
  • the leaf node 21 generates a first LDP Label Mapping message, and sends the first LDP Label Mapping message to the intermediate node 24.
  • the first LDP Label Mapping message includes information about the leaf node 21, that is, the current leaf node list.
  • the information of the leaf node 21 can be carried in the Leaf Node Address List TLV.
  • the format of the generated first LDP Label Mapping message is as follows: 1 2 3 4 5 6 7 B 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
  • Leaf Addr . List (TBD) 1 Length
  • the intermediate node 24 receives the first LDP Label Mapping message, and obtains information about the leaf node 21 from the first LDP Label Mapping message.
  • the intermediate node 24 generates a second LDP Label Mapping message, and sends the second LDP Label Mapping message to the root node.
  • the second LDP Label Mapping message carries the information of the leaf node 21, that is, the current leaf node list.
  • the encoding format of the second LDP Label Mapping message refer to the format of Table 1 above.
  • the encoding format of the Leaf Node Address List TLV refer to the format of Table 2 above, and details are not described herein again.
  • the intermediate node 24 is connected to the root node 25, that is, the upstream node of the intermediate node 24 is the root node 25, so the intermediate node 24 sends the second LDP Label Mapping message to The root node 25. It can be understood that if there are other intermediate nodes upstream of the intermediate node 24, the intermediate node 24 sends the second LDP Label Mapping message to its upstream node, which is sent to the root node hop by hop.
  • the root node 25 receives the second LDP Label Mapping message.
  • the root node 25 obtains the leaf node 21 from the second LDP Label Mapping message. Information, the root node 25 knows that the leaf node in the current multicast network is the leaf node 21.
  • the multicast network subsequently adds the leaf node 22 and the leaf node 23, and the method may further include:
  • the leaf node 22 generates a third LDP Label Mapping message, and sends the third LDP Label Mapping message to the intermediate node 24.
  • the third LDP Label Mapping message includes the information of the leaf node 22, that is, the current leaf node list.
  • the current leaf node list herein refers to the current leaf node list that the leaf node 22 considers, that is, the information of the leaf node 22 itself, and does not include the information of the leaf node 21, because the leaf node 22 does not The presence of the leaf node 21 is perceived.
  • the information of the leaf node 22 can be carried in the leaf node address list TLV.
  • the format of the generated third LDP Label Mapping message can be referred to the format of Table 1 above.
  • the encoding format of the Leaf Node Address List TIN can be referred to the format of Table 2 above. I will not repeat them here.
  • the intermediate node 24 receives the third LDP Label Mapping message, and obtains information about the leaf node 22 from the third LDP Label Mapping message.
  • the intermediate node 24 generates a fourth LDP Label Mapping message, and sends the fourth LDP Label Mapping message to the root node 25.
  • the fourth LDP Label Mapping message carries the information of the leaf node 21 and the leaf node 22, that is, the current leaf node list.
  • the format of the fourth LDP Label Mapping message refer to the format of Table 1 above.
  • the encoding format of the Leaf Node Address List TLV refer to the format of Table 2 above, and details are not described herein.
  • the root node 25 receives the second LDP Label Mapping message.
  • the root node 25 obtains information about the leaf node 21 and the leaf node 22 from the second LDP Label Mapping message, and the root node 25 knows that the leaf node in the current multicast network is the leaf node 21 and The leaf node 22.
  • the leaf node 23 generates a fifth LDP Label Mapping message, and sends the fifth LDP Label Mapping message to the intermediate node 24.
  • the fifth LDP Label Mapping message includes information about the leaf node 23, that is, a current leaf node list.
  • the current leaf node list herein refers to the current leaf node list considered by the leaf node 23, that is, the information of the leaf node 23 itself, and does not include the information of the leaf node 21 and the leaf node 22, because the leaf Node 22 does not perceive the presence of leaf node 21 and leaf node 22.
  • the information of the leaf node 23 can be carried in the leaf node address list TLV.
  • the format of the generated fifth LDP Label Mapping message can be referred to the format of Table 1, and the encoding format of the Leaf Node Address List TLV can be referred to.
  • the format of Table 2 above is not described here.
  • the intermediate node 24 receives the fifth LDP Label Mapping message, and obtains the information of the leaf node 23 from the fifth LDP Label Mapping message.
  • the intermediate node 24 generates a sixth LDP Label Mapping message, and sends the sixth LDP Label Mapping message to the root node.
  • the sixth LDP Label Mapping message carries information about the leaf node 21, the leaf node 22, and the leaf node 23, that is, the current leaf node list.
  • the encoding format of the sixth LDP Label Mapping message refer to the format of Table 1 above.
  • the encoding format of the Leaf Node Address List TIN refer to the above table td.
  • the root node 25 receives the sixth LD ⁇ +P Label Mapping message.
  • the root node obtains information about the leaf node 21, the leaf node 22, and the leaf node 23 from the sixth LDP Label + Mapping message, and the root node 25 knows that the leaf node in the current multicast network is The leaf node 21, the leaf node 22, and the leaf node 23
  • the LDP Label Mapping message uses the LDP Label Mapping message as an example to introduce the process of adding a leaf node.
  • the LDP Label Mapping message carries the current leaf node list information, so it is applicable to the case of adding or deleting a leaf node.
  • the case of adding a leaf node has been described in detail in the foregoing embodiment. To delete a leaf node, you need to exclude the deleted leaf node list from the current leaf node list.
  • LDP Label Withdraw message is used to delete a leaf node. You can carry the Leaf Node Address List TLV in the LDP Label Withdraw message to indicate the deleted leaf node.
  • the generated LDP Label Withdraw message encoding format can be as shown in Table 3:
  • the above embodiment is more suitable for the scenario where the leaf information list is updated at any time, that is, by each leaf node. Trigger an announcement.
  • the following describes a method for transmitting leaf node information according to another embodiment of the present invention.
  • This embodiment adopts a method in which a root node periodically or irregularly triggers collection of leaf node information, and is more suitable for a scenario in which leaf information is not required to be updated at any time. For example, when a large number of leaf nodes join frequently, the leaf list is frequently refreshed, and the protocol packet exchange amount is large. Therefore, the user does not need to update the leaf node information in real time.
  • FIG. 4 is a flowchart of a method for transmitting leaf node information according to an embodiment of the present invention.
  • the method is applied to an mLDP network, and specifically includes:
  • the root node sends a request message for collecting the leaf node information to the downstream node, so that the request message for collecting the leaf node information is sent to the leaf node by the intermediate nodes hop by hop.
  • the request message may be an extended LDP Label Request message or an LDP Notification message or other protocol message, which is not limited herein. Take the LDP Notification message as an example.
  • the extended Status TLV format is shown in Table 4 below:
  • Table 4 Specifically, a Status Code can be added to the original Status TLV, as shown in Table 5 below:
  • the leaf node After receiving the request message for collecting leaf node information from the root node, the leaf node generates the leaf including the leaf
  • the protocol message of the child node information is sent to the upstream node of the leaf node, so that the information of the leaf node is transmitted to the root node hop by hop by each intermediate node.
  • the leaf node information is a current leaf node list, and details are not described herein again.
  • the LDP Label Mapping message is used as an example to carry the leaf node information.
  • the LDP Notification message may be used to carry the leaf node information.
  • a list of the plurality of leaf nodes sent by the intermediate node to the root node may be included in an LDP Notification message, or may be included in multiple LDP Notification messages, which is not limited in this embodiment of the present invention.
  • the encoding format of the LDP Notification message sent by the leaf node or the intermediate node to the upstream node is as shown in Table 6 below:
  • the foregoing embodiment uses the LDP protocol message as an example for description.
  • the embodiment of the present invention is not limited to the LDP protocol message, and other protocol messages, such as a multicast ping message, may also be applied to a scenario in which the leaf information list does not need to be updated at any time.
  • the root node sends a ping request, that is, after the echo request message is sent, all the leaf nodes reply, that is, send an echo reply message, and the echo reply message may include a Leaf Node Address List TLV, which is used to transmit the leaf node information.
  • FIG. 5 is a schematic diagram of an apparatus for transmitting leaf node information according to an embodiment of the present invention, which is applied to an mLDP network, where the device may be an intermediate node or a leaf node, and specifically includes:
  • the generating unit 52 is configured to generate a protocol message, where the protocol message includes leaf node information of the mLDP network.
  • the leaf node information may be carried in a Leaf Node Address List TIN (Type-Length-Value, type length value) of the generated protocol message, and the leaf node address is used to mark Identify specific leaf nodes.
  • the protocol message may be an LDP Label Mapping message
  • the leaf node information is a current leaf node list.
  • the protocol message may be an LDP Label Withdraw message
  • the leaf node information is a deleted leaf node list.
  • the protocol message may be an LDP Notification message or a multicast ping message
  • the leaf node information is a current leaf node list.
  • the sending unit 54 is configured to send the protocol message to an upstream node in the mLDP network, so that the leaf node information is hop by hop to the root node in the mLDP network.
  • the device may further include:
  • the receiving unit 50 is configured to receive a request message for collecting leaf node information from the root node.
  • the request message may be an extended LDP Label Request message or an LDP Notification message or a multicast ping message or other protocol message.
  • FIG. 6 is a schematic diagram of a system for transmitting leaf node information according to an embodiment of the present invention.
  • the system is applied to an mLDP network, and may include:
  • the root node 60 is configured to send a request message for collecting the leaf node information to the downstream node, so that the request message for collecting the leaf node information is sent to the leaf node by the intermediate nodes hop by hop.
  • the request message may be an extended LDP Label Request message or an LDP Notification message or a multicast ping message or other protocol message, which is not limited herein.
  • the leaf node 62 is configured to: after receiving the request message from the root node, generate a protocol message including the leaf node information, and send the protocol message to the upstream node of the leaf node, so that the information of the leaf node is intermediate The node is passed to the root node hop by hop.
  • the leaf node information may be carried in a Leaf Node Address List TIN (Type-Length-Value) of the generated protocol message, and the leaf node address is used to identify a specific leaf node.
  • TIN Type-Length-Value
  • the protocol message can be an LDP Notification message or a multicast ping message.
  • the root node in the system can perform the steps performed by the root node in the foregoing method embodiment, and the leaf nodes in the system can perform the steps performed by the leaf node in the foregoing method embodiment, and details are not described herein again.
  • the LDP protocol packet or other protocol packet is extended to transmit the leaf node information, which belongs to the In-band (in-band) transmission. It is not necessary to maintain additional neighbor relationships between the root node and the leaf node, saving network resources and enhancing the multicast network. Ease of use.
  • the program when executed, may include the flow of an embodiment of the methods as described above.
  • the storage medium may be a magnetic disk, an optical disk, a read only memory (ROM) or a random access memory (RAM).
  • the functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist physically separately, or two or more units may be integrated into one module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules.
  • the integrated modules if implemented in the form of software functional modules and sold or used as stand-alone products, may also be stored in a computer readable storage medium.
  • the above-mentioned storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • Each of the above described devices or systems may perform the methods of the corresponding method embodiments.

Landscapes

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

Abstract

L'invention porte sur un procédé, un dispositif et un système de transmission d'informations de nœud feuille. Le procédé est appliqué à un réseau à protocole de distribution d'étiquettes de diffusion groupée (mLDP) et consiste à : générer un message de protocole qui comprend des informations de nœud feuille concernant le réseau mLDP ; et envoyer le message de protocole à un nœud amont dans le réseau mLDP, de telle sorte que les informations de nœud feuille sont transmises au nœud racine du réseau mLDP bond par bond. Au moyen de la solution technique selon les modes de réalisation de la présente invention, l'extension d'un message de protocole LDP ou de messages d'autres protocoles pour une transmission d'informations de nœud feuille appartient à une transmission dans la bande qui ne nécessite pas de maintenir une relation de voisinage supplémentaire entre le nœud racine et les nœuds feuilles, ce qui économise les ressources du réseau et améliore l'utilisabilité de réseaux de diffusion groupée.
PCT/CN2012/080401 2011-08-27 2012-08-21 Procédé, dispositif et système de transmission d'informations de nœud feuille Ceased WO2013029478A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110249340.4 2011-08-27
CN2011102493404A CN102957677A (zh) 2011-08-27 2011-08-27 传递叶子节点信息的方法、装置和系统

Publications (1)

Publication Number Publication Date
WO2013029478A1 true WO2013029478A1 (fr) 2013-03-07

Family

ID=47755309

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/080401 Ceased WO2013029478A1 (fr) 2011-08-27 2012-08-21 Procédé, dispositif et système de transmission d'informations de nœud feuille

Country Status (2)

Country Link
CN (1) CN102957677A (fr)
WO (1) WO2013029478A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350761A (zh) * 2007-07-18 2009-01-21 华为技术有限公司 实现路径建立、计算的方法、装置及系统
US7743122B1 (en) * 2007-11-07 2010-06-22 The United States Of America As Represented By The Director Of The National Security Agency Method of reliably communicating via computer network
CN101989947A (zh) * 2009-08-07 2011-03-23 华为技术有限公司 关联通道能力协商方法和网络设备
CN102142970A (zh) * 2011-03-16 2011-08-03 华为技术有限公司 二层以太网络的组播树构建方法和网络节点设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350761A (zh) * 2007-07-18 2009-01-21 华为技术有限公司 实现路径建立、计算的方法、装置及系统
US7743122B1 (en) * 2007-11-07 2010-06-22 The United States Of America As Represented By The Director Of The National Security Agency Method of reliably communicating via computer network
CN101989947A (zh) * 2009-08-07 2011-03-23 华为技术有限公司 关联通道能力协商方法和网络设备
CN102142970A (zh) * 2011-03-16 2011-08-03 华为技术有限公司 二层以太网络的组播树构建方法和网络节点设备

Also Published As

Publication number Publication date
CN102957677A (zh) 2013-03-06

Similar Documents

Publication Publication Date Title
CN105991302B (zh) 可靠传输上使用注册的多播流覆盖
CN103004147B (zh) 报文转发路径确定方法及网络设备、控制设备
EP3531617B1 (fr) Procédé et appareil de transmission de messages, noeud et support de stockage informatique
US8730979B2 (en) Method and system for increasing forwarding efficiency of virtual private LAN service network
WO2012003743A1 (fr) Procédé et appareil d'acheminement de trafic de diffusion groupée
US9306758B2 (en) Dynamic adjustment of MLDP tunnel and PIM binding
CN109981308B (zh) 报文传输方法及装置
WO2010111956A1 (fr) Procédé et système de convergence de trajet de relais multidiffusion
CN101800742B (zh) 路由设备上游信息的更新处理方法、路由设备及网络系统
CN101778113A (zh) 组播网中rp状态检测方法、装置、rp装置和组播系统
US20140241351A1 (en) Dynamic determination of the root node of an mldp tunnel
WO2018072732A1 (fr) Procédé et dispositif de traitement d'informations, et support de stockage informatique
US10225091B2 (en) Method for implementing point-to-multipoint multicast, network node, and system
CN106411750B (zh) 数据分发方法及系统
CN101394358A (zh) 提高组播转发可靠性的方法和装置
TW201138376A (en) Efficient host management protocol on multicast capable router
EP2736204B1 (fr) Méthode et appareil pour la convergence d'un point de Rendez-vous.
WO2010069174A1 (fr) Procédé, système et équipement de transmission de données
CN106572050B (zh) 能力协商方法及装置
WO2013037319A1 (fr) Procédé, dispositif et système de gestion de ressources de bande passante pour trajet commuté par étiquette
CN108667731A (zh) 一种基于bier信息的处理及装置
WO2012103748A1 (fr) Procédé de commande de multidiffusion, dispositif de routage et système de multidiffusion
CN114900462A (zh) 一种路由匹配方法、信息发送方法及装置
Bartczak et al. Lightweight PIM—a new multicast routing protocol
WO2013029478A1 (fr) Procédé, dispositif et système de transmission d'informations de nœud feuille

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: 12828748

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: 12828748

Country of ref document: EP

Kind code of ref document: A1