Iterative algorithm for performing max min fair allocation
US6003062A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jul 16, 1997 |
| Grant date | Dec 14, 1999 |
| Priority date | — |
| Expiry date | Jul 16, 2017 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/5679
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
The present invention pertains to a method for providing service to entities. The method comprises the steps of receiving a first request for service by a server within a predetermined time from a first entity. Next there is the step of receiving a second request for service by the server within the predetermined time from a second entity. Then there is the step of reducing the service to be provided by the server to the first entity so the second entity can be provided service by the server within the predetermined time. The present invention pertains to a system for providing service. The system comprises N entities, where N is greater than or equal to 2. Each of the N entities require service. The system comprises a server which provides service to the N entities. Also, the system comprises a scheduler connected to the entities and the server. The scheduler provides service to the N entities by reducing the amount of service to at least one of the N entities from the server until all of the N entities receive their minimum amount of service.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.