Patent classifications
H04L61/45
SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS
The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.
SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS
The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.
LDAP query optimization with smart index selection
The present disclosure relates generally to Lightweight Directory Access Protocol (LDAP), and more particularly, to techniques for improving query performance on an LDAP server. One particular technique includes receiving a LDAP query having search criteria, identifying one or more search filters within the search criteria, determining candidate indices based on the identified one or more search filters, evaluating the candidate indices based on statistics collected for the candidate indices, selecting one or more indices from the candidate indices based on the evaluating, and executing the LDAP query on an LDAP directory using the selected one or more indices.
Virtualized fabric name server for storage area network
Techniques for a virtualized fabric name server for a storage area network are described herein. An aspect includes operating a storage area network, the storage area network including a hybrid control plane. Another aspect includes managing, using a virtualized fabric name server and the hybrid control plane, the storage area network, wherein the virtualized fabric name server is disposed in a container that is hosted on an element of the storage area network.
INTERNET OF THINGS COMMUNICATION METHOD AND APPARATUS
The present disclosure provides an Internet of Things communication method and apparatus. The method includes: receiving a resource addition request transmitted by a client, where the resource addition request is used to indicate addition of an identification of a reference resource into a collection resource on the first server; performing communication with the reference resource according to an access location of the reference resource and the identification of the reference resource; adding the identification of the reference resource into the collection resource if the communication between the first server and the reference resource is successful. In this way, before adding the reference resource, the first server first performs communication with the reference resource, and adds the identification of the reference resource into the collection resource after determining that the communication between the first server and the reference resource is successful, thereby ensuring the validity of the reference resource.
Server node selection method and terminal device
Methods and terminal devices, including computer programs encoded on computer storage media, for selecting a server node. According to one of the methods, a terminal device first sends a connection request to one server node, and then sends a connection request to another server node after a time interval T. The terminal device first sends a connection request to a first server node. If the terminal device receives, within a first preset duration T, response information fed back by the first server node, the terminal device does not need to send a connection request to another server node. This helps save resources. In addition, the terminal device may establish a connection to a server node corresponding to received response information, and does not need to wait for feedback from another server node. This helps reduce a delay in establishing a connection between the terminal device and a server node.
SELECTING INTERFACES FOR DEVICE-GROUP IDENTIFIERS
In one embodiment, a computer networking device calculates a first hash value for an identifier of a group of computing devices, as well as a second hash value for the identifier of the group of computing devices, with each hash value being at least in part on the identifier of the group of computing devices and an identifier of the respective interface. The computer networking device may also analyze the first hash value with respect to the second hash value and select the first interface for association with the identifier of the group of computing devices based at in part on the analyzing. The computer networking device may further store an indication that the identifier of the group of computing devices is associated with the first interface.
SELECTING INTERFACES FOR DEVICE-GROUP IDENTIFIERS
In one embodiment, a computer networking device calculates a first hash value for an identifier of a group of computing devices, as well as a second hash value for the identifier of the group of computing devices, with each hash value being at least in part on the identifier of the group of computing devices and an identifier of the respective interface. The computer networking device may also analyze the first hash value with respect to the second hash value and select the first interface for association with the identifier of the group of computing devices based at in part on the analyzing. The computer networking device may further store an indication that the identifier of the group of computing devices is associated with the first interface.
TECHNIQUES FOR PROVIDING LONG UNIFORM RESOURCE LOCATORS THROUGH A SECURE ENVIRONMENT
A method and system for providing web resources having long identifiers through a zero trust network environment. The method comprises receiving a request from a client device to access a web resource through a zero trust network environment, wherein the web resource is external to the zero trust network environment, the request including a first uniform resource locator (URL), and the resource further including a second URL having a first length; fetching the web resource based on the first URL; generating a shortened alternate URL based on at least a portion of the second URL, in response to determining that the first length exceeds a predetermined threshold; generating an alternate resource, the alternate resource including the shortened alternate URL replacing the second URL; and providing the alternate resource to the client device.
Obscured routing
Systems and techniques are provided for obscured routing. A computing device may send stacks of identifiers to neighbor computing devices in a network. Each stack of identifiers may include a unique identifier for the neighbor computing device to which it is sent. The computing device may send a notification identifying a destination computing device to the neighbor computing devices. The computing device may receive stacks of identifiers from the neighbor computing devices. The received stacks of identifiers may include completed routes to the destination computing device. Each completed route may be specified by unique identifiers added to the stack of identifiers by computing devices in the network. A unique identifier in each stack of identifiers may not be resolvable to an address by the computing device. The computing device may send a message a neighbor computing device based on a unique identifier in a chosen stack of identifiers.