This application provides a method and device for sending and obtaining an assert message, to increase packet processing efficiency and reduce overheads of the network device. The method includes: determining, by a network node, a plurality of assert records based on one multicast source address, where each of the plurality of assert records includes the multicast source address and one multicast group address, the plurality of assert records have the same multicast source address, and multicast group addresses included in different assert records in the plurality of assert records are different from each other; generating, by the network node, one assert message based on the plurality of assert records, where the assert message includes the multicast source address and the multicast group addresses in the plurality of assert records; and sending, by the network node, the assert message in a multicast mode.

Techniques are directed to determining a rank value associated with a first network node. An example method includes determining a second network node indicated as being a preferred parent network node for the first network node. A first rank value is processed to determine a second rank value, the first rank value corresponding to a path from the second network node to a destination network node, including rounding up the first rank value in a predetermined manner to at least a second next higher integral rank value than the first rank value, to determine the second rank value. The second rank value is processed with at least a third rank value to determine the rank value associated with the first network node, the third rank value associated with a path from one of a plurality of candidate parent network nodes, for the first network node, to the destination network node.

A node in a Segment Routing network includes a plurality of ports and a switching fabric between the plurality of ports, wherein, for an Ethernet Tree (E-tree) service, a port is configured to transmit a packet with a plurality of Segment Identifiers (SID) including a first SID, a second SID, and a third SID, wherein the first SID identifies one of multicast, ingress replication for broadcast, and a destination node including any of a node SID and an anycast SID, wherein the second SID identifies a service including the E-tree service, and wherein the third SID identifies a source of the packet. A second port of the node is connected to a customer edge, and wherein the third SID is based on whether the customer edge is a leaf node or a root node in the E-tree service.

Systems and methods for supporting SMA level abstractions at router ports for inter-subnet exchange of management information in a high performance computing environment. In accordance with an embodiment, a subnet manager in a local subnet is responsible for establishing and configuring a remote attribute a switch having a switch port configured as a router port. This remote attribute can comprise certain information about the local subnet, including connectivity information and port status information. On receiving a query from a remote subnet manager, via a SMP (or a vendor specific SMP), information contained in the remote attribute can be communicated back to the remote subnet manager.

A multi-hop relay network comprises a set of data nodes arranged in a relay topology, wherein the set of data nodes communicate with one another via a data plane comprising a set of high frequency data links, such as mmWave links. An edge node communicates with one or more of the set of data nodes via the data plane and communicates with the set of data nodes over a control plane comprising a set of low frequency wireless links, such as a Wi-Fi network. The edge node determines a path utilization for the set of high frequency wireless links. When one of the high frequency wireless links is over-utilized, the edge node communicates, to a data node in the set of data nodes via the control plane, a command to change the relay topology. The edge node also determines whether the relay topology is operating at a target accuracy. When it is not, the edge node adjusts a data analytics parameter for a node to improve the overall accuracy of the network.

A controller assigns variable length addresses to addressable elements that are connected to a network. The variable length addresses are determined based on probabilities that packets are addressed to the corresponding addressable element. The controller transmits, to the addressable elements via the network, a routing table indicating the variable length addresses assigned to the addressable elements. Routers or addressable elements receive the routing table and route one or more packets over the network to an addressable element using variable length addresses included in a header of the one or more packets.

A network segment route and a host route are advertised to a Spine node; the network segment route advertised by the Spine node is learned; when a first packet hits the network segment route, the first packet is sent to a Spine node corresponding to a next hop of the hit network segment routes so that the Spine node sends the first packet to a Leaf node corresponding to a next hop of a host route hit by the first packet.

System and method for supporting scalable representation of switch port status in a high performance computing environment. In accordance with an embodiment, a scalable representation of switch port status can be provided. By adding a scalable representation of switch port status at each switch (both physical and virtual)—instead of getting all switch port changes individually, the scalable representation of switch port status can combine a number of ports that can scale by just using a few bits of information for each port's status.

A vehicle transmission includes a shaft; speed-changing gears; switching mechanisms; and a shifting mechanism. The shifting mechanism is provided with a double-meshing preventing mechanism configured to switch between a one-way state in which the switching mechanisms are hindered from moving in a downshift direction and allowed to move in an upshift direction and a free state in which the switching mechanisms are allowed to move in both the downshift direction and the upshift direction.

Techniques configure a network to relay data from a node to a root device are described herein. In an example, one-hop neighbors of the node are determined and ranked according to link quality. The ranked neighbor nodes may be considered potential “parent nodes” of the node. The ranked nodes may be divided into a plurality of groups according to link quality. A parent node may be selected from among the “best” group of one-hop neighbor nodes and may be used to relay data for the node to and/or from the router or other device. The node continues to use the parent node at least until its ranking removes it from the best group or falls below a threshold value. After the ranking of the parent falls below such a prescribed threshold it may be replaced by selection of a replacement parent from the group of one-hop upstream neighbors having the best link quality.