Approaches for multicast routing a group packet that includes a payload and routing information (e.g., a target identifier vector and a target multicast group ID) in a network having multiple cells each comprising a parent node and one or more child nodes include establishing and storing one or more child-node multicast group map tables associated with the child node(s) for each cell; receiving a multicast group packet; determining whether to forward the multicast group packet to the child node(s) based at least in part on the child-node multicast group map table(s) associated therewith and the received target identifier vector; and if so, causing the parent node to forward the multicast group packet to the child node(s).

A message-limiting mechanism for enabling computing devices to self-organize into groups based on network proximity can entail the transmission of values based on hierarchical evaluation such that only a computing device having a most extreme value continues to transmit. The values utilized can be randomly generated and their broadcast can facilitate the identification of computing devices that are proximate, by network distance. Each computing device can retain a most extreme value received, unless a value generated by that computing device itself is more extreme, in which case the computing device can continue periodic broadcasts of its value. Each computing device can report its retained values, or its own value if no values were retained, and groupings can be generated based on the values reported by the computing devices. The grouping of computing devices can then facilitate the identification of peers, including for purposes of downloading content from such peers.

In an embodiment, a computer-implemented method for highly-scalable, in-network multicasting of statistics data is disclosed. In an embodiment, a method comprises: receiving, from an underlay controller, a match-and-action table that is indexed using one or more multicast (“MC”) group identifiers and includes one or more special MC headers; detecting a packet carrying statistics data; determining whether the packet includes an MC group identifier; in response to determining that the packet includes the MC group identifier: using the MC group identifier, retrieving a special MC header, of the one or more special MC headers, from the match-and-action table; generating an encapsulated packet by encapsulating the packet with the special MC header; and providing the encapsulated packet to an interface controller for transmitting the encapsulated packet to one or more physical switches.

The invention relates to a wireless communication system comprising a plurality of radio devices. Each radio device belongs to one or more radio neighborhoods and is capable of repeating the transmission of the broadcast message regardless of whether the radio device is operating as a router device or as a non-router device. The radio devices belonging to each radio neighborhood are configured to repeat collectively a transmission of a broadcast message a collective target amount of repetitions within each radio neighborhood. Each radio device within each radio neighborhood to which it belongs is arranged to: define a total repetition load value representing a contribution of said radio device to the collective target amount of repetitions of the broadcast message within said radio neighborhood, and decide whether to repeat the transmission of the broadcast message in accordance with the defined total repetition load value. The invention relates also to a method for the wireless communication system, a radio device for the wireless communication system, a method for the radio device, a computer program, and a tangible non-volatile computer readable medium.

A system to facilitate automatic data center assembly is described. The system includes a first enclosure, including a first set of components, each component including a component manager to perform a component function and a first enclosure manager, communicatively coupled to each component manager, to perform a discovery of each of the first set of components and discover one or more adjacent enclosures coupled to the enclosure via link cables. The system also includes a system manager to automatically discover the first enclosure via the first enclosure manager and discover each of the first set of plurality of components via an associated component manager.

In some embodiments, a method processes a first packet and generates a first copy of the first packet as a second packet. The method sends second copies of the first packet to a first group of multiple destinations defined by a first address. Also, the method sends the second packet to an interface with a loopback function. The interface recirculates the second packet for further processing. The second packet is processed where the second packet is assigned a destination of a second address. Then, the method sends copies of the second packet to a second group of multiple destinations defined by the second address.

A method, device and node for message transmission, and a computer storage medium are provided, the method including Bit Indexed Explicit Replication (BIER) information which is sent by other nodes except a first node in a distance-vector routing protocol (Babel) network in a Babel protocol extension manner is received, wherein the BIER information is used for acquiring a BIER forwarding entry; the BIER forwarding entry is acquired according to the BIER information; and a message encapsulated in a BIER manner is sent to said other nodes according to the BIER forwarding entry.

A message-limiting mechanism for enabling computing devices to self-organize into groups based on network proximity can entail the transmission of values based on hierarchical evaluation such that only a computing device having a most extreme value continues to transmit. The values utilized can be randomly generated and their broadcast can facilitate the identification of computing devices that are proximate, by network distance. Each computing device can retain a most extreme value received, unless a value generated by that computing device itself is more extreme, in which case the computing device can continue periodic broadcasts of its value. Each computing device can report its retained values, or its own value if no values were retained, and groupings can be generated based on the values reported by the computing devices. The grouping of computing devices can then facilitate the identification of peers, including for purposes of downloading content from such peers.

Techniques for limiting forwarding of multicast communications are described herein. For example, the techniques intelligently forward data along paths of a network where members of a multicast group are located. As such, a node that does not lead to members of the multicast group may be configured to selectively and intelligently forward multicast messages it receives. This can reduce network communications, ultimately conserving processing, communication, and/or battery resources of the nodes and improving performance of the network.

An example system includes a transceiver. The transceiver communicates multicast frames to a plurality of client devices in a multicast group. The system further includes a controller. The controller determines that a predetermined time has passed since the transceiver most recently sent a unicast transmission to one of the plurality of client devices. The controller instructs the transceiver to transmit a unicast frame to the one of the plurality of client devices. The controller computes a data rate for the one of the plurality of client devices based on the transmission of the unicast frame to the one of the plurality of client devices.