Results 1  10
of
276
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.
The effect of fading, channel inversion, and threshold scheduling on ad hoc networks
 IEEE TRANS. INF. THEORY
, 2007
"... This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based scheduling on capacity. Channel inversion and threshold scheduling may be viewed as simple ways to exploit channel state informat ..."
Abstract

Cited by 91 (29 self)
 Add to MetaCart
(Show Context)
This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based scheduling on capacity. Channel inversion and threshold scheduling may be viewed as simple ways to exploit channel state information (CSI) without requiring cooperation across transmitters. We use the transmission capacity (TC) as our metric, defined as the maximum spatial intensity of successful simultaneous transmissions subject to a constraint on the outage probability (OP). By assuming the nodes are located on the infinite plane according to a Poisson process, we are able to employ tools from stochastic geometry to obtain asymptotically tight bounds on the distribution of the signaltointerference (SIR) level, yielding in turn tight bounds on the OP (relative to a given SIR threshold) and the TC. We demonstrate that in the absence of CSI, fading can significantly reduce the TC and somewhat surprisingly, channel inversion only makes matters worse. We develop a thresholdbased transmission rule where transmitters are active only if the channel to their receiver is acceptably strong, obtain expressions for the optimal threshold, and show that this simple, fully distributed scheme can significantly reduce the effect of fading.
Opportunistic scheduling with reliability guarantees in cognitive radio networks
 In Copyright (c) 2012 International Journal of Computer Science Issues. All Rights Reserved. International Journal of Computer Science Issues, Vol. 9, Issue 2, No 3, March 2012 ISSN (Online): 16940814 www.IJCSI.org 73 INFOCOM 2008. The 27th Conference on
, 2008
"... Abstract—We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision constraints with the primary (licensed) users. We consider a cognitive network with static primary users and potent ..."
Abstract

Cited by 79 (8 self)
 Add to MetaCart
Abstract—We develop opportunistic scheduling policies for cognitive radio networks that maximize the throughput utility of the secondary (unlicensed) users subject to maximum collision constraints with the primary (licensed) users. We consider a cognitive network with static primary users and potentially mobile secondary users. We use the technique of Lyapunov Optimization to design an online flow control, scheduling and resource allocation algorithm that meets the desired objectives and provides explicit performance guarantees.
Optimal power cost management using stored energy in data centers
, 2011
"... Since the electricity bill of a data center constitutes a significant portion of its overall operational costs, reducing this has become important. We investigate cost reduction opportunities that arise by the use of uninterrupted power supply (UPS) units as energy storage devices. This represents a ..."
Abstract

Cited by 79 (10 self)
 Add to MetaCart
(Show Context)
Since the electricity bill of a data center constitutes a significant portion of its overall operational costs, reducing this has become important. We investigate cost reduction opportunities that arise by the use of uninterrupted power supply (UPS) units as energy storage devices. This represents a deviation from the usual use of these devices as mere transitional failover mechanisms between utility and captive sources such as diesel generators. We consider the problem of opportunistically using these devices to reduce the time average electric utility bill in a data center. Using the technique of Lyapunov optimization, we develop an online control algorithm that can optimally exploit these devices to minimize the time average cost. This algorithm operates without any knowledge of the statistics of the workload or electricity cost processes, making it attractive in the presence of workload and pricing uncertainties. An interesting feature of our algorithm is that its deviation from optimality reduces as the storage capacity is increased. Our work opens up a new area in data center power management.
On Combining ShortestPath and BackPressure Routing Over Multihop Wireless Networks
, 2008
"... Abstract—Backpressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However a significant weakness of this approach has been in routing, because the traditional backpress ..."
Abstract

Cited by 65 (5 self)
 Add to MetaCart
(Show Context)
Abstract—Backpressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However a significant weakness of this approach has been in routing, because the traditional backpressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes and the algorithm could be very inefficient in terms of endtoend delay and routing convergence times. This paper proposes new routing/scheduling backpressure algorithms that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortestpath information in order to minimize average pathlengths between each source and destination pair. Our results indicate that under the traditional backpressure algorithm, the endtoend packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising lowload behavior is explained due to the fact that the traditional backpressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the otherhand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller endtoend packet delays as compared to the traditional backpressure algorithm. I.
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
Wireless Video Content Delivery through Coded Distributed Caching
"... We suggest a novel approach to handle the ongoing explosive increase in the demand for video content in mobile devices. We envision femtocelllike base stations, which we call helpers, with weak backhaul links but large storage capabilities. These helpers form a wireless distributed caching network ..."
Abstract

Cited by 64 (10 self)
 Add to MetaCart
We suggest a novel approach to handle the ongoing explosive increase in the demand for video content in mobile devices. We envision femtocelllike base stations, which we call helpers, with weak backhaul links but large storage capabilities. These helpers form a wireless distributed caching network that assists the macro base station by handling requests of popular files that have been cached. We formalize the wireless distributed caching optimization problem for the case that files are encoded using fountain/MDS codes. We express the problem as a convex optimization. By adding additional variables we reduce it to a linear program. On the practical side, we present a detailed simulation of a university campus scenario covered by a single 3GPP LTE R8 cell and several helper nodes using a simplified 802.11n protocol. We use a real campus trace of video requests and show how distributed caching can increase the number of served users by as much as 600 − 700%.
QCSMA: Queuelength based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks
 IN IEEE INFOCOM
, 2010
"... Recently, it has been shown that CSMAtype random access algorithms can achieve the maximum possible throughput in wireless ad hoc networks. However, the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of ..."
Abstract

Cited by 64 (6 self)
 Add to MetaCart
(Show Context)
Recently, it has been shown that CSMAtype random access algorithms can achieve the maximum possible throughput in wireless ad hoc networks. However, the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, they may only achieve a fraction of the capacity region in general. In this paper, we propose a discretetime version of the CSMAtype random access algorithm that allows us to incorporate simple heuristics which lead to very good delay performance while retaining the throughputoptimality property. Central to our results is a discretetime distributed randomized algorithm that generates data transmission schedules according to a productform distribution, a counterpart of similar results obtained earlier for continuoustime models under the perfect CSMA assumption where collisions can never occur. An appealing feature of this algorithm is that it explicitly takes collisions into account during the exchange of control packets.
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
(Show Context)
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.
Throughput optimal control of cooperative relay networks
 IEEE Trans. on Information Theory
, 2005
"... In cooperative relaying, packets are not forwarded by traditional hopbyhop transmissions between pairs of nodes. Instead, several nodes cooperate with each other to forward a packet by, for example, forming a distributed antenna array. To date, such schemes have been primarily investigated at the ..."
Abstract

Cited by 50 (3 self)
 Add to MetaCart
(Show Context)
In cooperative relaying, packets are not forwarded by traditional hopbyhop transmissions between pairs of nodes. Instead, several nodes cooperate with each other to forward a packet by, for example, forming a distributed antenna array. To date, such schemes have been primarily investigated at the physical layer with the focus on communication of a single endtoend flow. In this paper, we consider cooperative relay networks with multiple stochastically varying endtoend flows. The traffic from each flow is queued within the network until it can be forwarded. For such networks, we study network control policies that take into account queue dynamics to jointly optimize routing, scheduling and resource allocation. Specifically, we develop a throughput optimal policy, i.e., a policy that stabilizes the network for any arrival rate in its stability region. This policy is a generalization of the wellknown Maximum Differential Backlog algorithms, which takes into account the cooperative gains in the network. Implementing this policy requires solving an optimization problem over the set of feasible transmission rates. We discuss several structural characteristics of this optimization problem for the special case of parallel relay cooperative networks. I.