Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set
IEEE Transactions on Computers
Fair Coalitions for Power-Aware Routing in Wireless Networks
IEEE Transactions on Mobile Computing
Downlink capacity of hybrid cellular ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A lexicographic optimization framework to the flow control problem
IEEE Transactions on Information Theory
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
| Hi-index | 754.90 |
Channel allocation algorithms for channelized cellular systems are discussed from a new perspective, viz., fairness of allocation. The concepts of relative and absolute fairness are introduced and discussed. It is shown that under certain reasonable assumptions, there exists an absolute (max-min) fair carried traffic intensity vector (a vector describing the traffic carried in the cells of the system). We also show that this vector is unique. We describe some properties of the max-min fair carried traffic intensity vector in an asymptotic limit where the traffic and the number of channels are scaled together. For each traffic pattern, we determine a fixed channel allocation which attains this max-min fair carried traffic intensity vector independent of the value of the offered traffic, in the same asymptotic limit. Finally, we discuss a tradeoff between being max-min fair and trying to maximize revenue. We conclude by discussing some possible extensions of our work.