Method and apparatus for providing fair traffic scheduling among aggregated internet protocol flows
US6084855A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Feb 18, 1997 |
| Grant date | Jul 4, 2000 |
| Priority date | — |
| Expiry date | Feb 18, 2017 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/568
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method and apparatus is disclosed for providing fair traffic scheduling of L2 connections based on the number of IP flows and a priority coefficient for flow groups in the L2 connection. IP flows are scheduled according to a priority coefficient. The system identifies a number of IP flows for a plurality of connections, assigns a priority coefficient for each of the IP flows and schedules the IP flows according to the priority coefficient. The assignment of a priority coefficient results in a probability P.sub.i that a data unit belonging to a flow carried over connection A.sub.i will be selected for forwarding as defined by .sigma..sub.i *x.sub.i /.SIGMA.(x.sub.1 . . . x.sub.n), i={1,2, . . . n}, where x.sub.i is the number of flows carried over connection A.sub.i, .sigma..sub.i is the priority and n is the number of connections. The relationship between the number of flows x.sub.i and the priority .sigma..sub.i is defined by .SIGMA..sub.(e=1-n) (.sigma..sub.i *x.sub.i)/.SIGMA..sub.(i=1-n) x.sub.i =1.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.