Various example embodiments for supporting stateless multicast communications in a communication system are presented. Various example embodiments for supporting stateless multicast communications may be configured to support stateless multicast communications in a label switching network (e.g., a Multiprotocol Label Switching (MPLS) network, an MPLS—Traffic Engineered (TE) network, or the like) based on a network label space. Various example embodiments for supporting stateless multicast communications based on a network label space may be configured to support assignment, from a network label space of a network, of a set of labels for nodes of the network and for adjacencies of the network. Various example embodiments for supporting stateless multicast communications based on a network label space may be configured to support assignment of node labels from the network label space for nodes of the network and assignment of adjacency labels from the network label space for adjacencies of the network.

This disclosure describes techniques for improved multicast network telemetry implemented over multilayer switches in a PIM domain. The multilayer switches may be configured to collectively certify end-to-end flow provisioning, and to publish telemetry data certifying flow provisioning from a single notifier to an external controller host. Computational workload and network traffic for streaming data related to certifying path provisioning is kept to a minimum for each flow that needs to be certified, which also keeps compounding of network traffic for many different flows to a minimum. Moreover, since controller hosts are notified upon successful provisioning but not at other times, controller hosts can trust that the telemetric data is minimally latent, and may be relied upon to enact timely actions which produce desired outcomes.

Disclosed in the embodiments of the present disclosure are a packet forwarding method, apparatus and system, a network device and a storage medium. The method includes: carrying, according to Deterministic Networking (DetNet) requirements for a multicast packet based on Bit Index Explicit Replication (BIER), corresponding DetNet configuration information in BIER header information of the multicast packet; and sending the multicast packet carrying the BIER header information.

Functionality for creating a bit routing table for use in a bit-indexed explicit replication (“BIER”) environment in disclosed herein. In one embodiment, this functionality includes receiving information from a host, and determining whether the information comprises a MAC address that is a bit-indexed explicit replication (“BIER”) MAC address. In response to determining that the information comprises a BIER MAC address, this functionality creates an entry corresponding to the MAC address in a bit routing table. This functionality also analyzes the information to determine a bit position that is associated with the host, and also determines a port via which the host is reachable. The functionality updates the bit routing table by storing information identifying the bit position and the port in the entry, such that the bit position and the port both correspond to the MAC address. This functionality can be used to route packets in a BIER environment.

Various example embodiments for supporting stateless multicast communications in a communication system are presented. Various example embodiments for supporting stateless multicast communications may be configured to support stateless multicast communications in a label switching network (e.g., a Multiprotocol Label Switching (MPLS) network, an MPLS—Traffic Engineered (TE) network, or the like) based on use of local label spaces of nodes of the label switching network for encoding of an explicit path tree for the multicast communications within the multicast communications. Various example embodiments for supporting stateless multicast communications in a label switching network based on use of local label spaces of nodes of the label switching network may be configured to support use of local label spaces of nodes of the label switching network by using network-wide unique node identifiers to uniquely identify nodes with which the node and adjacency labels of the explicit path tree are associated.

Methods, systems, and devices for wireless communications are described. A method for wireless communication at a user equipment (UE) may include: receiving a multicast bandwidth part configuration for multicast communications between a base station and the UE, where the multicast bandwidth part configuration includes a maximum number of multiple-input, multiple-output layers to be used for the multicast communications; establishing a multicast link with the base station for multicast communications; determining to use a reduced number of antennas for multicast reception than the number of antennas used for unicast reception, or determining that the UE is able to decode the multicast communications prior to a remaining portion of the multicast communications; and receiving the multicast communications via the reduced number of antennas, or reducing the radio frequency power prior to completion of a number of repetitions or retransmissions of the multicast communications.

A disclosed method is performed at a first boundary node bordering a BIER domain. The method includes receiving a message associated with a source and group for multicast from outside the BIER domain. The method further includes generating an encapsulated message based on the message, a metric, and a first proxy address of the first boundary node. The method also includes forwarding the encapsulated message through the BIER domain to at least one second boundary node bordering the BIER domain and connectable to the first boundary node. The first boundary node additionally triggers the at least one second boundary node to decapsulate the encapsulated message for forwarding out of the first domain and store a record including the source, the group, the metric representing the cost of the first boundary node to the source, and the first proxy address on the at least one second boundary node.

Some examples relate to managing multicast group traffic. In an example, a switch anchor controller receives a request for a multicast group from an associated network switch in a multicast-capable network. The associated network switch registers to the switch anchor controller in the multicast-capable network. In response to the request, the switch anchor controller selects a non-anchor controller in the multicast-capable network to serve the multicast group to the associated network switch. The switch anchor controller provides the information related to the non-anchor controller to the associated network switch, which in response creates a specific multicast tunnel between the associated network switch and the non-anchor controller to transfer multicast traffic related to the multicast group.

Technologies include a network switch configured to perform packet replication. The network switch includes a network communicator, an entity manager, and a tag manager. The network communicator is to receive a data packet, and the entity manger is to identify an entity associated with the data packet and determine a tag associated with the entity. Additionally, the tag manager is to determine a packet replication configuration associated with the tag, and perform one or more per-port forwarding actions based on the packet replication configuration. The packet replication configuration includes one or more destination ports to be masked and a number of copies to be replicated to be sent out on of at least one destination port.

A method includes: a) receiving node identifiers from nodes of a plurality of nodes in a computer network; b) determining a plurality of node committees in a sampler graph comprising a plurality of nodes, wherein the node is present in a node committee in the plurality of node committees; c) and i) generating a random string; ii) performing a proof of work process using the random string and a hash function; iii) if the proof of work process yields a solution that is acceptable, then broadcasting the solution to all other nodes in the plurality of nodes, wherein the other nodes verify the solution; and iv) if the other nodes verify the solution, the node is elected to a subcommittee for the node committee, wherein the subcommittee updates the sampler graph; and d) repeating steps b) and c) until a leader committee is determined.