System for association of customer information across subscribers

Information

  • Patent Grant
  • 10728361
  • Patent Number
    10,728,361
  • Date Filed
    Tuesday, May 29, 2018
    6 years ago
  • Date Issued
    Tuesday, July 28, 2020
    4 years ago
Abstract
The disclosed technology relates to a context service system configured to receive, from a subscriber, a shared customer lookup request that includes a first customer data identifier and identify, in a shared data partition, a second customer data identifier associated with the first customer data identifier. The context service system is further configured to determine that the second customer data identifier is associated with customer information in a subscriber data partition and transmit, to the subscriber system, the customer information from the subscriber data partition.
Description
TECHNICAL FIELD

The subject matter of this disclosure relates in general to the field of computerized management of customer information, and more specifically to a platform for identifying associations between customer information.


BACKGROUND

Businesses and other organizations often store information associated with customers or other individuals or entities in order to better serve those customers or for some other purpose. For example, an e-commerce platform may store a customer's name and mailing address for shipping products to the customer, account name and password to enable a customer to login to an e-commerce website or for other services, age, and/or an order history. Some e-commerce platforms may use the customer information in order to provide better and more customized service such as suggesting other products that the customer may be interested in. Other types of platforms (e.g., social media platforms, financial services platforms, etc.) may store user profile information, activity information on the platform or other platforms, or other information.


However, in many cases, the information collected may be incomplete or fragmented. For example, the e-commerce platform in the example above may receive a call from customer from a phone number. Although the e-commerce platform has the customer's phone number, it is unable to retrieve other information associated with the customer (e.g., the customer name, mailing address, or order history) because the e-commerce platform does not have the customer's phone number in the customer record. Even though the e-commerce platform has access to the phone number and other customer information, the e-commerce platform is unable to leverage the customer information because the customer information is fragmented and there is no association between the phone number and the rest of the customer information.


The fragmentation of customer information may lead to a degraded level of service and/or an increase the time and effort needed to provide services to customers, which increases costs to the business. For example, instead of being able to automatically retrieve the customer record, a customer service representative of the e-commerce platform may need to request additional information from the customer (e.g., an account name, an order number, etc.) in order to identify the customer record and retrieve it.





BRIEF DESCRIPTION OF THE FIGURES

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1 is a conceptual block diagram illustrating an example network environment that includes a context service system, in accordance with various embodiments of the subject technology;



FIG. 2 is a conceptual block diagram illustrating an example context service system, in accordance with various embodiments of the subject technology;



FIG. 3 is a conceptual block diagram illustrating an example context service data store, in accordance with various embodiments of the subject technology;



FIG. 4 shows an example process for providing a subscriber system with a customer record from a data partition associated with the subscriber system, in accordance with various embodiments of the subject technology;



FIG. 5 shows an example process for providing a subscriber system with a customer record from a shared data partition, in accordance with various embodiments of the subject technology;



FIG. 6 is a conceptual block diagram illustrating an example scenario, in accordance with various embodiments of the subject technology; and



FIGS. 7A and 7B illustrate examples of systems in accordance with some embodiments.





DESCRIPTION OF EXAMPLE EMBODIMENTS

The detailed description set forth below is intended as a description of various configurations of embodiments and is not intended to represent the only configurations in which the subject matter of this disclosure can be practiced. The appended drawings are incorporated herein and constitute a part of the detailed description. The detailed description includes specific details for the purpose of providing a more thorough understanding of the subject matter of this disclosure. However, it will be clear and apparent that the subject matter of this disclosure is not limited to the specific details set forth herein and may be practiced without these details. In some instances, structures and components are shown in block diagram form in order to avoid obscuring the concepts of the subject matter of this disclosure.


Overview


The disclosed technology relates to a context service system configured to receive, from a subscriber, a shared customer lookup request that includes a first customer data identifier and identify, in a shared data partition, a second customer data identifier associated with the first customer data identifier. The context service system is further configured to determine that the second customer data identifier is associated with customer information in a subscriber data partition and transmit, to the subscriber system, the customer information from the subscriber data partition.


EXAMPLE EMBODIMENTS

As described above, fragmentation of customer information and/or the incompleteness of customer records may lead to various detrimental results including, for example, a degraded level of service, an increase the time and effort needed to provide services, or an increase in costs to provide services. In order to make their customer records more complete and robust, organizations may be tempted to share and exchange information about customers through partnerships or through third-party data brokers. However, the information collected may also include personally identifiable information (PII) or other private information that cannot (legally) be shared without the consent of the customer. In other cases, an organization may not wish to share collected information for various other business reasons. For example, sharing collected information may anger customers or the public. Furthermore, the information collected may also be a valuable resource that may serve as a competitive advantage over other businesses or organizations.


Aspects of the subject technology relate to a context service system configured to leverage the customer information shared across multiple subscribers and allow subscribers to share associations between different elements of customer information without exposing the customer information. As will be discussed in further detail, the context service system generates a shared partition of data that contains associations of different elements of customer information provided by a subscriber group. The context service system facilitates the querying of the shared partition of data by a subscriber to determine whether a first element of customer information provided by the subscriber is associated with another element of customer information that is already known to the subscriber.


By querying the context service system, the subscriber can determine whether an element of customer information is associated with a customer record already known to the subscriber. As an illustrative example, a call center system may receive a phone call and identify the phone number (e.g., using caller ID) associated with the phone call. However, the phone number may be previously unknown to the call center system. Accordingly, the call center system may not know any context for the call and may not be able to provide certain services or service levels because of the lack of context. In response to receiving the call, the call center system may transmit a customer lookup request that includes the unknown phone number to the context service system.


The context service system may determine whether the phone number is associated with any other items of customer information in a shared partition of data generated based on information from a number of subscribers. If an association is found with another element of customer information (e.g., an address or email address), the context service system may determine if the element of customer information is already known to the call center system. If the element of customer information is already known to the call center system, the context service system may inform the call center system that the unknown phone number is actually associated with the element of customer information (e.g., an address or email address) or provide the call center system with the call center system's record including the element of customer information.


In this way, the call center system may determine that the previously unknown phone number is actually associated with an existing customer record (e.g., the customer record with the address or email address), update the call center system's customer record, and/or provide additional services or benefits enabled by the new contextual information (e.g., the customer record) provided by the context service system. Furthermore, although the context service system leverages information shared across a number of subscribers in the shared partition of data, the context service system does not expose any elements of customer information that is unknown to a subscriber. For example, in the example above, the call center system already knows of the phone number and the customer record for the caller, the context service system merely provided the association between the two elements of customer information. Accordingly, the context service system prevents and/or limits the dissemination of customer information, including personally identifiable information (PII) or other sensitive information.


For illustrative purposes, various embodiments described herein may refer to customer information or elements of customer information. However, these embodiments and others may also readily apply to other information stored by subscribers and not necessarily a “customer.” For example, other types of information that is applicable include account information, user information, or profile information. Furthermore, the information may be associated with an individual, a company, an organization, or other entity.


Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustrative purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without departing from the spirit and scope of the disclosure.



FIG. 1 is a conceptual block diagram illustrating an example network environment 100 that includes a context service system 160, in accordance with various embodiments of the subject technology. The network environment 100 described with respect to FIG. 1 includes the context service system 160, a subscriber system 120, a customer device 140, a third-party system 150, and other subscriber systems 130. However, in other embodiments, other network environment configurations may also be used.


The subscriber system 120 and other subscriber systems 130 are configured to communicate with the context service system 160 via a network 110. The network 110 may include, for example, any one or more of a cellular network, a satellite network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a broadband network (BBN), the Internet, and the like. The network environment 100 can be a public network, a private network, or a combination thereof. The network environment 100 may be implemented using any number of communications links associated with one or more service providers, including one or more wired communication links, one or more wireless communication links, or any combination thereof. Additionally, the network 110 can be configured to support the transmission of data formatted using any number of protocols.


The subscriber system 120 and/or subscriber systems 130 may be associated with a financial services entity, a medical industry entity, a business entity, an e-commerce entity, or any other entity that deals with customer information, account information, user information, or profile information. The subscriber system 120 and/or subscriber systems 130 may also be associated with a particular function or purpose such as a call center, a contact center, a sales organization or group, a customer service center, a help desk, or other group that may deal with customer information, account information, user information, or profile information. The subscriber system 120 and/or subscriber systems 130 may each manage a separate database of customer information.


According to some embodiments, the subscriber system 120 may obtain an element of customer information such as a phone number, email address, mailing address, user name, or other identifier. The element of customer information may be generated by the subscriber system or received via an external party such as customer device 140 or third-party system 150. For example, the third-party system 150 may be configured to perform a task with the subscriber system 120 via an application programming interface (API) provided by the subscriber system 120 and the third-party system 150 may provide the subscriber system 120 with the element of customer information for a user, account, or other entity during the course of performing that task.


In another example, the customer device 140 may communicate with the subscriber system 120 and provide, either directly or indirectly (e.g., via the communication protocols used), the element of customer information. The communications may occur via, for example, a cellular network, a landline telephone network, an short message service network, a chat or messaging service, or any number of other communication technologies.


The context service system 160 enables the subscriber system 120 to determine whether the element of customer information is associated with other information that is already in the subscriber system's database of customer information by leveraging customer information associated with the other subscriber systems 130 without revealing any of the customer information associated with the other subscriber systems 130.



FIG. 2 is a conceptual block diagram illustrating an example context service system 200, in accordance with various embodiments of the subject technology. The context service system 200 described with respect to FIG. 2 includes a subscriber interface 210, a context engine 220, and a context service data store 230. The context service data store 230 is shown to include a shared data partition 240 and one or more subscriber data partitions. However, in other embodiments, configurations may also be used including additional components, fewer components, or alternative components.


The subscriber interface 210 is configured to communicate with one or more subscribers. For example, the subscriber interface 210 may receive customer lookup requests that include an element of customer information such as a customer data identifier and provide subscribers with customer records or other customer data identifiers associated with the element of customer information in the customer lookup request.


As will be discussed further below, the context engine 220 is configured to identify other customer information that is associated with the element of customer information in the customer lookup request and determine whether the subscriber that submitted the customer lookup request has access to the associated customer information.


The context service data store 230 may store customer information associated with the one or more subscribers of the context service system 200. According to some embodiments, the context service data store 230 may include a shared data partition 240 and a subscriber data partition for each subscriber of the context data store. For example, in FIG. 2, subscriber data partition 250 may be associated with the subscriber system 120 of FIG. 1 and the other subscriber data partitions 260 may be associated with the other subscriber systems 130 of FIG. 1.


The subscriber data partitions 250 and 260 include sets of customer information (e.g., customer records) known by their corresponding subscriber. For example, subscriber data partition 250 may include sets of customer information or customer records that the subscriber system 120 of FIG. 1 is aware of. Subscriber data partition 250 may be provided by the subscriber and updated over time. In some embodiments, the subscriber data partition 250 is synchronized with a data store managed by the subscriber system (e.g., subscriber system 120 of FIG. 1). Although FIG. 2 is shown with the context service data store 230 including the subscriber data partitions 250 and 260, in other embodiments, one or more subscriber data partitions may be stored by a subscriber system and accessed by the context service system 200 via network communications.


The shared data partition 240 includes sets or records of related customer information that is generated based on the customer information in the subscriber data partitions 250 and 260 or customer information provided by subscriber systems. The information in the shared data partition 240 may include information that each subscriber specifically permits to be used by the context service system 200 to provide associations to other systems.


According to some embodiments, an end-to-end encryption scheme may be used to protect the customer information stored by the context service data store 230. In other words, the subscriber systems may encrypt some or all data transmitted and/or stored by the context service data store 230. For example, a subscriber system may encrypt the entire customer record for all customer records to be stored by the context service system 200 or a portion of the customer records (e.g., any personally identifiable information (PII), private information, or otherwise sensitive information). The encryption and decryption scheme and/or various parameters used for encryption and decryption may be known only to the subscriber system. In this way, a subscriber may be assured with an additional layer of protection that prevents other subscribers or even the context service system 200 from unpermitted access to the subscriber's encrypted customer information.



FIG. 3 is a conceptual block diagram illustrating an example context service data store 330, in accordance with various embodiments of the subject technology. For illustrative purposes, the context service data store 330 includes a shared data partition 340, an ACME data partition for a subscriber named “ACME,” and a Z Corp data partition for a subscriber named “Z Corp.” Each data partition may include a number of sets of associated customer information or customer records. To conserve space, each of the data partitions 340, 350, and 360 in FIG. 3 are shown with one customer record or set of associated customer information each. For example, ACME data partition 350 includes customer record 355, shared data partition 340 includes customer record 345, and Z Corp data partition 360 includes customer record 365.


The context service data store 330 is implemented using an encryption scheme where all or portions of the customer information is encrypted using a cryptographic function. The encryption and decryption scheme and/or various parameters used for encryption and decryption may be known only to the subscriber system or entities that the subscriber system entrusts in order to provide an additional layer of protection that prevents other subscribers or even the context service system 200 from unpermitted access to the subscriber's encrypted customer information. For example, in customer record 355 in the ACME data partition 350, the customer information 358 in the customer record is encrypted. Similarly, in customer record 365 in the Z Corp data partition 360, the customer information 368 in the customer record is encrypted.


As will be explained in further detail below, in order to allow the context service system to determine whether an element of customer information is associated with the encrypted information that in the subscriber data partition, the subscriber system may hash each element of customer information using a subscriber specific cryptographic salt value and a hash function. As an added advantage, the hash value for the element of customer information enables the context service system to determine whether the element of customer information is associated with a customer record in the subscriber data partition without revealing the element of customer information to the context service system or any other party.


For example, for the email address “fsmith@email.com” in customer record 355, the ACME subscriber system may use an “ACME” subscriber salt value to generate a customer data identifier (e.g., a hash value) for the email address. The ACME subscriber system may then transmit the customer data identifier to the context service system for storage in the ACME data partition 350. Similarly, in customer record 365, the Z Corp subscriber system may generate a customer data identifier (e.g., a hash value) for the email address, mobile phone number, or home phone number based on a “ZCORP” subscriber salt value. The Z Corp subscriber system may then transmit the customer data identifiers to the context service system for storage in the Z Corp data partition 360.


Hash values generated based on a shared cryptographic salt value further enable the context service system to determine whether an element of customer information is associated with the encrypted information that in the subscriber data partition based on information in the shared data partition.


For example, for the email address “fsmith@email.com” in customer record 355, the ACME subscriber system may use a shared salt value, which is represented by the “SHARED” string in the hash function shown in customer record 355, to generate a customer data identifier (e.g., a hash value) for the email address. The ACME subscriber system may then transmit the customer data identifier to the context service system for storage in the ACME data partition 350. Similarly, in customer record 365, the Z Corp subscriber system may generate a customer data identifier (e.g., a hash value) for the email address, mobile phone number, or home phone number based on the shared salt value. The Z Corp subscriber system may then transmit the customer data identifiers to the context service system for storage in the Z Corp data partition 360.


The context service system may identify the hashes of customer information in customer records across the various subscriber data partitions that have been hashed using the shared salt value and aggregate them into the shared data partition 340. For example, customer record 345 includes all of the hash values of customer information that have been hashed using the shared salt value. Since the context service system does not store the actual customer information in the context service data store 330 but instead stores customer data identifiers (e.g., the hash values) associated with the customer information, the customer information is prevented from being shared or accessed either intentionally or unintentionally. Furthermore, in some embodiments, the context service system may not know any of the salt values (e.g., the shared salt value or the subscriber salt values) used to encrypt the customer information. Accordingly, even the context service system may not access the customer information.


According to some embodiments, a key management server may be configured to disseminate salt values to the subscriber systems. For example, the key management server may provide a subscriber system with a shared salt value that is also provided to all other subscriber systems as well as a subscriber salt value that is only provided to the subscriber system. Accordingly, a subscriber system may use the various salt values to determine which elements of subscriber's customer information are to be used by the context service system to assist other subscribers.


Although FIG. 2 and FIG. 3 show only a single shared data partition 340 for illustrative purposes, in other embodiments, multiple shared data partitions may also be implemented. Multiple shared data partitions may allow for subscribers to have different sharing levels with different groups. For example, shared data partitions may be established for a group of business partners, a group of competitors, a group of customers, and/or a general public group and each group may be assigned a different shared salt value for the group. Each subscriber system belonging to the group may obtain a shared salt value for the group of subscribers. Accordingly, a subscriber system may receive multiple shared salt values for a multitude of groups and use the shared salt values to determine which elements of customer information to allow the context service system to use to assist other subscribers.



FIG. 4 shows an example process 400 for providing a subscriber system with a customer record from a data partition associated with the subscriber system, in accordance with various embodiments of the subject technology. It should be understood that, for any process discussed herein, there can be additional, fewer, or alternative steps performed in similar or alternative orders, or in parallel, within the scope of the various embodiments unless otherwise stated. The process 400 can be performed by a system such as, for example, the context service system 200 of FIG. 2 or a similar computing platform.


A subscriber system may receive an element of customer information during operation of the subscriber system. For example, a call center system may receive a call or text from a phone number. Alternatively, the call center may receive an email or message from a messaging service from an email address or user name that is not in the call center system's database. The subscriber system may attempt to determine if there is any additional contextual information associated with the element of customer information.


According to some embodiments, the subscriber system may maintain a local database of customer information and determine if the element of customer information is associated with other customer information (e.g., a customer account or record). However, in other embodiments, the subscriber system may not maintain a local database of customer information or may rely on the context service system to store the subscriber system's customer information. Accordingly, the subscriber system may generate a subscriber customer lookup request that includes a customer data identifier associated with the element of customer information and transmit the request to the context service system. In some embodiments, the customer data identifier may be the element of customer information itself. However, in embodiments where encryption is used, the customer data identifier may be generated based on the application of a hashing function on the element of customer information using a subscriber salt value for the subscriber system.


At operation 405, the context service system receives the subscriber customer lookup request and determines whether the customer data identifier in the subscriber customer lookup request is associated with a customer record in the subscriber's data partition at operation 410. If a customer record is associated with the customer data identifier, the customer record may be returned to the subscriber system at operation 415.


If no customer record is found, at operation 420, the context service system may notify the subscriber system that no customer record was found in the subscriber data partition associated with the subscriber system. If no customer record was found in the subscriber data partition associated with the subscriber system, the subscriber system may wish to query the shared data partition for customer records associated with the element of customer information, which leads to process 500 of FIG. 5. Alternatively, even if a customer record is found in the subscriber data partition, the subscriber system may wish to determine whether other information in the subscriber data partition may also be associated with the element of customer information and the customer record that was found. This can also be accomplished through process 500 of FIG. 5.



FIG. 5 shows an example process 500 for providing a subscriber system with a customer record from a shared data partition, in accordance with various embodiments of the subject technology. It should be understood that, for any process discussed herein, there can be additional, fewer, or alternative steps performed in similar or alternative orders, or in parallel, within the scope of the various embodiments unless otherwise stated. The process 500 can be performed by a system such as, for example, the context service system 200 of FIG. 2 or a similar computing platform.


To query the shared data partition for customer records associated with the element of customer information, the subscriber system may generate a shared customer lookup request that includes a first customer data identifier associated with the element of customer information and transmit the request to the context service system. In some embodiments, the first customer data identifier may be the element of customer information itself. In other embodiments, the first customer data identifier may be generated by applying a hash function to the element of customer information using a shared salt value.


At operation 505, the context service system may receive the shared customer lookup request including the first customer data identifier. The context service system may query the shared data partition to determine if there is another customer data identifier (e.g., another hash value associated with different element of customer data) that is associated with the first customer data identifier included in the shared customer lookup request.


At operation 510, the context service system may identify a second customer data identifier in the shared data partition that is associated with the first customer data identifier. The context service system may then determine whether the second customer data identifier is associated with a customer record in a subscriber data partition at operation 515. If there is a customer record in the subscriber data partition, the context service system may provide the customer record to the subscriber system at operation 520. If there is no customer record in the subscriber data partition, the context service system notifies the subscriber system that no record was found at operation 525.



FIG. 6 is a conceptual block diagram illustrating an example scenario 600, in accordance with various embodiments of the subject technology. The scenario 600 includes an ACME subscriber system 610 and a context service data store 630 and may help to illustrate the processes 400 and 500 of FIGS. 4 and 5. The other components of the context service system associated with the context service data store 630 are not shown in FIG. 6 for illustrative purposes. The context service data store 630 is shown containing a subscriber partition for an “ACME” subscriber 650 and a shared data partition 640. However, the context service data store 630 may contain many other shared data partitions and/or subscriber partitions. For illustrative purposes, each data partition is shown containing a record for customer “Frank Smith.” However, the data partitions may contain many more customer records or sets of associated data.


According to some embodiments, the context service system may enable a subscriber to retrieve a customer record in the subscriber's data partition that is associated with a customer data identifier (e.g., an element of customer information or a hash value for the element of customer information) provided in a customer lookup request. In some cases, the customer record may be located based on information in the subscriber's data partition. However, in other cases, the context service system may leverage the associations in the shared data partition to identify the customer record in the subscriber's data partition.


In the scenario 600 of FIG. 6, the ACME subscriber system 610 may come across an element of customer information. In particular, the ACME subscriber system 610 may receive a call 672 from a phone number 555-123-4567 that is unknown to the ACME subscriber system. The phone number of 555-123-4567 may be the element of customer information in this scenario 600, but in other scenarios, user names, email addresses, social media account identifiers, or any other identifiers may be used as elements of customer information and the subscriber system 610 may come across the element of customer information by other means.


To determine whether the ACME data partition 650 contains information associated with the received phone number, the ACME subscriber system 610 may generate a hash value for the received phone number using an ACME subscriber salt value, which is represented as “HASH(ACME, 555-123-4567)” in FIG. 6. The ACME subscriber system 610 inserts the hash value in a subscriber customer lookup request 674 and transmits the subscriber customer lookup request 674 to the context service system.


The context service system receives the subscriber customer lookup request 674 and determines whether the customer data identifier “HASH(ACME, 555-123-4567)” in the subscriber customer lookup request is associated with a customer record in the subscriber's data partition 650. In the scenario 600 of FIG. 6, no customer record is found. Accordingly, the context service system may generate and transmit a notification 676 to the ACME subscriber system 610 informing the subscriber system that no customer record was found in the subscriber's data partition 650.


The ACME subscriber system 610 receives the notification 676 and may wish to query the leverage the information in the shared data partition 640 to determine whether the ACME data partition 650 contains information associated with the received phone number. Accordingly, the ACME subscriber system 610 generates a hash value for the received phone number using a shared subscriber salt value, which is represented as “HASH(SHARED, 555-123-4567)” in FIG. 6. The ACME subscriber system 610 inserts the hash value in a shared customer lookup request 680 and transmits the shared customer lookup request 680 to the context service system.


The context service system receives the shared customer lookup request 680 and determines whether the customer data identifier “HASH(SHARED, 555-123-4567)” in the shared customer lookup request is associated with a customer record in the shared data partition 640. In the scenario 600 of FIG. 6, customer record 645 is found. More specifically, customer record 645 also includes a matching customer data identifier with the same “HASH(SHARED, 555-123-4567)” value.


Based on the found customer record 645, the context service system identifies two additional customer data identifiers (“HASH(SHARED, fsmith@email.com)” and “HASH(SHARED, 321-555-8888)”) that are associated with the customer data identifier (“HASH(SHARED, 555-123-4567)”) included in the shared customer lookup request.


The context service system may then query 682 the ACME data partition 650 to determine whether either of the two identified customer data identifiers (“HASH(SHARED, fsmith@email.com)” and “HASH(SHARED, 321-555-8888)”) are associated with a customer record in the ACME data partition 650. In the scenario 600 of FIG. 6, no corresponding customer record is found for “HASH(SHARED, 321-555-8888).” However, customer record 655 is found for “HASH(SHARED, fsmith@email.com).” Accordingly, the context service system provides the customer record 655 or the encrypted customer information 658 in the customer record 655 to the ACME subscriber system 610. This is represented by transmission 690 in FIG. 6.


After receiving the transmission 690, the ACME subscriber system 610 may decrypt the customer information 658 in the customer record 655 to reveal that the customer information elements of “Name: Fred Smith” and “Email: fsmith@email.com” are associated with the call 672 from the phone number 555-123-4567. In many cases, the additional information that is revealed may enable the subscriber system to provide improved services and/or additional services.


As the data sets in the context service data store increases in size and the number of subscriber data partitions grows there is an increased likelihood that multiple customer records may be identified in the subscriber data partition. According to various embodiments, the context service system may also be configured to generate scores (e.g., confidence scores) for the identified customer records and/or rank the identified customer records. The context service system may provide the subscriber system with a top ranked customer record or a set of top ranked customer records. Additionally, the context service system may provide one or more or all of the customer records to the subscriber system along with their calculated scores to allow the subscriber system to select.


According to various embodiments, the confidence score for an identified customer record may be based on the number of other subscriber systems that have identified the association between the customer record and the element of customer information and/or how recent the association between the customer record and the element of customer information was made. For example, if a large number of subscribers have identified an association between the customer record and the element of customer information, it is more likely to be an accurate identification. Accordingly, the confidence score should be higher than for a customer with fewer subscribers having identified the association.


Furthermore, associations between customer records and the element of customer information may be timestamp according to when they were created or updated. An association between a customer record and the element of customer information with a recent timestamp may be more accurate than an association with an older timestamp because the association with the recent timestamp may reflect updated information that has not reached the data partition for another subscriber. For example, a customer record may include a residential address for a user. This information may be reflected in a customer record with a particular timestamp. However, the user may have moved to a new address. This new information may be reflected in a customer record with a more recent timestamp.



FIG. 7A and FIG. 7B illustrate systems in accordance with various embodiments. The more appropriate system will be apparent to those of ordinary skill in the art when practicing the various embodiments. Persons of ordinary skill in the art will also readily appreciate that other systems are possible.



FIG. 7A illustrates an example architecture for a bus computing system 700 wherein the components of the system are in electrical communication with each other using a bus 705. The computing system 700 can include a processing unit (CPU or processor) 710 and a system bus 705 that may couple various system components including the system memory 715, such as read only memory (ROM) in a storage device 720 and random access memory (RAM) 725, to the processor 710. The computing system 700 can include a cache 712 of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 710. The computing system 700 can copy data from the memory 715 and/or the storage device 730 to the cache 712 for quick access by the processor 710. In this way, the cache 712 can provide a performance boost that avoids processor delays while waiting for data. These and other modules can control or be configured to control the processor 710 to perform various actions. Other system memory 715 may be available for use as well. The memory 715 can include multiple different types of memory with different performance characteristics. The processor 710 can include any general purpose processor and a hardware module or software module, such as module 1732, module 2734, and module 3736 stored in storage device 730, configured to control the processor 710 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 710 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing system 700, an input device 745 can represent any number of input mechanisms, such as a microphone for speech, a touch-protected screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 735 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing system 700. The communications interface 740 can govern and manage the user input and system output. There may be no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.


Storage device 730 can be a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 725, read only memory (ROM) 720, and hybrids thereof.


The storage device 730 can include software modules 732, 734, 736 for controlling the processor 710. Other hardware or software modules are contemplated. The storage device 730 can be connected to the system bus 705. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 710, bus 705, output device 735, and so forth, to carry out the function.



FIG. 7B illustrates an example architecture for a chipset computing system 750 that can be used in accordance with an embodiment. The computing system 750 can include a processor 755, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. The processor 755 can communicate with a chipset 760 that can control input to and output from the processor 755. In this example, the chipset 760 can output information to an output device 765, such as a display, and can read and write information to storage device 770, which can include magnetic media, and solid state media, for example. The chipset 760 can also read data from and write data to RAM 775. A bridge 780 for interfacing with a variety of user interface components 785 can be provided for interfacing with the chipset 760. The user interface components 785 can include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. Inputs to the computing system 750 can come from any of a variety of sources, machine generated and/or human generated.


The chipset 760 can also interface with one or more communication interfaces 790 that can have different physical interfaces. The communication interfaces 790 can include interfaces for wired and wireless LANs, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein can include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 755 analyzing data stored in the storage device 770 or the RAM 775. Further, the computing system 700 can receive inputs from a user via the user interface components 785 and execute appropriate functions, such as browsing functions by interpreting these inputs using the processor 755.


It will be appreciated that computing systems 700 and 750 can have more than one processor 710 and 755, respectively, or be part of a group or cluster of computing devices networked together to provide greater processing capability.


For clarity of explanation, in some instances the various embodiments may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.


In some embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures can comprise hardware, firmware, and/or software, and can take any of a variety of form factors. Examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.


Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims.

Claims
  • 1. A computer-implemented method comprising: receiving, from a subscriber system, a shared customer lookup request that includes a first customer data identifier;identifying, in a shared data partition, a second customer data identifier associated with the first customer data identifier; andwherein the first customer data identifier is a first hashed value based on a shared salt value and a first element of customer information received by the subscriber system, and wherein the second customer data identifier is a second hashed value based on the shared salt value and a second element of customer information;determining that the second customer data identifier is associated with a customer record in a subscriber data partition; andproviding to the subscriber system, in response to the second customer data identifier being associated with the customer record, customer information in the customer record from the subscriber data partition;calculating a confidence score for the customer record based on a timestamp associated with the customer record; andproviding the confidence score to the subscriber system.
  • 2. The computer-implemented method of claim 1, wherein the customer information is encrypted.
  • 3. The computer-implemented method of claim 1, wherein the first customer data identifier is an element of customer information received by the subscriber system.
  • 4. The computer-implemented method of claim 1, further comprising identifying a match between the second customer data identifier and a third customer data identifier associated with the customer record in the subscriber data partition.
  • 5. The computer-implemented method of claim 1, further comprising: receiving, from the subscriber system, a subscriber customer lookup request that includes a fourth customer data identifier;determining whether the fourth customer data identifier is associated with a second customer record in the subscriber data partition; andproviding, to the subscriber system, second customer information in the second customer record from the subscriber data partition when the fourth customer data identifier is associated with the second customer record in the subscriber data partition.
  • 6. The computer-implemented method of claim 5, wherein the fourth customer data identifier is a hashed value based on a subscriber salt value and an element of customer information received by the subscriber system.
  • 7. The computer-implemented method of claim 1, wherein the first customer data identifier is based on one of a user name, a phone number, an email address, or an address.
  • 8. The computer-implemented method of claim 1, wherein the subscriber data partition is associated with the subscriber system.
  • 9. A non-transitory computer-readable medium comprising instructions, the instructions, when executed by a computing system, cause the computing system to: receive, from a subscriber, a shared customer lookup request that includes a first customer data identifier;identify, in a shared data partition, a second customer data identifier associated with the first customer data identifier; andwherein the first customer data identifier is a first hashed value based on a shared salt value and a first element of customer information received by the subscriber, and wherein the second customer data identifier is a second hashed value based on the shared salt value and a second element of customer information;determine that the second customer data identifier is associated with customer information in a subscriber data partition; andtransmit, to the subscriber, the customer information from the subscriber data partition;calculating a confidence score for the customer record based on a timestamp associated with the customer record; andproviding the confidence score to the subscriber system.
  • 10. The non-transitory computer-readable medium of claim 9, wherein the first customer data identifier is an element of customer information received by the subscriber.
  • 11. The non-transitory computer-readable medium of claim 9, wherein the instructions further cause the computing system to identify a match between the second customer data identifier and a third customer data identifier associated with the customer information in the subscriber data partition.
  • 12. A system comprising: a processor;a subscriber data partition comprising customer records associated with a subscriber;a shared data partition comprising customer records associated with a set of subscribers; anda non-transitory computer-readable medium storing instructions that, when executed by the system, cause the system to:receive, from the subscriber, a shared customer lookup request that includes a first customer data identifier;identify, in the shared data partition, a second customer data identifier associated with the first customer data identifier; andwherein the first customer data identifier is a first hashed value based on a shared salt value and a first element of customer information received by the subscriber, and wherein the second customer data identifier is a second hashed value based on the shared salt value and a second element of customer information;determine that the second customer data identifier is associated with customer information in the subscriber data partition; andtransmit, to the subscriber, the customer information from the subscriber data partition;calculating a confidence score for the customer record based on a timestamp associated with the customer record; andproviding the confidence score to the subscriber system.
  • 13. The system of claim 12, wherein the subscriber is a member of the set of subscribers.
  • 14. The system of claim 12, wherein the customer information is encrypted.
  • 15. The system of claim 12, wherein the first customer data identifier is an element of customer information received by the subscriber.
  • 16. The system of claim 12, wherein the instructions further cause the system to identify a match between the second customer data identifier and a third customer data identifier associated with the customer information in the subscriber data partition.
US Referenced Citations (432)
Number Name Date Kind
5812773 Norin Sep 1998 A
5889896 Meshinsky et al. Mar 1999 A
6108782 Fletcher et al. Aug 2000 A
6178453 Mattaway et al. Jan 2001 B1
6298153 Oishi Oct 2001 B1
6343290 Cossins et al. Jan 2002 B1
6643260 Kloth et al. Nov 2003 B1
6683873 Kwok et al. Jan 2004 B1
6721804 Rubin et al. Apr 2004 B1
6733449 Krishnamurthy et al. May 2004 B1
6735631 Oehrke et al. May 2004 B1
6996615 McGuire Feb 2006 B1
7054930 Cheriton May 2006 B1
7058706 Lyer et al. Jun 2006 B1
7062571 Dale et al. Jun 2006 B1
7111177 Chauvel et al. Sep 2006 B1
7212490 Kao et al. May 2007 B1
7277948 Igarashi et al. Oct 2007 B2
7313667 Pullela et al. Dec 2007 B1
7379846 Williams et al. May 2008 B1
7480672 Hahn et al. Jan 2009 B2
7496043 Leong et al. Feb 2009 B1
7536476 Alleyne May 2009 B1
7567504 Darling et al. Jul 2009 B2
7583665 Duncan et al. Sep 2009 B1
7606147 Luft et al. Oct 2009 B2
7624421 Ozzie Nov 2009 B2
7644437 Volpano Jan 2010 B2
7647594 Togawa Jan 2010 B2
7773510 Back et al. Aug 2010 B2
7808897 Mehta et al. Oct 2010 B1
7881957 Cohen et al. Feb 2011 B1
7917647 Cooper et al. Mar 2011 B2
7930252 Bender et al. Apr 2011 B2
8010598 Tanimoto Aug 2011 B2
8028071 Mahalingam et al. Sep 2011 B1
8041714 Aymeloglu et al. Oct 2011 B2
8121117 Amdahl et al. Feb 2012 B1
8140502 Francis et al. Mar 2012 B2
8171415 Appleyard et al. May 2012 B2
8234377 Cohn Jul 2012 B2
8244559 Horvitz et al. Aug 2012 B2
8250215 Stienhans et al. Aug 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8284664 Aybay et al. Oct 2012 B1
8301746 Head et al. Oct 2012 B2
8345692 Smith Jan 2013 B2
8406141 Couturier et al. Mar 2013 B1
8407205 Doshi Mar 2013 B2
8407413 Yucel et al. Mar 2013 B1
8448171 Donnellan et al. May 2013 B2
8477610 Zuo et al. Jul 2013 B2
8495356 Ashok et al. Jul 2013 B2
8495725 Ahn Jul 2013 B2
8510469 Portolani Aug 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8533687 Greifeneder et al. Sep 2013 B1
8547974 Guruswamy et al. Oct 2013 B1
8560639 Murphy et al. Oct 2013 B2
8560663 Baucke et al. Oct 2013 B2
8589543 Dutta et al. Nov 2013 B2
8590050 Nagpal et al. Nov 2013 B2
8611356 Yu et al. Dec 2013 B2
8612625 Andreis et al. Dec 2013 B2
8630291 Shaffer et al. Jan 2014 B2
8639787 Lagergren et al. Jan 2014 B2
8656024 Krishnan et al. Feb 2014 B2
8660129 Brendel et al. Feb 2014 B1
8719804 Jain May 2014 B2
8775576 Hebert et al. Jul 2014 B2
8797867 Chen et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8838629 Degeoglu et al. Sep 2014 B2
8850002 Dickinson et al. Sep 2014 B1
8850182 Fritz et al. Sep 2014 B1
8856339 Mestery et al. Oct 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8938775 Roth et al. Jan 2015 B1
8959526 Kansal et al. Feb 2015 B2
8977754 Curry, Jr. et al. Mar 2015 B2
9009697 Breiter et al. Apr 2015 B2
9015324 Jackson Apr 2015 B2
9043439 Bicket et al. May 2015 B2
9049115 Rajendran et al. Jun 2015 B2
9063789 Beaty et al. Jun 2015 B2
9065727 Liu et al. Jun 2015 B1
9075649 Bushman et al. Jul 2015 B1
9130846 Szabo et al. Sep 2015 B1
9164795 Vincent Oct 2015 B1
9167050 Durazzo et al. Oct 2015 B2
9201701 Boldyrev et al. Dec 2015 B2
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244776 Koza et al. Jan 2016 B2
9251114 Ancin et al. Feb 2016 B1
9264478 Hon et al. Feb 2016 B2
9294408 Dickinson et al. Mar 2016 B1
9313048 Chang et al. Apr 2016 B2
9361192 Smith et al. Jun 2016 B2
9379982 Krishna et al. Jun 2016 B1
9380075 He et al. Jun 2016 B2
9432245 Sorenson, III et al. Aug 2016 B1
9432294 Sharma et al. Aug 2016 B1
9444744 Sharma et al. Sep 2016 B1
9473365 Melander et al. Oct 2016 B2
9485271 Roundy Nov 2016 B1
9503530 Niedzielski Nov 2016 B1
9558078 Farlee et al. Jan 2017 B2
9571570 Mutnuru Feb 2017 B1
9613078 Vermeulen et al. Apr 2017 B2
9628471 Sundaram et al. Apr 2017 B1
9658876 Chang et al. May 2017 B2
9692802 Bicket et al. Jun 2017 B2
9755858 Bagepalli et al. Sep 2017 B2
20010055303 Horton et al. Dec 2001 A1
20020073337 Ioele et al. Jun 2002 A1
20020143928 Maltz et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020174216 Shorey et al. Nov 2002 A1
20030018591 Komisky Jan 2003 A1
20030056001 Mate et al. Mar 2003 A1
20030228585 Inoko et al. Dec 2003 A1
20040004941 Malan et al. Jan 2004 A1
20040034702 He Feb 2004 A1
20040088542 Daude et al. May 2004 A1
20040095237 Chen et al. May 2004 A1
20040131059 Ayyakad et al. Jul 2004 A1
20040197079 Latvala et al. Oct 2004 A1
20040264481 Darling et al. Dec 2004 A1
20050060418 Sorokopud Mar 2005 A1
20050125424 Herriott et al. Jun 2005 A1
20060062187 Rune Mar 2006 A1
20060104286 Cheriton May 2006 A1
20060126665 Ward et al. Jun 2006 A1
20060146825 Hofstaedter et al. Jul 2006 A1
20060155875 Cheriton Jul 2006 A1
20060168338 Bruegl et al. Jul 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20070174663 Crawford et al. Jul 2007 A1
20070223487 Kajekar et al. Sep 2007 A1
20070242830 Conrado et al. Oct 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080080524 Tsushima et al. Apr 2008 A1
20080084880 Dharwadkar Apr 2008 A1
20080165778 Ertemalp Jul 2008 A1
20080198752 Fan et al. Aug 2008 A1
20080198858 Townsley et al. Aug 2008 A1
20080201711 Amir Husain Aug 2008 A1
20080235755 Blaisdell et al. Sep 2008 A1
20090006527 Gingell, Jr. et al. Jan 2009 A1
20090019367 Cavagnari et al. Jan 2009 A1
20090031312 Mausolf et al. Jan 2009 A1
20090083183 Rao et al. Mar 2009 A1
20090138763 Arnold May 2009 A1
20090177775 Radia et al. Jul 2009 A1
20090178058 Stillwell, III et al. Jul 2009 A1
20090182874 Morford et al. Jul 2009 A1
20090265468 Annambhotla et al. Oct 2009 A1
20090265753 Anderson et al. Oct 2009 A1
20090293056 Ferris Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090323706 Germain et al. Dec 2009 A1
20090328031 Pouyadou et al. Dec 2009 A1
20100036903 Ahmad et al. Feb 2010 A1
20100042720 Stienhans et al. Feb 2010 A1
20100061250 Nugent Mar 2010 A1
20100115341 Baker et al. May 2010 A1
20100131765 Bromley et al. May 2010 A1
20100149966 Achlioptas et al. Jun 2010 A1
20100191783 Mason et al. Jul 2010 A1
20100192157 Jackson et al. Jul 2010 A1
20100205601 Abbas et al. Aug 2010 A1
20100211782 Auradkar et al. Aug 2010 A1
20100293270 Augenstein et al. Nov 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100325199 Park et al. Dec 2010 A1
20100325441 Laurie et al. Dec 2010 A1
20100333116 Prahlad et al. Dec 2010 A1
20110016214 Jackson Jan 2011 A1
20110035754 Srinivasan Feb 2011 A1
20110055396 Dehaan Mar 2011 A1
20110055398 Dehaan et al. Mar 2011 A1
20110055470 Portolani Mar 2011 A1
20110072489 Parann-Nissany Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110110382 Jabr et al. May 2011 A1
20110116443 Yu et al. May 2011 A1
20110126099 Anderson et al. May 2011 A1
20110138055 Daly et al. Jun 2011 A1
20110145413 Dawson et al. Jun 2011 A1
20110145657 Bishop et al. Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110185063 Head et al. Jul 2011 A1
20110185065 Stanisic et al. Jul 2011 A1
20110206052 Tan et al. Aug 2011 A1
20110213966 Fu et al. Sep 2011 A1
20110219434 Betz et al. Sep 2011 A1
20110231715 Kunii et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110252327 Awasthi et al. Oct 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110283013 Grosser et al. Nov 2011 A1
20110295998 Ferris et al. Dec 2011 A1
20110305149 Scott et al. Dec 2011 A1
20110307531 Gaponenko et al. Dec 2011 A1
20110320870 Kenigsberg et al. Dec 2011 A1
20120005724 Lee Jan 2012 A1
20120036234 Staats et al. Feb 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072318 Akiyama et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072581 Tung et al. Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120072992 Arasaratnam et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120102193 Rathore et al. Apr 2012 A1
20120102199 Hopmann et al. Apr 2012 A1
20120131174 Ferris et al. May 2012 A1
20120137215 Kawara May 2012 A1
20120158967 Sedayao et al. Jun 2012 A1
20120159097 Jennas, II et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173710 Rodriguez Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120180044 Donnellan et al. Jul 2012 A1
20120182891 Lee et al. Jul 2012 A1
20120185913 Martinez et al. Jul 2012 A1
20120192016 Gotesdyner et al. Jul 2012 A1
20120192075 Ebtekar et al. Jul 2012 A1
20120201135 Ding et al. Aug 2012 A1
20120214506 Skaaksrud et al. Aug 2012 A1
20120222106 Kuehl Aug 2012 A1
20120236716 Anbazhagan et al. Sep 2012 A1
20120240113 Hur Sep 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120272025 Park et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120281708 Chauhan et al. Nov 2012 A1
20120290647 Ellison et al. Nov 2012 A1
20120297238 Watson et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120324092 Brown et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20130003567 Gallant et al. Jan 2013 A1
20130013248 Brugler et al. Jan 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130066940 Shao Mar 2013 A1
20130080509 Wang Mar 2013 A1
20130080624 Nagai et al. Mar 2013 A1
20130091557 Gurrapu Apr 2013 A1
20130097601 Podvratnik et al. Apr 2013 A1
20130104140 Meng et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130117337 Dunham May 2013 A1
20130124712 Parker May 2013 A1
20130125124 Kempf et al. May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130144978 Jain et al. Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130159097 Schory et al. Jun 2013 A1
20130159496 Hamilton et al. Jun 2013 A1
20130160008 Cawlfield et al. Jun 2013 A1
20130162753 Hendrickson et al. Jun 2013 A1
20130169666 Pacheco et al. Jul 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198374 Zalmanovitch et al. Aug 2013 A1
20130201989 Hu et al. Aug 2013 A1
20130204849 Chacko Aug 2013 A1
20130232491 Radhakrishnan et al. Sep 2013 A1
20130246588 Borowicz et al. Sep 2013 A1
20130250770 Zou et al. Sep 2013 A1
20130254415 Fullen et al. Sep 2013 A1
20130262347 Dodson Oct 2013 A1
20130283364 Chang et al. Oct 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318240 Hebert et al. Nov 2013 A1
20130318546 Kothuri et al. Nov 2013 A1
20130339949 Spiers et al. Dec 2013 A1
20140006481 Frey et al. Jan 2014 A1
20140006535 Reddy Jan 2014 A1
20140006585 Dunbar et al. Jan 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140052877 Mao Feb 2014 A1
20140056146 Hu et al. Feb 2014 A1
20140059310 Du et al. Feb 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140075048 Yuksel et al. Mar 2014 A1
20140075108 Dong et al. Mar 2014 A1
20140075357 Flores et al. Mar 2014 A1
20140075501 Srinivasan et al. Mar 2014 A1
20140089727 Cherkasova et al. Mar 2014 A1
20140098762 Ghai et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140122560 Ramey et al. May 2014 A1
20140136779 Guha et al. May 2014 A1
20140140211 Chandrasekaran et al. May 2014 A1
20140141720 Princen et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164486 Ravichandran et al. Jun 2014 A1
20140188825 Muthukkaruppan et al. Jul 2014 A1
20140189095 Lindberg et al. Jul 2014 A1
20140189125 Amies et al. Jul 2014 A1
20140215471 Cherkasova Jul 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140244851 Lee Aug 2014 A1
20140245298 Zhou et al. Aug 2014 A1
20140281173 Im et al. Sep 2014 A1
20140282536 Dave et al. Sep 2014 A1
20140282611 Campbell et al. Sep 2014 A1
20140282889 Ishaya et al. Sep 2014 A1
20140289200 Kato Sep 2014 A1
20140295831 Karra et al. Oct 2014 A1
20140297569 Clark et al. Oct 2014 A1
20140297835 Buys Oct 2014 A1
20140310391 Sorenson, III et al. Oct 2014 A1
20140310417 Sorenson, III et al. Oct 2014 A1
20140310418 Sorenson, III et al. Oct 2014 A1
20140314078 Jilani Oct 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140321278 Cafarelli et al. Oct 2014 A1
20140330976 van Bemmel Nov 2014 A1
20140330977 van Bemmel Nov 2014 A1
20140334488 Guichard et al. Nov 2014 A1
20140362682 Guichard et al. Dec 2014 A1
20140365680 van Bemmel Dec 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140369204 Anand et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20140379938 Bosch et al. Dec 2014 A1
20150033086 Sasturkar et al. Jan 2015 A1
20150043576 Dixon et al. Feb 2015 A1
20150052247 Threefoot et al. Feb 2015 A1
20150052517 Raghu et al. Feb 2015 A1
20150058382 St Laurent et al. Feb 2015 A1
20150058459 Amendjian et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150085870 Narasimha et al. Mar 2015 A1
20150089082 Patwardhan et al. Mar 2015 A1
20150100471 Curry, Jr. et al. Apr 2015 A1
20150103827 Quinn et al. Apr 2015 A1
20150106802 Ivanov et al. Apr 2015 A1
20150106805 Melander et al. Apr 2015 A1
20150117199 Chinnaiah Sankaran et al. Apr 2015 A1
20150117458 Gurkan et al. Apr 2015 A1
20150120914 Wada et al. Apr 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150138973 Kumar et al. May 2015 A1
20150178133 Phelan et al. Jun 2015 A1
20150189009 van Bemmel Jul 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150227405 Jan et al. Aug 2015 A1
20150242204 Hassine et al. Aug 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150263901 Kumar et al. Sep 2015 A1
20150280980 Bitar Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150281113 Siciliano et al. Oct 2015 A1
20150304315 Estehghari Oct 2015 A1
20150309908 Pearson et al. Oct 2015 A1
20150319063 Zourzouvillys et al. Nov 2015 A1
20150326524 Tankala et al. Nov 2015 A1
20150339210 Kopp et al. Nov 2015 A1
20150358850 La Roche, Jr. et al. Dec 2015 A1
20150365324 Kumar et al. Dec 2015 A1
20150373108 Fleming et al. Dec 2015 A1
20160011925 Kulkarni et al. Jan 2016 A1
20160013990 Kulkarni et al. Jan 2016 A1
20160026684 Mukherjee et al. Jan 2016 A1
20160062786 Meng et al. Mar 2016 A1
20160094389 Jain et al. Mar 2016 A1
20160094398 Choudhury et al. Mar 2016 A1
20160094453 Jain et al. Mar 2016 A1
20160094454 Jain et al. Mar 2016 A1
20160094455 Jain et al. Mar 2016 A1
20160094456 Jain et al. Mar 2016 A1
20160094480 Kulkarni et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160099847 Melander et al. Apr 2016 A1
20160099853 Nedeltchev et al. Apr 2016 A1
20160099864 Akiya et al. Apr 2016 A1
20160105393 Thakkar et al. Apr 2016 A1
20160127184 Bursell May 2016 A1
20160134557 Steinder et al. May 2016 A1
20160156708 Jalan et al. Jun 2016 A1
20160164780 Timmons et al. Jun 2016 A1
20160164914 Madhav et al. Jun 2016 A1
20160182378 Basavaraja et al. Jun 2016 A1
20160188527 Cherian et al. Jun 2016 A1
20160234071 Nambiar et al. Aug 2016 A1
20160239399 Babu et al. Aug 2016 A1
20160253078 Ebtekar et al. Sep 2016 A1
20160254968 Ebtekar et al. Sep 2016 A1
20160261564 Foxhoven et al. Sep 2016 A1
20160277368 Narayanaswamy et al. Sep 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026294 Basavaraja et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170147297 Krishnamurthy et al. May 2017 A1
20170147527 Chandrasekaran May 2017 A1
20170149878 Mutnuru May 2017 A1
20170163531 Kumar et al. Jun 2017 A1
20170171158 Hoy et al. Jun 2017 A1
20170237555 Roullier et al. Aug 2017 A1
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 A1
20190205459 Busjaeger Jul 2019 A1
20190297060 Iverson Sep 2019 A1
Foreign Referenced Citations (14)
Number Date Country
101719930 Jun 2010 CN
101394360 Jul 2011 CN
102164091 Aug 2011 CN
104320342 Jan 2015 CN
105740084 Jul 2016 CN
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2645253 Nov 2014 EP
10-2015-0070676 May 2015 KR
M394537 Dec 2010 TW
WO 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
2017161403 Sep 2017 WO
Non-Patent Literature Citations (66)
Entry
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages.
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages.
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page.
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages.
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages.
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages.
Author Unknown, “CloudControl Documentation,” Aug. 25, 2013, 14 pages.
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages.
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages.
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages.
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages.
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-ISO0103, Jun. 16, 2010, 75 pages.
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages.
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page.
Baker, F., “Requirements for IP Version 4 Routers,” Jun. 1995, 175 pages, Network Working Group, Cisco Systems.
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages.
Blanchet, M., “A Flexible Method for Managing the Assignment of Bits of an IPv6 Address Block,” Apr. 2003, 8 pages, Network Working Group, Viagnie.
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages.
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages.
Broadcasters Audience Research Board, “What's Next,” http://lwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages.
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white_paper_c11-558242.pdf.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages.
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages.
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages.
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages.
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages.
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages.
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php.
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, Cisco Systems, Jan. 2012, 12 pages.
Ford, Bryan, et al., Peer-to-Peer Communication Across Network Address Translators, In USENIX Annual Technical Conference, 2005, pp. 179-192.
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages.
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages.
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages.
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524.
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages.
Kenhui, “Musings on Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf.
Kumar, S., et al., “Infrastructure Service Forwarding for NSH,”Service Function Chaining Internet Draft, draft-kumar-sfc-nsh-forwarding-00, Dec. 5, 2015, 10 pages.
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages.
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages.
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages.
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages.
Meraki, “Meraki releases industry's first cloud-managed routers,” Jan. 13, 2011, 2 pages.
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages.
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov 17, 2003, pp. 1-11.
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com.
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages.
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages.
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html.
Quinn, P., et al., “Network Service Header,” Internet Engineering Task Force Draft, Jul. 3, 2014, 27 pages.
Quinn, P., et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, Internet Draft, draft-quinn-sfc-arch-03.txt, Jan. 22, 2014, 21 pages.
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages.
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages.
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, 2011, 4, 803-811, 9 pages.
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages.
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages.
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages.
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter_%28software%29&oldid=594544359.
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index.php?title=Pipeline2/028Unix%29&oldid=606980114.
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computer and Information Science, 2012 IEEE, 5 pages.
Related Publications (1)
Number Date Country
20190373077 A1 Dec 2019 US