Models for routing tree selection in peer-to-peer communications
US7738406B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 8, 2008 |
| Grant date | Jun 15, 2010 |
| Priority date | — |
| Expiry date | Dec 9, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/48
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.