A comparison of mechanisms for improving TCP performance over wireless links
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Proceedings of the 10th annual international conference on Mobile computing and networking
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Stability of multi-class queueing systems with state-dependent service rates
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Flow-level stability of data networks with non-convex and time-varying rate regions
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Traffic capacity of multi-cell WLANS
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stability of Parallel Queueing Systems with Coupled Service Rates
Discrete Event Dynamic 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
Stability of two interfering processors with load balancing
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
IEEE Transactions on Information Theory
Flow-level performance and capacity of wireless networks with user mobility
Queueing Systems: Theory and Applications
User Association to Optimize Flow Level Performance in Wireless Systems with Dynamic Interference
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
Performance analysis of wireless multihop data networks
Proceedings of the Third international EURO-NGI network of excellence conference on Wireless systems and mobility in next generation internet
Stability and benefits of suboptimal utility maximization
IEEE/ACM Transactions on Networking (TON)
Distributed α-optimal user association and cell load balancing in wireless networks
IEEE/ACM Transactions on Networking (TON)
Practical adaptive user association policies for wireless systems with dynamic interference
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.06 |
The performance of wireless data systems has been extensively studied in the context of a single base station. In the present paper we investigate the flow-level performance in networks with multiple base stations. We specifically examine the complex, dynamic interaction of the number of active flows in the various cells introduced by the strong impact of interference between neighboring base stations. For the downlink data transmissions that we consider, lower service rates caused by increased interference from neighboring base stations result in longer delays and thus a higher number of active flows. This in turn results in a longer duration of interference on surrounding base stations, causing a strong correlation between the activity states of the base stations. Such a system can be modelled as a network of multi-class processor-sharing queues, where the service rates for the various classes at each queue vary over time as governed by the activity state of the other queues. The complex interaction between the various queues renders an exact analysis intractable in general. A simplified network with only one class per queue reduces to a coupled-processors model, for which there are few results, even in the case of two queues. We thus derive bounds and approximations for key performance metrics like the number of active flows, transfer delays, and flow throughputs in the various cells. Importantly, these bounds and approximations are insensitive, yielding simple expressions, that render the detailed statistical characteristics of the system largely irrelevant.