Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Quality of service and flow level admission control in the internet
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Congestion at flow level and the impact of user behaviour
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of strategies for integration of elastic and stream traffic
Performance evaluation of strategies for integration of elastic and stream traffic
Wireless downlink data channels: user performance and cell dimensioning
Proceedings of the 9th annual international conference on Mobile computing and networking
Modeling integration of streaming and data traffic
Performance Evaluation
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the joint international conference on Measurement and modeling of computer systems
Wireless data performance in multi-cell scenarios
Proceedings of the joint international conference on Measurement and modeling of computer systems
On Stochastic Bounds for Monotonic Processor Sharing Networks
Queueing Systems: Theory and Applications
Optimal insensitive routing and bandwidth sharing in simple data networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
On Queues with Markov Modulated Service Rates
Queueing Systems: Theory and Applications
Integration of streaming services and TCP data transmission in the Internet
Performance Evaluation - Performance 2005
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Location-based admission control for differentiated services in 3G cellular networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Insensitive queueing models for communication networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
On processor sharing and its applications to cellular data network provisioning
Performance Evaluation
Processor sharing: A survey of the mathematical theory
Automation and Remote Control
Throughputs in processor sharing models for integrated stream and elastic traffic
Performance Evaluation
Reversible fair scheduling: the teletraffic theory revisited
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Towards an Erlang formula for multiclass networks
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider joint strategies of bandwidth allocation and admission control for elastic users competing for a downlink data channel in a cellular network. For the sake of robustness and generality of the results we focus on the set of strategies whose performance does not depend on the detailed traffic characteristics beyond the traffic intensity. Performance is studied at the flow level in a dynamic setting where users come and go over time. A number of user classes are considered, which are characterized by their achievable bit rate, guaranteed throughput, arrival rate and mean flow size. We aim at characterizing a strategy which is optimal in the sense of having the lowest blocking probability. Such characterization provides some interesting insights into the optimal policy and its evolution as the system load increases. In some cases computing the optimal policy can be exceedingly complex except for lightly loaded systems. For those cases we propose a computationally feasible suboptimal policy that achieves a good relative performance. Finally, we show that in scenarios of practical interest, the loads of interest lie inside the region where the optimal policy can be efficiently computed.