Data networks
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Robustness of real and virtual queue-based active queue management schemes
IEEE/ACM Transactions on Networking (TON)
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Efficient and fair scheduling for wireless networks
Efficient and fair scheduling for wireless networks
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Scheduling and performance limits of networks with constantly changing topology
IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Delay reduction via lagrange multipliers in stochastic network optimization
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Cross-layer resource allocation for wireless networks via signomial programming
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Fairness-aware radio resource management in downlink OFDMA cellular relay networks
IEEE Transactions on Wireless Communications
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Utility optimal scheduling in processing networks
Performance Evaluation
Distributed resource allocation based on queue balancing in multihop cognitive radio networks
IEEE/ACM Transactions on Networking (TON)
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
On the interaction between TCP-like sources and throughput-efficient scheduling policies
Performance Evaluation
LIFO-backpressure achieves near-optimal utility-delay tradeoff
IEEE/ACM Transactions on Networking (TON)
Network Performance Optimization in Constrained Queueing Systems
Wireless Personal Communications: An International Journal
| Hi-index | 0.06 |
We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriately chosen queue-length based policies are throughput-optimal while other policies based on the estimation of channel statistics can be used to allocate resources fairly (such as proportional fairness) among competing users. In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.