Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Blocking in a shared resource environment with batched Poisson arrival processes
Performance Evaluation
"Call-level" and "Burst-level" priorities for an effective management of multimedia services in UMTS
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
A medium-access control protocol for a cellular packet CDMA carrying multirate traffic
IEEE Journal on Selected Areas in Communications
A decision-theoretic approach to call admission control in ATM networks
IEEE Journal on Selected Areas in Communications
Wireless Personal Communications: An International Journal
International Journal of Mobile Communications
Optimal bandwidth allocation for multimedia mobile networks using particle swarm optimization
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Stable protocols for the medium access control in wireless networks
DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Bandwidth degradation QoS provisioning for adaptive multimedia in wireless/mobile networks
Computer Communications
Hi-index | 0.00 |
Priority based link-bandwidth partitioning is required to support wireless multimedia services, having diverse QoS (delay, throughput) requirements, in mobile ad hoc networks with multimedia nodes. A new class of service disciplines, termed “batch and prioritize” or BP admission control (AC), is proposed. The BP algorithms use the delay tolerance of applications to batch requests in time slots. Bandwidth assignment is made either at the end of the slot, or during the slot, on a priority basis. Analytical and simulation models are developed to quantify the performance of the BP schemes. The results are compared with those obtained for a First-Come-First-Served (FCFS) service discipline. The class of BP schemes trade off the delay and loss tolerance of applications to improve the net carried traffic on the link. Further, such schemes enable an easy implementation for adaptive prioritization, where the degree of precedence given to an application varies with offered load and the link capacity.