Microsoft Technology Licensing, LLC

Facebook, Inc.

Bhupinder Singh Sethi

Sanjay N Kaniyar

Oludare Victor Obasanjo

David A Nichols

Paul A Elliott

Michelle M Aleong

James T Pinkerton

Eric J Zappa

Shiyu Zhao

Yang Xia

Abolade Gbadegesin

Alireza Dabagh

Omar H Shahine

Nk Srinivas

Arvind M Murching

Shaun David Cox

Jeffrey Craig Kunins

Sachin C Sheth

Jeffrey Che Fuller

N K Srinivas

Paul Ming

An multi-level privacy evaluation technology is described for increasing the performance of applications or services that experience high volumes of queries for data with privacy attributes. The multi-level privacy evaluation technology evaluates data using a subset of privacy policy rules and privacy information determined for the data at a backend server and thereby reduces the volume of data that need to be filtered at a frontend server. The multi-level privacy evaluation technology first applies an initial privacy check on a large data set at the backend to authoritatively filter out any data that a viewing user is not permitted to view or access and return as results a smaller data set that the viewing user may be permitted to view or access. A full privacy check is then performed at the frontend on the smaller data set, resulting in reduction in the overall cost of performing privacy checks and reducing latency in displaying data to the viewing user.

Multi-level privacy evaluation

Techniques are described to establish one-way public relationships. In an implementation, a service manager module is usable to configure a webpage for output to a client over a network to provide to a user of the client an indication of others users that are part of a social network of the user and have establishes one-way public relationships, respectively, with another user corresponding to an object of a social networking service available from a service provider. In addition, a relation module is configured to establish a one-way public relationship between the user of the client and the other user corresponding to the object without establishing a mutual friend relationship between the user and the other user. In an implementation, the one-way public relationship is established in response to user selection of a control that is presented on the webpage that is output at the client in conjunction with the object.

One-way public relationships

People often trust ratings provided by those with whom they have an existing relationship more than they would trust ratings provided by strangers. A system that provides ratings can combine the ratings with information about a person's social network, in order to provide information that a person seeking the rating may find more reliable. The information provided to a person may, in some manner, differentiate between ratings that were provided by members of the person's social network and ratings that were provided by those outside of the persons' social network.

Rating based on relationship

Information aggregation techniques are described. In an implementation, a communication is received that includes an indication of a source of information associated with a non-member of the social network. Information associated with the non-member is aggregated from the source. The aggregation may be performed in response to receipt of a selection by a member of the social network service to interact with the information from the source. The aggregated information may then be presented to a member in conjunction with webpages output for interaction with the social network.

Information aggregation service

A computer system to efficiently process packets received over a network operating in accordance with a layered protocol. The system includes logic that provides combined processing to determine whether a received packet complies with multiple requirements of the layered protocol. Combined processing determines compliance with requirements at more than one of the protocol layers of the layered protocol. If the combined processing does not verify compliance with all of the requirements of a protocol layer, those requirements may be verified in a layered fashion following the combined processing. In this way, greater efficiencies may be achieved through the combined processing of requirements from multiple protocol layers, but advantages of implementing a layered protocol in a modular fashion may still be retained.

Combined header processing for network packets

Techniques are described to establish one-way public relationships. In an implementation, a control is exposed that is operable to become a fan of an object within a social networking page. Responsive to operation of the control, data may be stored to establish a one-way public relationship between a user and the selected object. By establishing a one-way public relationship rather than a mutual friend relationship, the object and/or a corresponding owner of the object is not included in the user's social network and is not provided access to the user's profile, status, or other personal information. The one-way public relationship may be employed by a service provider to serve content related to the object to the user. The one-way public relationships may also be employed by the service provider to push status updates regarding the object to 'fans' of the object.

Techniques are described for use with social networks and associated access information, such as access control lists, indicating which users are allowed to access the social networks. The social networks represent relationships between users. The social networks and access control lists may be represented in a graph which is traversed in connection with performing different operations using the social networks.

Using social networks while respecting access control lists

A method and system for tracking context information of a service provider and interceptors of service provider requests is provided. An interceptor modifies a portion of service provider context information to reference interceptor context information associated with a client. When the client requests a service of the service provider, the client provides the modified service provider context information along with the request. The interceptor uses the reference of the modified portion of the service provider context information to retrieve its context information. The interceptor then restores the modified portion of the service provider context information to the original unmodified portion, which the interceptor retained as part of its context information. The interceptor then forwards the request along with the original service provider context information to the service provider.

Modifying service provider context information to facilitate locating interceptor context information

A new method and framework for scheduling receive-side processing of data streams received from a remote requesting client by a multiprocessor system computer is disclosed. The method receives data packets from the remote requesting client via a network and, for each data packet, applies a cryptographically secure hashing function to portions of the received data packet yielding a hash value. The method further applies the hash value to a processor selection policy to identify a processor in the multiprocessor system as a selected processor to perform receive-side processing of the data packet. The method queues the received data packet for processing by the selected processor and invokes a procedure call to initiate processing of the data packet.

Receive side scaling with cryptographically secure hashing

Mechanisms in which reliable communication is enabled without having to wait for a final acknowledgement message. An upper layer issues a send request. The message is then placed in a send queue. If data in the send queue is less than (or equal to) a predetermined threshold at this stage, the packet is sent, a successful transmission report is returned to the caller, and the data is copied to an internal buffer for use in case transmission was unsuccessful. If the amount of data in the send queue is more than that predetermined threshold, the packets are sent. Subsequently, each time an acknowledgement is received, the determination is repeated until the amount of unacknowledged data in the send queue is less than or equal to the predetermined threshold. Then, the successful transmission report is returned to the caller.

Use of internal buffer to reduce acknowledgement related delays in acknowledgement-based reliable communication protocols

The present invention protects against denial of service attacks on lookup or hash tables used to store state information for data transfer protocols used to transfer data between two host computers. Two hash tables are provided for holding state information, one for verified remote entities (i.e., those where the remote local address can be traced to a host), and one for unverified entities. A cryptographically secure hash is applied to packets from unverified remote entities, since these are the most likely to attempt attacks on the hash tables. The performance of the local server for packets from verified remote entities, however, is maintained.

Efficient hash table protection for data transport protocols

A unified congestion notification mechanism can detect congestion at a recipient device either directly, such as via an explicit indicator, or indirectly, such as via dropped packets. Such congestion can then be indicated to the sending device either by leveraging an existing congestion notification mechanism, including by spoofing expected communications, or by creating a new congestion notification mechanism. Additionally, modifications to lossless protocols, such as TCP/IP can adapt them for use with streaming data while still implementing the unified congestion notification mechanism by eliminating retransmissions either as a result of the retransmission timeout or as a result of information conveyed as part of the acknowledgement packets.

Growing community of inventors

Redmond, WA, United States of America

Bhupinder Singh Sethi