Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling integration of streaming and data traffic
Performance Evaluation
On Stochastic Bounds for Monotonic Processor Sharing Networks
Queueing Systems: Theory and Applications
Asymptotic regimes and approximations for discriminatory processor sharing
ACM SIGMETRICS Performance Evaluation Review
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
The Erlang model with non-poisson call arrivals
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Optimal File Splitting for Wireless Networks with Concurrent Access
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
Effective load for flow-level performance modelling of file transfers in wireless LANs
Computer Communications
| Hi-index | 0.00 |
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the ''strict'' and ''approximate'' insensitivity of a Processor Sharing (PS) system, specifically for the Egalitarian (EPS) and Discriminatory (DPS) variants of PS. Assuming homogeneous channel conditions, all concurrent flows are allocated an equal share of downlink transmission slots regardless of flow types and locations. The cell system is modeled as an EPS queue. We prove the performance insensitivity of EPS in a relevant new case that has not been studied in the literature. Considering heterogenous channel conditions, the system is modeled as the DPS queue in which each traffic type is divided into subclasses with different assigned weights. Asymmetric weights among the subclasses model the unequal channel sharing that occurs with PF scheduling. Our results show that the first-order performance of the DPS is largely insensitive to the input traffic characteristics, as long as the weights among subclasses are not highly skewed. Our findings, confirmed by the simulation of a cellular system, imply reduced complexity for traffic provisioning procedures. However, our study also shows that the first-order performance is sensitive to the traffic details when there is discrimination among different traffic types. This observation implies that the introduction of differentiated services may pose a great challenge to network provisioning in future cellular systems.