Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Performance Evaluation of the IEEE 802.16 MAC for QoS Support
IEEE Transactions on Mobile Computing
Supporting vehicular mobility in urban multi-hop wireless networks
Proceedings of the 6th international conference on Mobile systems, applications, and services
Scheduling in IEEE 802.16e Mobile WiMAX networks: key issues and a survey
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Modeling and resource allocation for mobile video over WiMAX broadband wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Scheduling algorithms for high-speed wireless networks need to be simple to implement for serving packets while ensuring quality-of-service (QoS). The ordinary frame-based scheduling principle is well-known for providing fair service with low implementation complexity. However, existing frame-based scheduling algorithms cannot properly handle location-dependent burst errors in wireless networks. To utilize the advantages of frame-based scheduling algorithms in error-prone wireless networks, we propose an elastic compensation model that provides not only smooth compensations without any service disruptions of flows but also flexible compensations to flows that experience frequent errors to provide flows with fairness of service. From our analysis and simulation studies, we found that the proposed compensation model shows smooth compensation performance without any service disruption periods and good fairness performance when channel errors occur.