[go: up one dir, main page]

WO2009067951A1 - Procédé pour déterminer des nœuds mandataires multidiffusion et procédé, dispositif et système de multidiffusion - Google Patents

Procédé pour déterminer des nœuds mandataires multidiffusion et procédé, dispositif et système de multidiffusion Download PDF

Info

Publication number
WO2009067951A1
WO2009067951A1 PCT/CN2008/073150 CN2008073150W WO2009067951A1 WO 2009067951 A1 WO2009067951 A1 WO 2009067951A1 CN 2008073150 W CN2008073150 W CN 2008073150W WO 2009067951 A1 WO2009067951 A1 WO 2009067951A1
Authority
WO
WIPO (PCT)
Prior art keywords
multicast
node
group
key
multicast data
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/CN2008/073150
Other languages
English (en)
Chinese (zh)
Inventor
Yongjun Liu
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 WO2009067951A1 publication Critical patent/WO2009067951A1/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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/563—Data redirection of data network streams
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers

Definitions

  • the embodiments of the present invention relate to the field of communications, and in particular, to a method, a multicast method, a device, and a system for determining a multicast proxy node. Background technique
  • Multicast also called multicast, means that one node in the network simultaneously sends data to multiple destination nodes.
  • Multicast technology mainly involves multicast routing, group member management, and multicast security.
  • multicast security it is necessary to ensure that multicast data is not obtained by unauthorized nodes, usually by encryption and decryption.
  • the multicast source node and the group member node respectively use the network key shared by all network nodes to encrypt and decrypt the multicast data, since the non-group member node also knows the network key. Therefore, non-group members cannot be prevented from obtaining multicast data.
  • multicast source nodes and group member nodes use group keys to encrypt and decrypt multicast data. All group member nodes know or can obtain the group key, while non-group member nodes do not know the group key, thus preventing non-group member nodes from obtaining multicast data.
  • the multicast source node may be a group member node or a non-group member node. When the multicast source node is a non-group member node, since the non-group member node does not grasp the group key, it cannot be directly encrypted using the group key. .
  • the prior art solution is to set up a multicast manager in each group, which is one of the group member nodes, and manages security centrally. All multicast data initiated by non-group members is sent to the multicast manager. The multicast manager then uses the group key to encrypt the packets and then sends them to each group member node.
  • the embodiment of the invention provides a method, a multicast method, a device and a system for determining a multicast proxy node, so that the multicast source node can perform multicast according to an optimal route.
  • the method for determining a multicast proxy node in the embodiment of the present invention includes: a multicast source node sends a multicast proxy node discovery request; and each group member node that receives the discovery request or an intermediate node that stores routing information of a group member node returns a route
  • the cost is given to the multicast source node, and the routing cost is a routing cost of the multicast source node to each group member node; the multicast source node selects a path corresponding to the path with the lowest routing cost according to the returned routing cost
  • the group member node acts as a multicast proxy node.
  • the embodiment of the present invention further provides a multicast method, a node device, and a multicast system, which can implement multicast routing optimization under the premise of satisfying multicast security requirements.
  • the multicast method of the embodiment of the present invention includes: the multicast source node encrypts the multicast data by using a key shared by the multicast proxy node, and then sends the multicast data according to a preset route; the multicast proxy node is a multicast source node.
  • the key is a key other than the group key corresponding to the destination group identifier; after receiving the multicast data, the multicast proxy node decrypts the multicast data by using the shared key
  • the processing is performed to the upper layer, and the decrypted multicast data is encrypted by using the group key and transmitted to other group member nodes.
  • the node device of the embodiment of the present invention includes: a storage unit, configured to: when the node device is used as a multicast source node, store the destination group identifier and the corresponding preset route, and the identifier of the corresponding corresponding multicast proxy node and/or a shared key between the corresponding multicast proxy node and the node device, where the multicast proxy node is a group member node corresponding to a path with the least cost route between the node device and each group member node, the pre-predetermined Let the route be the path with the least cost of the route, and the shared key is other than the group key corresponding to the destination group.
  • the encryption unit is configured to encrypt the multicast data by using the shared key
  • the sending unit is configured to send the encrypted multicast data according to the preset route.
  • a node device includes: a receiving unit, configured to receive multicast data from a multicast source node; and a determining unit, configured to determine whether it is a multicast proxy node corresponding to the received multicast data,
  • the multicast proxy node is a group member node corresponding to a path with the least cost route between the multicast source node and each group member node;
  • the decryption unit is configured to determine, in the determining unit, that the node device is a corresponding multicast And proxying the node, decrypting the multicast data by using a key shared by the multicast source node, the shared key being a key other than the group key; and an encryption unit, configured to use the The group key encrypts the decrypted multicast data, and the sending unit is configured to send the multicast data encrypted by using the group key.
  • the multicast system of the embodiment of the present invention includes: a multicast source node, configured to encrypt the multicast data by using a key shared by the multicast proxy node, and then send the data according to a preset route; the multicast proxy node is multicast The group member node corresponding to the route with the least cost route between the source node and the member nodes of the group, the preset route is the path with the least cost of the route, and the shared key is a key other than the group key.
  • a multicast proxy node after receiving the multicast data, decrypting the multicast data by using the shared key, transmitting the multicast data to a higher layer for processing, and using the decrypted multicast data
  • the group key is encrypted and transmitted to other group member nodes.
  • a method for determining a multicast proxy node includes: sending a multicast proxy node discovery request to each group member node or an intermediate node storing routing information of the group member node;
  • the routing cost is the multicast The routing cost from the source node to each member node.
  • the multicast proxy node is a group member node corresponding to a path with a least cost route from the multicast source node to each member node, and the preset route is a path with the least cost of the route, and the multicast data is The destination group identifier is carried, where the shared key is a key other than the group key corresponding to the destination group identifier;
  • the multicast data is decrypted using the shared key and transmitted to a higher layer for processing, and the decrypted multicast data is encrypted using a group key and transmitted to other group member nodes.
  • the embodiment of the invention has the following advantages:
  • the multicast source node selects a group member node corresponding to the path with the least route cost from the group member node or the intermediate node as a multicast proxy node, so that the multicast source node can perform multicast according to the optimal route. . DRAWINGS
  • FIG. 1 is a flow chart of a method for determining a multicast proxy node according to Embodiment 1 of the present invention
  • FIG. 2 is a flowchart of a multicast method according to Embodiment 2 of the present invention.
  • FIG. 3 is a flow chart of a method for determining a multicast proxy node according to Embodiment 3 of the present invention.
  • FIG. 4 is a schematic diagram of a network structure in a scenario according to an embodiment of the present invention
  • FIG. 5 is a flowchart of a method for determining a multicast proxy node according to Embodiment 1 of the third embodiment of the present invention
  • FIG. 6 is a flowchart of a multicast method according to Embodiment 4 of the present invention.
  • FIG. 7 is a flowchart of a multicast method according to Embodiment 1 of the fourth embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a multicast system according to Embodiment 5 of the present invention. detailed description
  • a first embodiment of the present invention describes a method for determining a multicast proxy node. As shown in FIG. 1, the method includes:
  • Step slOl sending a multicast proxy node discovery request to each group member node or an intermediate node storing routing information of the group member node;
  • Step s 102 Select, according to the routing cost returned by each group member node or the intermediate node storing the routing information of the group member node, the group member node corresponding to the path with the lowest routing cost as the multicast proxy node, and the routing cost is the multicast source node. The routing cost to each member node.
  • the multicast source node selects a group member node corresponding to the path with the least route cost from the group member node or the intermediate node as a multicast proxy node, so that the multicast source node can perform multicast according to the optimal route.
  • a second embodiment of the present invention describes a multicast method.
  • the method includes: Step s201: Receive multicast data sent by a multicast source node, where the multicast data is shared by the multicast source node and shared by the multicast proxy node.
  • the key is encrypted and the multicast data is sent according to the preset route;
  • the multicast proxy node is the group member node corresponding to the path with the most cost of the route from the multicast source node to the member nodes of each group, and the preset route
  • the multicast data carries the destination group identifier
  • the shared key is the key other than the group key corresponding to the destination group identifier.
  • the method further includes: determining whether it is a multicast proxy node corresponding to the multicast data.
  • the method for determining whether the multicast proxy node is the multicast data is: the multicast data carries the identifier of the multicast proxy node, and is determined according to the identifier; or
  • the multicast data also carries the Flag flag.
  • the group corresponding to the multicast data is determined. Broadcast proxy node; or,
  • the multicast data carries the multicast source node identifier, and the multicast proxy node stores the destination group identifier and the multicast source node identifier corresponding to the multicast proxy node, and the destination group identifier carried in the multicast data.
  • the multicast source node identifier is the same as the identifier stored by itself. When it is time, it is judged that it is a multicast proxy node corresponding to the multicast data.
  • Step s202 Decrypt the multicast data by using the shared key, and then transmit the multicast data to the upper layer for processing, and encrypt the decrypted multicast data by using the group key and transmit the data to the other group member nodes.
  • the multicast source node selects the group member node corresponding to the path with the least routing cost as the multicast proxy node from the group member nodes, so that the multicast source node can perform multicast according to the optimal route.
  • Embodiment 3 of the present invention describes a method for determining a multicast proxy node. As shown in Figure 3, the method includes the following steps:
  • Step s301 The multicast source node sends a multicast proxy node discovery request, where the discovery request carries the destination group identifier.
  • the multicast proxy node discovery request can be sent by broadcast.
  • Step s302 After receiving the discovery request, each group member node determines the routing cost of the node to the multicast source node, and then returns the result to the multicast source node.
  • the intermediate node which may be a group member node or a non-group member node.
  • a node can determine whether it is a member node of the group according to the destination group identifier carried in the discovery request. If it is a member node of the group, it returns the routing cost information to the multicast source node. That is, the non-group member node;), accumulates the routing cost from the previous hop to its own, and then forwards the multicast proxy node discovery request to its neighbor until it reaches the group member node.
  • Each group member node can return all routing costs to the multicast source node.
  • all routing costs theoretically refers to the route corresponding to all objective existing paths of the multicast source node to each group member node according to the network structure. The cost, but in fact, the multicast source node usually presets a period of time, and after the preset time is over, it no longer receives the returned route cost. Therefore, “all routing costs” usually refers to the routing cost of each path within a preset time.
  • Each group member node can also compare the routing costs of each path first, and only return the minimum routing cost. It can also return to the multicast source node after receiving the discovery request for the first time.
  • the routing cost of the requesting transmission path is found for the first time.
  • the discovery request is received for the second time, it is determined whether the routing cost corresponding to the second discovery request transmission path is smaller than the routing cost corresponding to the first discovery request transmission path. Returns the smaller route cost, if not, does not return, and records the smaller route cost.
  • each subsequent discovery request is received, it is compared with the previous smaller routing cost.
  • the intermediate node can directly return the routing cost to the multicast source node after receiving the discovery request.
  • the routing cost here may be the sum of the routing cost of the multicast source node to the intermediate node and the routing cost of the intermediate node to each group member node, and preferentially, the minimum route from the multicast source node to the intermediate node.
  • the cost is the sum of the minimum routing cost of the intermediate node to each group member node, because the number of returns can be reduced.
  • Step s303 The multicast source node selects, according to the routing cost information returned by the member nodes of each group, a group member node corresponding to the path with the smallest routing cost as the multicast proxy node of the destination group.
  • FIG. 4 is a schematic diagram of a network structure in a scenario according to an embodiment of the present invention.
  • Nodes A, B, C, D, and E belong to a group member of a multicast group G, and all members in the group G share one.
  • Group key Kg, the non-group member node cannot obtain this group key.
  • Node S is a non-group member and needs to send multicast data to each group member node of group G. That is to say, in this multicast process, node S is a multicast source node.
  • Step s501 The multicast source node S broadcasts a multicast proxy node discovery request to its neighbor nodes K and I, and discovers the request at the multicast proxy node.
  • the request carries the identifier and routing cost of the destination group G.
  • the initial value of the routing cost is 0.
  • Step s502 After receiving the multicast proxy node discovery request, the node K determines, according to the identifier of the destination group G, that it does not belong to the group G, and therefore, accumulates the route generation from S to K. The price is 1, and then the multicast proxy node discovery request is re-broadcasted. The routing cost carried in the request is the accumulated routing cost, that is, 1. After receiving the multicast proxy node discovery request re-broadcasted by the node K, the node A determines that it belongs to the group member of the group G according to the identifier of the destination group G. Therefore, the route cost from K to A is accumulated 1.2, and the accumulated route is obtained.
  • the cost is 2.2, and the accumulated routing cost is returned to the multicast source node S.
  • the group member node A also receives the multicast proxy node discovery request forwarded by other non-group member nodes (for example, node I), and accumulates the routing cost, and returns the accumulated routing cost to the multicast source node S. It should be noted that the group member node A may also separately accumulate the routing cost in the multicast proxy node discovery request forwarded by each non-group member, that is, the routing cost of different paths of the multicast source node S to A, and then select one of them. The minimum routing cost, and the lowest routing cost is returned to the multicast source node S.
  • Other group member nodes: 8, C, D, and E also receive the multicast proxy node discovery request forwarded by the non-group member node, and add the route cost to the multicast source node. There are two ways to return, that is, to return the routing cost of different paths respectively, or to select the smallest one from the routing costs of different paths and then return the minimum routing cost.
  • Step s503 The multicast source node S selects a group member node corresponding to the path with the lowest route cost as the multicast proxy node of the destination group G according to the routing cost returned by the member nodes of each group. For example, if a group member node returns the routing cost of multiple paths, if the minimum routing cost selected by the multicast source node is one of the routing costs of the multiple paths, the group member node is used as a multicast proxy. node. In this case, the multicast source node can also select the minimum of multiple routing costs returned by the same group of member nodes, and then compare the minimum values of the routing costs returned by each group member node, and finally obtain the minimum value.
  • the corresponding group member node is a multicast proxy node.
  • the multicast source node directly selects the group member node corresponding to the path with the least routing cost as the multicast proxy node.
  • the multicast source node determines that the route cost corresponding to the A node is the smallest, and therefore uses the node A as its multicast proxy node.
  • group member node A is only a multicast proxy node for the group G and the source node S, and different multicast source nodes, or different groups, multicast proxy nodes. May be different.
  • the intermediate node from the multicast source node S to the group member nodes of the group G stores related routing information
  • the intermediate node may be a group member node or a non-group member node.
  • the intermediate node K stores the routing information of K to the group member nodes A, B, C, D, and E.
  • the stored routing information may be the minimum routing cost information of K to a single group member node, or may be the minimum routing cost information obtained by comparing the minimum routing cost corresponding to each group member node.
  • the node after receiving the multicast proxy node discovery request and knowing that the destination group is the group G, the node directly returns the routing cost information to the multicast source node according to the routing information stored in the group G. That is, the routing cost stored by the member nodes of each group is added to the routing cost of K to S, and then the accumulated routing cost is returned to the node A.
  • Embodiment 4 of the present invention describes a multicast method. As shown in FIG. 6, the multicast method includes the following steps:
  • Step s601 The multicast source node encrypts the multicast data by using a key shared by the multicast proxy node, and then sends the multicast data according to a preset route.
  • the multicast proxy node is a group member node corresponding to the path with the highest route cost from the multicast source node to the member nodes of each group. It is pre-determined and stored in the multicast source node, and the determined method may be The method for determining a multicast proxy node in the foregoing first embodiment may also use other methods.
  • the preset route is a route with the least cost between the multicast source node and the multicast proxy node, and is also determined and stored in the multicast source node, and may be determined by using the method in the foregoing Embodiment 1, or may be determined. Use other methods to determine.
  • the shared key may be a key other than the group key corresponding to the multicast data, and may be a point-to-point key, a multi-point-to-point key, or a point-to-multipoint key.
  • the multi-point-to-point key can be determined by the multicast proxy node and its corresponding multiple multicast source nodes by negotiation, distribution, and the like.
  • Step s602 After receiving the multicast data, the multicast proxy node decrypts the multicast data by using the shared key, transmits the multicast data to the upper layer for processing, and uses the decrypted multicast data to use the group secret.
  • the key is encrypted and transmitted to other group member nodes.
  • the multicast proxy node Before decrypting the multicast data, the multicast proxy node may first determine whether it is the multicast proxy node corresponding to the received multicast data. There are a plurality of methods for judging. One method is: when the multicast source node sends the multicast data, it carries the identifier of the multicast proxy node, and after receiving the multicast data, the multicast proxy node determines according to the identifier; In the method, when the multicast source node sends the multicast data, it carries the destination group identifier and the Flag flag. When the multicast proxy node receives the multicast data, if the destination group is found to be the group in which it belongs, and the Flag flag indicates the multicast.
  • the third method is to carry the destination group identifier and group when the multicast source node sends the multicast data.
  • the source node identifier is identified, and the group identifier and the multicast source node identifier corresponding to the multicast proxy node are stored in the multicast proxy node (the multicast proxy node can obtain the information from each multicast source node in advance and store the information.
  • the destination group identifier and the multicast source node identifier carried in the received multicast data are consistent with the identifiers stored by the multicast data, it is determined. It is the corresponding multicast proxy node.
  • the first two methods are preferred, which are simple and convenient, and consume less signaling.
  • the multicast method is as follows. As shown in FIG. 7, the method includes the following steps: Step s701: The multicast source node S encrypts the multicast data packet by using the point-to-point key Ks shared by the multicast proxy node A. The payload portion of the frame is encrypted with Ks). The trailing edge is sent out by a preset route. The data packet carries the identifier of the destination group G (in this embodiment, the destination group address) and a Flag flag. The initial value of the flag is 0, indicating that the data packet is not forwarded by the group member node. If the multicast packet has been forwarded by the multicast member, Flag becomes 1. Table 1 shows a possible frame format for a multicast packet, including the Flag flag, the source node address, and the destination group identifier. Table 1 A possible frame format for multicast packets
  • the multicast source node stores a shared key including each multicast group and corresponding route, a corresponding multicast proxy node, and the multicast source node.
  • the identifier of the multicast group G is represented by its address, which is 0x1234.
  • the routing table also stores the minimum cost route from S to A.
  • the multicast source node searches its own routing table based on the destination group address to obtain the corresponding route and shared key.
  • the multicast source node may also store the multicast proxy node identifier corresponding to each shared key.
  • Step s702 The multicast data packet arrives at the node K according to the preset route, and the node K determines that the destination group identifier of the data packet is not the group in which it is located, and therefore forwards according to the preset route. Since K does not know the key Ks, the content of the packet cannot be intercepted.
  • step s703 the multicast data packet arrives at node A according to the preset route, and according to the destination group identifier, it is determined that the destination group is the group in which it is located, and then the value of Flag is checked to be 0, so that it is determined that it is a multicast proxy node.
  • the node A knows that the source node is S according to the source node address. Therefore, the data packet is decrypted using the key Ks shared with the S, and then transmitted to the upper layer for processing.
  • the node A changes the value of the Flag identifier to 1, re-encrypts the multicast data packet using the group key Kg, and then transmits the multicast data packet between the nodes in the group, which may be multicast or used.
  • the key Kg decrypts the data packet and transmits it to the upper layer for processing, and transmits the data packet to the members of other groups.
  • the process of sending a data packet according to a preset route may be implemented by using multiple routing algorithms.
  • the AODV algorithm may be used to record only the next hop in the routing table.
  • the address can also use the DSR algorithm to record the address of the full path in the routing table, and the remaining full routing node address in the sent multicast packet.
  • the proxy node identifier is stored in the multicast source node, and is represented by the proxy node address.
  • the multicast source node stores the destination group identifier (here represented by the destination group address) and the corresponding route and proxy node address.
  • the multicast source node also stores a shared key of each multicast proxy node and the multicast source node.
  • the multicast source node sends a multicast packet, it carries the destination group identifier and the identifier of the multicast proxy node.
  • the identifier of the multicast proxy node is determined in advance and stored in the multicast source node.
  • the method for determining the multicast proxy node may use the method for determining the multicast proxy node in the foregoing first embodiment, or may use other methods.
  • each node on the preset route determines whether the multicast proxy node identifier in the data packet is its own identifier. If yes, the key shared by the multicast source node is used for decryption, and is transmitted to The high-level processing, at the same time, uses the group key Kg corresponding to the destination group identifier to encrypt the data packet and transmit between the nodes in the group. If not, continue to forward down according to the preset route.
  • the multicast proxy node stores its own multicast source node and multicast group information corresponding to the multicast proxy node.
  • the data frame contains the multicast source node identifier (for example, it can be a multicast source node address).
  • the multicast proxy node determines that it is the corresponding multicast proxy node according to the destination group identifier and the multicast source node identifier in the data packet, and uses the key shared with the multicast source node.
  • the decryption is transmitted to the upper layer processing, and at the same time, the packet is encrypted using the group key Kg and transmitted between the nodes in the group.
  • Embodiment 5 of the present invention describes a multicast system. As shown in FIG. 8, the multicast system includes a multicast source node 8000 and a multicast proxy node 8002.
  • the source node 8000 specifically includes a storage unit 8004, an encryption unit 8006, and a transmission unit 8008.
  • the storage unit 8004 is configured to store the destination group identifier and the corresponding preset route, and the corresponding multicast proxy node identifier and/or the shared key between the corresponding multicast proxy node and the node device.
  • the destination group identifier may be the address of the destination group
  • the multicast proxy node identifier may be the address of the multicast proxy node
  • the preset route is the path with the lowest routing cost between the multicast source node 8000 and the corresponding multicast proxy node.
  • the shared key is a key other than the group key corresponding to the destination group, that is, the group key corresponding to the destination group identifier.
  • Encryption unit 8006 is for encrypting the multicast data using a key (e.g., a point-to-point key) shared with the corresponding multicast proxy node.
  • the shared key cannot be the group key of the corresponding destination group.
  • the sending unit 8008 is configured to send the encrypted multicast data according to a preset route.
  • the multicast proxy node 8002 includes a receiving unit 8018, a determining unit 8016, a decrypting unit 8014, an encrypting unit 8012, and a transmitting unit 8010.
  • the receiving unit 8018 uses After receiving the multicast data from the multicast source node 8000, the determining unit 8016 is configured to determine whether the multicast proxy node 8002 is a multicast proxy node corresponding to the received multicast data. If so, the decryption unit 8014 decrypts the multicast data using the shared key described above for transmission to higher layer processing.
  • the judging unit 8016 may use a plurality of judging methods, for example, the three methods described in step 602 may be employed.
  • the encryption unit 8012 is configured to re-encrypt the decrypted multicast data using the group key, and then the re-encrypted data is transmitted by the transmitting unit 8010 to the other group member nodes.
  • the drawings are merely illustrative and represent logical structures in which the units shown as separate components may or may not be physically separated, and the components displayed as a unit may be Or it may not be a physical unit, that is, it can be located in one place or distributed to several network units.
  • the transmitting unit 8010 and the receiving unit 8018 may be physically located in one place to synthesize the transceiver unit, and the encrypting unit 8012 and the decrypting unit 8014 may also be located in one place and combined into an encryption and decryption unit.
  • the multicast source node selects the group member node corresponding to the path with the least routing cost as the multicast proxy node from the group member nodes, so that the multicast source node can perform multicast according to the optimal route.
  • the multicast source node encrypts the multicast data by using a key other than the group key, which satisfies the requirements of multicast security.
  • the multicast proxy nodes may be different, thereby dispersing the burden of the multicast proxy node, and avoiding the problem that the same node is overburdened as a multicast proxy node of different multicast source nodes.

Landscapes

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

Abstract

La présente invention concerne un procédé permettant de déterminer des nœuds mandataires multidiffusion, ainsi qu'un procédé, un dispositif et un système de multidiffusion. Le procédé permettant de déterminer les nœuds mandataires multidiffusion comprend les étapes suivantes : une demande de découverte du nœud mandataire multidiffusion est envoyée par un nœud initial multidiffusion ; le coût d'acheminement est renvoyé au nœud initial multidiffusion par chaque élément du groupe recevant la demande de découverte ou par le nœud intermédiaire qui stocke l'information d'acheminement de chaque élément du groupe, dans lequel le coût d'acheminement correspond au coût d'acheminement du nœud initial multidiffusion vers chaque élément du groupe ; l'élément du nœud de groupe correspondant au coût d'acheminement le moins cher est choisi comme nœud mandataire multidiffusion par le nœud initial multidiffusion en fonction du coût d'acheminement renvoyé. Dans la présente invention, la multidiffusion est mise en application en fonction du parcours optimal par le nœud initial multidiffusion et la charge du nœud mandataire multidiffusion est dispersée de sorte que le problème du même nœud servant de nœud mandataire multidiffusion pour plusieurs nœuds initiaux multidiffusion devienne surchargé est évité.
PCT/CN2008/073150 2007-11-21 2008-11-21 Procédé pour déterminer des nœuds mandataires multidiffusion et procédé, dispositif et système de multidiffusion Ceased WO2009067951A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200710124665.3A CN101442419B (zh) 2007-11-21 2007-11-21 确定组播代理节点的方法、组播方法、设备及系统
CN200710124665.3 2007-11-21

Publications (1)

Publication Number Publication Date
WO2009067951A1 true WO2009067951A1 (fr) 2009-06-04

Family

ID=40678039

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/073150 Ceased WO2009067951A1 (fr) 2007-11-21 2008-11-21 Procédé pour déterminer des nœuds mandataires multidiffusion et procédé, dispositif et système de multidiffusion

Country Status (2)

Country Link
CN (1) CN101442419B (fr)
WO (1) WO2009067951A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105530183B (zh) * 2014-09-30 2019-11-05 中兴通讯股份有限公司 响应消息的获取、响应消息的路由方法、装置及系统
CN105764110B (zh) * 2014-12-16 2017-06-06 中国科学院沈阳自动化研究所 一种基于免疫克隆选择的无线传感器网络路由优化方法
CN106888083B (zh) * 2015-12-15 2020-04-21 中国移动通信集团公司 物联网下组密钥生成方法及通信节点

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006088614A1 (fr) * 2005-02-17 2006-08-24 Motorola, Inc. Routage multidiffusion
CN101043429A (zh) * 2006-06-05 2007-09-26 华为技术有限公司 一种在mpls域中建立组播lsp的方法和组播数据传输系统
WO2008018153A1 (fr) * 2006-08-09 2008-02-14 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et appareil de routage d'un paquet dans un système ip mobile
CN101141488A (zh) * 2006-09-08 2008-03-12 华为技术有限公司 组播服务代理的实现方法及系统和节点发现方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100488163C (zh) * 2005-01-19 2009-05-13 华为技术有限公司 组播业务处理方法和系统
CN100499583C (zh) * 2005-10-20 2009-06-10 华为技术有限公司 一种简化的igmp组播代理实现方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006088614A1 (fr) * 2005-02-17 2006-08-24 Motorola, Inc. Routage multidiffusion
CN101043429A (zh) * 2006-06-05 2007-09-26 华为技术有限公司 一种在mpls域中建立组播lsp的方法和组播数据传输系统
WO2008018153A1 (fr) * 2006-08-09 2008-02-14 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et appareil de routage d'un paquet dans un système ip mobile
CN101141488A (zh) * 2006-09-08 2008-03-12 华为技术有限公司 组播服务代理的实现方法及系统和节点发现方法

Also Published As

Publication number Publication date
CN101442419B (zh) 2010-12-08
CN101442419A (zh) 2009-05-27

Similar Documents

Publication Publication Date Title
US12143819B2 (en) Lattice mesh
US20220006627A1 (en) Quantum key distribution node apparatus and method for quantum key distribution thereof
US7865717B2 (en) Method and apparatus for dynamic, seamless security in communication protocols
Kutscher et al. Information-centric networking (ICN) research challenges
EP3054648B1 (fr) Structure de contrôle d'accès pour réseautage centrique d'informations
WO2019128753A1 (fr) Procédé de service mobile à clé quantique présentant un faible retard
KR101485279B1 (ko) 링크 계층 보안 전송을 지원하는 스위칭 장치 및 그의 데이터 처리 방법
WO2019128785A1 (fr) Procédé de relais à clé quantique
WO2018082345A1 (fr) Procédé et dispositif de relais de clé quantique basés sur un réseau de gestion et de commande centralisées
US10320760B2 (en) Method and system for mutating and caching content in a content centric network
CN103314551A (zh) 针对内容导向网络创建和管理差异化安全框架的方法和设备
Huang et al. A secure group key management scheme for hierarchical mobile ad hoc networks
US20120216036A1 (en) Encryption methods and systems
WO2009067951A1 (fr) Procédé pour déterminer des nœuds mandataires multidiffusion et procédé, dispositif et système de multidiffusion
WO2019201326A1 (fr) Routage par la source à la demande sécurisé et fiable dans un réseau centré sur l'information
Sudarsono et al. An implementation of secure data exchange in wireless delay tolerant network using attribute-based encryption
Yao et al. A-CACHE: An anchor-based public key caching scheme in large wireless networks
KR20220148880A (ko) 노드간 프라이버시 통신 방법 및 네트워크 노드
Alphonse et al. A method for obtaining authenticated scalable and efficient group key agreement for wireless ad-hoc networks
CN110289959B (zh) 一种使用公告板的双向匿名秘密通信方法
MS et al. Implementation of Protected Routing to Defend Byzantine Attacks for MANET's.
Matsuzono et al. Qkdn meets icn: Efficient secure in-network data acquisition
Chinnasamy et al. Secured distributed routing technique using extended DART and table elimination (ET-DART) technique in wireless sensor networks environment.
Chuah et al. Secure descriptive message dissemination in dtns
JP2020057906A (ja) 無線ｌａｎ通信システム、無線ｌａｎアクセスポイントおよび無線ｌａｎ通信方法

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

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

Country of ref document: EP

Kind code of ref document: A1