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:
Jun. 15, 2010
Filed:
Oct. 08, 2008
Shao Liu, Redmond, WA (US);
Sudipta Sengupta, Redmond, WA (US);
Mung Chiang, Bellevue, WA (US);
Jin LI, Sammamish, WA (US);
Philip Andrew Chou, Bellevue, WA (US);
Shao Liu, Redmond, WA (US);
Sudipta Sengupta, Redmond, WA (US);
Mung Chiang, Bellevue, WA (US);
Jin Li, Sammamish, WA (US);
Philip Andrew Chou, Bellevue, WA (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration.