Social Scores for Network Elements

• US 20160117355A1
• Filed: 10/22/2014
• Published: 04/28/2016
• Est. Priority Date: 10/22/2014
• Status: Abandoned Application

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Krishnamurthy, Rajiv Jayanth
• Application Number:
  US14/521,269
• Publication Number:
  US 20160117355A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/955 using information identifiers, e.g. uniform resource locators [URL]
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34

Abstract

In one embodiment, a method includes identifying users of a social-networking system whose client devices receive and transmit data by a first network element, and retrieving social graph information for each of the users. The social graph information for each user may comprise (1) a social affinity score for each relationship between the user and one of their social-graph connections and (2) an identification of a second network element to which a client system of the social-graph connection is connected. Particular embodiments may include calculating a collective social affinity score between the first network element and the second network element based at least in part on individual social affinity scores for relationships between the users and the social-graph connections, and taking action, based on the collective social affinity score, to handle data transmissions involving the first users and the second users (e.g., pre-fetching data and/or establishing additional TCP connections.

Claims

1. A method comprising:

identifying one or more first users of a social-networking system, wherein the first users are associated with client devices that receive and transmit data by a first network element;

retrieving social graph information for each of the first users, wherein the social graph information for each of the first users comprises (1) a social affinity score for each relationship between the first user and a social-graph connection of the first user and (2) an identification of one or more second network elements to which a client system of at least one of the social-graph connections is connected;

identifying one or more pairs of network elements based on the retrieved social graph information, wherein each of the pairs comprises the first network element and the at least one second network element;

calculating a collective social affinity score for each of the pairs of network elements, wherein the collective social affinity score is calculated based at least in part on the social affinity scores for a plurality of user pairs between the first users and social-graph connections of the first users; and

taking action, based on the collective social affinity score, to handle data transmissions involving the first users and the second users.

2. The method of claim 1, wherein the calculating the collective social affinity score for a pair of network elements comprises:

determining a set of user pairs, wherein for each of the user pairs, a client system of a first user of the user pair is connected to a first network element of the pair of network elements and a client system of a second user of the user pair is connected to a second network element of the pair of network elements; and

determining an average of the social affinity scores for each of the user pairs in the set.

3. The method of claim 2, wherein the average of the social affinity scores comprises a weighted average.

4. The method of claim 1, wherein the taking action to handle data transmissions further comprises:

receiving, at a first network element of one of the identified pairs of network elements, a transmission of data by a client device connected to the first network element; and

sending a notification to the second network elements in the identified pairs of network elements about the data transmission.

5. The method of claim 4, further comprising:

receiving the notification at a second network element in one of the identified pairs of network elements; and

pre-fetching the data transmission.

6. The method of claim 4, further comprising:

receiving the notification at a second network element in one of the identified pairs of network elements; and

establishing a pool of TCP connections in anticipation of peak periods when the collective social affinity score is high.

7. The method of claim 2, wherein the calculating the collective social affinity score takes place on a regular and continual basis.

8. The method of claim 1, wherein at least one of the network elements comprises a Wi-Fi router.

9. The method of claim 1, wherein at least one of the network elements comprises a cell tower base station.

10. One or more computer-readable non-transitory storage media embodying software that is operable when executed by one or more processors to:

identify one or more first users of a social-networking system, wherein the first users are associated with client devices that receive and transmit data by a first network element;

retrieve social graph information for each of the first users, wherein the social graph information for each of the first users comprises (1) a social affinity score for each relationship between the first user and a social-graph connection of the first user and (2) an identification of one or more second network elements to which a client system of at least one of the social-graph connections is connected;

identify one or more pairs of network elements based on the retrieved social graph information, wherein each of the pairs comprises the first network element and the at least one second network element;

calculate a collective social affinity score for each of the pairs of network elements, wherein the collective social affinity score is calculated based at least in part on the social affinity scores for a plurality of user pairs between the first users and social-graph connections of the first users; and

take action, based on the collective social affinity score, to handle data transmissions involving the first users and the second users.

11. The media of claim 10, wherein the software operable to calculate the collective social affinity score comprises software operable to:

determine a set of user pairs, wherein for each of the user pairs, a client system of a first user of the user pair is connected to a first network element of the pair of network elements and a client system of a second user of the user pair is connected to a second network element of the pair of network elements; and

determine an average of the social affinity scores for each of the user pairs in the set.

12. The media of claim 10, wherein the average of the social affinity scores comprises a weighted average.

13. The media of claim 10, wherein the software operable to take action to handle data transmissions further comprises software operable to:

receive, at a first network element of one of the identified pairs of network elements, a transmission of data by a client device connected to the first network element; and

send a notification to the second network elements in the identified pairs of network elements about the data transmission.

14. The media of claim 13, the software being further operable to:

receive the notification at a second network element in one of the identified pairs of network elements; and

pre-fetch the data transmission.

15. The media of claim 13, wherein the software operable to take action to handle data transmissions further comprises software operable to:

receive the notification at a second network element in one of the identified pairs of network elements; and

establish a pool of TCP connections in anticipation of peak periods when the collective social affinity score is high.

16. A system comprising:

one or more processors; and

a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;

identify one or more first users of a social-networking system, wherein the first users are associated with client devices that receive and transmit data by a first network element;

retrieve social graph information for each of the first users, wherein the social graph information for each of the first users comprises (1) a social affinity score for each relationship between the first user and a social-graph connection of the first user and (2) an identification of one or more second network elements to which a client system of at least one of the social-graph connections is connected;

identify one or more pairs of network elements based on the retrieved social graph information, wherein each of the pairs comprises the first network element and the at least one second network element;

calculate a collective social affinity score for each of the pairs of network elements, wherein the collective social affinity score is calculated based at least in part on the social affinity scores for a plurality of user pairs between the first users and social-graph connections of the first users; and

take action, based on the collective social affinity score, to handle data transmissions involving the first users and the second users.

17. The system of claim 16, wherein the processors being operable to calculate of the collective social affinity score comprises the processors being operable to:

determine a set of user pairs, wherein for each of the user pairs, a client system of a first user of the user pair is connected to a first network element of the pair of network elements and a client system of a second user of the user pair is connected to a second network element of the pair of network elements; and

determine an average of the social affinity scores for each of the user pairs in the set.

18. The system of claim 16, wherein the processors being operable to take action to handle data transmissions further comprises the processors being operable to:

receive, at a first network element of one of the identified pairs of network elements, a transmission of data by a client device connected to the first network element; and

send a notification to the second network elements in the identified pairs of network elements about the data transmission.

19. The system of claim 18, wherein the processors are further operable to:

receive the notification at a second network element in one of the identified pairs of network elements; and

send a notification to the second network element to retrieve the information.

20. The system of claim 18, wherein the processors being operable to take action to handle data transmissions further comprises the processors being operable to:

receive the notification at a second network element in one of the identified pairs of network elements; and

establish a pool of TCP connections in anticipation of peak periods when the collective social affinity score is high.