Cisco Technology, Inc.

Bandwidth Inc.

Bryan C Turner

John Albert Toebes

Douglas Jay Walker

Billy Gayle Moon

Gregory Pelton

Syed Mohsin Reza Zaidi

James J Miner

Jeremy Howard

Alan Woodrow Bevier

Deepali Apurva Brahmbhatt

Adam Covati

Charles L Baker

Techniques are disclosed for correlating delivery receipt (DLR) messages with short message service (SMS) messages sent in an application-to-person (A2P) manner through a messaging network comprising multiple data centers. SMS and DLR messages are received and stored into a correlator comprising a local and a global storage area. It is then determined whether a received DLR message corresponds to a received SMS message within a local timeout period associated with the received SMS message. When corresponding DLR and SMS messages have been received they are correlated and the DLR message is sent to the sending SMS client. When corresponding DLR and SMS messages have not been received the location of a global storage area of a correlator in a data center where the DLR and SMS messages are intended to be stored is derived. The DLR and SMS messages are then moved to the derived global storage area of the correlator in a data center where it is again determined whether a received DLR message corresponds to a received SMS message within a global timeout period associated with the received SMS message. When corresponding DLR and SMS messages have not been received within the global timeout period, a fail notification is sent to the sending SMS client. Other embodiments are disclosed.

Techniques for correlating delivery receipt messages in a communications network

Techniques are described for single or multi-factor authentication. An access request is received followed by a prompt for authentication data comprising a segment of a continuous rolling authentication code. Upon receipt of the segment of a continuous rolling authentication code, it is compared to another version of the continuous rolling authentication code generated by an algorithm and shared secret key known to both parties. The access request may be authenticated when the segment of the rolling authentication code received in response to the prompt for authentication data matches a segment the continuous rolling authentication code generated. Otherwise, it is rejected.

Rolling code authentication techniques

Techniques are disclosed for passing short message service (SMS) messages between sending and receiving SMS service providers over a network comprising a default data center and one or more alternative data centers. The default data center may receive message segments of an SMS message from the sending SMS provider into a local storage area of a concatenator comprising a local and a global storage area. The message segments may include segmentation information indicative of a number of message segments associated with the SMS message, routing information, the sending SMS provider, and the receiving SMS provider. When all the message segments have been received within a local timeout period, the default data center concatenates the message segments into a single SMS message and sends it to the receiving SMS service provider. When not all of the message segments have been received, the default data center moves the message segments to the global storage area sends the received message segments to an alternative data centers. The alternative data center receives all of the message segments from one or more data centers into its global storage area; concatenates them into a single SMS message; and sends the concatenated SMS message to the receiving SMS service provider. Other embodiments are disclosed.

Techniques for combining segmented messages in a communications network

In one embodiment, a method comprises supplying, by a network node to a peer network node, a randomization seed assigned to the network node for generating a prescribed sequence of pseudorandom numbers according to a prescribed pseudorandom number generation function; encoding each data block having a corresponding position in an ordered sequence of a stream of data blocks, into a corresponding differentially-encoded data block based on applying a product of the corresponding data block and the corresponding pseudorandom number, having the corresponding position in the prescribed sequence, to a corresponding successively-preceding differentially-encoded data block from the prescribed ordered sequence, the data block recoverable solely based on a determined difference between the corresponding differentially-encoded data block and the corresponding successively-preceding differentially-encoded data block relative to the corresponding pseudorandom number; and outputting each differentially-encoded data block in a corresponding packet that identifies the network node and the corresponding position.

Streaming network coding

Each data file of a distributed file system is identified by a corresponding globally-unique object identifier that is independent of any attribute of the data file. A node in the distributed file system has a file system that includes a plurality of directory entries, where each directory entry has a file name field, an attributes field, and an object identifier field configured for specifying a globally-unique object identifier. The globally-unique object identifier is universally reachable by any node of the distributed file system and uniquely identifies the data file, enabling the data file to be universally identifiable by any node based on the corresponding object identifier. The data file can be stored independently of a device file system based on providing a resolution between the data file name and its object identifier, followed by a resolution between the object identifier and a selected location for the data file.

Arrangement for a distributed file system having data objects mapped independent of any data object attribute

In one embodiment, a method comprises generating a first executable program optimized for an executable system based on compiling a program relative to an initial set of independent optimization metrics; determining first performance metrics based on the executable system executing the first executable program; adjusting the initial set of independent optimization metrics based on the first performance metrics to generate a second set of independent optimization metrics; and generating a second executable program, based on compiling the program relative to the second set of independent optimization metrics, for improved execution of the program in the executable system.

Automated improvement of executable applications based on evaluating independent execution heuristics

In one embodiment, a method comprises receiving an application that describes functions according to a prescribed symbol manipulation language, the prescribed symbol manipulation language a non-Turing complete language that does not permit partial functions and describes the functions independent of any attribute of any computing system; identifying, in the application, a distribution annotation that identifies a candidate element in the application, the candidate element configured for execution in a distributed computing operation by a distributed computing system comprising two or more distributed computing devices; generating one or more variants of the application based on executing a nondestructive transformation of the application relative to prescribed equality axioms, at least one of the variants containing a corresponding semantically-equivalent variation of the candidate element; and selecting one of the variants as an optimization for execution of the application by the distributed computing system relative to prescribed metrics.

Optimizing symbol manipulation language-based executable applications for distributed execution

A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.

Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements

In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on at least one of a workflow item or one or more entities of an ad hoc geospatial directory, the workflow item including at least one of the lambda functions for a workflow in the geospatial application; and executing by the computing device the at least one lambda function to form, in the geospatial application, a work entity that associates the workflow item with one of the entities, the work entity defining execution of the workflow on the one entity.

Ad hoc generation of work item entity for geospatial entity based on symbol manipulation language-based workflow item

In one embodiment, a method includes receiving data that indicates a maximum number of end nodes with which to set up real-time data sessions that is less than a conference number of nodes whose data is mixed in a single real-time data conference. Real-time data sessions are established with a connected set of a connected number of nodes not greater than the maximum number. A mix of the real-time data received from the connected set is presented to a user of the first node. Local real-time data is received from a user. The received real-time data is distributed by mixing and sending. This includes, for each individual node in the connected set, mixing received local real-time data with real-time data received from other nodes in the connected set different from the individual node to form individual mixed real-time data, and sending the individual mixed real-time data to the individual node.

Distributed real-time data mixing for conferencing

In one embodiment, a method comprises receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities.

Ad hoc geospatial directory of users based on optimizing non-Turing complete executable application

Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information.

Arrangement for recovery of data by network nodes based on retrieval of encoded data distributed among the network nodes

Methods and apparatus for authenticating a user are disclosed. According to one aspect of the present invention, a method for authenticating a user includes displaying a first representation of a challenge. The challenge is based on a ruleset. The method also includes receiving a first input, determining if the first input furthers a successful completion of the first representation of the challenge, and determining if the first input completes the first representation of the challenge. If it is determined that the first input completes the first representation of the challenge and that the first input furthers the successful completion of the first representation of the challenge, the method further includes positively augmenting a security indicator.

Growing community of inventors

Apex, NC, United States of America

Bryan C Turner