• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,810
Next 10 →

Throughput analysis of the proportional fair scheduler

by Gabor Horvath, Csaba Vulkán - in HSDPA,” in Wireless Conference, 2008. EW 2008. 14th European , 2008
"... Throughput analysis of the proportional fair ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Throughput analysis of the proportional fair

Optimizing proportionally fair prices

by Laura Wynter - INRIA RR , 2001
"... Abstract We demonstrate the non-uniqueness of Proportional Fairness prices, and show that themodel of [1] falls into the category of models that can be generalized to allow optimization of the link prices, with a view towards profit maximization. However, though thisframework, we also show that the ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract We demonstrate the non-uniqueness of Proportional Fairness prices, and show that themodel of [1] falls into the category of models that can be generalized to allow optimization of the link prices, with a view towards profit maximization. However, though thisframework, we also show

On the Delay Optimality of Proportional Fairness

by Lei Ying, Bo Tan, R. Srikant
"... Abstract—We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exponentially distributed. For a simple symmetric three-link star network, we derive the optimal resource allocation po ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
policy which minimizes the expected number of files waiting in the system. The performance of the optimal policy is then compared with the performance of the widely-studied proportionally-fair resource allocation policy. We show that the expected number of files under proportional fairness is at most 1

Proportional Fair Scheduling with . . .

by Megumi Kaneko, Kazunori Hayashi, Petar Popovski, Hideaki Sakai , 2012
"... Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on Superposition Coding (SC) which maximizes the achievable sum-rate under a Proportional Fairnes ..."
Abstract - Add to MetaCart
Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on Superposition Coding (SC) which maximizes the achievable sum-rate under a Proportional

The weighted proportional fair scheduler

by Kinda Khawam, Daniel Kofman, Eitan Altman, Inria Sophia Antipolis - University of Waterloo , 2006
"... To this day, traffic in cellular networks is still mainly real-time. However, with the deployment of new technologies, such as HDR (High Date Rate) and HSDPA (High Speed Downlink Packet Access), this situation is bound to evolve rapidly and elastic traffic will significantly increase. These novel te ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
technologies implement opportunistic scheduling, taking advantage of the delay-tolerance of elastic traffic, to augment the global capacity of the system. Previous work has shown that ”Proportional Fair ” (PF) is an opportunistic scheduler that provides a good compromise between fairness and efficiency

Monitoring Proportional Fairness in cdma2000

by High Data Rate
"... As the 3G cdma2000 # networks with High Data Rates get deployed, it is interesting to study the impact of the scheduling algorithm used in these networks, and to improve its performance. We consider here the setting where this scheduling algorithm is used in heterogenous channels, meaning channel ..."
Abstract - Add to MetaCart
channels for which the fading properties are not the same from one user to the next. Some users might encounter relatively steady conditions while other suffer from fast fading for instance. In heterogenous channels, it is known that the proportional fairness algorithm falls short of its goal to provide

Channel Predictive Proportional Fair Scheduling

by Hans Jørgen Bang , Torbjörn Ekman , David Gesbert - IEEE Transaction on Wireless Communications , 2008
"... ABSTRACT There is growing interest in the area of cross-layer design. This paper addresses the problem of multi-user diversity scheduling together with channel prediction. Recent work demonstrates that the mobile radio channel can be linearly predicted, quite accurately, several milliseconds ahead ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
compromising fairness. The current approach builds on the proportional fair scheduling technique but can also be generalized to other criteria.

Utility-Proportional Fairness in Wireless Networks

by G. Tychogiorgos, A. Gkelias, K. K. Leung - IEEE 23RD INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS- (PIMRC) , 2012
"... Current communication networks support a variety of applications with different quality of service (QoS) requirements which compete for its resources. This continuously increasing competition highlights the necessity for more efficient and fair resource allocation. Current Network Utility Maximizat ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Maximization (NUM) framework fails to achieve this target and alternative approaches cannot operate in networks that consist of wireless links. This paper presents a NUM framework for wireless networks that shares resources according to the utility proportional fairness policy. This policy is shown to prevent

Hard Fairness Versus Proportional Fairness in

by Daeyoung Park, Technische Universität Berlin
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

Instability of the proportional fair scheduling algorithm for HDR

by Matthew Andrews - IEEE Transactions on Wireless Communications , 2004
"... Abstract In this paper we study the Proportional Fair scheduler that has been proposed for scheduling in the High Data Rate (HDR) wireless data system [4, 6]. We consider a single basestation transmitting to a set of mobile users. In each time slot the scheduler has to decide on a mobile to which it ..."
Abstract - Cited by 43 (7 self) - Add to MetaCart
Abstract In this paper we study the Proportional Fair scheduler that has been proposed for scheduling in the High Data Rate (HDR) wireless data system [4, 6]. We consider a single basestation transmitting to a set of mobile users. In each time slot the scheduler has to decide on a mobile to which
Next 10 →
Results 1 - 10 of 1,810
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University