A packet forwarding method, apparatus, and system are provided, and belong to the field of network technologies. A destination address field of a first packet received by a first network node includes a compressed segment identifier corresponding to a first outbound interface or a next-hop node of the first network node; based on the first outbound interface being faulty or the next-hop node being faulty, the first network node determines a second segment identifier based on segment identifier planning information of the node corresponding to the compressed segment identifier, and forwards the first packet based on the second segment identifier, where the second segment identifier is a segment identifier in a segment list of the first packet or a segment identifier in the destination address field.

A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.

A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.

Embodiments of the present disclosure relate to a distributed link tracing data processing method, a device, and a storage medium. The method includes: receiving a service request, processing the service request, caching first tracing data generated in a local cache, constructing a sub-request of the service request, delivering the sub-request to a next-hop service node, receiving second tracing data generated by the next-hop service node through processing the sub-request of the service request and fed back through a response message, caching the second tracing data in the local cache, processing the response message, caching third tracing data generated in the local cache, obtaining the first tracing data, the second tracing data, and the third tracing data, splicing the above tracing data to obtain full link tracing data generated by processing the service request, and storing the full link tracing data in a target storage device.

Embodiments of the present disclosure relate to a distributed link tracing data processing method, a device, and a storage medium. The method includes: receiving a service request, processing the service request, caching first tracing data generated in a local cache, constructing a sub-request of the service request, delivering the sub-request to a next-hop service node, receiving second tracing data generated by the next-hop service node through processing the sub-request of the service request and fed back through a response message, caching the second tracing data in the local cache, processing the response message, caching third tracing data generated in the local cache, obtaining the first tracing data, the second tracing data, and the third tracing data, splicing the above tracing data to obtain full link tracing data generated by processing the service request, and storing the full link tracing data in a target storage device.

A method comprises, at routers of a network configured to provide connectivity from a multicast receiver to edge routers multihomed to a multicast source of multicast traffic on an Ethernet segment: creating a limited flood domain for the Ethernet segment, wherein the limited flood domain includes boundary routers positioned to make a final decision as to which of the edge routers to send a multicast join for the multicast traffic; by the boundary routers, upon receiving a source announcement that announces the multicast source is active on a particular edge router of the Ethernet segment, locally storing information, provided by the source announcement, which includes a multicast address for the multicast source and identifies a link to the particular edge router; and by boundary router of the boundary routers, upon receiving the multicast join, sending the multicast join to the particular edge router using the multicast address and the link.

A method comprises, at routers of a network configured to provide connectivity from a multicast receiver to edge routers multihomed to a multicast source of multicast traffic on an Ethernet segment: creating a limited flood domain for the Ethernet segment, wherein the limited flood domain includes boundary routers positioned to make a final decision as to which of the edge routers to send a multicast join for the multicast traffic; by the boundary routers, upon receiving a source announcement that announces the multicast source is active on a particular edge router of the Ethernet segment, locally storing information, provided by the source announcement, which includes a multicast address for the multicast source and identifies a link to the particular edge router; and by boundary router of the boundary routers, upon receiving the multicast join, sending the multicast join to the particular edge router using the multicast address and the link.

Systems and methods herein are for a network having a receiver network device and a source network device. The source network device may be configured to advertise a route comprising an attribute and at least one network address that is representative of the source network device. The attribute may include an identifier of the source network device and the at least one network address having a prefix associated with hosts of the source network device.

The receiver network device may determine a convergence for routing packets from the receiver network device based in part on a determination that the identifier matches at least the prefix of the route advertised by the source network device. Convergence determinations can be faster when performed using only the one route update having the identifier that matches at least the prefix, which allows the receiver network device to recognize and use only one route update.

Systems and methods herein are for a network having a receiver network device and a source network device. The source network device may be configured to advertise a route comprising an attribute and at least one network address that is representative of the source network device. The attribute may include an identifier of the source network device and the at least one network address having a prefix associated with hosts of the source network device.

The receiver network device may determine a convergence for routing packets from the receiver network device based in part on a determination that the identifier matches at least the prefix of the route advertised by the source network device. Convergence determinations can be faster when performed using only the one route update having the identifier that matches at least the prefix, which allows the receiver network device to recognize and use only one route update.

Techniques and architecture are described for a controller that encodes hop-by-hop unprotected adjacency SIDs in SRv6 SID compressed carriers in IPV6 destination address (DA) and segment routing heading (SRH). In configurations, the adjacency SIDs are locally scoped and require encoding of a node SID followed by the adjacency SID. However, network devices are updated to handle back-to-back adjacency SIDs as the SR circuit-style SID list is computed and encoded hop-by-hop. The techniques and architecture also provide a F3208 SID format, which provides compressed data comprising eight bits. Using the F3208 SID format, the controller may encode up to 14 hop-by-hop unprotected adjacency SIDs in a single 128-bit IPv6 address and an additional 14 adjacency SIDs+14 adjacency SIDs, which equals 28 adjacency SIDs, in the SRH. The F3208 format may be extended to handle cases where the number of interfaces is more than 28, which equals 256 interfaces.