Microsoft Technology Licensing, LLC

James Evan Undery

Mark Markaryan

Jeremy Thomas Buch

Michael Trommsdorff

David J Simons

Maksim Lepikhin

Christopher Stephen Messer

Philip Starhill

Keith Seifert

An input mesh can be decomposed into component meshes that can be independently simplified. A computing device can calculate costs of performing candidate edge collapses for a component mesh. The candidate edge collapses can include boundary edge collapses and interior edge collapses. To simplify a component mesh, the execution of boundary edge collapses and the execution of interior edge collapses are interleaved in an order based on the costs of performing the candidate edge collapses. The position of a vertex resulting from a boundary edge collapse can be calculated independently of the interior of the component mesh. When component meshes are simplified in parallel, a boundary that is common to the component meshes can be simplified identically.

Maintaining consistent boundaries in parallel mesh simplification

In an embodiment, techniques for sustaining session connections are provided. The techniques send heartbeat messages when not sending a message may cause the session connection to close because of a timeout condition. Heartbeat messages are valid transport layer messages that will be ignored by protocols at higher levels of a data communications stack. As an example, the techniques may send a TCP message containing only a carriage return and line feed ('CRLF') in its payload. Because the TCP layer considers a message containing only a CRLF to be a valid TCP message, intermediary computing devices such as proxy servers may not interpret heartbeat messages as 'keep alive' messages, and may sustain session connections.

Sustaining session connections

Open federation security techniques with rate limits are described. An apparatus may include a network interface operative to communicate messages, and a secure open federation (SOF) module operative to manage a message rate between multiple federated networks. The SOF module may comprise a peer authentication module operative to determine whether a peer making the message is an untrusted peer. The SOF module may comprise a peer rate tracking module operative to retrieve a message rate value and a message rate limit value associated with the untrusted peer, and compare the message rate value with the message rate limit value to form a threat status indicator value. The SOF module may comprise a peer authorization module operative to authorize communication of the message based on the threat status indicator value. Other embodiments are described and claimed.

Open federation security techniques with rate limits

Techniques to protect from open enhanced federation user enumeration are described. An apparatus may include a network interface operative to establish connections. The access edge server may further include an open enhanced federation (OEF) module communicatively coupled to the network interface. The OEF module may be operative to manage connections between multiple federated networks. In one embodiment, for example, the OEF module may comprise a peer authentication module operative to determine whether a peer making the request is an untrusted peer domain. The OEF module may further comprise a peer tracking module operative to retrieve a total request number and a total limit number associated with the untrusted peer, and compare the total request number with the total limit number to form a threat status indicator value. The OEF module may also comprise a peer authorization module operative to authorize the request based on the threat status indicator value. Other embodiments are described and claimed.

Growing community of inventors

Seattle, WA, United States of America

James Evan Undery