Proceedings ArticleDOI
Downlink scheduling in CDMA data networks
Niranjan Sudhir Joshi,Srinivas R. Kadaba,Sarvar Patel,Ganapathy Subramanian Sundaram +3 more
- pp 179-190
Reads0
Chats0
TLDR
This work addresses resource management on the downlink of CDMA packet data networks, and argues that the discretization needs to be fine tuned to address this shortcoming ofrete bandwidth conditions.Abstract:
Packet data is expected to dominate third generation wireless networks, unlike current generation voice networks. This opens up new and interesting problems. Physical and link layer issues have been studied extensively, while resource allocation and scheduling issues have not been addressed satisfactorily.In this work, we address resource management on the downlink of CDMA packet data networks. Network performance (for example, capacity) has been addressed, but user centric performance has not received much attention. Recently, various non-traditional scheduling schemes based on new metrics have been proposed, and target user performance (mostly without reference to wireless). We adapt these metrics to the CDMA context, and establish some new results for the offline scheduling problem. In addition, we modify a large class of online algorithms to work in our setup and conduct a wide range of experiments. Based on detailed simulations, we infer that: Algorithms which exploit “request sizes” seem to outperform those that do not. Among these, algorithms that also exploit channel conditions provide significantly higher network throughput.Depending on continuous or discretized bandwidth conditions, either pure time multiplexing or a combination of time and code multiplexing strikes an excellent balance between user satisfaction and network performance.Discrete bandwidth conditions can lead to degraded user level performance without much impact on network performance. We argue that the discretization needs to be fine tuned to address this shortcoming.read more
Citations
More filters
Proceedings ArticleDOI
Asymptotic analysis of proportional fair algorithm
TL;DR: A more general result for two classes of users with different fading characteristics is given-the user class with more fading variability gets more throughput with a lower fraction of time transmitting.
Journal ArticleDOI
Great expectations: the value of spatial diversity in wireless networks
TL;DR: This paper adopts spatial diversity as a central theme, and illustrates its benefits across the physical (signal transmission/coding and receiver signal processing) and networking (resource allocation, routing, and applications) layers.
Proceedings ArticleDOI
Wireless downlink data channels: user performance and cell dimensioning
TL;DR: In this article, the authors consider wireless downlink data channels where the transmission power of each base station is time-shared between a dynamic number of active users as in CDMA/HDR systems and derive analytical results relating user performance, in terms of blocking probability and data throughput, to cell size and traffic density.
Proceedings ArticleDOI
Dynamic rate control algorithms for HDR throughput optimization
Sem Borst,Philip Whiting +1 more
TL;DR: It is shown that the 'best' user may be identified as the maximum-rate user when the feasible rates are weighed with some appropriately determined coefficients, and the optimal strategy may be viewed as a revenue-based policy.
Proceedings ArticleDOI
Exploiting medium access diversity in rate adaptive wireless LANs
TL;DR: A Medium Access Diversity (MAD) scheme that leverages the benefits of rate adaptation schemes by aggressively exploiting multiuser diversity is proposed and can improve the overall throughput of IEEE 802.11 wireless LANs by 50% as compared with the best existing rate adaptation scheme.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Cdma: Principles of Spread Spectrum Communication
TL;DR: Generating Pseudorandom Signals (Pseudonoise) from PseudOrandom Sequences by Modulation and Demodulation of Spread Spectrum Signals in Multipath and Multiple Access Interference.
Journal ArticleDOI
A new approach to the maximum-flow problem
TL;DR: An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
Proceedings ArticleDOI
Generating representative Web workloads for network and server performance evaluation
Paul Barford,Mark Crovella +1 more
TL;DR: This paper applies a number of observations of Web server usage to create a realistic Web workload generation tool which mimics a set of real users accessing a server and addresses the technical challenges to satisfying this large set of simultaneous constraints on the properties of the reference stream.