IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Distributed multi-hop scheduling and medium access with delay and throughput constraints
Proceedings of the 7th annual international conference on Mobile computing and networking
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Call Admission and Resource Reservation for Multicast Sessions
Call Admission and Resource Reservation for Multicast Sessions
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
A scalable approach to the partition of QoS requirements in unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Call admission and resource reservation for multicast sessions
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal partition of QoS requirements with discrete cost functions
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Wireless Mesh Networks (WMNs) are currently attracting strong attention due to their great potential in supporting multimedia applications with real-time transport with last-mile Internet access. Multimedia end-to-end transmission requires Quality of Service (QoS) guarantees. Mapping end-to-end QoS requirements into link QoS requirements is an important step for providing QoS in WMNs. Despite the importance of this functionality, it is yet to be addressed in WMNs or, more generally, in multihop wireless networks. Such mappings, however, have resulted in several algorithms being proposed for connection-oriented wired networks. The algorithms proposed, nevertheless, are either near-optimal or heuristics, and provide solutions for only one end-to-end requirement. In this paper, we propose a partitioning algorithm that is capable of partitioning multiple end-to-end QoS requirements simultaneously. We define QoS as the pair of the required end-to-end delay and the violation probability of meeting the required end-to-end delay. Our approach is motivated by experiments decisively showing that the delay probability distribution can be accurately characterized by a gamma or logistic distribution, thus there is not a specific one distribution that can characterize the delay. This conclusion is used to formulate a mathematical linear program that optimally partitions the end-to-end delay and the violation probability into link delays and link violation probabilities without imposing any specific delay distribution. Extensive simulation verified the effectiveness of the algorithm compared to two representative QoS partitioning algorithms. The proposed algorithm outperforms the other algorithms for loose and stringent QoS requirements, and over different path lengths.