Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
FHCF: a simple and efficient scheduling scheme for IEEE 802.11e wireless LAN
Mobile Networks and Applications
Simulation with real world network stacks
WSC '05 Proceedings of the 37th conference on Winter simulation
NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
An integrated framework for enabling effective data collection and statistical analysis with ns-2
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
Design and performance analysis of the Real-Time HCCA scheduler for IEEE 802.11e WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGMOBILE Mobile Computing and Communications Review
User-level performance evaluation of VoIP using ns-2
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
TCP fairness issues in IEEE 802.11 wireless LANs
Computer Communications
A scheduling algorithm for QoS support in IEEE802.11 networks
IEEE Wireless Communications
Web traffic modeling exploiting TCP connections' temporal clustering through HTML-REDUCE
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
In this paper we present a solution for the IEEE 802.11e HCCA (Hybrid coordination function Controlled Channel Access) mechanism which aims both at supporting strict real-time traffic requirements and, simultaneously, at handling TCP applications efficiently. Our proposal combines a packet scheduler and a dynamic resource allocation algorithm. The scheduling discipline is based on the Monolithic Shaper-Scheduler, which is a modification of a General Processor Sharing (GPS) related scheduler. It supports minimum-bandwidth and delay guarantees and, at the same time, it achieves the optimal latency of all the GPS-related schedulers. In addition, our innovative resource allocation procedure, called the territory method, aims at prioritizing real time services and at improving the performance of TCP applications. For this purpose, it splits the wireless channel capacity (in terms of transmission opportunities) into different territories for the different types of traffic, taking into account the end-to-end network dynamics. In order to give support to the desired applications, we consider the following traffic classes: conversational, streaming, interactive and best-effort. The so called territories shrink or expand depending on the current quality experienced by the corresponding traffic class. We evaluated the performance of our solution through extensive simulations in a heterogeneous wired-cum-wireless scenario under different traffic conditions. Additionally, we compare our proposal to other HCCA scheduling algorithms, the HCCA reference scheduler and Fair Hybrid Coordination Function (FHCF). The results show that the combination of the MSS and the territory method obtains higher system capacity for VoIP traffic (up to 32 users) in the simulated scenario, compared to FHCF and the HCCA reference scheduler (13 users). In addition, the MSS with the territory method also improves the throughput of TCP sources (one FTP application achieves between 6.1 Mbps without VoIP traffic and 2.1 Mbps with 20 VoIP users) compared to the reference scheduler (at most 388 kbps) and FHCF (with a maximum FTP throughput of 4.8 Mbps).