Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
A comparison of mechanisms for improving TCP performance over wireless links
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
The Eifel algorithm: making TCP robust against spurious retransmissions
ACM SIGCOMM Computer Communication Review
I-TCP: indirect TCP for mobile hosts
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Proceedings of the 10th annual international conference on Mobile computing and networking
A flexible downlink scheduling scheme in cellular packet data systems
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Efficient Internet traffic delivery over wireless networks
IEEE Communications Magazine
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Current downlink scheduling algorithms in the (enhanced) third-generation (3G) cellular packet systems exploit instantaneous channel status of multiple users, but most of them are blind to traffic information. To improve TCP users' perception of quality-of-services (QoSs), characterized by response delay, goodput, and always-on connectivity, we propose a cross-layer hierarchical scheduler with traffic awareness and channel dependence to properly prioritize buffer and radio resource allocation among different TCP classes. The scheduler has two tiers: At the IP layer, an intrauser scheduler enhances a common practice, i.e., the DiffServ-based buffer management, by dequeuing same-user TCP packets according to per-class specified and measured responsiveness; at the MAC layer, an interuser scheduler transmits the dequeued packets by considering the opportunistic channel states, mean throughput, and class ID of all users. Both tiers consider the online measured throughput, a cross-layer metric, to achieve resource and performance fairness and TCP classification. Experiments show that, compared with (variations of) Proportional Fairness (PF) and other schemes, our scheduler can notably speed up time-critical interactive TCP services (HTTP and TELNET) or TCP slow-starts with minor cost to bulk file transfer (FTP) or long-lived flows. It offers scalable and low-cost TCP performance enhancement over the emerging cellular systems.