In one embodiment, a first networking device associated with a switched network comprises one or more processors and one or more computer-readable media storing computer-executable instructions that, when executed, cause the one or more processors to perform acts comprising configuring, on the first networking device, a network-address-translation (NAT) rule indicating that a first multicast group is to be translated to a second multicast group. The acts further include, at least partly in response to the configuring of the NAT rule, storing the NAT rule at the first networking device, generating a message indicating the NAT rule, and sending the message to at least a second networking device associated with the switched network.

A communication device includes a processor. The processor updates, when a port which is received a packet is connected to a first path or a second path, an identifier assigned to the packet from a value according to the path to a first value or a second value. The processor learns a correspondence relationship between a destination address of the packet and a transmission port by flooding the packet, and determines the transmission port based on the correspondence relationship. The processor updates, when the transmission port is connected to the first path or the second path, the identifier assigned to the packet of which the transmission port is determined to a value according to the first path or the second path. The processor discards the packet of which the identifier is updated to the second value by the first process and the transmission port is connected to the second path.

A method includes identifying within a network topology, by an apparatus, a plurality of network devices; and establishing by the apparatus, a multiple tree topology comprising a first multicast tree and a second multicast tree, the first and second multicast trees operable as redundant trees for multicast traffic in the network topology, the establishing including: allocating a first of the network devices as a corresponding root of the first multicast tree, allocating a first group of intermediate devices from the network devices as first forwarding devices in the first multicast tree, allocating a second group of intermediate devices as belonging to first leaf devices in the first multicast tree, and allocating terminal devices of the network devices as belonging to the first leaf devices, and allocating a second of the network devices as the corresponding root of the second multicast tree, allocating the second group of intermediate devices as second forwarding devices in the second multicast tree, allocating the first group of intermediate devices as belonging to second leaf devices in the second multicast tree, and allocating the terminal devices as belonging to the second leaf devices.

A method and apparatus for routing packets in a network, such as a satellite mesh network. Network nodes maintain awareness of network status in a limited surrounding region through flooding notifications. Network nodes route packets by addressing them to a selected other node within part or the entire limited surrounding region. Network nodes adjust the portion of the network to which they route packets to match the limited surrounding region, which changes dynamically due to network events.

Embodiments of the invention relate to the field of the multicast network. Disclosed by the embodiments of the present invention are a method of establishing a bidirectional forwarding detection (BFD) session based on bit index explicit replication (BIER), a BFIR, a BFER, a system and a storage medium. A method includes: establishing, by a bit-forwarding ingress router (BFIR), the BFD session; flooding, by the BFIR, BFD information to a bit-forwarding egress router (BFER) group based on an Interior Gateway Protocol (IGP); and transmitting, by the BFIR, a BFD control packet to a BFER, to trigger the BFER to establish the BFD session corresponding to the BFIR.

This application provides a node configuration method, wherein the method includes: First, determinning a target network based on an original network, where the original network is for flooding control topology information, the target network is for flooding the service topology information, and a quantity of flooding paths in the target network is less than a quantity of flooding paths in the original network. Next, determinning attributes of all interfaces on each node, where the attributes of the interfaces include a first attribute and a second attribute, an interface with the first attribute is configured to flood the service topology information. Further, generating first configuration information based on the attributes of all the interfaces on each node, and sends, to each node, the first configuration information corresponding to each node, where the first configuration information indicates each node to configure the attributes of all the local interfaces.

Disclosed is an improved implementation of a flood fill mesh network that utilizes low power and does not require any network addressing or routing protocol for network message delivery. Network messages are only communicated to a network node's correspondents using broadcast network messages over a wireless network. Network messages propagate throughout the network based on each correspondent node rebroadcasting received messages to its correspondent nodes, and so on. Coordinated synchronization across network nodes can be achieved by each network node broadcasting synchronization frames to its correspondents within a synchronization window time period and thereafter adjusting its own start time for the next synchronization period to converge synchronization. A guard band may also be utilized to account for any clock drift and signal path delays between any two communicating network nodes.

In general, various aspects of the techniques described in this disclosure provide a sequence number checksum for link state protocols. In one example, the disclosure describes an apparatus, such as a network device, having a control unit operative to obtain link state information describing links between pairs of the network devices in a network topology, the link state information being fragmented into a plurality of link state protocol (LSP) fragments; compute a sequence number checksum from sequence numbers of the link state protocol (LSP) fragments; receive an LSP data unit from another network device in the network; determine whether a sequence number checksum in the LSP data unit matches a sequence number checksum computed from the link state information; and configure a delay for processing the LSP data unit in response to determining a mismatch between the sequence number checksum of the LSP data unit and the sequence number checksum computed from the link state information.

A system may include a transmitter node and a receiver node. Each node may include a communications interface including at least one antenna element and a controller operatively coupled to the communications interface, the controller including one or more processors. Each node may be time synchronized to apply Doppler corrections to said node's own motions relative to a stationary common inertial reference frame. The stationary common inertial reference frame may be known to the transmitter node and the receiver node prior to the transmitter node transmitting signals to the receiver node and prior to the receiver node receiving the signals from the transmitter node.

Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.