Name
Abstract | ||
|---|---|---|
Fair resource allocation is usually studied in a static context, in which a fixed amount of resources is to be shared. In
dynamic resource allocation one usually tries to assign resources instantaneously so that the average share of each user is
split fairly. The exact definition of the average share may depend on the application, as different applications may require
averaging over different time periods or time scales. Our main contribution is to introduce new refined definitions of fairness
that take into account the time over which one averages the performance measures. We examine how the constraints on the averaging
durations impact the amount of resources that each user gets.
|
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.comcom.2012.01.013 | Computer Communications |
Keywords | Field | DocType |
main contribution,exact definition,wireless network,fixed amount,different application,durations impact,different fairness criterion,multiscale fairness,dynamic resource allocation,different time period,new concept,fair resource allocation,time scale,resource sharing,average share,resource allocation,networking | Wireless network,Max-min fairness,Computer science,Computer network,Real-time computing,Resource allocation,Fairness measure,Shared resource,Distributed computing | Journal |
Volume | Issue | ISSN |
35 | 7 | 0140-3664 |
Citations | PageRank | References |
3 | 0.42 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eitan Altman | 1 | 5085 | 516.73 |
| Konstantin Avrachenkov | 2 | 1250 | 126.17 |
| Sreenath Ramanath | 3 | 28 | 6.53 |