Results 1  10
of
167
Fairness and optimal stochastic control for heterogeneous networks
 Proc. IEEE INFOCOM, March 2005. TRANSACTIONS ON NETWORKING, VOL
, 2008
"... Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capaci ..."
Abstract

Cited by 266 (63 self)
 Add to MetaCart
(Show Context)
Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an endtoend delay increase for data that is served by the network.
CrossLayer Design for Wireless Networks
 IEEE Communications Magazine
, 2003
"... As the cellular and PCS world collides with Wireless LANs and Internetbased packet data, new networking approaches will support the integration of voice and data on the composite infrastructure of cellular base stations and Ethernetbased wireless access points. This paper highlights some of the pa ..."
Abstract

Cited by 254 (2 self)
 Add to MetaCart
(Show Context)
As the cellular and PCS world collides with Wireless LANs and Internetbased packet data, new networking approaches will support the integration of voice and data on the composite infrastructure of cellular base stations and Ethernetbased wireless access points. This paper highlights some of the past accomplishments and promising research avenues for an important topic in the creation of future wireless networks. In this paper, we address the issue of crosslayer networking, where the physical and MAC layer knowledge of the wireless medium is shared with higher layers, in order to provide efficient methods of allocating network resources and applications over the Internet. In essence, future networks will need to provide ”impedance matching ” of the instantaneous radio channel conditions and capacity needs with the traffic and congestion conditions found over the packetbased world of the Internet. Further, such matching will need to be coordinated with a wide range of particular applications and user expectations, making the topic of crosslayer networking an increasingly important one for the evolving wireless buildout. 1
Maximizing Queueing Network Utility Subject to Stability: Greedy Primaldual algorithm
 Queueing Systems
, 2005
"... We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has assoc ..."
Abstract

Cited by 204 (9 self)
 Add to MetaCart
(Show Context)
We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has associated \traditional " queueing control eect, i.e., it determines traÆc (customer) arrival rates, service rates at the nodes, and random routing of processed customers among the nodes. The problem is to nd a dynamic control strategy which maximizes a concave utility function H(X), where X is the average value of commodity vector, subject to the constraint that network queues remain stable. We introduce a dynamic control algorithm, which we call Greedy PrimalDual (GPD) algorithm, and prove its asymptotic optimality. We show that our network model and GPD algorithm accommodate a wide range of applications. As one example, we consider the problem of congestion control of networks where both traÆc sources and network processing nodes may be randomly timevarying and interdependent. We also discuss a variety of resource allocation problems in wireless networks, which in particular involve average power consumption constraints and/or optimization, as well as traÆc rate constraints.
Energy optimal control for time varying wireless networks
 IEEE Trans. Inform. Theory
, 2006
"... Abstract — We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates without knowledge of traffic rates or channel statistics, and yields average power that is arbitrarily close to the minimum p ..."
Abstract

Cited by 184 (50 self)
 Add to MetaCart
(Show Context)
Abstract — We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates without knowledge of traffic rates or channel statistics, and yields average power that is arbitrarily close to the minimum possible value achieved by an algorithm optimized with complete knowledge of future events. Proximity to this optimal solution is shown to be inversely proportional to network delay. We then present a similar algorithm that solves the related problem of maximizing network throughput subject to peak and average power constraints. The techniques used in this paper are novel and establish a foundation for stochastic network optimization.
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for MultiUser Throughput Allocation
 Operations Research
"... informs ..."
A queueing analysis of maxmin fairness, proportional fairness and balanced fairness
, 2006
"... We compare the performance of three usual allocations, namely maxmin fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processorsharing queues. The vector of service rates ..."
Abstract

Cited by 67 (13 self)
 Add to MetaCart
(Show Context)
We compare the performance of three usual allocations, namely maxmin fairness, proportional fairness and balanced fairness, in a communication network whose resources are shared by a random number of data flows. The model consists of a network of processorsharing queues. The vector of service rates, which is constrained by some compact, convex capacity set representing the network resources, is a function of the number of customers in each queue. This function determines the way network resources are allocated. We show that this model is representative of a rich class of wired and wireless networks. We give in this general framework the stability condition of maxmin fairness, proportional fairness and balanced fairness and compare their performance on a number of toy networks.
Optimal energy and delay tradeoffs for multiuser wireless downlinks
 Proc. IEEE INFOCOM
, 2006
"... Abstract — We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multiuser wireless downlink with randomly varying channels. First, we extend the BerryGallager bound to a multiuser context, demonstrating that any algorithm that yields average power within O(1/V) of th ..."
Abstract

Cited by 64 (17 self)
 Add to MetaCart
(Show Context)
Abstract — We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multiuser wireless downlink with randomly varying channels. First, we extend the BerryGallager bound to a multiuser context, demonstrating that any algorithm that yields average power within O(1/V) of the minimum power required for network stability must also have an average queueing delay greater than or equal to Ω ( √ V). We then develop a class of algorithms, parameterized by V, that come within a logarithmic factor of achieving this fundamental tradeoff. The algorithms overcome an exponential state space explosion, and can be implemented in real time without apriori knowledge of traffic rates or channel statistics. Further, we discover a “superfast ” scheduling mode that beats the BerryGallager bound in the exceptional case when power functions are piecewise linear. Index Terms — queueing analysis, stability, optimization, stochastic control, asymptotic tradeoffs
Optimal Backpressure Routing for Wireless Networks with MultiReceiver Diversity
, 2006
"... We consider the problem of optimal scheduling and routing in an adhoc wireless network with multiple traffic streams and time varying channel reliability. Each packet transmission can be overheard by a subset of receiver nodes, with a transmission success probability that may vary from receiver t ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
We consider the problem of optimal scheduling and routing in an adhoc wireless network with multiple traffic streams and time varying channel reliability. Each packet transmission can be overheard by a subset of receiver nodes, with a transmission success probability that may vary from receiver to receiver and may also vary with time. We develop a simple backpressure routing algorithm that maximizes network throughput and expends an average power that can be pushed arbitrarily close to the minimum average power required for network stability, with a corresponding tradeoff in network delay. The algorithm can be implemented in a distributed manner using only local link error probability information, and supports a “blind transmission” mode (where error probabilities are not required) in special cases when the power metric is neglected and when there is only a single destination for all traffic streams.
Optimal utility based multiuser throughput allocation subject to throughput constraints
 in Proc. IEEE INFOCOM
, 2005
"... ..."
A scorebased opportunistic scheduler for fading radio channels
 in Proc. European Wireless
, 2003
"... Abstract: While fading effects have long been combatted in 2G wireless networks, primarly devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The packet delay tolerance of data applications, such as file transfers and Web ..."
Abstract

Cited by 58 (1 self)
 Add to MetaCart
(Show Context)
Abstract: While fading effects have long been combatted in 2G wireless networks, primarly devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The packet delay tolerance of data applications, such as file transfers and Web browsing for instance, allows the system flexibility in scheduling a user’s packets. Opportunistic scheduling ensures transmission occurs when radio conditions are most favorable. This paper discusses different resource sharing strategies and presents some shortcomings of the classical Proportional Fair opportunistic scheduler. A new algorithm, called the ScoreBased scheduler, is presented and shown to overcome these drawbacks.