Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems 2004
DOI: 10.1145/1005686.1005730
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a PNA Probability, Networks and Algorithms Probability, Networks and AlgorithmsWireless Data Performance in Multi-Cell Scenarios ABSTRACT 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 introduced by the strong impact of interfer… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
81
0
3

Year Published

2005
2005
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 74 publications
(87 citation statements)
references
References 15 publications
3
81
0
3
Order By: Relevance
“…Since P(N 0 = 0, N i = 0) > 0 implies stability of node i, it follows that node i is stable if ρ 0 + ρ i + w i < 1. The above observation reflects the fact that the stability condition may not only depend on the first moments of the service requirements as captured through the loads, but also on higher-order characteristics, as was found in [8] as well. The scheduling discipline prescribes the allocation of the service rates among competing users, depending on the state of the network.…”
Section: Model Description and Preliminary Resultsmentioning
confidence: 61%
“…Since P(N 0 = 0, N i = 0) > 0 implies stability of node i, it follows that node i is stable if ρ 0 + ρ i + w i < 1. The above observation reflects the fact that the stability condition may not only depend on the first moments of the service requirements as captured through the loads, but also on higher-order characteristics, as was found in [8] as well. The scheduling discipline prescribes the allocation of the service rates among competing users, depending on the state of the network.…”
Section: Model Description and Preliminary Resultsmentioning
confidence: 61%
“…As observed in Bonald et al (2004a), the intricate correlation among the various servers renders an exact analysis elusive in general. In the special case of a static server assignment strategy and each server handling a single user class, the system corresponds to a so-called coupled-processors model, which even in the case of two queues is barely tractable, although the stability condition is then relatively simple.…”
Section: With Server Interactionmentioning
confidence: 99%
“…Although π 10 + π 11 = ρ 1 /C 11 and π 01 + π 11 = ρ 2 /C 22 , the individual probabilities π ij and thus the value of the entire expression depend on the detailed features of the server assignment scheme. (If the service rates of servers 1 and 2 did depend on the activity states of the other servers, then the probabilities in fact may even be sensitive to the service requirement distributions (Bonald et al 2004a).) This suggests that static assignment schemes will in general not suffice to achieve the full stability region and system capacity, and that there do not even exist any simple greedy dynamic schemes that do so.…”
Section: With Server Interactionmentioning
confidence: 99%
See 2 more Smart Citations