Raghunath Sapuram - Cedar Park TX, US Jayaram Rajan Kasi - San Jose CA, US Todd Christopher Klaus - San Jose CA, US Christopher Crall - Seattle WA, US Joseph Sanfilippo - San Jose CA, US
Assignee:
Open Invention Network, LLC - Pound Ridge NY
International Classification:
G06F 13/00
US Classification:
709238, 709249, 709250
Abstract:
The present invention includes devices and methods to establish networks of communities, route documents among communities having dissimilar interfaces and do so in a trusted and trustworthy manner. Particular aspects of the present invention are described in the claims, specification and drawings.
Christopher J. Crall - Seattle WA, US Gennady Medvinsky - Issaquah WA, US Joshua Ball - Lake Forest Park WA, US Karthik Jaganathan - Redmond WA, US Paul J. Leach - Seattle WA, US Liqiang Zhu - Kirkland WA, US David B. Cross - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
H04L 9/32 H04L 9/00
US Classification:
726 10, 726 14, 713175
Abstract:
A hint containing user mapping information is provided in messages that may be exchanged during authentication handshakes. For example, a client may provide user mapping information to the server during authentication. The hint (e. g. , in the form of a TLS extension mechanism) may be used to send the domain/user name information of a client to aid the server in mapping the user's certificate to an account. The extension mechanism provides integrity and authenticity of the mapping data sent by the client. The user provides a hint as to where to find the right account or domain controller (which points to, or otherwise maintains, the correct account). Based on the hint and other information in the certificate, the user is mapped to an account. The hint may be provided by the user when he logs in. Thus, a certificate is mapped to an identity to authenticate the user.
Dynamic Negotiation Of Security Arrangements Between Web Services
Symon Szu-Yuan Chang - Fremont CA, US Joseph S. Sanfilippo - San Jose CA, US Jayaram Rajan Kasi - San Jose CA, US Christopher Crall - Seattle WA, US
Assignee:
Open Invention Network, LLC - Pound Ridge NY
International Classification:
H04L 9/00 H04K 1/00
US Classification:
713189, 713150, 726 1, 380255
Abstract:
The present invention relates to computer-based devices and methods negotiate and implement security arrangements between two or more web services. More particularly, it relates to devices and methods that specify input and output interfaces, computation and generation of a security contract consistent with inputs, and implementation of security in accordance with negotiated security arrangements. Particular aspects of the present invention are described in the claims, specification and drawings.
Christopher J. Crall - Seattle WA, US Karthik Jaganathan - Redmond WA, US Liqiang Zhu - Kirkland WA, US Paul J. Leach - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 21/00 H04L 29/06
US Classification:
726 5, 713168, 713183
Abstract:
A domain controller (DC) side plugin supports one time passwords natively in Kerberos, Part of the key material is static and the other part is dynamic, thereby leveraging properties unique to each to securely support one time passwords in an operating system. The user is permitted to type in the one time passcode into a logon user interface. Rather than calling the SAM APIs to get the static passwords, vendors may register callbacks on the DC to plugin their algorithm. These callback functions will return the dynamically calculated passcodes for the user at a specific point in time. This passcode will then be treated as a normal password by the DC.
Computing Scheduling Using Resource Lend And Borrow
Colin Watson - Kirkland WA, US Konstantinos Kollias - Stanford CA, US Christopher J. Crall - Seattle WA, US Sayantan Chakravorty - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/173
US Classification:
709226, 709228, 709229, 709232
Abstract:
The scheduling of a processing job to be performed by at least a portion of a cluster of processing resources distributed across multiple machines. The processing job is associated with a certain entity having a certain amount of guaranteed processing resources on the cluster. If there are enough processing resources to perform the job, then the job may be initiated. On the other hand, if there are not enough processing resources to perform the job, and there are yet some remaining processing resources that are guaranteed to the certain entity, then one or more other jobs that are associated with other entities are at least partially preempted until there are enough processing resources to perform the processing job.
Sayantan Chakravorty - Redmond WA, US Colin Watson - Kirkland WA, US Christopher J. Crall - Seattle WA, US
Assignee:
MICROSOFT CORPORATION - Redmond WA
International Classification:
G06F 9/46
US Classification:
718104
Abstract:
The preemption of running jobs by other running or queued jobs in a system that has processing resources. The system has running jobs, and queued jobs that are awaiting processing by the system. In a scheduling operation, preemptor jobs are identified, the preemptor jobs being jobs that are candidates for preempting one or more of the running jobs. The preemptor jobs include queued jobs, as well as running jobs that are capable of using more processing resource of the system. One of the other running jobs is preempted to free processing resources for the running job that was identified as a preemptor job. Accordingly, not only may queued jobs preempt running jobs, but currently running jobs may preempt other currently running jobs.