| US 7,499,413 B2 | ||
| Method for designating communication paths in a network | ||
| Jeffrey B. Parham, Redmond, Wash. (US); Mark R. Brown, Seattle, Wash. (US); William B. Lees, Redmond, Wash. (US); Van H. Vu, Bellevue, Wash. (US); Laszlo Lovasz, Sammamish, Wash. (US); Nicholas J. A. Harvey, Redmond, Wash. (US); and Katalin Vesztergombi, Sammamish, Wash. (US) | ||
| Assigned to Microsoft Corporation, Redmond, Wash. (US) | ||
| Filed on Jan. 26, 2005, as Appl. No. 11/43,607. | ||
| Application 11/043607 is a continuation of application No. 09/795202, filed on Feb. 28, 2001, granted, now 6,879,564. | ||
| Prior Publication US 2005/0256879 A1, Nov. 17, 2005 | ||
| Int. Cl. H04L 12/28 (2006.01) | ||
| U.S. Cl. 370—256 [709/241] | 9 Claims |
| 1. One or more computer storage media containing executable instructions that, when executed, implement the following steps:
creating one or more communication groups from a plurality of servers sharing a distributed database, wherein the plurality
of servers has one or more replicating servers and at least two intermediate servers, each communication group being created
by grouping each a first intermediate server with at least a second intermediate server and a replicating server, wherein
the intermediate servers are grouped with the replicating server with which it is optimal for the intermediate servers to
communicate;
identifying one or more inter-group communication paths, each inter-group communication path connecting two or more groups;
creating a replication topology representation having a plurality of primary communication paths in which the intermediate
servers are replaced with the inter-group communication paths; and
determining optimal communication paths using the replication topology representation.
|