Scheduling data over multiple network interfaces
US8625429B2 · kind B2 · utility
Inventors
Key dates
| Filing date | Dec 19, 2011 |
| Grant date | Jan 7, 2014 |
| Priority date | — |
| Expiry date | Jan 19, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/621
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A scheduler is configured to schedule packets in a plurality of flows to a corresponding one of a plurality of interfaces. Each of the packets includes a flow identifier for identifying a corresponding one of the plurality of flows. The scheduler include memory having instructions for execution by the processor to implement a scheduling algorithm. The scheduling algorithm person as follows. Sections within a predefined range are assigned to corresponding ones of the plurality of interfaces. For each packet, a hash function is applied to the flow identifier to obtain a hash value that is evenly distributed within the predefined range. Additionally, for each packet, it is determined in which of the sections the hash value falls and the corresponding one of the plurality of interfaces is identified accordingly.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.