WO2013035286A1 - Procédé d'établissement de chemin de distribution de diffusion de groupe à groupe et dispositifs de communication - Google Patents

Procédé d'établissement de chemin de distribution de diffusion de groupe à groupe et dispositifs de communication Download PDF

Info

Publication number
WO2013035286A1
WO2013035286A1 PCT/JP2012/005517 JP2012005517W WO2013035286A1 WO 2013035286 A1 WO2013035286 A1 WO 2013035286A1 JP 2012005517 W JP2012005517 W JP 2012005517W WO 2013035286 A1 WO2013035286 A1 WO 2013035286A1
Authority
WO
WIPO (PCT)
Prior art keywords
group
bloom filter
node
tree
filter value
Prior art date
Application number
PCT/JP2012/005517
Other languages
English (en)
Japanese (ja)
Inventor
藤田　範人
啓文 植田
Original Assignee
日本電気株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 日本電気株式会社 filed Critical 日本電気株式会社
Priority to JP2013532426A priority Critical patent/JP6003893B2/ja
Publication of WO2013035286A1 publication Critical patent/WO2013035286A1/fr

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/16—Multipoint routing
    • 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

Definitions

  • the present invention relates to a group-specific broadcast distribution route setting method and a communication apparatus for setting a broadcast distribution route for each group.
  • each terminal may transmit its own location information to other terminals existing in the network.
  • each terminal in the network can share each other's position information.
  • exchanging and sharing sensor information temperature, power consumption, etc.
  • Such a logical topology is also called a virtual topology or an overlay topology.
  • Patent Document 1 describes an example of a method of configuring a logical topology between terminals and exchanging data on the configured logical topology.
  • communication terminals belonging to a network are assumed to be two-level nodes of a trunk node and a branch node that communicates with another communication device through the trunk node.
  • the logical topology is determined so that the management node can minimize the amount of communication between the core nodes.
  • each basic node communicates with other basic nodes according to the logical topology defined by the management node.
  • bucket relay type information transmission which is a condition for improving anonymity of the peer-to-peer network, can be performed while satisfying the improvement in communication efficiency.
  • a redundant topology (tree topology) is obtained in order to prevent redundant transfer.
  • the hierarchy of the tree is two hierarchies of a basic node and a branch node.
  • an arbitrary number of hierarchies can be considered in the tree topology.
  • FIG. 11 is an explanatory diagram showing an example of broadcast delivery on a tree topology.
  • FIG. 11 shows an example of a tree topology composed of 12 terminals (terminals T1 to T12).
  • the terminal T1 is a terminal located at the top (root) of the tree.
  • terminals T2 to T4 are connected as terminals belonging to a hierarchy one level below the vertex.
  • terminals T5 to T7 are connected to the terminal T2
  • terminals T8 and T9 are connected to the terminal T3
  • terminals T10 to T12 are connected to the terminal T4.
  • dotted arrows indicate an example of a data exchange route in the broadcast distribution on the tree topology.
  • each terminal transmits data to all links of its own terminal when distributing the data of its own terminal to all other terminals. For example, when the terminal is the terminal T2, the terminal T2 transmits data to four terminals T1, T5 to T7.
  • the terminal that has received the data transfers the received data to all links other than the received link.
  • the terminal T4 copies and transfers the received data to the terminals T1, T10, and T11.
  • data transmitted by a certain terminal can be delivered to all terminals on the tree topology.
  • Patent Document 2 describes an example of a method for sharing information for each group.
  • clients are divided into a plurality of information sharing groups according to quality requirements.
  • Each client manages the information sharing group, exchanges update information with other clients, and updates data for each sharing group.
  • Patent Document 3 describes an example of a route control method for suppressing overhead during data transmission and non-transmission in an ad hoc network.
  • the route control method described in Patent Document 3 uses a Bloom filter with the node identifier of each node existing at the link destination as a key as route information.
  • FIG. 12 is an explanatory diagram showing an example of a method for exchanging and sharing data for each group when exchanging and sharing data for each group as described in Patent Document 2 is performed on the tree topology described above. It is.
  • each of the terminals T1 to T12 constituting the tree topology belongs to one of groups A, B, and C.
  • terminals T4 to T6, T9, and T12 belong to group A
  • terminals T1, T2, T7, T10, and T11 belong to group B
  • terminals T3 and T8 belong to group C.
  • each terminal exchanges data to be shared between terminals belonging to the same group.
  • a route for transferring data is set for each group. That is, on a tree topology connecting all terminals, a tree-like route (broadcast delivery route) is set for each group so that data is transferred only to the terminals of the same group.
  • three types of arrow lines indicate an example of a data exchange route (hereinafter referred to as a group-specific broadcast delivery route) in the broadcast delivery for each group.
  • the broadcast distribution route of group C is only the link between the terminal T3 and the terminal T8, and it is not necessary to send traffic for data exchange to other links.
  • the group B broadcast distribution route may be only a link between terminals T1 and T2, between terminals T2 and T7, between terminals T1 and T4, between terminals T4 and T10, and between terminals T4 and T11. Therefore, this method contributes to a reduction in the amount of data traffic flowing through the network.
  • the identifier of the group of terminals existing on the lower hierarchy terminal side from the lower hierarchy terminal to the upper hierarchy terminal in the tree topology It is necessary to notify the list of (group name, etc.). Furthermore, in this case, it is also necessary to notify the list of identifiers of the group of terminals existing on the higher hierarchy terminal side from the higher hierarchy terminal to the lower hierarchy terminal.
  • the case of the terminal T3 in FIG. 12 will be described as an example. If the terminal T3 does not know which group belongs to each side of the terminals T1, T8, T9, the terminal T3 determines to which link the data addressed to the terminal belonging to the group C can be transferred. I can't. In order to be able to determine this, it is necessary to notify each terminal of a list of identifiers of groups of terminal groups existing on the terminal side of the upper and lower layers.
  • the route control method described in Patent Document 3 is a route control method in normal unicast communication, and has the following problems when applied directly to broadcast communication for each group. That is, as described in Patent Document 3, in the method of setting all the received Bloom filter values in the routing table, the path control of the broadcast communication for each group may not function correctly depending on the network configuration. That is, the Bloom filter value is transmitted / received to / from all adjacent nodes while keeping the physical network topology as it is, and all the received Bloom filter values are set in the routing table. Then, in the case of a looping topology, Bloom filter values corresponding to the same node are received from a plurality of nodes. If all of these are set in the routing table, a packet transfer loop may occur.
  • the terminal T1 is connected to the terminal T2, the terminal T2 is further connected to the terminal T3, the terminal T3 is further connected to the terminal T4, the terminal T4 is further connected to the terminal T5, Terminal T5 is further connected to terminal T1.
  • a loop topology is formed.
  • the Bloom filter value corresponding to the group A to which the terminal T3 belongs is changed from the terminal T3 to the terminal.
  • the terminal T1 is notified via T2, but the terminal T1 is also notified from the terminal T3 via terminals T4 and T5. Then, the terminal T1 determines that it should transfer to both the terminal T2 and the terminal T5 as the broadcast communication path of the group A, and if this occurs every hop, it leads to a packet transfer loop.
  • the present invention provides a group-by-group broadcast distribution route setting method and a communication apparatus that enable broadcast distribution for each group with a reduced amount of data traffic at the time of data distribution as well as the amount of traffic by control information at the time of route setting.
  • the purpose is to provide. More narrowly, the purpose is to provide a group-by-group broadcast delivery route setting method and a communication device capable of setting a broadcast delivery route for each group that does not loop during data delivery with as little control information as possible. To do.
  • the group-specific broadcast distribution route setting method is a group-specific broadcast distribution route setting method for setting a group-specific broadcast distribution route for exchanging or sharing data between nodes belonging to the same group. Then, each node transmits to each adjacent node in the tree-like topology a Bloom filter value representing a list of group identifiers to which a group of nodes existing on the own node side as seen from the adjacent node belongs. Is configured to set a forwarding table based on a Bloom filter value representing a list of group identifiers received from each adjacent node in a tree-like topology and information on the adjacent node that has transmitted the Bloom filter value. .
  • the communication device is a communication device provided in a communication system that performs broadcast distribution for each group for exchanging or sharing data between communication devices belonging to the same group, and includes at least one communication via a network.
  • Bloom filter transmission means for transmitting a Bloom filter value representing a list of identifiers of a group to which a node group existing on the own node side as viewed from the adjacent node belongs to each adjacent node in the tree-like topology connected to the apparatus And a Bloom filter value representing a list of group identifiers received from each adjacent node in a tree-like topology, and a broadcast communication for each group that sets a forwarding table based on information of the adjacent node that has transmitted the Bloom filter value Route setting means.
  • a list of group identifiers for setting a broadcast distribution route for each group along the tree topology is exchanged using a Bloom filter. Therefore, it is possible to reduce the amount of control information necessary for notification of the list of group identifiers. Furthermore, according to the present invention, each node transfers data according to a broadcast distribution path for each group by a list expressed using a Bloom filter set along the tree topology. Therefore, the problem that the broadcast distribution data for each group loops over the network can be prevented. As a result, it is possible to reduce not only the traffic volume based on the control information at the time of route setting but also the traffic volume flowing through the network including the data traffic volume at the time of data distribution.
  • FIG. 1 is a block diagram showing a configuration example of a communication apparatus according to the first embodiment of the present invention.
  • a communication apparatus 10 shown in FIG. 1 is a terminal that functions as a node in a communication system to which the present invention is applied, and includes a tree configuration unit 11, a tree configuration information holding unit 12, a Bloom filter exchange unit 13, and a forwarding table. 14, a broadcast delivery data transfer unit 15, and a Bloom filter query generation unit 16.
  • the communication device 10 is a terminal connected to a network, and is connected to the network via a wireless interface or a wired interface.
  • the communication device 10 is connected to other terminals via a network. Note that all terminals are assumed to have the same components as the communication device 10.
  • the communication device 10 may be simply expressed as a terminal.
  • the link connecting the terminal to another terminal may be a logical link by encapsulation, such as an IP tunnel or a UDP / TCP tunnel, in addition to a wireless link or a wired link.
  • the tree configuration unit 11 configures a hierarchical tree topology between terminals.
  • the tree configuration unit 11 exchanges control messages with other terminals to configure a tree topology applied to the terminals.
  • configuring a tree topology determines the connection form of each node on the network to which the present invention is applied so that the logical topology is a tree regardless of whether it is physically a tree. This means performing various controls for (fixing).
  • a protocol for realizing such a function for example, a spanning tree protocol that is a protocol that configures a tree without a loop on Ethernet (registered trademark), or a PIM that configures a multicast tree -DM (Protocol-Independent-Multicast-Dense-Mode-).
  • the tree configuration unit 11 registers tree configuration information indicating the configured tree topology in the tree configuration information holding unit 12.
  • the tree configuration unit 11 may configure the tree topology as follows. That is, a frame called BPDU (bridge protocol data ⁇ unit) is exchanged with the tree configuration unit 11 of the node on the network, and a bridge (root bridge) that is the root of the tree structure is first determined. A tree without a loop may be configured by blocking unnecessary ports based on the cost to the root bridge. More specifically, first, each bridge exchanges BPDUs and compares the bridge IDs included therein to determine the root bridge. When the root bridge is determined, each bridge further exchanges BPDUs, and calculates a path cost to the root bridge (a total value of costs determined for each link on the route).
  • BPDU bridge protocol data ⁇ unit
  • the port closest to the root bridge is defined as a root port (Root Port, RP).
  • the shortest route may be selected by comparing the sum of the costs obtained from the link speed.
  • a port closest to the root bridge (low cost) is designated as a designated port (Designated Port).
  • Other ports are non-designated ports (Non Designated Port, NDP).
  • Each segment may form a spanning tree by blocking non-designated ports.
  • a virtual network overlay network
  • virtual link setting may be instructed from a management server (not shown) so as to have a tree topology.
  • a logical tree topology may be configured by configuring virtual links in a distributed manner by a peer-to-peer protocol used in a distributed stream distribution tree or the like.
  • the tree configuration unit 11 may perform such a tree configuration operation using, for example, the timing when the participation or withdrawal of another node is detected.
  • the tree configuration information holding unit 12 stores the tree configuration information of the tree topology configured by the tree configuration unit 11.
  • the tree configuration information may be information indicating the connection destination (adjacent node) of the terminal together with the tree topology hierarchy information, for example.
  • the tree configuration information holding unit 12 may store a list of adjacent nodes existing on the upper side and the adjacent nodes existing on the lower side in the configured tree topology.
  • the tree configuration information is only information indicating the connection destination (adjacent node) of the terminal, in which hierarchical information such as upper or lower is omitted. There may be.
  • FIG. 2 is an explanatory diagram showing an example of an entry (tree configuration information) in the tree configuration information table registered in the tree configuration information holding unit 12.
  • tree configuration information in the terminal T2 shown in FIG. 12 is registered. This entry indicates that the terminal T1 exists as an upper side adjacent node and the terminals T5 to T7 exist as lower side adjacent nodes.
  • the Bloom filter exchanging unit 13 uses a Bloom filter to obtain a list of identifiers of a group to which a group of nodes existing on the own node side from each adjacent node belongs, that is, a group to which a node beyond the own node belongs, with other terminals. It is a processing unit for exchanging with each other.
  • the Bloom filter exchange unit 13 includes a reception Bloom filter / group ID storage unit 131, a Bloom filter generation unit 132, a Bloom filter transmission unit 133, a Bloom filter reception unit 134, and a forwarding table setting unit 135.
  • Bloom filter is a bit string used to test whether an element is a member of a set.
  • the Bloom filter value of an element is a value in which the key value of the element is calculated using k hash functions in an m-bit bit array, and 1 is set in the bit position corresponding to each hash value.
  • group ID group identifier to which each node belongs is expressed by a Bloom filter, and a list of group identifiers is notified with a small bit length.
  • FIG. 3 is an explanatory diagram showing the relationship between the group ID and the Bloom filter value in the first embodiment of the present invention.
  • the Bloom filter value of group A is “01100100” as shown in FIG.
  • the Bloom filter value of the group B is “10010010”.
  • the Bloom filter value of group C is “00101001”. Note that both are 8-bit bit strings.
  • the reception Bloom filter / group ID storage unit 131 stores the Bloom filter value received from the adjacent node accepted by the Bloom filter reception unit 134 and the group ID of the own node.
  • FIG. 4 is an explanatory diagram illustrating an example of an entry (hereinafter referred to as a reception bloom filter / group ID storage table) registered in the reception bloom filter / group ID storage unit 131.
  • FIG. 4 shows an example of a reception Bloom filter group ID storage table when the own node is the terminal T2 shown in FIG. In FIG. 4, for example, it is shown that the group ID of the own node is group B.
  • the Bloom filter values received from the adjacent nodes T1, T5 to T7 are “11111111”, “01100100”, “01100100”, and “10010010”, respectively.
  • the list of group IDs is expressed by the logical sum of the Bloom filter values of the groups included in the list.
  • the Bloom filter generation unit 132 generates a Bloom filter value to be transmitted to each of the other adjacent nodes based on the reception Bloom filter / group ID storage table registered in the reception Bloom filter / group ID storage unit 131. . Specifically, the Bloom filter generation unit 132 calculates the logical sum of the Bloom filter value of the group ID of the own node and all Bloom filter values received from the adjacent nodes other than the adjacent node to be transmitted. The Bloom filter value to be notified to each adjacent node is generated. The timing for generating the Bloom filter value may be set for every predetermined period, or may be the timing when the entry registered in the reception Bloom filter / group ID storage unit 131 is updated.
  • the own node is the terminal T2 shown in FIG. 12, and the group ID of the own node and the Bloom filter value received from each adjacent node are those shown in the received Bloom filter group ID storage table shown in FIG.
  • the Bloom filter generation unit 132 calculates the Bloom filter value of the group B that is the group ID of the own node.
  • the Bloom filter value of the group B is “10010010”.
  • the Bloom filter generation unit 132 receives Bloom filter values “01100100”, “01100100”, “01100100” received from all adjacent nodes (terminals T5, T6, T7 in this example) other than the terminal T1 that is the transmission target node.
  • the logical sum of 10010010 "and the previously calculated Bloom filter value" 10010010 "of group B is calculated.
  • the logical sum is “11110110”, and this value is the Bloom filter value generated as transmitted from the terminal T2 to the terminal T1.
  • the own node belongs to only one group, but it may belong to a plurality of groups.
  • the Bloom filter value of the group ID of the own node is the Bloom filter value “10010010” of Group B and the Bloom filter value “00101001” of Group C.
  • the logical sum is taken to be “10111011”.
  • Bloom filter transmission unit 133 transmits the Bloom filter value generated by Bloom filter generation unit 132 to each adjacent node.
  • the timing of transmission may be at a preset fixed period, or may be the timing when the Bloom filter to be transmitted to the adjacent node is updated for each adjacent node.
  • Bloom filter reception unit 134 receives the Bloom filter value from the adjacent node on the tree topology, and registers the received Bloom filter value in reception Bloom filter group ID storage unit 131 as necessary. Also, the Bloom filter receiving unit 134 passes the identifier of the node that transmitted the Bloom filter value to the forwarding table setting unit 135 together with it.
  • the Bloom filter receiving unit 134 when the Bloom filter receiving unit 134 receives the Bloom filter value from the adjacent node, the Bloom filter receiving unit 134 refers to the tree configuration information holding unit 12 and only receives the Bloom filter value received from the upper or lower adjacent node in the tree topology. Accept and discard bloom filter values from other nodes.
  • the forwarding table setting unit 135 sets a route entry in the forwarding table 14 based on the Bloom filter value passed from the Bloom filter receiving unit 134 and the identifier of the node that transmitted the Bloom filter value.
  • the forwarding table setting unit 135 uses the Bloom filter value passed from the Bloom filter receiving unit 134 as information indicating the group ID list Bloom filter, and the node that has transmitted the Bloom filter value
  • the route entry having the identifier of the information indicating the adjacent node is registered.
  • the forwarding table setting unit 135 overwrites the entry.
  • the forwarding table 14 is a table that is referred to in order to determine which adjacent node to transfer when the broadcast distribution data for each group is transferred.
  • An example of entries set in the forwarding table 14 is shown in FIG.
  • the group ID list Bloom filter is a Bloom filter value representing a list of group identifiers (group ID list) to which a group of nodes existing on each adjacent node side in the tree topology belongs. By checking this Bloom filter value, it can be determined whether or not a node belonging to a certain group ID exists on the side of the corresponding adjacent node.
  • the group included in the group ID list represented by the Bloom filter value “11111111” on the side of the terminal T1 of the adjacent node in this example, group A, group B, and group C. It can be seen that there are terminals belonging to.
  • a terminal belonging to the group (group B in this example) included in the group ID list represented by the Bloom filter value “10010010” exists on the terminal T7 side of the adjacent node.
  • the broadcast distribution data transfer unit 15 determines to which adjacent node the data should be transferred with reference to the forwarding table 14, and transfers based on the determination result. Broadcast distribution data for each group is transferred to the adjacent node to be transmitted. A method for determining which adjacent node should be transferred will be described. First, the broadcast distribution data transfer unit 15 generates a query for inquiry corresponding to the target group ID via the Bloom filter query generation unit 16 based on the target group ID included in the header of the broadcast distribution data. Then, the broadcast delivery data transfer unit 15 searches the forwarding table 14 for an entry in which the logical product of the group ID list bloom filter and the query for inquiry has the same value as that of the query.
  • the broadcast distribution data transfer unit 15 determines all adjacent nodes corresponding to the corresponding entry (except for the adjacent node that has transmitted the broadcast distribution data) as adjacent nodes to be transferred. .
  • an adjacent node that has transmitted the broadcast distribution data may be expressed as an “upstream adjacent node”.
  • the Bloom filter query generation unit 16 searches the forwarding table 14 for an adjacent node to which the data is to be transferred, from the group ID that is the broadcast distribution target of the data to be transferred by the broadcast distribution data transfer unit 15. Generate a query for The query may be a Bloom filter value created by the target group ID.
  • the terminal T2 in FIG. 12 searches for an adjacent node to which the broadcast delivery message addressed to the group B received from the terminal T1 should be transferred.
  • the entries in the forwarding table 14 are as shown in FIG. 5, and the Bloom filter query generation unit 16 generates “10010010” as a query corresponding to the group B.
  • the entries in which the adjacent nodes are terminals T1 and T7 correspond to entries in which the logical product of the query and the group ID list Bloom filter has the same value as the query.
  • the terminal T1 is excluded because it is an adjacent node that has transmitted the broadcast distribution data to be transferred, that is, an upstream adjacent node.
  • the adjacent node to which the broadcast distribution data addressed to the group B from the terminal T1 is to be transferred is one of the terminals T7.
  • FIG. 6 is a flowchart illustrating an operation example of a node when the communication apparatus according to the present embodiment transmits a Bloom filter value as a group ID list to an adjacent node.
  • the bloom filter generation unit 132 refers to the reception bloom filter / group ID storage unit 131, and the reception bloom filter / group ID table 131 stores the reception bloom filter / group ID storage unit 131.
  • a Bloom filter value to be transmitted to each of the other neighboring nodes is generated (step S101).
  • the bloom filter generation unit 132 may perform this generation operation at predetermined intervals, or each entry registered in the reception bloom filter / group ID storage unit 131 (group ID of the own group or You may perform at the timing when the reception bloom filter value of each adjacent node was updated.
  • the group ID of the own node and the Bloom filter value received from each adjacent node are shown in the received Bloom filter group ID storage table of FIG. 4, and the Bloom filter value transmitted from the terminal T2 of FIG. 12 to the terminal T5.
  • the Bloom filter generation unit 132 calculates the Bloom filter value of “Group B” which is the group ID of the own node.
  • the Bloom filter value of “Group B” is calculated as “10010010”.
  • the Bloom filter generator 132 receives Bloom filter values (“11111111”, “01100100”, “10010010”) received from all adjacent nodes (terminals T1, T6, T7) other than the terminal T5 that is the transmission target node.
  • the logical sum is “11111111”, and this value is the Bloom filter value transmitted from the terminal T2 to the terminal T5.
  • the Bloom filter transmission unit 133 transmits the Bloom filter value generated in Step S101 to each corresponding adjacent node (Step S102). In steps S101 and S102, only one adjacent node is processed. The Bloom filter transmission unit 133 may repeat the processes of steps S101 to S102 for the necessary adjacent nodes.
  • FIG. 7 is a flowchart illustrating an operation example of a node when a Bloom filter value is received from an adjacent node.
  • the Bloom filter receiving unit 134 receives a Bloom filter value from an adjacent node (Step S201).
  • the Bloom filter receiving unit 134 refers to the tree configuration information holding unit 12 and checks whether or not the transmission source node of the received Bloom filter is an upper or lower adjacent node in the tree topology (step S202). , S203).
  • the Bloom filter receiving unit 134 discards the received Bloom filter, The operation is terminated (step S205).
  • the Bloom filter reception unit 134 receives and receives the received Bloom filter.
  • the received Bloom filter is stored in the reception Bloom filter / group ID storage unit 131 together with the information of the transmission source node (step S204).
  • the Bloom filter receiving unit 134 When the Bloom filter receiving unit 134 accepts the received Bloom filter, the Bloom filter receiving unit 134 refers to the forwarding table 14, and whether an entry corresponding to the same adjacent node as the transmission source node of the accepted Bloom filter is already registered in the forwarding table 14. Whether or not is checked (steps S206 and S207).
  • the Bloom filter reception unit 134 in the forwarding table 14 The group ID list Bloom filter value of the entry is updated with the accepted Bloom filter value (step S208).
  • the Bloom filter receiving unit 134 displays the accepted Bloom filter value.
  • An entry having a group ID list bloom filter and having the transmission source node as an adjacent node is newly added to the forwarding table 14 (step S209).
  • the list of group identifiers on the tree topology is exchanged using a Bloom filter in order to set a broadcast distribution route for each group.
  • the list of group identifiers can be expressed in a small size, and the amount of control information required for notification of the list of group identifiers can be reduced.
  • a group identifier can be expressed with 9.6 bits per element (group) when the false positive rate is 1%, and with 14.4 bits when the false positive rate is 0.1%. is there.
  • the broadcast distribution data is also transferred to the side of an adjacent node where there is no node belonging to the target group of the broadcast distribution data (that is, misdelivery).
  • misdelivery the broadcast distribution data is finally discarded without being received as broadcast distribution data of a different group.
  • the broadcast distribution data is always transferred in the direction in which the nodes belonging to the target group exist at this time, it can be said that there is no functional problem with a slight increase in the data transfer amount.
  • broadcast delivery such as copying and transferring a packet to a plurality of links is not performed. Therefore, if a false positive occurs and the transfer destination cannot be determined and is transferred in the wrong direction, the packet does not reach the destination, which is a problem.
  • broadcast distribution by group it should be avoided that broadcast distribution data is not distributed to all nodes belonging to the target group (that is, non-distribution) rather than being erroneously distributed to nodes belonging to different groups. . Therefore, the occurrence of false positives is not a fatal problem.
  • the Bloom filter is replaced to notify the group ID list. Specifically, the Bloom filter value received from other than the adjacent node on the tree topology is discarded, and only the Bloom filter received from the adjacent node on the tree topology is accepted and set in the forwarding table. In addition, this is used to calculate the Bloom filter value to send to other neighboring nodes. In this way, it is possible to set a broadcast distribution route for each group along the tree topology.
  • the tree configuration unit 11 logically converts a loop-free topology as shown in FIG. And the tree configuration information indicating the configuration (more specifically, the link at each node) is stored in the tree configuration information holding unit 12. By doing so, it is possible to recognize the physical topology (and physical link) and the logical topology (and logical link) separately.
  • the Bloom filter receiving unit 134 and the Bloom filter transmitting unit 133 recognize the logical topology based on the tree configuration information stored in the tree configuration information holding unit 12.
  • the Bloom filter receiving unit 134 and the Bloom filter transmitting unit 133 receive the Bloom filter value only from the adjacent node on the tree and do not receive the Bloom filter value from other adjacent nodes, and the Bloom filter calculated only for the adjacent node on the tree Control to send the value. Therefore, the Bloom filter value can be prevented from being transmitted and received in the loop topology as described above.
  • FIG. 9 is a block diagram showing an outline of the present invention.
  • a communication apparatus 500 shown in FIG. 9 is a communication apparatus included in a communication system that performs broadcast distribution for each group for exchanging or sharing data between communication apparatuses belonging to the same group, and includes a Bloom filter transmission unit 501, a group Each broadcast delivery route setting means 502 is provided. Note that the communication device 500 is connected to one or more communication devices via a network.
  • the Bloom filter transmission unit 501 for each adjacent node in the tree-like topology, lists a group identifier to which a group of nodes existing on the own node side as viewed from the adjacent node belongs. Send the Bloom filter value that represents it.
  • the group-specific broadcast distribution route setting means 502 (for example, the Bloom filter receiving unit 134 and the forwarding table setting unit 135) includes a Bloom filter value representing a list of group identifiers received from each adjacent node in the tree-like topology, A forwarding table is set based on the information of the adjacent node that transmitted the Bloom filter value.
  • each communication device By providing such a configuration for each communication device on the network, it is possible to perform broadcast distribution for each group while suppressing the amount of data traffic at the time of data distribution as well as the amount of traffic by control information at the time of route setting. .
  • the Bloom filter transmission means 501 includes all of the Bloom filter value generated from the identifier of the group to which the own node belongs and the Bloom filter value received from each adjacent node in the tree topology other than the adjacent node to be transmitted.
  • a logical sum with the Bloom filter value received from each adjacent node may be transmitted to each adjacent node as a Bloom filter value representing a list of group identifiers. According to such a configuration, it is possible to easily generate a Bloom filter value representing a list of group identifiers to be transmitted to each adjacent node, leading to a reduction in processing time related to notification.
  • the group-specific broadcast communication path setting unit 502 receives a Bloom filter value from other than an adjacent node in the tree-like topology, the received group filter value may be discarded without being set in the forwarding table. . According to such a configuration, even if a communication device that does not include the Bloom filter transmission unit according to the present invention enters the communication network, it is possible to prevent an incorrect route setting that leads to a packet transfer loop from being performed. be able to.
  • the communication device 500 may further include a group-by-group broadcast delivery data transfer unit 503, a tree configuration unit 504, and a tree configuration information holding unit 505.
  • FIG. 10 is a block diagram showing another configuration example of the communication apparatus according to the present invention.
  • the communication apparatus 500 shown in FIG. 10 further includes a group-by-group broadcast delivery data transfer unit 503, a tree configuration unit 504, and a tree configuration information holding unit 505.
  • the group-specific broadcast distribution data transfer means 503 (for example, the broadcast distribution data transfer unit 15), when transferring the group-specific broadcast distribution data, among the entries registered in the forwarding table, includes the bloom included in the entry. Adjacent nodes included in an entry in which the logical product of the filter value and the Bloom filter query that is the Bloom filter value generated from the identifier of the group that is the distribution target of the per-group broadcast distribution data matches the value of the Bloom filter query Then, the per-group broadcast distribution data is transferred to an adjacent node other than the upstream adjacent node of the per-group broadcast distribution data.
  • the group-by-group broadcast path setting unit 502 includes a Bloom filter value that represents a list of group identifiers received from adjacent nodes in a tree-like topology, and an adjacent node that has transmitted the Bloom filter value. Correspondingly, they are registered as entries in the forwarding table.
  • the tree configuration means 504 (for example, the tree configuration unit 11) logically configures a tree-like topology for performing broadcast distribution at least for each group.
  • the tree information holding unit 505 (for example, the tree configuration information holding unit 12) holds at least information indicating adjacent nodes in a tree-like topology configured by the tree forming unit. According to the configuration including the tree configuration unit 504 and the tree information holding unit 505, even if the topology is physically a loop topology, the packet caused by the fact that the group-by-group broadcast distribution route is not correctly set in the routing table. Generation of a transfer loop can be prevented.
  • the present invention can be suitably applied to a communication system that performs broadcast distribution by group for exchanging or sharing data between nodes belonging to the same group.
  • T1 to T12 Terminal 10 Communication device 11
  • Tree configuration unit 12 Tree configuration information holding unit 13
  • Forwarding table setting Unit 14 Forwarding table 15
  • Broadcast distribution data transfer unit 16 Bloom filter query generation unit 501 Bloom filter transmission unit 502
  • Tree configuration unit 505 Tree configuration information holding unit

Landscapes

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

Abstract

Selon l'invention, dans un système de communication, une distribution de diffusion de groupe à groupe pour échanger ou partager des données entre des dispositifs de communication appartenant au même groupe est effectuée. Chaque dispositif de communication dans le système de communication comprend : un moyen de transmission de filtre de Bloom (501) qui transmet, à chaque nœud voisin d'une pluralité de nœuds voisins dans une topologie arborescente, des valeurs de filtre de Bloom représentatives d'une liste des identificateurs de groupes auxquels appartiennent des groupes de nœuds existants du côté du nœud local vu depuis ce nœud voisin ; et un moyen d'établissement de chemin de communication de diffusion de groupe à groupe (502) qui établit une table d'acheminement sur la base des valeurs de filtre de Bloom reçues en provenance de chaque nœud voisin dans la topologie arborescente et représentatives d'une liste des identificateurs de groupes et sur la base d'informations du nœud voisin ayant transmis les valeurs de filtre de Bloom.
PCT/JP2012/005517 2011-09-09 2012-08-31 Procédé d'établissement de chemin de distribution de diffusion de groupe à groupe et dispositifs de communication WO2013035286A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2013532426A JP6003893B2 (ja) 2011-09-09 2012-08-31 グループ毎同報配信経路設定方法および通信装置

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2011-197259 2011-09-09
JP2011197259 2011-09-09

Publications (1)

Publication Number Publication Date
WO2013035286A1 true WO2013035286A1 (fr) 2013-03-14

Family

ID=47831758

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/005517 WO2013035286A1 (fr) 2011-09-09 2012-08-31 Procédé d'établissement de chemin de distribution de diffusion de groupe à groupe et dispositifs de communication

Country Status (2)

Country Link
JP (1) JP6003893B2 (fr)
WO (1) WO2013035286A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2015228611A (ja) * 2014-06-02 2015-12-17 富士通株式会社 情報生成装置、ネットワークシステム、及び情報生成方法
JP2019004341A (ja) * 2017-06-15 2019-01-10 Kddi株式会社 送信制御装置、送信制御方法及び送信制御プログラム
JP2021536170A (ja) * 2018-08-15 2021-12-23 華為技術有限公司Huawei Technologies Co., Ltd. Ｏｄｎ論理トポロジ情報を取得するための方法および装置、デバイス、ならびに記憶媒体

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007207013A (ja) * 2006-02-02 2007-08-16 Toshiba Corp 情報処理装置、情報共有プログラム
JP2010531086A (ja) * 2007-06-15 2010-09-16 テレフオンアクチーボラゲット エル エム エリクソン（パブル） 重複セルを発見する方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007207013A (ja) * 2006-02-02 2007-08-16 Toshiba Corp 情報処理装置、情報共有プログラム
JP2010531086A (ja) * 2007-06-15 2010-09-16 テレフオンアクチーボラゲット エル エム エリクソン（パブル） 重複セルを発見する方法

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2015228611A (ja) * 2014-06-02 2015-12-17 富士通株式会社 情報生成装置、ネットワークシステム、及び情報生成方法
JP2019004341A (ja) * 2017-06-15 2019-01-10 Kddi株式会社 送信制御装置、送信制御方法及び送信制御プログラム
JP2021536170A (ja) * 2018-08-15 2021-12-23 華為技術有限公司Huawei Technologies Co., Ltd. Ｏｄｎ論理トポロジ情報を取得するための方法および装置、デバイス、ならびに記憶媒体
US11405103B2 (en) 2018-08-15 2022-08-02 Huawei Technologies Co., Ltd. Method and apparatus for obtaining ODN logical topology information, device, and storage medium
JP7174832B2 (ja) 2018-08-15 2022-11-17 華為技術有限公司 Ｏｄｎ論理トポロジ情報を取得するための方法および装置、デバイス、ならびに記憶媒体
US11722217B2 (en) 2018-08-15 2023-08-08 Huawei Technologies Co., Ltd. Method and apparatus for obtaining ODN logical topology information, device, and storage medium

Also Published As

Publication number Publication date
JPWO2013035286A1 (ja) 2015-03-23
JP6003893B2 (ja) 2016-10-05

Similar Documents

Publication Publication Date Title
US11411853B2 (en) Link-state advertisement LSA sending method, apparatus, and system
EP3046294B1 (fr) Système et procédé d'acheminement efficace de contenu basé sur des noms utilisant des informations sur l'état des liens dans des réseaux centrés sur les informations
CN102150148B (zh) 层2拓扑中针对单播帧和多播帧的差别化服务
US9008088B2 (en) Multicast implementation in a link state protocol controlled ethernet network
CN107623630B (zh) 一种位索引显式复制信息传递方法和装置
CN102986176A (zh) 用于bgp mac-vpn的mpls标签分配的方法和装置
EP2989755B1 (fr) Distribution multidiffusion efficace vers des hôtes connectés de façon double (vpc) dans des réseaux de recouvrement
CN104335537A (zh) 用于层2多播多路径传送的系统和方法
CN103873373A (zh) 一种组播数据报文转发方法及设备
US10931530B1 (en) Managing routing resources of a network
US20170034285A1 (en) Service discovery optimization in a network based on bloom filter
US11627066B2 (en) IGP topology information and use for BIER-TE
KR20160078248A (ko) 콘텐트 중심 네트워크들에서 멀티 소스 멀티캐스팅을 위한 시스템 및 방법
US9247397B2 (en) Distribution of multicast traffic through a mesh network
CN107534611B (zh) 用于逻辑到物理拓扑发现的系统和方法
US20150201323A1 (en) Encapsulating received multicast traffic in unicast ip packets to support distribution of multicast traffic through a mesh network
JP5754267B2 (ja) 中継装置及び中継制御方法
JP6003893B2 (ja) グループ毎同報配信経路設定方法および通信装置
CN105282041A (zh) 基于isis的洪泛方法及装置
CN100496023C (zh) 一种传输链路状态信息的方法
US10680931B2 (en) Ingress gateway selection for a shortest path bridging network to support inter domain multicast routing
CN104702510B (zh) 一种rpr网络中的报文转发方法及装置
Cisco Configuring OSPF
CN107276774B (zh) 一种组播报文传输方法以及转发设备
Jiao Research of tree-based multicast routing protocols for ad hoc networks

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2013532426

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12829999

Country of ref document: EP

Kind code of ref document: A1