Abstract: Disclosed is an atomizing device, including: a housing, in which a first installation space and a host compartment are formed, the first installation space being spaced apart from the host compartment; an oil storage structure disposed in the first installation space and containing an oil storage chamber for storing oil; an atomizing tube disposed in the oil storage structure, in which an oil inlet is disposed at an air inlet end of the atomizing tube; an atomizing core disposed in the atomizing tube and spaced from the air inlet end of the atomizing tube in a longitudinal direction of the oil storage structure; and an oil guide member disposed between the atomizing tube and the atomizing core, in which the oil guide member is connected with the atomizing core, and is in communication with the oil storage chamber through the oil inlet.

Abstract: A device for simulating high-frequency current propagation of partial discharge of a GIL/GIS is disclosed. The device comprises a casing, a busbar cavity, an adjustable impedor, a first metal support, a second metal support, a third metal support, and a high-frequency current sensor. The first metal support and the second metal support are separated by an insulating support, the third metal support has an end connected to the second metal support, as well as an end connected to a grounding grid, and the adjustable impedor is formed by an adjustable resistor and an adjustable inductor which are connected in series, and is connected in series between the first metal support and the second metal support through a wire.

Abstract: The subject technology receives, by a distributed database, transactional queries against a key-value database comprising data managed by key-value pairs. The subject technology performs, using asynchronous threads of execution nodes of the distributed database, asynchronous transformation and compaction of key-value pairs of data that corresponds to the plurality of transactional queries. The subject technology performs, using asynchronous threads of execution nodes of the distributed database, asynchronous transformation and compaction of a set of secondary indexes that corresponds to the plurality of transactional queries. The subject technology processes, using transactional threads in the execution nodes, the plurality of transactional queries to generate results data, the asynchronous threads performing the asynchronous transformation and compaction while the transactional threads generate the results data.

Abstract: The subject technology performs, using asynchronous threads of execution nodes of a distributed database, asynchronous transformation and compaction of key-value pairs of data that correspond to a plurality of transactional queries, the asynchronous threads transforming the key-value pairs from an initial format to a commit format that includes a commit time of data committed to the distributed database, the asynchronous threads compacting the key-value pairs by deleting the key-value pairs in the initial format. The subject technology processes, using transactional threads in the execution nodes, the plurality of transactional queries to generate results data, the asynchronous threads performing the asynchronous transformation and compaction while the transactional threads generate the results data. The subject technology stores the results data.

Abstract: Techniques are described by which a routing protocol, such as border gateway protocol (BGP), is extended to control propagation and importation of information using route targets (RTs) specified as bitmasks that encode link administrative group information. For example, a network control device (e.g., controller) is configured to allocate one or more subset of resources (e.g., nodes or links) of an underlay network to each of one or more virtual networks established over the underlay network. The controller generates a bitmask encoded with link administrative group information of the one or more links. The controller then outputs, to a plurality of provider edge (PE) routers that are participating in a respective virtual network, a routing protocol message to advertise the one or more subset of resources, wherein the routing protocol message includes a route target specified as the bitmask.

Abstract: The subject technology receives a query, the query including a statement for performing a join operation on a first table and a second table. The subject technology executes, by an execution node using a generated query plan, the query. The subject technology performs, during execution of the query by the execution node, a runtime range pruning process. The subject technology determines a set of range sets for pruning, each range set including a set of columns from the first table, the set of columns being removed from undergoing a read operation as part of executing the query. The subject technology determines, based on a range bloom vector, a set of rows in a particular range set of the first table to avoid scanning in connection with the read operation. The subject technology performs the read operation based a remaining set of rows.

Abstract: The subject technology determines whether a key exists in a parent table associated with a first transaction. The subject technology performs a first write operation on a child table. The subject technology determines whether a duplicate key exists in the child table based on the key of the first write operation. The subject technology determines whether there is a conflict with the key. The subject technology, in response to determining that there is no conflict with the key, performs a second write operation on a secondary index table of the child table. The subject technology determines whether a particular duplicate key exists in the secondary index table based on a particular key from the second write operation. The subject technology, in response to determining that there is the particular duplicate key in the secondary index table, throws a uniqueness exception.

Abstract: In some implementations, a network device may receive, from a first other network device, a route that includes a label, a prefix, and a next-hop identifier. The network device may generate, based on receiving the route, a composite tunnel attribute that includes an identifier of the network device and a label allocated by the network device. The network device may modify, based on generating the composite tunnel attribute, the route to cause the composite tunnel attribute to be included in the route. The network device may send, based on modifying the route, the route to a second other network device.

Abstract: The subject technology initiates an online index building process of an index of a hybrid table. The subject technology includes, in the index, a new index record for each record from the hybrid table. The subject technology validates the index. The subject technology retrieves a first metadata version of the hybrid table from a metadata database. The subject technology retrieves a second metadata version of the hybrid table from a distributed data store. The subject technology compares the first metadata version with the second metadata version. The subject technology determines that the second metadata version is less than or equal to the first metadata version. The subject technology, in response to successfully validating the index, indicates in a particular entry of the index that validation of the index has succeeded.

Abstract: In some implementations, a network device may receive one or more packets via an incoming interface of the network device. The network device may forward, or refraining from forwarding, based on a destination address associated with the one or more packets and the incoming interface of the network device, the one or more packets. The network device may receive, prior to receiving the one or more packets, route information indicating the destination address, and at least one of a set of one or more authorized incoming interfaces of the network device or a set of one or more authorized identifiers that are associated with the destination address and may save the route information in an entry of a data structure. Forwarding, or refraining from forwarding, the one or more packets may further be based on the entry of the data structure.

Abstract: The subject technology receives a statement to initiate an online index building process of an index. The subject technology determines that the index can be generated. The subject technology performs a write operation to store an index record indicating an initial status of the online index building process. The subject technology performs a statement fencing process. The subject technology performs a back-filling process of the index. The subject technology validates the index.

Abstract: An interworking network device receives from a first other network device associated with an MPLS domain, a route that includes a label, a prefix, and a next-hop identifier that indicates the first other network device. The interworking network device thereby generates a prefix SID attribute that includes a SID value and information indicating a structure of the SID value, wherein a LOC portion of the SID value identifies the interworking network device, and a first sub-portion of a FUNCT portion of the SID value identifies an endpoint behavior of the interworking network device in association with the first other network device. The interworking network device modifies the route to cause the next-hop identifier to indicate the interworking network device, and to cause the route to include the prefix SID attribute. The interworking network device thereby sends the route to a second other network device associated with an SRv6 domain.

Abstract: The subject technology obtains a read timestamp of a first transaction. The subject technology performs a first read operation on a parent table associated with the first transaction to determine a set of committed versions of the parent table. The subject technology determines whether a key exists in the parent table based on the first transaction. The subject technology, in response to the key existing in the parent table, performs a first write operation on a child table. The subject technology determines whether a duplicate key exists in the child table. The subject technology, in response to determining that there is no duplicate key in the child table, determines whether there is a conflict with the key. The subject technology, in response to determining that there is no conflict with the key, performs a second write operation on a secondary index table of the child table.

Abstract: The subject technology determines that a first visible version of a key is not one of a N number of newest versions of the key based on searching for the key in a regular space to locate the first visible version of the key. The subject technology performs a search of an undo space to locate a second visible version of the key. The subject technology determines whether the first visible version or the second visible version of the key is newer. The subject technology provides a newer version of the key between the first visible version and the second visible version of the key.

Abstract: A network device may receive a non-Internet protocol (non-IP) frame with a particular size and may compare the particular size to a maximum transmission unit (MTU) associated with a path between the network device and another network device. The network device may divide the non-IP frame into fragments, based on the particular size being greater than the MTU and may prepend generic fragmentation headers to the fragments to generate fragments with headers, based on the particular size being greater than the MTU. The network device may add generic fragmentation header labels and transport labels to the fragments with the headers to generate fragments with headers and labels, based on the particular size being greater than the MTU. The network device may transmit the fragments with the headers and the labels to the other network device, via the path, based on the particular size being greater than the MTU.

Abstract: Techniques are described for using route target constraint to filter routes advertised to a node in a seamless Multiprotocol Label Switching (MPLS) network. For example, a first router of a first network may generate a first border gateway protocol (BGP) message to advertise routing information for a first node of the first network, the first BGP message indicating a transport class and specifying an address-specific route target, the transport class comprising one or more tunnels to the first node that share common characteristics. In response to receiving a second BGP message originated by second node of a second network, the second BGP message comprising the address-specific route target, the first router sends the first BGP message to a second router of the second network for sending to the second node to cause the second node to import the routing information.

Abstract: In an example, a method comprises executing, by an access network user plane function (ANUP) for a mobile network, an access network protocol to implement a connection with a user equipment (UE); implementing, by the ANUP, based on session data received from a control plane function of a mobile core network for the mobile network, an interface with a data network; and routing or switching, by the ANUP, packets between the connection with the UE and the interface with the data network.

Abstract: In an Ethernet Virtual Private Network (EVPN) with a multi-homed Ethernet Segment (MHES), potential problems of core isolation are avoided in a way that also avoids the potential “split brain” problems.

Abstract: In general, techniques are described for extending Mobile User Plane-Gateway architecture Border Gateway Protocol (BGP) signaling to an integrated Access Network-User Plane (ANUP) function in mobile networks. In an example, a method comprises receiving, by a computing system, a routing protocol message comprising second tunnel information for a packet data unit (PDU) session for a User Equipment (UE) and comprising data indicating a routing instance or a UE address for the User Equipment; by the computing system, based on matching the second tunnel information with first tunnel information sent or received on an interface with a mobile network control plane function, generating forwarding information to map the UE address to the PDU session or to map the PDU session to the routing instance; and based on the forwarding information, outputting, by the computing system, a packet associated with the PDU session.

Abstract: BIER architecture currently does not support anycast, in that each BIER Forwarding Router (BFR) has its own unique BFR-prefix and BFR-ID. BIER signaling protocols also check if there are duplicate BFR-IDs advertised. Anycast support with BIER is described. The description updates (e.g., relaxes and/or removes some requirements of) RFC 8279, RFC 8401, and RFC 8444.