41 results about "Broadcast tree" patented technology

A method for discovering addressing information within a network switch for an unknown MAC address received as a destination address of a packet. Where prior techniques flooded the network with the received packet, switch to switch protocols of the present invention reduce the volume of such overhead network traffic required to discover the addressing information. In particular, the present invention propagates query messages through network switches in a load balance domain (a group of switches cooperable in accordance with the protocols described herein). The query messages are propagated using a pruned broadcast tree to reduce the number of transmissions required to reach all switches in the load balance domain. The propagated query message eventual elicits a response from the device which owns the previously unknown destination address. Switches and devices outside the load balance domain are similarly probed for the unknown destination address using link level test messages which elicit a response from the device owning the unknown address without impacting the network higher layer protocols. These techniques reduce the volume of network traffic required to obtain the desired addressing information by forcing the response from the device owning the previously unknown destination address and constructing a unicast path to that device. Creating the unicast path obviates the need to flood the unknown destination address on the network.

A method for generating and maintaining a pruned broadcast tree for a network of switches operating multiple simultaneously active paths between devices with a load balancing family of protocols. The pruned broadcast tree is preferably generated as a by product of cost propagation aspects of the load balancing protocols exchanged among cooperating network switches. The load balance protocols operable within the network switches in association with the present invention permit multiple simultaneously active paths to be utilized among the network devices. The pruned broadcast tree is therefore used to reduce the latency of broadcast messages propagated within the network switches to reach all devices in the network. The broadcast tree defines a minimized set of devices to which a broadcast message need be forward to assure transmission to all network devices. The pruned broadcast tree, once established, is updated only in response to failure of a link and recovery of a failed link. A separate protocol of the present invention enables such pruned broadcast tree modifications and restoration.

Multicast systems and methods for Segment Routing include receiving, at a node, a multicast packet including an outer label comprising a Multiprotocol Label Switching (MPLS) source node identifier defining a source-rooted broadcast tree and an inner label including a service identifier defining a service specific multicast tree; responsive to the node including a branch point on the source-rooted broadcast tree, popping the outer label, analyzing the inner label to identify active egress ports, pushing back the outer label, and forwarding the multicast packet to the active egress ports; and responsive to the node including point-to-point transit for the source-rooted broadcast tree, forwarding the multicast packet on the source-rooted broadcast tree.

Alternate multicast / broadcast paths may be calculated in a routed network to enable broadcast / multicast traffic to be transmitted around a local failure in the routed network until the routing system reconverges on a new network topography. According to an embodiment of the invention, the nodes on a multicast tree or a broadcast tree may compute alternate paths for each of the downstream nodes in the multicast / broadcast tree or for select nodes in the multicast / broadcast tree. The select nodes may be those nodes that have advertised membership in the multicast or a set number of hops downstream on the branch affected by the failure. The alternate paths may be unicast paths from the node to the other nodes on the multicast / broadcast tree. U-turn nodes may be used where there is no regular loop-free alternate network path to a node on the downstream multicast / broadcast tree.

The invention discloses a message forwarding method and device. The method includes the steps that all node devices annunciate newly-learnt local MAC addresses and a WLAN which the MAC addresses belong to towards other node devices on the control surface of a large layer-2 network through a broadcast tree which can reach all the node devices in the large layer-2 network; the node devices receive the local MAC addresses, annunciated by other node devices, of other node devices from the broadcast tree, and original MAC address forwarding table items are generated according to large layer-2 network forwarding table items generated based on a large layer-2 network protocol in advance; after the node devices receive unicast data messages on the data plane of the large layer-2 network, matching is carried out in the original MAC address forwarding table items according to the destination MAC addresses of the unicast data messages and the WLAN which the MAC addresses belong to, outcoming interfaces of the matched table items are used for forwarding the unicast data messages directly instead of conducting large layer-2 network protocol packaging. According to the message forwarding method and device, L2 unicast traffic forwarding based on the large layer-2 network is achieved.

The invention discloses a message forwarding method and device. The method includes the steps that gateway nodes annunciate virtual MAC addresses configured by node devices and a WLAN which the addresses belong to through a broadcast tree which can reach all the node devices in a large layer-2 network; after non-gateway node devices receive the virtual MAC addresses configured by the gateway nodes and the WLAN which the addresses belong to through the broadcast tree, corresponding first MAC address forwarding table items are generated, wherein the virtual MAC addresses and the WLAN are annunciated by all the gateway nodes; when data messages with destination MAC addresses being the virtual MAC addresses of the gateway nodes are received by non-gateway nodes, the data messages are forwarded directly instead of conducting large layer-2 network protocol packaging in matching table items of the first MAC address forwarding table items according to the destination MAC addresses; when the gateway nodes receive the data messages and it is determined that the destination MAC addresses of the data messages are the virtual MAC addresses of the data messages, a routing table is searched for to forward the data messages according to the destination MAC addresses of the data messages. By means of the message forwarding method and device, L3 unicast traffic forwarding based on the large layer-2 network is achieved.

Multicast systems and methods for Segment Routing include receiving, at a node, a multicast packet including an outer label comprising a Multiprotocol Label Switching (MPLS) source node identifier defining a source-rooted broadcast tree and an inner label including a service identifier defining a service specific multicast tree; responsive to the node including a branch point on the source-rooted broadcast tree, popping the outer label, analyzing the inner label to identify active egress ports, pushing back the outer label, and forwarding the multicast packet to the active egress ports; and responsive to the node including point-to-point transit for the source-rooted broadcast tree, forwarding the multicast packet on the source-rooted broadcast tree.

The invention provides a host discovery method and system based on an SDN. The method comprises steps that 1) a controller obtains switch topology information of a whole network; 2) the controller generates a switch-level broadcast tree based on the switch topology information of the whole network and a tree establishment tree, and configures and distributes related flow tables for each switch according to the generated broadcast tree; and 3) each switch forwards ARP host searching information according to the distributed flow tables, the ARP host searching information is enabled to be broadcasted in the whole network along the broadcast tree, and a target host can be found in an effective manner. The controller is freed from the tedious host discovery task which is handled by each switch, and thus the workload of the controller is lowered, and the controller is enabled to have more functions to deal with other management and control work in the SDN. The host searching information is enabled to be broadcasted in the whole network along the switch-level broadcast tree in a radiating mode, and thus the effective host discovery is achieved.

The invention discloses a broadcast message processing method, a broadcast message processing device, a controller and a switch. The broadcast message processing method comprises the steps that: the controller classifies switches and user hosts existing on a network into different virtual networks according to network configuration information; the controller sets a broadcast tree for each virtualnetwork,, wherein a root node of the broadcast trees is one of the switches, branch nodes are a plurality of the switches different from the switch, and leaf nodes are user hosts and / or switch portsof the virtual networks which are determined according to the network configuration information and in which the home broadcast trees locate; and the controller generates broadcast flow tables and broadcast group tables of the virtual networks according to the broadcast trees, and transmits the broadcast flow tables and the broadcast group tables to the switches on the broadcast trees, so that theswitches forward received broadcast messages according to the broadcast flow tables and the broadcast group tables. By adopting the broadcast message processing method, the broadcast message processing device, the controller and the switch, the problems that load of a controller in an SDN architecture in the prior art is large and prone to cause a broadcast storm.

A method for controlling a processor array by a host computer involves creating a graph of a plurality of nodes using a data connection component, configuring a broadcast tree from a spanning tree of the graph, propagating a first command from the host computer to a member of the processor array using the broadcast tree, configuring a reply tree from a spanning tree of the graph, transmitting a response from the member of the processor array to the host computer using the reply tree, and configuring the data connection component to send at least one message selected from the first command and the response on at least one run mode communication path.

The invention discloses a channel allocating method and a device for a multichannel multi-interface wireless mesh network, relating to the wireless mesh network. The channel allocating method comprises the following steps: determining a trunk node in a broadcast tree after generating the broadcast tree from all nodes in the wireless mesh network according to grades, constructing a multicast tree with the least number of nodes according to the trunk node, and performing channel allocation for each node in the constructed multicast tree. By using the technical scheme of the invention, the network throughout is improved to a large extent and the time delay is lowered.

The invention discloses an implementation method and system of a blockchain distribution network, and the method comprises the steps: enabling each node to measure the connection quality between the node and other peer nodes, and enabling the obtained link state information to be shared with the peer nodes; calculating network topology information according to the link state information, and calculating an adjacent bandwidth resource index of each node; segmenting the network topological graph into k parts, and selecting a node with the highest adjacent bandwidth resource index in each part; taking the nodes as root nodes, and generating a transmission scheduling scheme of the broadcast tree and the non-leaf nodes; issuing a corresponding routing and transmission scheduling method to eachnode, and when broadcasting needs to be carried out in a block chain network, enabling the node to delegate a message to a root node and then carry out broadcasting according to a broadcasting tree. Meanwhile, a corresponding terminal and a medium are provided. According to the invention, through the design and sending planning of the blockchain distribution network, the broadcast delay and message complexity overhead in the blockchain network are reduced, and an efficient, reliable and universal broadcast protocol is provided for a blockchain system.

All wireless stations included in a wireless multi-hop network are allocated to one of channels available to the network as a common channel. A broadcast tree beginning from any one of the wireless stations is generated based on link information including path information on all links formed between two wireless stations communicatable in one hop. Branch information of the generated broadcast tree is used to group all of the wireless stations into blocks, and to each block is allocated a subchannel different from the common channel. A wireless station that can use the channels has its subchannel to a subchannel of group to which it belongs. Adjacent wireless stations in a wireless multi-hop network may thus be effectively allocated to communication channels, and may need minimum modification of the channels.

The invention belongs to the field of wireless sensor network energy-saving broadcast routing, in particular relates to a method for mutually exchanging node energy information in a local range in a wireless sensor network. The method is used to obtain node energy sequence information in local range and is applied to a broadcast tree structure to achieve the aims of evenly using network node energy and prolonging network life. The invention has the technical scheme that in the wireless sensor network, nodes exchange rest energy information in the local range and a certain proportion of nodes (such as 10 percent of nodes) with lowest energy and under protocol protection in a local area are reduced in the probability of functioning as the tree node in the broadcast tree and further reduced in the probability of participating in the packet retransmission.

The invention relates to a QoS (Quality of Service) broadcast method for an Overlay network based on a genetic algorithm. The method specifically comprises the following steps of determining a source node and a target node of multicast routing at an IP (Internet Protocol) layer; converting the multicast routing at the IP layer to broadcast routing at an application layer through the Overlay network; constructing a QoS target function meeting the multimedia application requirement; and utilizing the genetic algorithm to construct an optimal broadcast tree for the target function, and transmitting data from the source node along the broadcast tree. The method can be realized on the Internet, the network resources can be greatly saved, the cost is reduced, and the expansibility is strong.

The invention provides a state synchronizing method, which is executed by a first electric device. The method comprises that obtaining a first service state version recognize code stored in a local high-speed buffer of the first electric device, receiving a second service version recognize code sent from a second electric device, judging if the first service state version recognize code is older than the second one, and when the first code is older than the second one, inquiring and obtaining new service state value from a third electric device and a third service state version recognize code relative to the obtained service state value. The first, second and third electric devices are formed into event broadcast tree structure, while the third electric device is at the root node, and the first and second electric devices are at the blade nodes of the structure.

The invention discloses an Android WI-FI (Wireless Fidelity) direct mode based long-life-cycle broadcast tree establishment method. The Android WI-FI direct mode based long-life-cycle broadcast tree establishment method comprises setting a broadcast threshold value T and enabling a system only to be added to a broadcast tree and not to participate in selecting broadcast tree forwarding nodes when the node power P is smaller than T; trying to establishing the WI-FI direct connection with a neighbor of every node through the node when P is not less than T; serving mutually interacted Go intent values as remaining power values P, enabling the high remaining power value to serve as a GO (Group Owner) and enabling the other remaining power values to serve as GCs (Group Client); recording the numbers of nodes through the GO and establishing a tree with the GO as the root and the other GCs as leaves, wherein the GO is responsible for the numbers of the nodes; continuing to try to establishing the new WI-FI direct with neighbor nodes which are not on the tree through the GO; broadcasting a message to the intermediate nodes and the leaves through the root node, wherein the message indicates that the root node is the root of the broadcast tree, the broadcast information can be forwarded through the root node, and then the broadcast information of the integral network can be sent to the root node first and then forwarded through the root node hop by hop according to the broadcast tree until the broadcast information arrives at all of the nodes. According to the Android WI-FI direct mode based long-life-cycle broadcast tree establishment method, the life circle of the established broadcast tree can be as long as possible.

The invention discloses an Android WI-FI (Wireless Fidelity) direct mode based maximum coverage broadcast tree establishment method which is applied to the implementation of the information multi-hop sharing among a plurality of intelligent terminals with WI-FI modules, wherein the above Android 4.0 version operation is performed on the plurality of intelligent terminals. A broadcast tree is established in a WI-FI direct mode supported by the above Android 4.0 version without relying on the 2G (Second Generation) / 3G (Third Generation) / 4G (Fourth Generation) mobile base stations and WI-FI hotspots, the multi-hop broadcasting can be implemented among multiple users without the root, and accordingly the application range of the WI-FI direct is extended. Neighbors of core forwarding nodes of the established broadcast tree are more in participation members and accordingly the wide coverage of the broadcast tree is ensured, the depth of the broadcast tree is small, and accordingly the end-to-end broadcast delay can be maintained to be a low value.

The invention belongs to the field of energy-saving broadcast routing of the wireless sensor network, and particularly relates to an efficient energy flooding method oriented to the wireless sensor network. According to the method, in the wireless sensor network, the sequence information of node energy within the local range is utilized for achieving a broadcast tree structure method, so that the node energy is utilized regularly, and the service life of the wireless sensor network is prolonged.

The invention discloses a network routing convergence processing method. The method uses a pre-established unpruned multicast distribution tree as a fast channel. When the network topology changes, after each adjacent device of the topology change source detects the topology change, it The type of change generates an LSP message and sends it out through the fast channel, and then the convergence processing modules on these adjacent devices continue to perform route convergence processing for the topology change event. After receiving the LSP message, the device on the fast channel forwards the message and at the same time sends the message to the convergence processing module for route convergence processing. The invention also provides a corresponding network route convergence processing device. The method and device of the present invention can make the convergence of the whole network basically not limited by the network scale and topology change position, and the convergence performance of the whole network is close to the convergence performance of a single device.

The invention discloses an Android WI-FI (Wireless Fidelity) direct mode based long-life-cycle broadcast tree establishment method. The Android WI-FI direct mode based long-life-cycle broadcast tree establishment method comprises setting a broadcast threshold value T and enabling a system only to be added to a broadcast tree and not to participate in selecting broadcast tree forwarding nodes when the node power P is smaller than T; trying to establishing the WI-FI direct connection with a neighbor of every node through the node when P is not less than T; serving mutually interacted Go intent values as remaining power values P, enabling the high remaining power value to serve as a GO (Group Owner) and enabling the other remaining power values to serve as GCs (Group Client); recording the numbers of nodes through the GO and establishing a tree with the GO as the root and the other GCs as leaves, wherein the GO is responsible for the numbers of the nodes; continuing to try to establishing the new WI-FI direct with neighbor nodes which are not on the tree through the GO; broadcasting a message to the intermediate nodes and the leaves through the root node, wherein the message indicates that the root node is the root of the broadcast tree, the broadcast information can be forwarded through the root node, and then the broadcast information of the integral network can be sent to the root node first and then forwarded through the root node hop by hop according to the broadcast tree until the broadcast information arrives at all of the nodes. According to the Android WI-FI direct mode based long-life-cycle broadcast tree establishment method, the life circle of the established broadcast tree can be as long as possible.

A method and system for implementing a block chain distribution network, each node measures the connection quality between it and other peer nodes, and shares the obtained link state information with the peer nodes; calculates the network topology according to the link state information information, and calculate the adjacent bandwidth resource index of each node; divide the network topology map into k parts, and select the nodes with the highest adjacent bandwidth resource index in each part; use these nodes as root nodes to generate broadcast trees and non-leaf nodes Transmission scheduling scheme; distribute the corresponding routing and transmission scheduling methods to each node. When it is necessary to broadcast in the blockchain network, the node first entrusts the message to the root node, and then broadcasts according to the broadcast tree. At the same time provide the corresponding terminals and media. The present invention reduces the time delay and message complexity overhead of broadcasting in the blockchain network through the design and transmission planning of the blockchain distribution network, and provides an efficient, reliable and universal broadcast protocol for the blockchain system.