Patents by Inventor Robert Lomme
Robert Lomme has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9336324Abstract: A security trimming system disclosed herein uses intelligent caching of the security trimming information received from a security datastore. The security trimming system uses an access cache to store the security trimming information received from the access datastore together with other parameters associated with such security trimming information. Subsequently, in responding to a request for the security trimming information, the security trimming system uses the cached value of the security trimming information together with the other associated parameters to determine a response to the request from the content providers. In one implementation, if the other parameters associated with a particular security trimming information imply that the security trimming information in the cache is still valid, the cached security trimming information is used in the request response. Otherwise, a new request is sent to the security datastore for an updated value of the security trimming information.Type: GrantFiled: November 1, 2011Date of Patent: May 10, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Robert Lomme, Benjamin Wilde, Michael Tavis, Alexei Evdokimov, Siddharth R. Shah, Puneet Narula
-
Publication number: 20130111559Abstract: A security trimming system disclosed herein uses intelligent caching of the security trimming information received from a security datastore. The security trimming system uses an access cache to store the security trimming information received from the access datastore together with other parameters associated with such security trimming information. Subsequently, in responding to a request for the security trimming information, the security trimming system uses the cached value of the security trimming information together with the other associated parameters to determine a response to the request from the content providers. In one implementation, if the other parameters associated with a particular security trimming information imply that the security trimming information in the cache is still valid, the cached security trimming information is used in the request response. Otherwise, a new request is sent to the security datastore for an updated value of the security trimming information.Type: ApplicationFiled: November 1, 2011Publication date: May 2, 2013Applicant: MICROSOFT CORPORATIONInventors: Robert Lomme, Benjamin Wilde, Michael Tavis, Alexei Evdokimov, Siddharth R. Shah, Puneet Narula
-
Patent number: 8165041Abstract: A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.Type: GrantFiled: December 15, 2008Date of Patent: April 24, 2012Assignee: Microsoft CorporationInventors: Jim Jianping Wang, Robert A. Lomme, Jr., Ransom L. Richardson, Thomas D. Sanfilippo
-
Publication number: 20100150157Abstract: A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.Type: ApplicationFiled: December 15, 2008Publication date: June 17, 2010Applicant: Microsoft CorporationInventors: Jim Jianping Wang, Robert A. Lomme, JR., Ransom L. Richardson, Thomas D. Sanfilippo
-
Patent number: 7720083Abstract: Intelligent routing may be provided. First, a second peer via home relay may receive presence information indicating that a first peer is connected to a first foreign relay. Then the second peer may update, in response to the presence information, a routing table to indicate that a primary place to send data to the first peer is the first foreign relay. Next, the second peer may determine from the routing table that the primary place to send the data to the first peer is the first foreign relay. Next, the home relay may receive a request from a second peer to send data to the first peer via the first foreign relay. Then, in response to determining from the routing table that the primary place to send the data to the first peer is the first foreign relay, the data may be sent to the first foreign relay.Type: GrantFiled: September 28, 2007Date of Patent: May 18, 2010Assignee: Microsoft CorporationInventors: Leon James Alexandrou, Robert A. Lomme, Jr., Brian Hunter, Weidong Wang
-
Publication number: 20090086727Abstract: Intelligent routing may be provided. First, a second peer via home relay may receive presence information indicating that a first peer is connected to a first foreign relay. Then the second peer may update, in response to the presence information, a routing table to indicate that a primary place to send data to the first peer is the first foreign relay. Next, the second peer may determine from the routing table that the primary place to send the data to the first peer is the first foreign relay. Next, the home relay may receive a request from a second peer to send data to the first peer via the first foreign relay. Then, in response to determining from the routing table that the primary place to send the data to the first peer is the first foreign relay, the data may be sent to the first foreign relay.Type: ApplicationFiled: September 28, 2007Publication date: April 2, 2009Applicant: Microsoft CorporationInventors: Leon James Alexandrou, Robert A. Lomme, JR., Brian Hunter, Weidong Wang