Research on the generalized utility max-min fair algorithm based on piecewise linear function
A generalized utility max-min(UMM) fair algorithm of resource allocation based on piecewise linear function was provided,which supported the upper/lower bounds of resource allocation as well as strictly increasing and continu-ous utility functions.Because of the avoidance of iterative procedure,this...
        Saved in:
      
    
          | Published in | Tongxin Xuebao pp. 25 - 30 | 
|---|---|
| Main Authors | , | 
| Format | Journal Article | 
| Language | Chinese | 
| Published | 
            Editorial Department of Journal on Communications
    
        01.01.2006
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1000-436X | 
Cover
| Summary: | A generalized utility max-min(UMM) fair algorithm of resource allocation based on piecewise linear function was provided,which supported the upper/lower bounds of resource allocation as well as strictly increasing and continu-ous utility functions.Because of the avoidance of iterative procedure,this algorithm was less complex than water-filling,another UMM fair algorithm.And its simplified version had the same complexity as the narrow-sense UMM fair algo-rithm based on piecewise linear function.This algorithm can be applied in various problems of resource allocation in the field of computer and communication. | 
|---|---|
| ISSN: | 1000-436X |