The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 12, 2005
Filed:
Feb. 28, 2001
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);
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);
Microsoft Corp., Redmond, WA (US);
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.