Jeffrey B Parham

US Patent:

6457011, Sep 24, 2002

Filed:

Jul 23, 1999

Appl. No.:

09/359510

Inventors:

Colin H. Brace - Seattle WA
Donald J. Hacherl - North Bend WA
Jeffrey B. Parham - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707 10, 707103

Abstract:

A Knowledge Consistency Checker (KCC) that periodically executes on each server of the computer network is provided. The KCC interacts with a data structure contained within a copy of a database located on each server, and with a replication program that executes on each server when called by the KCC. The data structure contains a list of server objects representing the servers in the network. Associated with each server objects is a list or replication objects that describe how the server is obtain a copy of a change to the database. Each replication object represents a server other than the server with which it is associated. The KCC uses the replication objects to inform the replication program from which servers to periodically request an update to the database and to the data structure. Thus, while each KCC is only responsible for creating the objects required for its own server, the replication topology of the entire network is provided to every server in the network by the periodic requests.

US Patent:

6643670, Nov 4, 2003

Filed:

Feb 27, 2001

Appl. No.:

09/793868

Inventors:

Jeffrey B. Parham - Redmond WA
Eyal Schwartz - Bellevue WA
William B. Lees - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707201, 707 10, 707203, 709203, 709219

Abstract:

A replication occurs upon the re-configuration of a partial database to update an additional attribute of an object, and is divided into two sub-requests for replication. The first requests the new attribute from update sequence number zero and the second requests the existing attributes according to their known up-to-date vectors. To facilitate this request, a destination server sends an up-to-date vector table to a source server along with the request for replication. Because the existing attributes are requested from their known up-to-date vectors, rather than from update sequence number zero, this replication request results in less attributes being sent between servers and therefore, provides a more efficient replication.

US Patent:

6654771, Nov 25, 2003

Filed:

Oct 2, 2000

Appl. No.:

09/677945

Inventors:

Jeffrey B. Parham - Redmond WA
William B. Lees - Redmond WA

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 1730

US Classification:

707204, 707202, 709221, 709223

Abstract:

Techniques are provided for replicating database changes among servers of a database system that effectively removes the inconsistency problems encountered after restoration from backup and due to removal and re-addition of partitions by assigning a new GUID to a server after it has been restored or after the partition has been re-added. This new GUID is used for identifying new changes made by the server after restoration or partition re-addition. By virtue of the use of the new GUID, new changes made after restoration will not be confused with any changes made by the server after the backup and before the restoration, which are identified by the old GUID of the server, thereby ensuring convergence of the servers data through replication. Similarly, by virtue of the use of the new GUID, new changes made after re-addition of a partition will not be confused with any changes made prior to the re-addition of the partition.

US Patent:

6879564, Apr 12, 2005

Filed:

Feb 28, 2001

Appl. No.:

09/795202

Inventors:

Jeffrey B. Parham - Redmond WA, US
Mark R. Brown - Seattle WA, US
William B. Lees - Redmond WA, US
Van H. Vu - Bellevue WA, US
Laszlo Lovasz - Sammamish WA, US
Nicholas J. A. Harvey - Redmond WA, US
Katalin Vesztergombi - Sammamish WA, US

Assignee:

Microsoft Corp. - Redmond WA

International Classification:

H04L012/28

US Classification:

370256, 709241

Abstract:

A method for designating communication paths in a computer network is provided, in which communication paths are designated for the transmission of data throughout a network. The network may have both recipient computers, which are the intended recipients of the data, and intermediary computers, which are not the intended recipients, but merely relay the data. Each intermediary computer is grouped with the “closest” recipient computer (i. e. the recipient computer with whom it is “least expensive” to communicate). Communication paths between the resulting groups are then identified. A representation of the network is then created. The representation replaces the intermediary computers with the inter-group communication paths, so that the inter-group communication paths appear to pass directly through the locations occupied by the intermediary computers. The created representation is then further processed so that the “least expensive” communication paths may be designated.

US Patent:

7035922, Apr 25, 2006

Filed:

Nov 27, 2001

Appl. No.:

09/995121

Inventors:

Jeffrey B. Parham - Redmond WA, US

Assignee:

Microsoft Corporation - Remond WA

International Classification:

G06F 15/173

US Classification:

709224, 709242, 707200

Abstract:

A method for monitoring replica servers in a networked computer system is provided, in which each server in the system has a replica partner vector table that includes state information about other servers in the system. The replica partner vector table includes data fields for storing an update sequence number (USN) and timestamp information that identifies the time of the last update and/or the time last successful replication attempt for each replica server in the system. After each successful replication, the server updates the entries in the replica partner vector to reflect the updated USN and timestamp information. The replica monitoring method evaluates the USN and timestamp entries in the replica partner vector table to determine if any servers in the system are latent. If the monitoring method detects that a server in the system is latent, an alert is generated whereby users and/or a network administrator are informed of the problem.

US Patent:

7162499, Jan 9, 2007

Filed:

Jan 19, 2001

Appl. No.:

09/765542

Inventors:

William B. Lees - Redmond WA, US
Jeffrey B. Parham - Redmond WA, US
Mark R. Brown - Seattle WA, US
Donald J. Hacherl - North Bend WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707203, 707204, 707103 R

Abstract:

A network computer maintains a directory of objects having multi-valued attributes. The attributes are comprised of individual linked values having conflict-resolution data that indicates a change to an object at an attribute-value level. A second network computer stores a replica of the directory in which a replica of the objects is maintained. The computers replicate the objects in the directories and update the individual linked values of the attributes. Replication conflicts are identified and resolved with the conflict-resolution data at the attribute-value level of the objects.

US Patent:

7370195, May 6, 2008

Filed:

Sep 22, 2003

Appl. No.:

10/667582

Inventors:

Jeffrey B. Parham - Redmond WA, US
Brendan Dixon - Sammamish WA, US
Murli Satagopan - Sammamish WA, US
Richard Bruce Ward - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 9/00

US Classification:

713155, 713154, 713162, 713168, 713182, 713183, 705 67, 726 2, 726 3, 726 4, 726 5, 726 6, 726 7, 726 30

Abstract:

An improved network architecture employs a super authority having an identity catalog to direct login authentication tasks to appropriate authorities. Authentication tasks may be performed by authorities across namespace boundaries if so directed by the super authority, such that a principal account may be moved without alteration of the account ID. In an embodiment of the invention, the identity catalog comprises a listing associating account IDs with appropriate authenticating authorities.

US Patent:

7499413, Mar 3, 2009

Filed:

Jan 26, 2005

Appl. No.:

11/043607

Inventors:

Jeffrey B. Parham - Redmond WA, US
Mark R. Brown - Seattle WA, US
William B. Lees - Redmond WA, US
Van H. Vu - Bellevue WA, US
Laszlo Lovasz - Sammamish WA, US
Nicholas J. A. Harvey - Redmond WA, US
Katalin Vesztergombi - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 12/28

US Classification:

370256, 709241

Abstract:

A method for designating communication paths in a computer network is provided, in which communication paths are designated for the transmission of data throughout a network. The network may have both recipient computers, which are the intended recipients of the data, and intermediary computers, which are not the intended recipients, but merely relay the data. Each intermediary computer is grouped with the “closest” recipient computer (i. e. the recipient computer with whom it is “least expensive” to communicate). Communication paths between the resulting groups are then identified. A representation of the network is then created. The representation replaces the intermediary computers with the inter-group communication paths, so that the inter-group communication paths appear to pass directly through the locations occupied by the intermediary computers. The created representation is then further processed so that the “least expensive” communication paths may be designated.